Coding dp
House Robber I / II
LC 198, 213. Recurrence first. Circle case = two linear runs.
Week 4Tuesday 3 NovemberDP
Day 22: 1D dynamic programming
0 of 4 tasks completed0%
Coding dp
Coin Change
LC 322. Unbounded knapsack. Why greedy fails. Sentinel for impossible.
Coding dp
Longest Increasing Subsequence
LC 300. O(n²) first, then patience-sort O(n log n) if time.
System design storage
SQL vs NoSQL decision tree
Access pattern, transactions, fan-out. Say what you give up with each pick.