Interval Scheduling

Category: Greedy

Difficulty: intermediate

Description: Schedule intervals optimally

Time Complexity: O(n log n)

Space Complexity: O(1)

Related LeetCode Problems

• 435. Non-overlapping Intervals (Medium)
• 452. Minimum Number of Arrows to Burst Balloons (Medium)
• 253. Meeting Rooms II (Medium)
• 252. Meeting Rooms (Easy)
• 1024. Video Stitching (Medium)
• 1094. Car Pooling (Medium)
• 1353. Maximum Number of Events That Can Be Attended (Medium)
• 1235. Maximum Profit in Job Scheduling (Hard)
• 4352. Erase Overlap Intervals (variant) (duplicate) (Medium)
• 455. Assign Cookies (Easy)