Dynamic Programming
In Dynamic programming we break up a problem into a series of overlapping subproblems and build up solutions to larger and larger subproblems.
Examples
- Fibonacci number series
- Knapsack problem
- Tower of Hanoi
- All pair shortest path by Floyd Warshall
- Shortest path by Dijkstra
- Project scheduling