You've learned the core DP patterns. Climbing Stairs and House Robber taught you -D DP with simple recurrences. Coin Change showed unbounded choices. LIS introduced the subsequence pattern with and solutions. Unique Paths moved you to -D grids. LCS and Word Break applied DP to strings. When you see "count ways," "minimum cost," or "can you reach," think DP. Define your state, find the recurrence, and build from base cases.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/dynamic-programming/section-recap
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████████████████████████████████████████████████████████████████████████████████