You're given jobs, each with a start time, end time, and profit. No jobs can overlap in your schedule. Your goal is to pick a subset of non-overlapping jobs that maximizes total profit. Amazon asks scheduling DP problems that mirror real resource allocation in their fulfillment systems.
For instance, suppose you have jobs: (1,3,$50), (2,4,$10), (3,5,$40), (3,6,$70). You can't take all of them because their time ranges conflict. The best combination is jobs (1,3,$50) and (3,6,$70) for a total profit of .
Return the maximum profit you can collect. Think about whether a greedy approach works here, or if you need to consider all possible combinations of non-conflicting jobs.