Topic: dynamic-programming-problem / Level: beginner

• 801. Find the longest palindromic substring in a string using dynamic programming.
• 802. Solve the "Knapsack Problem" where repetition of items is allowed, and you must maximize the total value without exceeding the weight limit using dynamic programming.
• 803. Compute the number of ways to partition an array into subsets with equal sums using dynamic programming.
• 804. Find the minimum number of cuts required to partition a string into palindromic substrings using dynamic programming.
• 805. Solve the "Longest Common Subsequence" problem between two strings using dynamic programming.
• 806. Compute the number of ways to decode a string of digits where digits represent letters (A = 1, B = 2, ..., Z = 26) using dynamic programming.
• 807. Find the minimum number of steps required to reduce a number to 1 using dynamic programming.
• 808. Solve the "Rod Cutting Problem" where you maximize the revenue from cutting a rod into smaller pieces using dynamic programming.
• 809. Compute the minimum number of operations required to make two strings identical using dynamic programming.
• 810. Find the longest bitonic subsequence in an array where the subsequence first increases and then decreases using dynamic programming.
• 811. Solve the "House Robber Problem" where adjacent houses cannot be robbed, maximizing the loot using dynamic programming.
• 812. Compute the longest palindromic subsequence in a string using dynamic programming.
• 813. Find the minimum cost to paint a row of houses such that no two adjacent houses have the same color using dynamic programming.
• 814. Solve the "Matrix Chain Multiplication Problem" where you minimize the number of scalar multiplications using dynamic programming.
• 815. Determine the minimum number of operations required to convert one string into another using dynamic programming.
• 816. Find the number of distinct subsequences in a string using dynamic programming.
• 817. Solve the "Partition Problem" where you determine if a set can be partitioned into two subsets with equal sums using dynamic programming.
• 818. Compute the maximum product of a contiguous subarray using dynamic programming.
• 819. Find the longest alternating subsequence in an array where elements alternately increase and decrease using dynamic programming.
• 820. Solve the "Egg Dropping Problem" where you minimize the number of egg drops needed to find the critical floor using dynamic programming.
• 821. Compute the longest common subsequence between two strings using dynamic programming.
• 822. Find the minimum number of deletions required to make a string a palindrome using dynamic programming.
• 823. Solve the "House Robber II" problem where houses are arranged in a circle, and adjacent houses cannot be robbed using dynamic programming.
• 824. Compute the number of ways to partition an array into two subsets with equal sums using dynamic programming.
• 825. Find the longest increasing subsequence in an array using dynamic programming.
• 826. Solve the "Coin Change Problem" where you find the minimum number of coins required to make a given amount using dynamic programming.
• 827. Determine the minimum number of cuts required to partition a string into palindromic substrings using dynamic programming.
• 828. Compute the minimum number of operations required to make two strings identical using dynamic programming.
• 829. Solve the "Rod Cutting Problem" where you maximize the revenue from cutting a rod into smaller pieces using dynamic programming.
• 830. Find the number of distinct ways to partition a set into k non-empty subsets using dynamic programming.
• 831. Solve the "Longest Palindromic Subsequence" problem where you find the longest palindromic subsequence in a string using dynamic programming.
• 832. Compute the minimum cost to paint a row of houses where no two adjacent houses have the same color using dynamic programming.
• 833. Find the maximum sum of a contiguous subarray using dynamic programming (Kadanes Algorithm).
• 834. Solve the "Knapsack Problem" where repetition of items is allowed, maximizing the total value without exceeding the weight limit using dynamic programming.
• 835. Compute the longest bitonic subsequence in an array where the subsequence first increases and then decreases using dynamic programming.
• 836. Find the minimum number of operations required to convert one string into another using dynamic programming.
• 837. Solve the "House Robber Problem" where adjacent houses cannot be robbed, maximizing the profit using dynamic programming.
• 838. Compute the number of distinct ways to climb a staircase where you can take 1, 2, or 3 steps using dynamic programming.
• 839. Solve the "Longest Common Subsequence" problem between two strings using dynamic programming.
• 840. Find the number of ways to decode a message encoded as numbers where digits represent letters using dynamic programming.
• 841. Compute the minimum number of deletions required to make a string a palindrome using dynamic programming.
• 842. Solve the "Egg Dropping Problem" where you minimize the number of trials needed to determine the critical floor using dynamic programming.
• 843. Find the longest increasing subsequence in an array using dynamic programming.
• 844. Compute the number of distinct subsequences in a string using dynamic programming.
• 845. Solve the "House Robber II" problem where houses are arranged in a circle, and adjacent houses cannot be robbed using dynamic programming.
• 846. Find the minimum number of steps required to reduce a number to 1 using dynamic programming.
• 847. Solve the "Partition Problem" where you determine if a set can be partitioned into two subsets with equal sums using dynamic programming.
• 848. Compute the longest palindromic subsequence in a string using dynamic programming.
• 849. Find the minimum number of cuts required to partition a string into palindromic substrings using dynamic programming.
• 850. Solve the "Rod Cutting Problem" where you maximize the revenue from cutting a rod into smaller pieces using dynamic programming.

• More Levels

• Intermediate
• Advanced