Dynamic Programming
Those who cannot remember the past are condemned to
repeat it ...
1|Page
,Climbing Stairs :
Recursion :
Memoization : (Top Down)
2|Page
,Tabulation : Bottom up
Space Optimization :
Shortcut :
1) Try to represent the problem in terms of index.
2) Do all possible stuffs on that according to the problem statement.
3) Sum of all stuff count all ways.
4) Minimum/Maximum (of all stuff) find minimum/maximum
5) All possible ways means Recursion
Frog Jump :
Recursion :
3|Page
, Memoization :
4|Page
Those who cannot remember the past are condemned to
repeat it ...
1|Page
,Climbing Stairs :
Recursion :
Memoization : (Top Down)
2|Page
,Tabulation : Bottom up
Space Optimization :
Shortcut :
1) Try to represent the problem in terms of index.
2) Do all possible stuffs on that according to the problem statement.
3) Sum of all stuff count all ways.
4) Minimum/Maximum (of all stuff) find minimum/maximum
5) All possible ways means Recursion
Frog Jump :
Recursion :
3|Page
, Memoization :
4|Page
