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 denominations provided. Consider you have an infinite supply of each denomination given in the array.

Number of Ways To Make Change

Given an array of POSITIVE INTEGERS, find the greatest sum that can be generated without adding 2 numbers positioned next to each other.

Maximum Subset Sum With No Adjacent

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 character, deletion of a character, or addition of a character. This problem is also called Levenshtein Distance. Levenshtein distance is a string metric for measuring the difference between two sequences.

Levenshtein Distance

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 array will have denominations that are Infinitely available, i.e. coins can be repeated and added to calculate the target.

Dynamic Programming

Number of Ways To Make Change

Maximum Subset Sum With No Adjacent

Levenshtein Distance

Minimum Number Of Coins To Make Change

Pages

Algochurn

Frontend Churn

Friends

Links