// remember what made it click
Remember what made it click.
A journal for LeetCode and NeetCode practice. Save the insight that cracked the problem, not just the final answer, then let a light spaced-review system bring it back before you forget it.
100% free · No account required
// cards stay in your browser until you enable sync
Build up from amount 0 instead of recursing down. dp[a] only ever needs dp[a - coin], so one array and two loops replace the whole recursion tree.
Paste a LeetCode or NeetCode URL and write the one sentence that made it click. Patterns, complexity, and solutions come along too.
Title first, insight hidden. Rate yourself Forgot, Shaky, or Got it and the next review moves accordingly.
Everything works offline in your browser. Sign in with Google only if you want the same collection elsewhere.