__________________________________________________
- Recursion and Backtracking
- Combinatorial Problems
- Searchingn, Sorting and Greedy Algorithms
- Graph Theory, Traversal and Shortest Paths
- Introduction to Dynamic Programming
- Graphs Topologica Sorting, MST
- Graphs Bellman-Ford, Longest Path in (DAG)
- Graphs Strongly Connected Components, Max Flow
- Dynamic Programming Advanced
- Amortization and Problem Classification (P, NP, NP-completeness, Reductions)