Searching Algorithms
Np Completeness Complexity Classes
Dynamic Programming
All Pairs Shortest Path - Floyd Warshall
Matrix Chain Multiplication - Dynamic Programming
Sorting Techniques
Subset Sum
Multi Stage Graph
Travelling Salesman Problem
Time and Space Analysis
0/1 Knapsack
Greedy Algorithms
Bellman - Ford Algorithm
Dijkstra Algorithm
Longest Common Subsequence
Get 800+hrs of full syllabus lectures with subscription