Dynamic Programming coding problems

Dynamic programming is the topic most candidates fear and most product companies ask. Practise 1D and 2D states, knapsack, longest subsequences and counting ways, from easy warm-ups to hard problems.

37 problems: 11 easy, 18 medium, 8 hard. Free to read; a free account solves them and earns XP and Aura.

1. Count Consecutive OccurrencesPractice · +10 XP · dynamic programming, arrays, loopseasy
2. Count Multiples of KPractice · +10 XP · dynamic programming, iteration, number theoryeasy
3. Count Numbers Divisible by KPractice · +10 XP · dynamic programming, arrays, basic programmingeasy
4. Count Paths on a LinePractice · +10 XP · dynamic programming, recursion, countingeasy
5. Count Subsequences Summing to KPractice · +10 XP · dynamic programming, recursion, countingeasy
6. Count Vowel OccurrencesPractice · +10 XP · dynamic programming, strings, iterationeasy
7. Maximum Sum of Adjacent ElementsPractice · +10 XP · greedy, dynamic programmingeasy
8. Print Sum of DigitsPractice · +10 XP · dynamic programming, basic programmingeasy
9. Sum of First K MultiplesPractice · +10 XP · dynamic programming, arithmetic progression, iterationeasy
10. Sum of First N Even NumbersPractice · +10 XP · dynamic programming, iterationeasy
11. Sum of Prefix ProductsPractice · +10 XP · dynamic programming, prefix sumseasy
12. Lexicographically Smallest PathPractice · +20 XP · recursion, dynamic programming, graphsmedium
13. Longest Alternating SubsequencePractice · +20 XP · dynamic programming, greedymedium
14. Longest Palindromic SubsequencePractice · +20 XP · dynamic programming, string, lpsmedium
15. Longest Symmetric SubstringPractice · +20 XP · strings, dynamic programming, two pointersmedium
16. Longest Zigzag SubsequencePractice · +20 XP · recursion, dynamic programmingmedium
17. Max Consecutive SumPractice · +20 XP · two pointers, dynamic programming, greedymedium
18. Maximum Depth Path SumPractice · +20 XP · trees, dynamic programming, depth first searchmedium
19. Maximum Sum Increasing SubsequencePractice · +20 XP · recursion, dynamic programming, binary indexed treemedium
20. Maximum Sum Non-Adjacent PairsPractice · +20 XP · dynamic programming, recursion, memoizationmedium
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. Maximum Sum of PairsPractice · +20 XP · dynamic programming, prefix sums, binary searchmedium
29. Minimum Path Sum in GridPractice · +20 XP · matrix, dynamic programming, bfsmedium
30. Distinct Subsequences CountPractice · +30 XP · hash map, dynamic programming, stringhard
31. Longest Increasing Subsequence on a PermutationPractice · +30 XP · recursion, dynamic programming, greedyhard
32. Longest Increasing Subsequence with Stack ConstraintPractice · +30 XP · stack, dynamic programming, greedyhard
33. Longest Non-Decreasing SubsequencePractice · +30 XP · basics, dynamic programming, binary searchhard
34. Maximum Sum of Non-Adjacent ElementsPractice · +30 XP · basics, dynamic programming, arrayshard
35. Maximum Sum of Non-Overlapping IntervalsPractice · +30 XP · greedy, dynamic programming, interval schedulinghard
36. Maximum Sum Subarray with Length ConstraintPractice · +30 XP · dynamic programming, arrays, optimizationhard
37. The Harmonious SequenceOpen now · Monthly · +150 XP · +50 Aura · math, number theory, dynamic programming2 solvedhard