LeetCode 986: Interval List Intersections
A clear explanation of finding intersections between two sorted disjoint interval lists using two pointers.
Tag
Intervals
17 notes
LeetCode 759: Employee Free Time
A clear explanation of finding common free time by merging all employee busy intervals and returning the gaps.
LeetCode 758: Bold Words in String
A clear explanation of marking matching substrings and merging overlapping bold ranges.
LeetCode 757: Set Intersection Size At Least Two
A clear explanation of solving interval intersection constraints using greedy sorting and minimal point selection.
LeetCode 732: My Calendar III
Track the maximum number of overlapping calendar events using a sweep line difference map.
LeetCode 731: My Calendar II
Allow double bookings but reject triple bookings using overlap interval tracking.
LeetCode 729: My Calendar I
Implement a calendar that accepts a booking only when it does not overlap with any existing booking.
LeetCode 699: Falling Squares
Simulate falling squares on a number line and track the maximum stack height after each placement.
LeetCode 495: Teemo Attacking
A clear explanation of calculating total poisoned duration by merging overlapping attack intervals.
LeetCode 452: Minimum Number of Arrows to Burst Balloons
A clear explanation of the greedy interval solution for finding the minimum number of arrows needed to burst all balloons.
LeetCode 436: Find Right Interval
Find, for each interval, the interval with the smallest start point greater than or equal to its end point using sorting and binary search.
LeetCode 435: Non-overlapping Intervals
Remove the minimum number of intervals so the remaining intervals do not overlap, using greedy sorting by end time.
LeetCode 352: Data Stream as Disjoint Intervals
A clear explanation of maintaining disjoint sorted intervals from a stream using insertion and merging.
LeetCode 253: Meeting Rooms II
A clear explanation of the Meeting Rooms II problem using a min heap to track active meeting end times.
LeetCode 252: Meeting Rooms
A clear explanation of the Meeting Rooms problem using interval sorting to detect overlaps.
LeetCode 57: Insert Interval
A clear guide to solving Insert Interval with one linear scan over sorted, non-overlapping intervals.
LeetCode 56: Merge Intervals
A clear guide to solving Merge Intervals by sorting intervals and merging them in one pass.