More Problems

• Solve the problem of calculating the maximum profit from buying and selling a stock with at most two transactions.
• Determine the number of valid paths from the top-left to the bottom-right corner of a grid with obstacles.
• Compute the minimum cost to merge k files into one large file, where the cost is the sum of the sizes of the files being merged.
• 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.