dsa4 min read
1D Dynamic Programming — Complete Guide
Master 1D DP: Fibonacci/Climbing Stairs, House Robber, LIS, Coin Change, Jump Game, and Kadane patterns with 5-language templates.
Read →
Fibonacci
5 articles
dsa1 min read
Climbing Stairs — Fibonacci DP
Count ways to climb n stairs taking 1 or 2 steps. Classic Fibonacci DP — dp[n] = dp[n-1] + dp[n-2] with O(1) space.
Read →
dsa1 min read
Min Cost Climbing Stairs — Fibonacci DP
Find minimum cost to reach the top of stairs. Each stair has a cost; you can take 1 or 2 steps. DP: min cost to reach each stair.
Read →
dsa3 min read
Number Sequences: Fibonacci Variants and Mathematical Patterns
Explore classic number sequences: Fibonacci, Lucas, Pell, tribonacci, with DP and matrix approaches.
Read →
dsa3 min read
Matrix Exponentiation: Fibonacci and Linear Recurrences
Solve linear recurrences like Fibonacci in O(log n) using matrix exponentiation. Essential for DP optimization on large n.
Read →