More Problems

• Find the minimum cost path in a grid (only moves allowed are right or down).
• Solve the 0/1 Knapsack problem for a given set of weights and values.
• Determine if a subset of a given set can sum to a target value.
• Find the number of distinct ways to reach the nth step of a staircase.
• Compute the number of ways to climb a staircase with a maximum of 3 steps.
• Given an array of coins and an amount, find how many ways you can make the amount.
• Determine the maximum sum of non-adjacent numbers from an array.
• Calculate the minimum number of edits (insertions, deletions, substitutions) to transform one string into another (Levenshtein distance).