Topic: dynamic-programming-problem / Level: beginner

• 601. Determine the minimum cost to paint a row of houses where no two adjacent houses can be painted the same color using dynamic programming.
• 602. Solve the "Rod Cutting Problem" to maximize the revenue from cutting a rod into smaller pieces using dynamic programming.
• 603. Find the longest common substring between two strings using dynamic programming.
• 604. Compute the number of distinct ways to partition a set into k non-empty subsets using dynamic programming.
• 605. Solve the "Egg Dropping Problem" where you minimize the number of egg drops needed to find the critical floor using dynamic programming.
• 606. Find the longest increasing subsequence in an array using dynamic programming.
• 607. Compute the minimum number of operations required to make two strings identical using dynamic programming.
• 608. Solve the "Minimum Path Sum" problem where you need to find the minimum cost path from the top-left to the bottom-right corner of a grid using dynamic programming.
• 609. Find the maximum sum of non-adjacent elements in an array using dynamic programming.
• 610. Compute the longest palindromic substring in a string using dynamic programming.
• 611. Solve the "House Robber II" problem where houses are arranged in a circle, and no two adjacent houses can be robbed using dynamic programming.
• 612. Determine the minimum number of steps required to reduce a number to 1 using dynamic programming.
• 613. Find the number of ways to partition an array into two subsets with equal sums using dynamic programming.
• 614. Solve the "Coin Change Problem" to find the minimum number of coins needed to make a given amount using dynamic programming.
• 615. Compute the maximum product of a contiguous subarray using dynamic programming.
• 616. Find the longest common subsequence between two strings using dynamic programming.
• 617. Solve the "Partition Equal Subset Sum" problem where you determine if an array can be partitioned into two subsets with equal sums using dynamic programming.
• 618. Determine the minimum cost to paint a row of houses where no two adjacent houses are the same color using dynamic programming.
• 619. Compute the minimum number of operations required to convert one string into another using dynamic programming.
• 620. Solve the "Jump Game II" problem where you need to reach the last index of an array with the minimum number of jumps using dynamic programming.
• 621. Find the longest alternating subsequence in an array where elements alternately increase and decrease using dynamic programming.
• 622. Solve the "Longest Palindromic Subsequence" problem where you find the longest palindromic subsequence in a string using dynamic programming.
• 623. Compute the number of ways to partition a set into k non-empty subsets using dynamic programming.
• 624. Find the minimum number of deletions required to make two strings identical using dynamic programming.
• 625. Solve the "Knapsack Problem" where you maximize the total value of items without exceeding the weight limit using dynamic programming.
• 626. Determine the minimum number of cuts required to partition a string into palindromic substrings using dynamic programming.
• 627. Find the number of distinct subsequences in a string using dynamic programming.
• 628. Compute the minimum cost to reach the bottom-right corner of a grid from the top-left corner where each cell has a cost using dynamic programming.
• 629. Solve the "Egg Dropping Problem" where you minimize the number of trials to find the critical floor using dynamic programming.
• 630. Find the longest bitonic subsequence in an array where the subsequence first increases and then decreases using dynamic programming.
• 631. Compute the minimum number of steps required to reduce a number to 1 using dynamic programming.
• 632. Solve the "House Robber Problem" where you must maximize the profit when adjacent houses cannot be robbed using dynamic programming.
• 633. Determine the minimum number of jumps required to reach the last index of an array where each element represents the maximum jump length using dynamic programming.
• 634. Find the longest palindromic substring in a string using dynamic programming.
• 635. Solve the "Minimum Path Sum" problem where you need to find the minimum path sum in a grid using dynamic programming.
• 636. Compute the number of distinct ways to climb a staircase where you can take 1, 2, or 3 steps at a time using dynamic programming.
• 637. Solve the "Rod Cutting Problem" where you maximize the revenue from cutting a rod into smaller pieces using dynamic programming.
• 638. Find the longest common subsequence between two strings using dynamic programming.
• 639. Compute the maximum sum of non-adjacent numbers in an array using dynamic programming.
• 640. Solve the "Longest Increasing Subsequence" problem where you find the longest increasing subsequence in an array using dynamic programming.
• 641. Determine the minimum number of deletions required to make two strings identical using dynamic programming.
• 642. Find the number of ways to partition an array into two subsets with equal sums using dynamic programming.
• 643. Compute the minimum number of operations required to reduce a number to 1 using dynamic programming.
• 644. Solve the "Coin Change Problem" where you need to find the minimum number of coins required to make a given amount using dynamic programming.
• 645. Find the longest alternating subsequence in an array where elements alternately increase and decrease using dynamic programming.
• 646. Solve the "Partition Problem" where you determine if a set can be partitioned into two subsets with equal sums using dynamic programming.
• 647. Compute the longest palindromic subsequence in a string using dynamic programming.
• 648. Find the minimum number of deletions required to make a string a palindrome using dynamic programming.
• 649. Solve the "Knapsack Problem" where repetition of items is allowed to maximize the total value without exceeding the weight limit using dynamic programming.
• 650. Compute the minimum number of jumps required to reach the last index of an array where each element represents the maximum jump length using dynamic programming.

• More Levels

• Intermediate
• Advanced