Topic: dynamic-programming-problem / Level: intermediate

• 1951. Solve the "Maximum Path Sum in a 3D Grid with Moving Obstacles and Limited Steps" problem using dynamic programming.
• 1952. Compute the number of distinct ways to partition an array into subsets where each subset has a sum divisible by a prime number using dynamic programming.
• 1953. Solve the "Longest Increasing Subsequence with Constraints on Differences" problem where adjacent elements must differ by at least a given value using dynamic programming.
• 1954. Find the longest subsequence in an array where adjacent elements alternate between multiples of 6 and multiples of 9 using dynamic programming.
• 1955. Solve the "Minimum Path Cost in a Grid with Obstacles and Moving Targets" problem using dynamic programming.
• 1956. Compute the longest common subsequence between three strings where you can make up to k deletions and replacements in each string using dynamic programming.
• 1957. Solve the "Shortest Path to Collect All Coins in a Grid with Limited Resources" problem using dynamic programming.
• 1958. Find the number of ways to partition a string into palindromic substrings where each palindrome must have a prime length using dynamic programming.
• 1959. Solve the "Maximum Product of Alternating Subarrays with Constraints on Values" problem where subsequences alternate between increasing and decreasing values using dynamic programming.
• 1960. Compute the number of distinct ways to tile a 10xN board using 1x2 dominoes and L-shaped trominoes using dynamic programming.
• 1961. Solve the "Burst Balloons XLII" problem where you maximize the coins collected by bursting balloons of different sizes and colors using dynamic programming.
• 1962. Find the longest subsequence in an array where adjacent elements alternate between multiples of 7 and multiples of 4 using dynamic programming.
• 1963. Solve the "Minimum Number of Deletions to Make Two Strings Equal with Limited Changes and Costs" problem using dynamic programming.
• 1964. Compute the longest increasing subsequence in an array where adjacent elements alternate between multiples of 3 and prime numbers using dynamic programming.
• 1965. Solve the "Best Time to Buy and Sell Stock with At Most Nineteen Transactions" problem using dynamic programming.
• 1966. Find the minimum number of deletions required to make two strings equal where each deletion has a different cost using dynamic programming.
• 1967. Solve the "Palindrome Partitioning with Limited Cuts and Prime Lengths" problem where each partition has specific length constraints using dynamic programming.
• 1968. Compute the maximum sum of non-overlapping subarrays where each subarrays sum must be divisible by a prime number using dynamic programming.
• 1969. Solve the "Shortest Path to Collect All Keys in a 3D Grid with Obstacles" problem using dynamic programming.
• 1970. Find the longest subsequence in an array where adjacent elements alternate between multiples of 2 and multiples of 7 using dynamic programming.
• 1971. Solve the "Maximum Length of Repeated Subarrays with Constraints on Lengths" problem using dynamic programming.
• 1972. Compute the number of ways to partition a set into k subsets where each subsets sum is divisible by k using dynamic programming.
• 1973. Solve the "Best Time to Buy and Sell Stock with At Most Twenty Transactions" problem using dynamic programming.
• 1974. Find the longest increasing subsequence in an array where adjacent elements alternate between multiples of 4 and multiples of 9 using dynamic programming.
• 1975. Solve the "Minimum Number of Deletions to Make Two Strings Anagrams with Variable Costs" problem using dynamic programming.
• 1976. Compute the number of ways to partition an array into subsets where the sum of elements in each subset is divisible by a prime number using dynamic programming.
• 1977. Solve the "Burst Balloons XLIII" problem where you maximize the coins collected by bursting balloons of different sizes under specific conditions using dynamic programming.
• 1978. Find the longest subsequence in an array where adjacent elements alternate between prime numbers and multiples of 3 using dynamic programming.
• 1979. Solve the "Minimum Path Cost in a Weighted Grid with Teleports and Moving Obstacles" problem using dynamic programming.
• 1980. Compute the longest common subsequence between two strings where you can make up to k deletions using dynamic programming.
• 1981. Solve the "Shortest Path to Visit All Targets in a Grid with Limited Steps" problem using dynamic programming.
• 1982. Find the number of ways to partition a string into palindromic substrings where each palindrome must have an even length using dynamic programming.
• 1983. Solve the "Maximum Product of Alternating Subarrays with Constraints on Lengths" problem where the product alternates between prime and composite numbers using dynamic programming.
• 1984. Compute the number of distinct ways to tile a 9xN board using L-shaped trominoes and 2x3 tiles using dynamic programming.
• 1985. Solve the "Best Time to Buy and Sell Stock with Transaction Fees XII" problem using dynamic programming.
• 1986. Find the longest increasing subsequence in an array where adjacent elements alternate between multiples of 5 and multiples of 7 using dynamic programming.
• 1987. Solve the "Minimum Number of Swaps to Sort Two Binary Strings with Limited Resources" problem using dynamic programming.
• 1988. Compute the maximum sum of non-adjacent elements in an array where adjacent elements alternate between multiples of 3 and multiples of 6 using dynamic programming.
• 1989. Solve the "Palindrome Partitioning with Prime Lengths and Variable Costs" problem using dynamic programming.
• 1990. Find the longest subsequence in an array where adjacent elements alternate between multiples of 4 and multiples of 5 using dynamic programming.
• 1991. Solve the "Shortest Path in a Weighted Grid with Obstacles and Dynamic Targets" problem using dynamic programming.
• 1992. Compute the number of distinct subsequences in a string that match a given pattern with wildcard characters using dynamic programming.
• 1993. Solve the "Best Time to Buy and Sell Stock with Cooldown X" problem using dynamic programming.
• 1994. Find the minimum number of deletions required to make two strings equal where each deletion has a different cost using dynamic programming.
• 1995. Solve the "Longest Path in a Weighted Graph with Limited Moves and Dynamic Obstacles" problem using dynamic programming.
• 1996. Compute the maximum product of three elements in an array where adjacent elements alternate between multiples of 2 and multiples of 7 using dynamic programming.
• 1997. Solve the "Burst Balloons XLIV" problem where you maximize the coins collected by bursting balloons under specific conditions using dynamic programming.
• 1998. Find the longest subsequence in an array where adjacent elements alternate between multiples of 6 and multiples of 8 using dynamic programming.
• 1999. Solve the "Minimum Number of Operations to Make Two Strings Identical with Limited Changes III" problem using dynamic programming.
• 2000. Compute the number of ways to partition a set into subsets where each subsets sum is divisible by a prime number using dynamic programming.

• More Levels

• Beginner
• Advanced