Topic: dynamic-programming-problem / Level: intermediate

• 1851. Solve the "Maximum Path Sum in a 3D Grid with Teleports and Obstacles" problem where you maximize the path sum while navigating through teleport points and obstacles using dynamic programming.
• 1852. Compute the number of distinct ways to partition an array into k subsets where each subset has an odd number of elements using dynamic programming.
• 1853. Solve the "Longest Increasing Subsequence with Deletions and Gaps" problem where deletions and gaps between elements are allowed using dynamic programming.
• 1854. Find the longest subsequence in an array where adjacent elements alternate between multiples of 3 and multiples of 9 using dynamic programming.
• 1855. Solve the "Minimum Path Cost in a Grid with Obstacles and Varying Penalties" problem using dynamic programming.
• 1856. Compute the longest common subsequence between two strings where certain characters are allowed to be ignored using dynamic programming.
• 1857. Solve the "Shortest Path to Collect All Keys in a 3D Grid with Dynamic Obstacles" problem using dynamic programming.
• 1858. Find the number of ways to partition a string into palindromic substrings where each palindrome must be divisible by a given number using dynamic programming.
• 1859. Solve the "Maximum Product of Alternating Subarrays with Variable Lengths" problem where you compute the maximum product while alternating between different lengths using dynamic programming.
• 1860. Compute the number of distinct ways to tile an 8xN board using 1x2 and 2x3 tiles using dynamic programming.
• 1861. Solve the "Burst Balloons XXXVI" problem where you maximize the coins collected by bursting balloons with varying sizes and constraints using dynamic programming.
• 1862. Find the longest subsequence in an array where adjacent elements alternate between multiples of 5 and multiples of 3 using dynamic programming.
• 1863. Solve the "Minimum Number of Swaps to Sort Two Arrays" problem where adjacent swaps are allowed using dynamic programming.
• 1864. Compute the longest increasing subsequence in an array where adjacent elements alternate between prime and composite numbers using dynamic programming.
• 1865. Solve the "Best Time to Buy and Sell Stock with At Most Fifteen Transactions" problem using dynamic programming.
• 1866. Find the minimum number of operations to transform a string into a palindrome where each operation has a variable cost using dynamic programming.
• 1867. Solve the "Palindrome Partitioning with Limited Operations and Length Constraints" problem where each partition has specific length and operation constraints using dynamic programming.
• 1868. Compute the maximum sum of non-overlapping subarrays where the sum of each subarray must be divisible by a prime number using dynamic programming.
• 1869. Solve the "Shortest Path to Collect All Coins in a 3D Grid with Teleports and Obstacles" problem using dynamic programming.
• 1870. Find the longest subsequence in an array where adjacent elements alternate between multiples of 2 and multiples of 4 using dynamic programming.
• 1871. Solve the "Maximum Length of Repeated Subarrays with Deletions" problem where you are allowed to delete elements using dynamic programming.
• 1872. Compute the number of ways to partition a set into subsets where each subset has an odd number of elements using dynamic programming.
• 1873. Solve the "Best Time to Buy and Sell Stock with At Most Sixteen Transactions" problem using dynamic programming.
• 1874. Find the longest increasing subsequence in an array where adjacent elements alternate between multiples of 5 and multiples of 9 using dynamic programming.
• 1875. Solve the "Minimum Number of Deletions to Make Two Strings Identical with Prime Costs" problem using dynamic programming.
• 1876. 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.
• 1877. Solve the "Burst Balloons XXXVII" problem where you maximize the coins collected by bursting balloons of varying colors and values using dynamic programming.
• 1878. Find the longest subsequence in an array where adjacent elements alternate between multiples of 3 and multiples of 6 using dynamic programming.
• 1879. Solve the "Minimum Path Cost in a Weighted Grid with Moving Targets and Obstacles" problem using dynamic programming.
• 1880. Compute the longest common subsequence between two strings where you are allowed to make up to k deletions and replacements using dynamic programming.
• 1881. Solve the "Shortest Path to Visit All Targets in a Grid with Limited Moves" problem using dynamic programming.
• 1882. Find the number of ways to partition a string into palindromic substrings where each palindrome must have a specific length using dynamic programming.
• 1883. Solve the "Maximum Product of Alternating Subarrays with Constraints on Length" problem using dynamic programming.
• 1884. Compute the number of distinct ways to tile a 9xN board using L-shaped trominoes and 1x2 dominoes using dynamic programming.
• 1885. Solve the "Best Time to Buy and Sell Stock with Transaction Fees X" problem using dynamic programming.
• 1886. Find the longest increasing subsequence in an array where adjacent elements alternate between multiples of 4 and multiples of 7 using dynamic programming.
• 1887. Solve the "Minimum Number of Swaps to Sort Two Strings with Limited Operations" problem using dynamic programming.
• 1888. Compute the maximum sum of non-adjacent elements in an array where adjacent elements alternate between prime numbers and multiples of 6 using dynamic programming.
• 1889. Solve the "Palindrome Partitioning with Variable Costs and Length Constraints" problem using dynamic programming.
• 1890. Find the longest subsequence in an array where adjacent elements alternate between multiples of 2 and multiples of 9 using dynamic programming.
• 1891. Solve the "Shortest Path in a Weighted Grid with Teleports and Obstacles" problem using dynamic programming.
• 1892. Compute the number of distinct subsequences in a string that match a pattern with wildcard characters using dynamic programming.
• 1893. Solve the "Best Time to Buy and Sell Stock with Cooldown VIII" problem using dynamic programming.
• 1894. Find the minimum number of deletions required to make two strings equal where each deletion has a different cost using dynamic programming.
• 1895. Solve the "Longest Path in a Graph with Variable Costs and Weight Constraints" problem using dynamic programming.
• 1896. Compute the maximum product of three elements in an array where adjacent elements alternate between multiples of 4 and multiples of 8 using dynamic programming.
• 1897. Solve the "Burst Balloons XXXVIII" problem where you maximize the coins collected by bursting balloons of different sizes and values using dynamic programming.
• 1898. Find the longest subsequence in an array where adjacent elements alternate between prime numbers and multiples of 2 using dynamic programming.
• 1899. Solve the "Minimum Number of Operations to Make Two Strings Identical with Constraints" problem using dynamic programming.
• 1900. 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