Topic: dynamic-programming-problem / Level: intermediate

• 1901. Solve the "Maximum Path Sum in a Weighted Grid with Limited Moves" problem where you have a limited number of moves to reach the goal using dynamic programming.
• 1902. Compute the number of distinct ways to partition an array into k subsets where each subset has a prime number sum using dynamic programming.
• 1903. Solve the "Longest Increasing Subsequence with Limited Deletions" problem where you can delete up to k elements to form the longest increasing subsequence using dynamic programming.
• 1904. Find the longest subsequence in an array where adjacent elements alternate between multiples of 7 and multiples of 8 using dynamic programming.
• 1905. Solve the "Minimum Path Cost in a Grid with Dynamic Obstacles and Teleports" problem using dynamic programming.
• 1906. Compute the longest common subsequence between three strings where you can make up to k deletions in each string using dynamic programming.
• 1907. Solve the "Shortest Path to Collect All Coins in a Grid with Limited Moves" problem using dynamic programming.
• 1908. Find the number of ways to partition a string into palindromic substrings where each palindrome must be a prime length using dynamic programming.
• 1909. Solve the "Maximum Product of Alternating Subarrays with Dynamic Constraints" problem where the subsequences alternate between increasing and decreasing values using dynamic programming.
• 1910. Compute the number of distinct ways to tile a 10xN board using L-shaped trominoes and 2x2 dominoes using dynamic programming.
• 1911. Solve the "Burst Balloons XXXIX" problem where you maximize the coins collected by bursting balloons of different colors and sizes using dynamic programming.
• 1912. Find the longest subsequence in an array where adjacent elements alternate between multiples of 4 and multiples of 9 using dynamic programming.
• 1913. Solve the "Minimum Number of Operations to Make Two Strings Equal with Limited Deletions" problem using dynamic programming.
• 1914. Compute the longest increasing subsequence in an array where adjacent elements alternate between prime and odd numbers using dynamic programming.
• 1915. Solve the "Best Time to Buy and Sell Stock with At Most Seventeen Transactions" problem using dynamic programming.
• 1916. Find the minimum number of deletions required to make two strings equal where each deletion has a variable cost using dynamic programming.
• 1917. Solve the "Palindrome Partitioning with Prime Length and Limited Cuts" problem using dynamic programming.
• 1918. Compute the maximum sum of non-overlapping subarrays where each subarrays sum must be divisible by a given number using dynamic programming.
• 1919. Solve the "Shortest Path to Collect All Items in a 3D Grid with Dynamic Obstacles" problem using dynamic programming.
• 1920. Find the longest subsequence in an array where adjacent elements alternate between multiples of 2 and multiples of 6 using dynamic programming.
• 1921. Solve the "Maximum Length of Repeated Subarrays with Prime Constraints" problem using dynamic programming.
• 1922. Compute the number of ways to partition a set into k subsets where the sum of elements in each subset is divisible by a prime number using dynamic programming.
• 1923. Solve the "Best Time to Buy and Sell Stock with At Most Eighteen Transactions" problem using dynamic programming.
• 1924. Find the longest increasing subsequence in an array where adjacent elements alternate between multiples of 3 and multiples of 8 using dynamic programming.
• 1925. Solve the "Minimum Number of Deletions to Make Two Strings Identical with Limited Changes" problem using dynamic programming.
• 1926. Compute the number of ways to partition an array into subsets where the sum of elements in each subset is divisible by k using dynamic programming.
• 1927. Solve the "Burst Balloons XL" problem where you maximize the coins collected by bursting balloons of varying sizes and constraints using dynamic programming.
• 1928. Find the longest subsequence in an array where adjacent elements alternate between multiples of 3 and multiples of 5 using dynamic programming.
• 1929. Solve the "Minimum Path Cost in a Weighted Grid with Moving Obstacles and Dynamic Targets" problem using dynamic programming.
• 1930. Compute the longest common subsequence between two strings where you are allowed to make up to k deletions using dynamic programming.
• 1931. Solve the "Shortest Path to Visit All Keys in a Grid with Dynamic Obstacles" problem using dynamic programming.
• 1932. Find the number of ways to partition a string into palindromic substrings where each palindrome must have a specific length using dynamic programming.
• 1933. Solve the "Maximum Product of Alternating Subarrays with Dynamic Lengths" problem using dynamic programming.
• 1934. Compute the number of distinct ways to tile a 9xN board using 1x2 dominoes and L-shaped trominoes using dynamic programming.
• 1935. Solve the "Best Time to Buy and Sell Stock with Transaction Fees XI" problem using dynamic programming.
• 1936. Find the longest increasing subsequence in an array where adjacent elements alternate between prime numbers and multiples of 4 using dynamic programming.
• 1937. Solve the "Minimum Number of Swaps to Sort Two Binary Strings with Limited Operations" problem using dynamic programming.
• 1938. Compute the maximum sum of non-adjacent elements in an array where adjacent elements alternate between prime numbers and multiples of 7 using dynamic programming.
• 1939. Solve the "Palindrome Partitioning with Limited Cuts and Variable Costs II" problem using dynamic programming.
• 1940. Find the longest subsequence in an array where adjacent elements alternate between multiples of 4 and multiples of 8 using dynamic programming.
• 1941. Solve the "Shortest Path in a Grid with Obstacles and Teleports" problem using dynamic programming.
• 1942. Compute the number of distinct subsequences in a string that match a given pattern with wildcard characters using dynamic programming.
• 1943. Solve the "Best Time to Buy and Sell Stock with Cooldown IX" problem using dynamic programming.
• 1944. Find the minimum number of deletions required to make two strings identical where each deletion has a variable cost using dynamic programming.
• 1945. Solve the "Longest Path in a Graph with Dynamic Obstacles and Limited Moves" problem using dynamic programming.
• 1946. Compute the maximum product of three elements in an array where adjacent elements alternate between multiples of 3 and multiples of 6 using dynamic programming.
• 1947. Solve the "Burst Balloons XLI" problem where you maximize the coins collected by bursting balloons of different sizes and constraints using dynamic programming.
• 1948. Find the longest subsequence in an array where adjacent elements alternate between multiples of 5 and multiples of 7 using dynamic programming.
• 1949. Solve the "Minimum Number of Operations to Make Two Strings Identical with Limited Changes II" problem using dynamic programming.
• 1950. 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