Dynamic Programming
76 solutions
- 0005 - Longest Palindromic Substring (Medium)
- 0010 - Regular Expression Matching (Hard)
- 0022 - Generate Parentheses (Medium)
- 0042 - Trapping Rain Water (Hard)
- 0045 - Jump Game II (Medium)
- 0053 - Maximum Subarray (Medium)
- 0055 - Jump Game (Medium)
- 0062 - Unique Paths (Medium)
- 0063 - Unique Paths II (Medium)
- 0070 - Climbing Stairs (Easy)
- 0072 - Edit Distance (Hard)
- 0091 - Decode Ways (Medium)
- 0097 - Interleaving String (Medium)
- 0115 - Distinct Subsequences (Hard)
- 0118 - Pascal's Triangle (Easy)
- 0124 - Binary Tree Maximum Path Sum (Hard)
- 0131 - Palindrome Partitioning (Medium)
- 0139 - Word Break (Medium)
- 0152 - Maximum Product Subarray (Medium)
- 0188 - Best Time to Buy and Sell Stock IV (Hard)
- 0198 - House Robber (Medium)
- 0213 - House Robber II (Medium)
- 0300 - Longest Increasing Subsequence (Medium)
- 0309 - Best Time to Buy and Sell Stock with Cooldown (Medium)
- 0312 - Burst Balloons (Hard)
- 0322 - Coin Change (Medium)
- 0329 - Longest Increasing Path in a Matrix (Hard)
- 0392 - Is Subsequence (Easy)
- 0403 - Frog Jump (Hard)
- 0416 - Partition Equal Subset Sum (Medium)
- 0435 - Non-overlapping Intervals (Medium)
- 0464 - Can I Win (Medium)
- 0494 - Target Sum (Medium)
- 0518 - Coin Change 2 (Medium)
- 0542 - 01 Matrix (Medium)
- 0647 - Palindromic Substrings (Medium)
- 0678 - Valid Parenthesis String (Medium)
- 0698 - Partition to K Equal Sum Subsets (Medium)
- 0718 - Maximum Length of Repeated Subarray (Medium)
- 0746 - Min Cost Climbing Stairs (Easy)
- 0787 - Cheapest Flights Within K Stops (Medium)
- 0799 - Champagne Tower (Medium)
- 0813 - Largest Sum of Averages (Medium)
- 0838 - Push Dominoes (Medium)
- 0847 - Shortest Path Visiting All Nodes (Hard)
- 0907 - Sum of Subarray Minimums (Medium)
- 0918 - Maximum Sum Circular Subarray (Medium)
- 0926 - Flip String to Monotone Increasing (Medium)
- 0935 - Knight Dialer (Medium)
- 1000 - Minimum Cost to Merge Stones (Hard)
- 1043 - Partition Array for Maximum Sum (Medium)
- 1137 - N-th Tribonacci Number (Easy)
- 1140 - Stone Game II (Medium)
- 1143 - Longest Common Subsequence (Medium)
- 1235 - Maximum Profit in Job Scheduling (Hard)
- 1269 - Number of Ways to Stay in the Same Place After Some Steps (Hard)
- 1326 - Minimum Number of Taps to Open to Water a Garden (Hard)
- 1335 - Minimum Difficulty of a Job Schedule (Hard)
- 1372 - Longest ZigZag Path in a Binary Tree (Medium)
- 1434 - Number of Ways to Wear Different Hats to Each Other (Hard)
- 1494 - Parallel Courses II (Hard)
- 1531 - String Compression II (Hard)
- 1578 - Minimum Time to Make Rope Colorful (Medium)
- 1626 - Best Team With No Conflicts (Medium)
- 1639 - Number of Ways to Form a Target String Given a Dictionary (Hard)
- 1664 - Ways to Make a Fair Array (Medium)
- 1706 - Where Will the Ball Fall (Medium)
- 1916 - Count Ways to Build Rooms in an Ant Colony (Hard)
- 2050 - Parallel Courses III (Hard)
- 2218 - Maximum Value of K Coins From Piles (Hard)
- 2376 - Count Special Integers (Hard)
- 2380 - Time Needed to Rearrange a Binary String (Medium)
- 2439 - Minimize Maximum of Array (Medium)
- 2501 - Longest Square Streak in an Array (Medium)
- 2750 - Ways to Split Array Into Good Subarrays (Medium)
- 2811 - Check if it is Possible to Split Array (Medium)