← Back to Algorithms

Coin Change (Greedy)

Finds minimum number of coins that make a given value (may not always give optimal solution).

Time: O(n)
Space: O(1)

How it works