Greedy coding problems

Greedy problems pick the locally best move and prove it never hurts: intervals, scheduling, coin and jump games. Practise spotting when greedy works and when it needs dynamic programming instead.

41 problems: 9 easy, 26 medium, 6 hard. Free to read; a free account solves them and earns XP and Aura.

1. Count Elements Greater Than PreviousPractice · +10 XP · greedy, arrays, loopseasy
2. Find Maximum ValuePractice · +10 XP · greedy, simple iterationeasy
3. Maximize Non-Negative SumPractice · +10 XP · greedy, arrayseasy
4. Maximum Odd SumPractice · +10 XP · greedy, iteration, basiceasy
5. Maximum Sum of Adjacent ElementsPractice · +10 XP · greedy, dynamic programmingeasy
6. Minimum Absolute DifferencePractice · +10 XP · greedy, sorting, arrayseasy
7. Minimum Cost to SortPractice · +10 XP · greedy, sorting, bubble sorteasy
8. Smallest ElementPractice · +10 XP · greedy, arrays, iterationeasy
9. Sum of Positive NumbersPractice · +10 XP · greedy, loopseasy
10. Distinct Element Sum with Minimum CostPractice · +20 XP · heaps, hash map, greedymedium
11. Distinct Elements CountPractice · +20 XP · greedy, hash map, countingmedium
12. Distinct Elements with Minimum Total CostPractice · +20 XP · heaps, hash set, greedymedium
13. Longest Alternating SubsequencePractice · +20 XP · dynamic programming, greedymedium
14. Longest Subarray with Constant DifferencePractice · +20 XP · two pointers, greedy, arraysmedium
15. Longest Subarray with Limited DifferencePractice · +20 XP · two pointers, sliding window, greedymedium
16. Max Consecutive SumPractice · +20 XP · two pointers, dynamic programming, greedymedium
17. Maximize Distinct Elements After OperationsPractice · +20 XP · heaps, greedy, data structuresmedium
18. Maximize Minimum DifferencePractice · +20 XP · binary search, greedymedium
19. Maximize Non-overlapping IntervalsPractice · +20 XP · greedy, sortingmedium
20. Maximum Non-overlapping IntervalsPractice · +20 XP · greedy, sorting, intervalsmedium
21. Maximum Sum of Consecutive SubsegmentsPractice · +20 XP · dynamic programming, array, greedymedium
22. Maximum Sum of Non-Adjacent Elements in a Circular ArrayPractice · +20 XP · dynamic programming, greedy, arraysmedium
23. Maximum Sum of Non-Adjacent SubarraysPractice · +20 XP · dynamic programming, arrays, greedymedium
24. Maximum Sum of Non-Overlapping Positive SubarraysPractice · +20 XP · stack, dynamic programming, greedymedium
25. Maximum Sum of Non-Overlapping SegmentsPractice · +20 XP · greedy, dynamic programming, sortingmedium
26. Maximum Sum of Non-overlapping SubarraysPractice · +20 XP · greedy, dynamic programming, prefix sumsmedium
27. Maximum Sum of Non-Overlapping SubsegmentsPractice · +20 XP · dynamic programming, greedymedium
28. Minimize Maximum DifferencePractice · +20 XP · binary search, greedy, sortingmedium
29. Minimize Maximum Difference in PairsPractice · +20 XP · greedy, sorting, two pointersmedium
30. Minimize Maximum Segment SumPractice · +20 XP · binary search, greedymedium
31. Minimum Cost to Make All EqualPractice · +20 XP · binary search, greedymedium
32. Minimum Maximum DifferencePractice · +20 XP · binary search, greedymedium
33. Minimum Maximum Height DifferencePractice · +20 XP · binary search, greedymedium
34. Minimum Operations to Make Array SortedPractice · +20 XP · greedy, sorting, arraysmedium
35. Process Tasks by DeadlinePractice · +20 XP · heaps, scheduling, greedymedium
36. Longest Increasing Subsequence on a PermutationPractice · +30 XP · recursion, dynamic programming, greedyhard
37. Longest Increasing Subsequence with Stack ConstraintPractice · +30 XP · stack, dynamic programming, greedyhard
38. Maximum Sum of Non-Overlapping IntervalsPractice · +30 XP · greedy, dynamic programming, interval schedulinghard
39. Minimize Maximum Difference of Elements in IntervalsPractice · +30 XP · heaps, sliding window, greedyhard
40. Minimize Maximum Difference of Grouped ElementsPractice · +30 XP · binary search, greedy, prefix sumshard
41. Minimum Maximum SumPractice · +30 XP · binary search, divide and conquer, greedyhard