LeetCode Climbing Stairs: Fibonacci in Disguise
Walk through LeetCode 70 Climbing Stairs from brute force recursion to bottom-up DP, with edge cases, complexity analysis, and an interview script.
·5 min read · #dsa#leetcode#dynamic-programming
#dynamic-programming
6 posts.
LeetCode Coin Change: Bottom-Up DP Explained
Walk through LeetCode 322 Coin Change with brute force recursion, memoization, and bottom-up DP. Includes complexity analysis and interview script.
·6 min read · #dsa#leetcode#dynamic-programming
LeetCode House Robber: The Pick-or-Skip DP Template
Solve LeetCode 198 House Robber with the pick-or-skip DP recurrence, then optimize to O(1) space. Includes interview script and related variants.
·5 min read · #dsa#leetcode#dynamic-programming
LeetCode Word Break: DP with a Word Dictionary
Solve LeetCode 139 Word Break with bottom-up dynamic programming. Includes brute force, edge cases, complexity analysis, and an interview script.
·6 min read · #dsa#leetcode#dynamic-programming
Dynamic Programming: 8 Classic Problems with Solutions
Eight classic dynamic programming problems — Climbing Stairs, House Robber, Coin Change, LIS, Word Break, 0/1 Knapsack, Edit Distance, and LCS — each with Python solutions and DP tables.
·10 min read · #dsa#dynamic-programming#practice
Dynamic Programming: Memoization and Tabulation
An introduction to dynamic programming — overlapping subproblems, optimal substructure, top-down memoization, and bottom-up tabulation, with worked examples in Python.
·8 min read · #dsa#dynamic-programming#intermediate