Topic: dynamic-programming-problem / Level: beginner

• 701. Determine the minimum number of operations required to reduce a number to 1 using dynamic programming.
• 702. Find the longest bitonic subsequence in an array where the subsequence first increases and then decreases using dynamic programming.
• 703. Solve the "Partition Problem" to determine if a set can be partitioned into two subsets with equal sums using dynamic programming.
• 704. Compute the longest palindromic substring in a string using dynamic programming.
• 705. Find the number of distinct ways to partition a set of elements into two subsets with equal sums using dynamic programming.
• 706. Solve the "Coin Change Problem" where you find the minimum number of coins needed to make a given amount using dynamic programming.
• 707. Compute the minimum number of deletions required to make two strings identical using dynamic programming.
• 708. Find the longest common subsequence between two strings using dynamic programming.
• 709. Solve the "Minimum Path Sum" problem where you find the minimum path cost in a grid using dynamic programming.
• 710. Determine the minimum number of cuts required to partition a string into palindromic substrings using dynamic programming.
• 711. Compute the maximum sum of a subarray where no two elements are adjacent using dynamic programming.
• 712. Solve the "House Robber II" problem where you must maximize the profit when houses are arranged in a circle using dynamic programming.
• 713. Find the longest subsequence in an array where adjacent elements alternately increase and decrease using dynamic programming.
• 714. Compute the minimum number of steps required to reduce a number to 1 using dynamic programming.
• 715. Solve the "Longest Palindromic Subsequence" problem where you find the longest palindromic subsequence in a string using dynamic programming.
• 716. Determine the number of distinct subsequences of a string using dynamic programming.
• 717. Solve the "Knapsack Problem" where repetition of items is allowed, maximizing the total value using dynamic programming.
• 718. Find the longest common substring between two strings using dynamic programming.
• 719. Compute the minimum number of operations required to convert one string into another using dynamic programming.
• 720. Solve the "Rod Cutting Problem" where you maximize the revenue obtained from cutting a rod into smaller pieces using dynamic programming.
• 721. Find the minimum cost to paint a row of houses where no two adjacent houses can be painted the same color using dynamic programming.
• 722. Compute the longest increasing subsequence in an array using dynamic programming.
• 723. Solve the "Coin Change Problem" where you find the number of distinct ways to make change for a given amount using dynamic programming.
• 724. Determine the minimum number of operations required to make two strings identical using dynamic programming.
• 725. Find the longest palindromic substring in a string using dynamic programming.
• 726. Compute the maximum sum of a subsequence where no two elements are adjacent using dynamic programming.
• 727. Solve the "Partition Equal Subset Sum" problem to determine if an array can be partitioned into two subsets with equal sums using dynamic programming.
• 728. Find the longest bitonic subsequence in an array where the subsequence first increases and then decreases using dynamic programming.
• 729. Solve the "Longest Common Subsequence" problem between two strings using dynamic programming.
• 730. Compute the number of distinct ways to partition a set of elements into k non-empty subsets using dynamic programming.
• 731. Find the minimum number of jumps required to reach the last index in an array where each element represents the maximum jump length using dynamic programming.
• 732. Solve the "Egg Dropping Problem" where you minimize the number of trials to determine the critical floor using dynamic programming.
• 733. Compute the longest palindromic subsequence in a string using dynamic programming.
• 734. Find the number of distinct subsequences of a string using dynamic programming.
• 735. Solve the "House Robber Problem" where you maximize the profit when adjacent houses cannot be robbed using dynamic programming.
• 736. Determine the minimum number of steps required to reduce a number to 1 using dynamic programming.
• 737. Compute the longest bitonic subsequence in an array where the subsequence first increases and then decreases using dynamic programming.
• 738. Solve the "Coin Change Problem" where you find the minimum number of coins required to make a given amount using dynamic programming.
• 739. Find the longest common subsequence between two strings using dynamic programming.
• 740. Compute the minimum cost to paint a row of houses where no two adjacent houses can be painted the same color using dynamic programming.
• 741. Solve the "Longest Palindromic Subsequence" problem where you need to find the longest palindromic subsequence in a string using dynamic programming.
• 742. Compute the number of distinct ways to partition an array into two subsets with equal sums using dynamic programming.
• 743. Find the maximum product of a contiguous subarray using dynamic programming.
• 744. Solve the "House Robber II" problem where houses are arranged in a circle and adjacent houses cannot be robbed using dynamic programming.
• 745. Determine the number of distinct ways to climb a staircase where you can take either 1, 2, or 3 steps using dynamic programming.
• 746. Compute the longest increasing subsequence in an array of integers using dynamic programming.
• 747. Solve the "Partition Equal Subset Sum" problem where you need to determine if an array can be partitioned into two subsets with equal sums using dynamic programming.
• 748. Find the minimum number of cuts required to partition a string into palindromic substrings using dynamic programming.
• 749. Compute the number of distinct subsequences in a string using dynamic programming.
• 750. Solve the "Rod Cutting Problem" where you need to maximize the revenue by cutting a rod into smaller pieces using dynamic programming.

• More Levels

• Intermediate
• Advanced