Динамическое программирование

Одномерное ДП

• 70. Climbing Stairs
• 96. Unique Binary Search Trees
• 95. Unique Binary Search Trees II
• 279. Perfect Squares
• 322. Coin Change
• 518. Coin Change II
• 983. Minimum Cost For Tickets
• 894. All Possible Full Binary Trees
• 1884. Egg Drop With 2 Eggs and N Floors

ДП по матрице

• 62. Unique Paths
• 63. Unique Paths II
• 64. Minimum Path Sum

Двумерное ДП

• 72. Edit Distance
• 115. Distinct Subsequences
• 474. Ones and Zeroes
• 516. Longest Palindromic Subsequence
• 647. Palindromic Substrings
• 712. Minimum ASCII Delete Sum for Two Strings
• 718. Maximum Length of Repeated Subarray
• 887. Super Egg Drop
• 1130. Minimum Cost Tree From Leaf Values
• 1143. Longest Common Subsequence