Home / Coding / 1-D Dynamic Programming
1-D Dynamic Programming
19 problems. Tick each as you solve it.
0 / 19 solved
- easy Climbing Stairs source ↗
- easy Min Cost Climbing Stairs source ↗
- easy N-th Tribonacci Number source ↗
- medium Best Time to Buy and Sell Stock with Transaction Fee source ↗
- medium Coin Change source ↗
- medium Decode Ways source ↗
- medium Domino and Tromino Tiling source ↗
- medium House Robber source ↗
- medium House Robber II source ↗
- medium Longest Increasing Subsequence source ↗
- medium Longest Palindromic Substring source ↗
- medium Longest Subarray of 1's After Deleting One Element source ↗
- medium Maximum Product Subarray source ↗
- medium Palindromic Substrings source ↗
- medium Partition Equal Subset Sum source ↗
- medium Triangle source ↗
- medium Word Break source ↗
- hard Best Time to Buy and Sell Stock III source ↗
- hard Best Time to Buy and Sell Stock IV source ↗