Dynamic Programming
Single Parameter Dependencies
Sequential Decision Making
Naive Recursive Solution
Memoized Solution
Tabulated Solution
Space-Optimized Solution
Basic Stair Climbing
Variable Step Sizes
Cost-Based Variations
Linear Array Robbing
Circular Array Robbing
Binary Tree Robbing
Kadane's Algorithm
DP Interpretation
Minimum Coins Problem
Number of Ways Problem
Coin Combinations vs Permutations
O(n²) DP Solution
O(n log n) Binary Search Solution
Patience Sorting Interpretation
Previous
4. Problem-Solving Framework
Go to top
Next
6. Grid-Based Dynamic Programming