A playground for the things that are easier to understand when you can step through them — algorithms, React internals, and interactive visualizations.
Longest strictly increasing subsequence — dp[i] = best run ending at i.
Can a string be split into dictionary words? Reachability DP over prefixes.
Fewest coins to make an amount — bottom-up DP, not greedy.