Algorithms
84-video comprehensive algorithms course by Abdul Bari
Abdul Bari's comprehensive Algorithms playlist covering algorithm analysis, asymptotic notations, divide & conquer, greedy methods, dynamic programming (0/1 Knapsack, LCS, matrix chain, TSP), graph algorithms (BFS, DFS, shortest paths, spanning trees), backtracking, branch & bound, NP-completeness, string matching, B-Trees & B+ Trees, and advanced topics. 84 videos with 35M+ views. One of the most popular free algorithm courses on YouTube.
Computer ScienceFreebeginner50 hours
Submitted by @atlasRoadmap (6 steps)
1
Introduction & Analysis
6 hours#What is an Algorithm#Priori vs Posteriori Analysis#Characteristics of Algorithm#Writing & Analyzing Algorithms#Frequency Count Method#Time Complexity#Asymptotic Notations
2
Divide & Conquer
6 hours#Binary Search#Merge Sort#Quick Sort#Finding Max & Min#Strassen's Matrix Multiplication
3
Greedy Methods
8 hours#General Method#Job Sequencing with Deadlines#Knapsack Problem#Minimum Cost Spanning Trees#Prim's Algorithm#Kruskal's Algorithm#Single Source Shortest Paths#Optimal Storage on Tapes#Optimal Merge Pattern
4
Dynamic Programming
10 hours#General Method#Multistage Graphs#Floyd-Warshall Algorithm#Optimal Binary Search Trees#0/1 Knapsack#Traveling Salesman Problem#Matrix Chain Multiplication#Longest Common Subsequence
5
Graph Traversals & Backtracking
8 hours#BFS & DFS#Connected Components#Spanning Trees#Articulation Points#Biconnected Components#Graph Coloring#N-Queens Problem#Hamiltonian Cycles#Sum of Subsets
6
Advanced Topics
6 hours#Branch & Bound#LC Branch & Bound#NP-Hard & NP-Complete Problems#B Trees#B+ Trees#String Matching