- Difference between Dynamic programming and Greedy.
Dynamic programming is kind of enumerating, but greedy not. Therefore, dynamic programming always take higher time complexity but greedy is always “cheaper”. Dynamic programming can always find optimal solution but greedy not.
- Difference between BFS, DFS and Dijkstra’s Algorithm.