Leetcode 452. Minimum Number of Arrows to Burst Balloons
Given a list of intervals [x_start, x_end] (endpoints inclusive), find the minimum number of points on the x-axis (vertical arrows) such that each interval contains at least one point. This is the classic interval-stabbing/covering problem: choose the fewest x positions that hit all intervals.
Asked at:
Atlassian
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Mid June, 2025
Atlassian
Senior
You're given a list of bookings, each as [booking_id, start_time, end_time]. Assign each booking to a table such that: - No two overlapping bookings share a table. - The total number of tables used is minimized. Return a mapping of table_id to the list of bookings assigned to that table. Each booking is represented as [booking_id, start_time, end_time].
Mid September, 2024
Mid-level
Given intervals, find the minimum set of points S such that each interval has at least one point in S
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.