Clone a Graph: Deep Copy with DFS and BFS
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
Graphs
Dynamic Programming
Word Break Problem: Dynamic Programming Solution
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
Dynamic Programming
Coin Change: Bottom-Up and Top-Down Dynamic Programming
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