Neetcode Spaced Repetition System

322. Coin Change

MediumBlind 75

1-D Dynamic Programming

Optimal Complexity

Time

O(n * t)

Space

O(t)

Start First Attempt
Coin Change — NeetcodeSRS