Topic: dynamic-programming-problem / Level: intermediate

• 1801. Solve the "Maximum Path Sum in a 3D Weighted Grid with Obstacles" problem where you maximize the path sum while navigating through obstacles using dynamic programming.
• 1802. Compute the number of distinct ways to partition an array into k subsets where the sum of elements in each subset is divisible by a prime number using dynamic programming.
• 1803. Solve the "Longest Increasing Subsequence with Gaps" problem where gaps between consecutive elements are allowed using dynamic programming.
• 1804. Find the longest subsequence in an array where adjacent elements alternate between multiples of 6 and multiples of 9 using dynamic programming.
• 1805. Solve the "Minimum Path Sum in a Grid with Teleports and Obstacles" problem using dynamic programming.
• 1806. Compute the longest common subsequence between three strings where you can make up to k deletions in each string using dynamic programming.
• 1807. Solve the "Shortest Path to Collect All Coins in a Grid with Dynamic Obstacles" problem using dynamic programming.
• 1808. Find the number of ways to partition a string into palindromic subsequences where each palindrome must have an odd length using dynamic programming.
• 1809. Solve the "Maximum Product of Alternating Subarrays with Variable Sizes" problem where the subsequences alternate between increasing and decreasing sizes using dynamic programming.
• 1810. Compute the number of distinct ways to tile a 5xN board using L-shaped trominoes and dominoes using dynamic programming.
• 1811. Solve the "Burst Balloons XXXIII" problem where you maximize the coins collected by bursting balloons of varying sizes and weights using dynamic programming.
• 1812. Find the longest subsequence in an array where adjacent elements alternate between multiples of 2 and multiples of 8 using dynamic programming.
• 1813. Solve the "Minimum Number of Deletions to Make Two Strings Palindromes with Constraints" problem using dynamic programming.
• 1814. Compute the longest increasing subsequence in an array where adjacent elements alternate between prime and even numbers using dynamic programming.
• 1815. Solve the "Best Time to Buy and Sell Stock with At Most Thirteen Transactions" problem using dynamic programming.
• 1816. Find the minimum number of deletions required to make two strings equal where the cost of each deletion is different using dynamic programming.
• 1817. Solve the "Palindrome Partitioning with Limited Lengths and Cuts" problem where each partition has a specific length using dynamic programming.
• 1818. Compute the maximum sum of non-overlapping subarrays where the sum of each subarray must be divisible by a prime number using dynamic programming.
• 1819. Solve the "Shortest Path to Collect All Coins in a 3D Grid with Obstacles" problem using dynamic programming.
• 1820. Find the longest subsequence in an array where adjacent elements alternate between odd numbers and multiples of 7 using dynamic programming.
• 1821. Solve the "Maximum Length of Repeated Subarrays IV" problem where the subarrays are subject to length constraints using dynamic programming.
• 1822. Compute the number of ways to partition a set into subsets where the sum of each subset is divisible by a prime number using dynamic programming.
• 1823. Solve the "Best Time to Buy and Sell Stock with At Most Fourteen Transactions" problem using dynamic programming.
• 1824. Find the longest increasing subsequence in an array where adjacent elements alternate between multiples of 3 and multiples of 7 using dynamic programming.
• 1825. Solve the "Minimum Number of Deletions to Make Two Strings Equal with Prime Costs" problem using dynamic programming.
• 1826. Compute the number of ways to partition an array into subsets where the sum of elements in each subset is divisible by a given number using dynamic programming.
• 1827. Solve the "Burst Balloons XXXIV" problem where you maximize the coins collected by bursting balloons with specific conditions using dynamic programming.
• 1828. Find the longest subsequence in an array where adjacent elements alternate between multiples of 4 and multiples of 5 using dynamic programming.
• 1829. Solve the "Minimum Path Sum in a Weighted Grid with Penalties and Obstacles" problem using dynamic programming.
• 1830. Compute the longest common subsequence between two strings where you can replace up to k characters and delete others using dynamic programming.
• 1831. Solve the "Shortest Path to Collect All Items in a Grid with Moving Obstacles" problem using dynamic programming.
• 1832. Find the number of ways to partition a string into palindromic subsequences where each partition has a variable length using dynamic programming.
• 1833. Solve the "Maximum Product of Alternating Subarrays with Constraints on Length" problem where each subarray has a length constraint using dynamic programming.
• 1834. Compute the number of distinct ways to tile a 7xN board using 1x2 dominoes and L-shaped trominoes using dynamic programming.
• 1835. Solve the "Best Time to Buy and Sell Stock with Transaction Fees IX" problem using dynamic programming.
• 1836. Find the longest increasing subsequence in an array where adjacent elements alternate between prime and composite numbers using dynamic programming.
• 1837. Solve the "Minimum Number of Swaps to Make Two Strings Identical" problem using dynamic programming.
• 1838. Compute the maximum sum of non-adjacent elements in an array where adjacent elements alternate between multiples of 2 and multiples of 5 using dynamic programming.
• 1839. Solve the "Palindrome Partitioning with Limited Cuts and Variable Costs" problem using dynamic programming.
• 1840. Find the longest subsequence in an array where adjacent elements alternate between multiples of 7 and multiples of 9 using dynamic programming.
• 1841. Solve the "Shortest Path in a Weighted Grid with Moving Obstacles and Teleports" problem using dynamic programming.
• 1842. Compute the number of distinct subsequences in a string that match a given pattern using dynamic programming.
• 1843. Solve the "Best Time to Buy and Sell Stock with Cooldown VII" problem using dynamic programming.
• 1844. Find the minimum number of deletions required to make two strings equal where each deletion has a variable cost using dynamic programming.
• 1845. Solve the "Longest Path in a Graph with Limited Moves and Constraints" problem using dynamic programming.
• 1846. Compute the maximum product of three elements in an array where adjacent elements alternate between multiples of 4 and multiples of 6 using dynamic programming.
• 1847. Solve the "Burst Balloons XXXV" problem where you maximize the coins collected by bursting balloons of different sizes and constraints using dynamic programming.
• 1848. Find the longest subsequence in an array where adjacent elements alternate between prime and even numbers using dynamic programming.
• 1849. Solve the "Minimum Number of Operations to Make Two Strings Identical with Limited Changes" problem using dynamic programming.
• 1850. 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