Review: Interval Problems Posted on January 18, 2018September 17, 2019 by braindenny Interval Problems 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 point_x is common. But sometimes need to sort by point_y 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 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: Merge IntervalsLeetcode: Meeting RoomsLeetcode: Interval List IntersectionsLeetcode: Insert IntervalLeetcode: Find Right IntervalLeetcode: Employee Free TimeLeetcode: Car Pooling See more blog_posts. Post Views: 5