Review: Interval Problems Posted on January 18, 2018July 26, 2020 by braindenny Interval Problems Top Questions Name Example Two ways to check whether two intervals overlap min(y1, y2) > max(x1, x2); x1<y2 && x2>y1 Two types of intervals [x, y] vs [x, y) Interval problems usually solved by heap or greedy algorithms LeetCode: Car Pooling General idea of overlapping interval problems Sort intervals, maintain an active set, loop each intervals Sort by pointx is common. But sometimes need to sort by pointy LeetCode: Minimum Number of Arrows to Burst Balloons Typical problems: Interval conflict – Detect double booking LeetCode: My Calendar I Typical problems: Interval conflict – Detect triple booking LeetCode: My Calendar II Typical problems: Interval conflict – Detect K booking LeetCode: My Calendar III, LeetCode: Car Pooling Typical problems: Interval List Intersections LeetCode: Interval List Intersections Typical problems: Interval List Union LeetCode: Insert Interval CheatSheet: Leetcode For Code Interview CheatSheet: Common Code Problems & Follow-ups See all interval problems: #interval Review: Interval ProblemsLintCode: Time IntersectionLintCode: Interval SearchLintCode: Digital CoverageLeetCode: Teemo AttackingLeetCode: Smallest Range IILeetCode: Smallest Range ILeetCode: Non-overlapping IntervalsLeetCode: My Calendar IIILeetCode: My Calendar IILeetCode: My Calendar ILeetCode: Missing RangesLeetCode: Minimum Number of Arrows to Burst BalloonsLeetCode: Merge IntervalsLeetCode: Meeting RoomsLeetCode: Insert IntervalLeetCode: Find Right IntervalLeetCode: Employee Free Time See more blog posts. Post Views: 5