Skip to content
Academy
TracksLeaderboardPremium
Tracks/Interview practice: Python

Lesson 9 of 10 · 25 min Premium

Coin change

Find the fewest coins that make an amount, with dynamic programming that beats the greedy guess.

This problem is part of Premium

Interview-style problems with tests that check the tricky cases, to get you ready for coding interviews.

← Longest substring without repeatsLongest increasing subsequence →

Bytepic Academy is free to learn. Made by Bytepic.

Premium·Get a mentor·Leaderboard·Contact·Privacy·Terms