Topic: dynamic-programming-problem / Level: beginner

• 951. Solve the "Knapsack Problem" where repetition of items is allowed to maximize the total value using dynamic programming.
• 952. Compute the minimum number of cuts required to partition a string into palindromic substrings using dynamic programming.
• 953. Find the longest increasing subsequence in an array using dynamic programming.
• 954. Solve the "Egg Dropping Problem" where you minimize the number of egg drops needed to determine the critical floor using dynamic programming.
• 955. Compute the maximum sum of a contiguous subarray using dynamic programming (Kadanes Algorithm).
• 956. Find the number of distinct subsequences in a string that match a given pattern using dynamic programming.
• 957. Solve the "House Robber II" problem where houses are arranged in a circle, and adjacent houses cannot be robbed using dynamic programming.
• 958. Compute the longest palindromic subsequence in a string using dynamic programming.
• 959. Find the minimum number of deletions required to make a string a palindrome using dynamic programming.
• 960. Solve the "Longest Common Subsequence" problem between two strings using dynamic programming.
• 961. Compute the minimum cost to paint a row of houses where no two adjacent houses can be painted the same color using dynamic programming.
• 962. Find the longest bitonic subsequence in an array where the subsequence first increases and then decreases using dynamic programming.
• 963. Solve the "Rod Cutting Problem" where you maximize the profit obtained by cutting a rod into smaller pieces using dynamic programming.
• 964. Compute the number of ways to climb a staircase where you can take either 1, 2, or 3 steps using dynamic programming.
• 965. Find the longest palindromic substring in a string using dynamic programming.
• 966. Solve the "Partition Equal Subset Sum" problem where you determine if an array can be partitioned into two subsets with equal sums using dynamic programming.
• 967. Compute the number of distinct subsequences in a string using dynamic programming.
• 968. Find the longest increasing subsequence in an array using dynamic programming.
• 969. Solve the "Egg Dropping Problem" where you minimize the number of trials to determine the critical floor using dynamic programming.
• 970. Compute the longest common subsequence between two strings using dynamic programming.
• 971. Find the number of distinct ways to partition a set into k non-empty subsets using dynamic programming.
• 972. Solve the "House Robber Problem" where adjacent houses cannot be robbed, maximizing the loot using dynamic programming.
• 973. Compute the number of distinct ways to decode a string where digits represent letters using dynamic programming.
• 974. Find the minimum number of cuts required to partition a string into palindromic substrings using dynamic programming.
• 975. Solve the "Coin Change Problem" where you find the minimum number of coins required to make a given amount using dynamic programming.
• 976. Compute the longest palindromic subsequence in a string using dynamic programming.
• 977. Find the longest common substring between two strings using dynamic programming.
• 978. Solve the "Knapsack Problem" where repetition of items is allowed to maximize the total value using dynamic programming.
• 979. Compute the minimum number of steps required to reduce a number to 1 using dynamic programming.
• 980. Find the longest alternating subsequence in an array where elements alternately increase and decrease using dynamic programming.
• 981. Solve the "Longest Palindromic Subsequence" problem where you need to find the longest palindromic subsequence in a string using dynamic programming.
• 982. Compute the maximum sum of non-adjacent elements in an array using dynamic programming.
• 983. Find the minimum number of deletions required to make two strings identical using dynamic programming.
• 984. Solve the "House Robber II" problem where houses are arranged in a circle, and adjacent houses cannot be robbed using dynamic programming.
• 985. Compute the minimum number of operations required to convert one string into another using dynamic programming.
• 986. Find the longest increasing subsequence in an array using dynamic programming.
• 987. Solve the "Rod Cutting Problem" where you maximize the revenue from cutting a rod into smaller pieces using dynamic programming.
• 988. Compute the longest common subsequence between two strings using dynamic programming.
• 989. Find the number of distinct subsequences in a string using dynamic programming.
• 990. Solve the "Longest Common Subsequence" problem between two strings using dynamic programming.
• 991. Compute the minimum cost to paint a row of houses where no two adjacent houses have the same color using dynamic programming.
• 992. Find the number of distinct ways to partition a set of elements into two subsets with equal sums using dynamic programming.
• 993. Solve the "Matrix Chain Multiplication Problem" where you minimize the number of scalar multiplications using dynamic programming.
• 994. Compute the minimum number of operations required to make two strings identical using dynamic programming.
• 995. Find the longest palindromic substring in a string using dynamic programming.
• 996. Solve the "Partition Problem" where you determine if a set can be partitioned into two subsets with equal sums using dynamic programming.
• 997. Compute the maximum sum of a contiguous subarray using dynamic programming.
• 998. Find the longest common substring between two strings using dynamic programming.
• 999. Solve the "Rod Cutting Problem" where you maximize the revenue obtained from cutting a rod into smaller pieces using dynamic programming.
• 1000. Compute the minimum number of cuts required to partition a string into palindromic substrings using dynamic programming.

• More Levels

• Intermediate
• Advanced