Pemrograman Dinamis 1D

12 Pemrograman Dinamis 1D

Susun state dan transisi untuk submasalah satu dimensi.

Prasyarat: Backtracking

1. Climbing Stairs di LeetCode (easy)
2. Min Cost Climbing Stairs di LeetCode (easy)
3. House Robber di LeetCode (medium)
4. House Robber II di LeetCode (medium)
5. Longest Palindromic Substring di LeetCode (medium)
6. Palindromic Substrings di LeetCode (medium)
7. Decode Ways di LeetCode (medium)
8. Word Break di LeetCode (medium)
9. Coin Change di LeetCode (medium)
10. Maximum Product Subarray di LeetCode (medium)
11. Longest Increasing Subsequence di LeetCode (medium)
12. Partition Equal Subset Sum di LeetCode (medium)