6 min read Word Break looks like a string problem but rewards you for caching subproblems by start index, from the memoized recursion to the trie follow-up. Read article
2 min read Clone a Graph (LeetCode 133) is a foundational graph problem that tests your understanding of deep copy vs shallow copy, Read article
2 min read Word Break (LeetCode 139) is a string DP problem that tests whether you can partition a string using a given Read article
2 min read Coin Change (LeetCode 322) is the canonical dynamic programming problem. It tests your ability to identify optimal substructure, choose between Read article
What's missing, wrong, or worth adding? One line helps.
Sent — thank you. We read every one.
