Leetcode DP Practice Questions
Here is a list of some popular LeetCode dynamic programming problems:
-
Climbing Stairs
-
Maximum Subarray
-
House Robber
-
Decode Ways
-
Coin Change
-
Unique Paths
-
Palindrome Partitioning II
-
Regular Expression Matching
-
Wildcard Matching
-
Integer Break
-
Best Time to Buy and Sell Stock
-
Longest Palindromic Subsequence
-
Minimum Path Sum
-
Edit Distance
-
Longest Increasing Subsequence
-
Distinct Subsequences
-
Jump Game
-
Jump Game II
-
Partition Equal Subset Sum
-
Longest Valid Parentheses
-
Word Break
-
Word Break II
-
Paint House
-
Paint House II
-
Unique Binary Search Trees
-
Unique Binary Search Trees II
-
Minimum Cost For Tickets
-
Minimum Number of Taps to Open to Water a Garden
-
Best Time to Buy and Sell Stock with Cooldown
-
Perfect Squares
These are some of the well-known dynamic programming problems on LeetCode. You can search for each problem by name on the LeetCode platform to find detailed descriptions, examples, and solutions provided by the community.