More Problems

• Solve the "Shortest Common Supersequence Problem" between two strings.
• Find the number of ways to tile a 3xN board with 2x1 and 2x2 tiles.
• Compute the maximum value that can be obtained from a set of items where each item has a weight and a value.
• Determine the minimum number of cuts needed to partition a string into palindromic substrings.
• Solve the "Unique Paths II" problem where some cells in the grid are blocked.
• Find the number of ways to partition a set into non-empty subsets.
• Determine the number of ways to make change for a given amount using a set of coins with dynamic programming.
• Solve the "Jump Game II" problem where each element represents the maximum number of jumps, and you must reach the last index with the fewest jumps.