Questions based on dynamic programming
Maximum Subset Sum With No Adjacent
Given an array of POSITIVE INTEGERS, find the greatest sum that can be generated without adding 2 numbers positioned next to each other.
Number of Ways To Make Change
Given a target amount and a set of denominations (coins), find the total number of ways the given target amount can be expressed by using the denomina...
Minimum Number Of Coins To Make Change
Given an array of coins or denominations and a target sum, calculate the minimum number of coins required to match the total. Note that the coins arra...
Given 2 strings, find the minimum number of operations required to change one string to the other. An operation is defined as either replacement of a ...