Dynamic Programming Problems
Practice 19 Dynamic Programming coding problems on Code Arena — from easy to hard, each with a live judge and a solution editorial.
- Maximum Subarray Sum — Medium · Dynamic Programming, Arrays
- Edit Distance — Hard · Dynamic Programming, Strings
- Coin Change — Hard · Dynamic Programming, Greedy
- Nth Fibonacci — Medium · Dynamic Programming, Math
- Longest Common Subsequence — Hard · Dynamic Programming, Strings
- Longest Increasing Subsequence — Hard · Dynamic Programming, Arrays
- 0/1 Knapsack — Hard · Dynamic Programming
- Subset Sum — Hard · Dynamic Programming
- House Robber — Hard · Dynamic Programming
- Unique Grid Paths — Hard · Dynamic Programming, Combinatorics
- Longest Palindromic Substring — Hard · Strings, Dynamic Programming
- Maximum Product Subarray — Hard · Dynamic Programming, Arrays
- Best Time to Buy and Sell Stock — Easy · Arrays, Dynamic Programming
- Climbing Stairs — Medium · Dynamic Programming
- Minimum Subset Difference — Hard · Dynamic Programming
- Coin Change (Count Ways) — Hard · Dynamic Programming
- Longest Common Substring — Hard · Dynamic Programming, Strings
- Minimum Path Sum — Hard · Dynamic Programming, Matrix
- Word Break — Hard · Dynamic Programming, Strings