Topic: dynamic-programming-problem / Level: intermediate

• 1701. Solve the "Maximum Path Sum in a Weighted Graph with Obstacles" problem where you maximize the path sum while avoiding obstacles using dynamic programming.
• 1702. Compute the number of distinct ways to partition an array into subsets such that each subset has an even number of elements using dynamic programming.
• 1703. Solve the "Longest Increasing Subsequence with Alternating Parity" problem where adjacent elements alternate between even and odd using dynamic programming.
• 1704. Find the longest subsequence in an array where adjacent elements alternate between prime numbers and multiples of 6 using dynamic programming.
• 1705. Solve the "Minimum Path Sum in a 3D Grid with Obstacles" problem where obstacles must be avoided while finding the minimum path using dynamic programming.
• 1706. Compute the longest common subsequence between three strings where you can make up to k replacements in each string using dynamic programming.
• 1707. Solve the "Shortest Path to Collect All Items in a Grid with Moving Obstacles" problem using dynamic programming.
• 1708. Find the number of ways to partition a string into palindromic substrings where each partition has a prime length using dynamic programming.
• 1709. Solve the "Maximum Product of Alternating Subsequences with Variable Costs" problem using dynamic programming.
• 1710. Compute the number of distinct ways to tile a 6xN board using L-shaped trominoes and 2x2 squares using dynamic programming.
• 1711. Solve the "Burst Balloons XXVII" problem where you maximize the coins collected by bursting balloons with varying sizes and values using dynamic programming.
• 1712. Find the longest subsequence in an array where adjacent elements alternate between multiples of 3 and multiples of 7 using dynamic programming.
• 1713. Solve the "Minimum Number of Operations to Make Two Strings Palindromes" problem where each operation has a variable cost using dynamic programming.
• 1714. Compute the longest increasing subsequence in an array where adjacent elements alternate between multiples of 2 and multiples of 8 using dynamic programming.
• 1715. Solve the "Best Time to Buy and Sell Stock with Multiple Cooldown Periods" problem using dynamic programming.
• 1716. Find the minimum number of insertions required to make a string a palindrome where each insertion has a variable cost using dynamic programming.
• 1717. Solve the "Palindrome Partitioning with Variable Length Constraints" problem where each palindrome has a specific length using dynamic programming.
• 1718. Compute the maximum sum of non-overlapping subarrays where each subarrays sum is divisible by a prime number using dynamic programming.
• 1719. Solve the "Shortest Path to Collect Keys in a Grid with Obstacles and Teleports" problem using dynamic programming.
• 1720. Find the longest subsequence in an array where adjacent elements alternate between odd numbers and multiples of 4 using dynamic programming.
• 1721. Solve the "Maximum Length of Repeated Subarrays with Constraints" problem where you compute the longest subarray that appears in both arrays with specific constraints using dynamic programming.
• 1722. Compute the number of ways to partition a set into subsets where each subsets sum is divisible by k using dynamic programming.
• 1723. Solve the "Best Time to Buy and Sell Stock with Cooldown V" problem where you maximize profit while observing cooldown periods using dynamic programming.
• 1724. Find the longest increasing subsequence in an array where adjacent elements alternate between even numbers and multiples of 7 using dynamic programming.
• 1725. Solve the "Minimum Number of Deletions to Make Two Strings Anagrams II" problem using dynamic programming.
• 1726. Compute the number of ways to partition an array into subsets where each subset has a sum divisible by a given number using dynamic programming.
• 1727. Solve the "Burst Balloons XXVIII" problem where you maximize the coins collected by bursting balloons with varying sizes and additional constraints using dynamic programming.
• 1728. Find the longest subsequence in an array where adjacent elements alternate between multiples of 5 and multiples of 2 using dynamic programming.
• 1729. Solve the "Minimum Path Cost in a Grid with Moving Targets and Obstacles" problem using dynamic programming.
• 1730. Compute the longest common subsequence between two strings where you can make up to k replacements and deletions using dynamic programming.
• 1731. Solve the "Shortest Path to Visit All Keys in a 3D Grid with Limited Moves" problem using dynamic programming.
• 1732. Find the number of ways to partition a string into palindromic subsequences where each palindrome must have an odd length using dynamic programming.
• 1733. Solve the "Maximum Product of Alternating Subarrays with Prime Numbers" problem where you compute the maximum product using dynamic programming.
• 1734. Compute the number of distinct ways to tile a 7xN board using 1x2 dominoes and 1x3 trominoes using dynamic programming.
• 1735. Solve the "Best Time to Buy and Sell Stock with At Most Ten Transactions" problem using dynamic programming.
• 1736. Find the longest increasing subsequence in an array where adjacent elements alternate between odd numbers and multiples of 6 using dynamic programming.
• 1737. Solve the "Minimum Number of Swaps to Sort a Binary String III" problem where each swap has a different cost using dynamic programming.
• 1738. Compute the maximum sum of non-adjacent elements in an array where adjacent elements alternate between prime numbers and multiples of 2 using dynamic programming.
• 1739. Solve the "Palindrome Partitioning with Limited Operations and Variable Costs" problem using dynamic programming.
• 1740. Find the longest subsequence in an array where adjacent elements alternate between prime numbers and multiples of 3 using dynamic programming.
• 1741. Solve the "Shortest Path in a Weighted Grid with Moving Obstacles and Penalties" problem using dynamic programming.
• 1742. Compute the number of distinct subsequences that match a pattern in a string with wildcard characters using dynamic programming.
• 1743. Solve the "Best Time to Buy and Sell Stock with Transaction Fees VII" problem using dynamic programming.
• 1744. Find the minimum number of deletions required to make two strings identical where each deletion has a different cost using dynamic programming.
• 1745. Solve the "Longest Path in a Graph with Limited Steps and Weight Constraints" problem using dynamic programming.
• 1746. Compute the maximum product of three elements in an array where adjacent elements alternate between multiples of 4 and multiples of 5 using dynamic programming.
• 1747. Solve the "Burst Balloons XXIX" problem where you maximize the coins collected by bursting balloons of different colors using dynamic programming.
• 1748. Find the longest subsequence in an array where adjacent elements alternate between multiples of 2 and multiples of 3 using dynamic programming.
• 1749. Solve the "Minimum Number of Operations to Make Two Strings Identical with Variable Costs" problem using dynamic programming.
• 1750. 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