Solution for Dynamic Programming


2
12
11
# Name Difficulty Tags
5 Longest Palindromic Substring Medium Dynamic Programming | String
10 Regular Expression Matching Hard String | Dynamic Programming | Backtracking
32 Longest Valid Parentheses Hard String | Dynamic Programming
44 Wildcard Matching Hard String | Dynamic Programming | Backtracking | Greedy
53 Maximum Subarray Easy Array | Divide and Conquer | Dynamic Programming
62 Unique Paths Medium Array | Dynamic Programming
63 Unique Paths II Medium Array | Dynamic Programming
64 Minimum Path Sum Medium Array | Dynamic Programming
85 Maximal Rectangle Hard Array | Hash Table | Dynamic Programming | Stack
95 Unique Binary Search Trees II Medium Dynamic Programming | Tree
96 Unique Binary Search Trees Medium Dynamic Programming | Tree
120 Triangle Medium Array | Dynamic Programming
121 Best Time to Buy and Sell Stock Easy Array | Dynamic Programming
123 Best Time to Buy and Sell Stock III Hard Array | Dynamic Programming
152 Maximum Product Subarray Medium Array | Dynamic Programming
968 Binary Tree Cameras Hard Dynamic Programming | Tree | Depth-first Search
1130 Minimum Cost Tree From Leaf Values Medium Dynamic Programming | Stack | Tree
1269 Number of Ways to Stay in the Same Place After Some Steps Hard Dynamic Programming
1277 Count Square Submatrices with All Ones Medium Array | Dynamic Programming
1278 Palindrome Partitioning III Hard Dynamic Programming
1320 Minimum Distance to Type a Word Using Two Fingers Hard Dynamic Programming
1335 Minimum Difficulty of a Job Schedule Hard Dynamic Programming
1339 Maximum Product of Splitted Binary Tree Medium Dynamic Programming | Tree
1367 Linked List in Binary Tree Medium Linked List | Dynamic Programming | Tree
1751 Maximum Number of Events That Can Be Attended II Hard Binary Search | Dynamic Programming