More Problems

• Solve the "Partition Problem" to determine if an array can be divided into two subsets of equal sum.
• Find the number of ways to tile a 2 x n grid using 2 x 1 tiles.
• Compute the nth Catalan number using dynamic programming.
• Determine if a string can be rearranged into a palindrome.
• Find the minimum path sum from top to bottom in a triangle of numbers.
• Solve the "Jump Game" problem where each element in the array represents the maximum jump length.
• Calculate the minimum number of cuts required to partition a string such that every substring is a palindrome.
• Solve the "Unique Binary Search Trees" problem, counting the number of structurally unique BSTs that store values 1 to n.