Dynamic Programming
Master DP by visualizing how overlapping subproblems are solved and stored to avoid redundant calculations.
📜 Execution Log
Set N and click Start to see DP in action.
🧠 DP Strategy
Memoization: Recursive approach that stores results in a table (usually Hash/Array) to avoid re-calculating the same input.
💡 Complexity
Naive Recursion: O(2ⁿ)
With DP: O(n)