| Problem | Difficulty | Notes |
|---|---|---|
| 1094. Car Pooling | Medium (1441) | |
| 2848. Points That Intersect With Cars | Medium (1229) | |
| 1893. Check if All the Integers in a Range Are Covered | Easy (1307) | |
| 3355. Zero Array Transformation I | Medium (1638) | |
| 2779. Maximum Beauty of an Array After Applying Operation | Medium (1638) | |
| 2406. Divide Intervals Into Minimum Number of Groups | Medium (1713) | Max overlap = min groups. |
| 2381. Shifting Letters II | Medium (1793) |
- https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/description/ 1835
- https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/description/ 1872
- https://leetcode.com/problems/zero-array-transformation-ii 1913
- https://leetcode.com/problems/number-of-flowers-in-full-bloom/ 2022
- https://leetcode.com/problems/maximum-profit-in-job-scheduling/
- https://leetcode.com/problems/minimum-interval-to-include-each-query/description/ 2286
- https://leetcode.com/problems/the-skyline-problem/description/ h
| Problem | Difficulty |
|---|---|
| 56. Merge Intervals | Medium |
| 57. Insert Interval | Medium |
| 55. Jump Game | Medium |
| 763. Partition Labels | Medium |
| 729. My Calendar I | Medium |
| 3047. Find the Largest Area of Square Inside Two Rectangles | Medium |
- TODO: 56. Merge Intervals to be solved by line sweep
- https://leetcode.com/problems/count-days-without-meetings/description/ 1483
- https://leetcode.com/problems/find-right-interval/description/
- https://leetcode.com/problems/my-calendar-ii/description/ m, at most one conflict
- https://leetcode.com/problems/my-calendar-iii/description/ h, return most frequent overlap, similar to 253. Meeting Rooms II
- https://leetcode.com/problems/meeting-rooms-iii/ h (Premium)
- |759. Employee Free Time|Hard (1710)|
Given a collections of intervals, find the maximum number of intervals that are non-overlapping.
| Problem | Difficulty |
|---|---|
| 252. Meeting Rooms | Premium |
| 986. Interval List Intersections | Medium |
| 435. Non-overlapping Intervals | Medium |
| 646. Maximum Length of Pair Chain | Medium |
| 1288. Remove Covered Intervals | Medium (1375) |
| 2054. Two Best Non-Overlapping Events | Medium (1883) |
Given a collections of intervals, find the minimum number of groups that can be formed by the intervals.
| Problem | Difficulty | Notes |
|---|---|---|
| 253. Meeting Rooms II | Premium | |
| **2406. Divide Intervals Into Minimum Number of Groups | Medium (1713) | Min-heap of ends = among active meetings, the one that ends earliest is the only one you can possibly reuse. |
Given a collections of intervals, find the minimum number of points that can be covered by the intervals.
| Problem | Difficulty |
|---|---|
| 452. Minimum Number of Arrows to Burst Balloons | Medium |
Given a collections of intervals, find the minimum number of intervals that can be covered by the intervals.
| Problem | Difficulty |
|---|---|
| 45. Jump Game II | Medium |
| 1024. Video Stitching | Medium (1746) |
| 1326. Minimum Number of Taps to Open to Water a Garden | Hard (1885) |
| Problem | Difficulty |
|---|
TODO: Update problem listing from https://huxulm.github.io/lc-rating/list/data_structure
八、树状数组和线段树, most of problems are beyond my rating now.
| Problem | Difficulty |
|---|
| Problem | Difficulty |
|---|