Activity Selection

Category: Greedy

Difficulty: intermediate

Description: Select maximum non-overlapping activities

Time Complexity: O(n log n)

Space Complexity: O(1)

Related LeetCode Problems

• 252. Meeting Rooms (Easy)
• 455. Assign Cookies (Easy)
• 435. Non-overlapping Intervals (Medium)
• 452. Minimum Number of Arrows to Burst Balloons (Medium)
• 1353. Maximum Number of Events That Can Be Attended (Medium)
• 253. Meeting Rooms II (Medium)
• 628. Maximum Product of Three Numbers (Easy)
• 532. K-diff Pairs in an Array (Easy)
• 630. Course Schedule III (Hard)
• 2099. Find Subarray With Given XOR (related greedy/interval practice) (Medium)
• 1024. Video Stitching (Medium)
• 1354. Construct Target Array With Multiple Sums (hard greediness practice) (Hard)