- Binary Search
- Divide and Conquer
- Dynamic programming
- From O(1) to O(n!) time complexity
- Greedy algorithm vs. dynamic programming
- Introduction to Greedy Algorithms
- Linear and binary search
- Recursion
- Selection, bubble, insert, merge and quick sort and their complexity
- Time and space complexity
- Dijkstra’s algorithm for finding minimum distance path
- DFS - Depth First Search
- Two pointers method