Topic: dynamic-programming-problem / Level: intermediate

• 1751. Solve the "Maximum Path Sum in a Weighted Graph with Variable Costs" problem using dynamic programming.
• 1752. Compute the number of distinct ways to partition an array into subsets where the sum of elements in each subset is divisible by a prime number using dynamic programming.
• 1753. Solve the "Longest Increasing Subsequence with Limited Replacements" problem where you can replace up to k elements using dynamic programming.
• 1754. Find the longest subsequence in an array where adjacent elements alternate between odd numbers and multiples of 8 using dynamic programming.
• 1755. Solve the "Minimum Path Sum in a 3D Grid with Moving Obstacles" problem using dynamic programming.
• 1756. Compute the longest common subsequence between three strings where you can make up to k replacements in each string using dynamic programming.
• 1757. Solve the "Shortest Path to Collect All Coins in a Grid with Penalties" problem using dynamic programming.
• 1758. Find the number of ways to partition a string into palindromic substrings where each palindrome must have an even length using dynamic programming.
• 1759. Solve the "Maximum Product of Alternating Subarrays with Constraints" problem where you maximize the product of alternating subarrays using dynamic programming.
• 1760. Compute the number of distinct ways to tile a 7xN board using L-shaped trominoes and dominoes using dynamic programming.
• 1761. Solve the "Burst Balloons XXX" problem where you maximize the coins collected by bursting balloons of different sizes under specific conditions using dynamic programming.
• 1762. Find the longest subsequence in an array where adjacent elements alternate between multiples of 5 and multiples of 2 using dynamic programming.
• 1763. Solve the "Minimum Number of Operations to Make Two Strings Palindromes with Limited Changes" problem using dynamic programming.
• 1764. Compute the longest increasing subsequence in an array where adjacent elements alternate between prime and composite numbers using dynamic programming.
• 1765. Solve the "Best Time to Buy and Sell Stock with At Most Eleven Transactions" problem using dynamic programming.
• 1766. Find the minimum number of deletions required to make two strings anagrams where each deletion has a variable cost using dynamic programming.
• 1767. Solve the "Palindrome Partitioning with Variable Length and Cost Constraints" problem where each partition has a specific length and cost using dynamic programming.
• 1768. Compute the maximum sum of non-overlapping subarrays where the sum of each subarray is divisible by k using dynamic programming.
• 1769. Solve the "Shortest Path to Visit All Keys in a Grid with Limited Moves" problem using dynamic programming.
• 1770. Find the longest subsequence in an array where adjacent elements alternate between multiples of 2 and multiples of 3 using dynamic programming.
• 1771. Solve the "Maximum Length of Repeated Subarrays with Limited Replacements" problem using dynamic programming.
• 1772. 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.
• 1773. Solve the "Best Time to Buy and Sell Stock with At Most Twelve Transactions" problem using dynamic programming.
• 1774. Find the longest increasing subsequence in an array where adjacent elements alternate between even numbers and multiples of 6 using dynamic programming.
• 1775. Solve the "Minimum Number of Deletions to Make Two Strings Equal with Variable Costs" problem using dynamic programming.
• 1776. 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.
• 1777. Solve the "Burst Balloons XXXI" problem where you maximize the coins collected by bursting balloons with variable sizes and weights using dynamic programming.
• 1778. Find the longest subsequence in an array where adjacent elements alternate between multiples of 4 and multiples of 6 using dynamic programming.
• 1779. Solve the "Minimum Path Cost in a Grid with Obstacles and Moving Targets" problem using dynamic programming.
• 1780. Compute the longest common subsequence between two strings where you can replace up to k characters using dynamic programming.
• 1781. Solve the "Shortest Path to Collect All Keys in a 3D Grid with Teleports" problem using dynamic programming.
• 1782. Find the number of ways to partition a string into palindromic substrings where each palindrome must have a specific length using dynamic programming.
• 1783. Solve the "Maximum Product of Alternating Subarrays with Prime Numbers" problem using dynamic programming.
• 1784. Compute the number of distinct ways to tile a 8xN board using L-shaped trominoes and 1x2 dominoes using dynamic programming.
• 1785. Solve the "Best Time to Buy and Sell Stock with Transaction Fees VIII" problem using dynamic programming.
• 1786. Find the longest increasing subsequence in an array where adjacent elements alternate between prime and composite numbers using dynamic programming.
• 1787. Solve the "Minimum Number of Swaps to Sort Two Binary Strings" problem using dynamic programming.
• 1788. Compute the maximum sum of non-adjacent elements in an array where adjacent elements alternate between prime numbers and multiples of 5 using dynamic programming.
• 1789. Solve the "Palindrome Partitioning with Limited Replacements and Variable Costs" problem using dynamic programming.
• 1790. Find the longest subsequence in an array where adjacent elements alternate between multiples of 3 and multiples of 7 using dynamic programming.
• 1791. Solve the "Shortest Path in a Weighted Grid with Moving Obstacles and Penalties" problem using dynamic programming.
• 1792. Compute the number of distinct subsequences in a string that match a given pattern with wildcard characters using dynamic programming.
• 1793. Solve the "Best Time to Buy and Sell Stock with Cooldown VI" problem using dynamic programming.
• 1794. Find the minimum number of deletions required to make two strings identical where each deletion has a variable cost using dynamic programming.
• 1795. Solve the "Longest Path in a Graph with Weight and Step Constraints" problem using dynamic programming.
• 1796. 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.
• 1797. Solve the "Burst Balloons XXXII" problem where you maximize the coins collected by bursting balloons under specific conditions using dynamic programming.
• 1798. Find the longest subsequence in an array where adjacent elements alternate between odd numbers and multiples of 5 using dynamic programming.
• 1799. Solve the "Minimum Number of Operations to Make Two Strings Identical with Limited Replacements" problem using dynamic programming.
• 1800. 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