Greedy Problems

Greedy algorithms for interval selection, job sequencing, and optimization problems.

Filter by difficulty:
Interval & Scheduling Problems
•
Activity (Interval) Selection Problem – Max non-overlapping intervals Medium
Solution
•
Minimum Platforms Required – Trains arrival/departure times Medium
Solution
•
Merge Overlapping Intervals Medium
Solution
•
Minimum Number of Arrows to Burst Balloons (2D board) Medium
Solution
Optimization Problems
•
Rearrange fruits in two baskets – Equal cost in both baskets Medium
Solution
•
Job Sequencing Problem – Maximize profit with StartTime = 0 & EndTime = Deadline – Greedy & Disjoint Sets Hard
Solution
•
Job Sequencing Problem – Maximize profit with arbitrary StartTime & EndTime – Sorting, Memoization, Backtracking Hard
Solution