Home / Coding / Algorithm & Data Structure / 1-D Dynamic Programming

1-D Dynamic Programming

19 problems. Tick each as you solve it.

0 / 19 solved

• easy Climbing Stairs
• easy Min Cost Climbing Stairs
• easy N-th Tribonacci Number
• medium Best Time to Buy and Sell Stock with Transaction Fee
• medium Coin Change
• medium Decode Ways
• medium Domino and Tromino Tiling
• medium House Robber
• medium House Robber II
• medium Longest Increasing Subsequence
• medium Longest Palindromic Substring
• medium Longest Subarray of 1's After Deleting One Element
• medium Maximum Product Subarray
• medium Palindromic Substrings
• medium Partition Equal Subset Sum
• medium Triangle
• medium Word Break
• hard Best Time to Buy and Sell Stock III
• hard Best Time to Buy and Sell Stock IV