Abdul Bari's Algorithm Masterclass
Your roadmap for mastering Algorithms — 84 free videos, one clear path
84
free videos
~50 hrs
of content
1.3M
subscribers
Main Topic
Free Video
Paid Course
Start Here
Introduction to Algorithms
Priori vs Posteriori Analysis
Characteristics of Algorithm
How to Analyze Algorithm
Frequency Count Method
Time Complexity #1
Time Complexity #2
Time Complexity #3
Algorithm Analysis &
Time Complexity
Classes of Functions
Compare Class of Functions
Asymptotic Notations #1
Asymptotic Notations #2
Properties of Notations
Comparison of Functions #1
Comparison of Functions #2
Best, Worst & Average Case
Core Techniques
D&C Introduction
Binary Search (Iterative)
Binary Search (Recursive)
Heap Sort
Divide and Conquer
Merge Sort
QuickSort
Strassen's Matrix Multiply
Greedy Introduction
Knapsack Problem
Job Sequencing
Greedy Method
Huffman Coding
Prim's & Kruskal's
Dijkstra's Shortest Path
Principle of Optimality
Floyd-Warshall
Matrix Chain Multiply
Bellman Ford
Dynamic Programming
0/1 Knapsack
Traveling Salesman
Longest Common Subseq.
Advanced
BFS & DFS
Graph Traversals
Articulation Points
Backtracking Intro
N Queens Problem
Sum of Subsets
Backtracking
Graph Coloring
Hamiltonian Cycle
B&B Introduction
Job Sequencing
Branch and Bound
0/1 Knapsack
Traveling Salesman
Specialized
NP-Hard & NP-Complete
Complexity Theory
Clique Decision Problem
KMP Algorithm
String Matching
Rabin-Karp
AVL Trees
Trees & Databases
B Trees & B+ Trees
Go Deeper
Mastering DSA in C/C++ — 53hrs
Paid Courses
Deep Dive in C++ — 30hrs
Core Java — 61hrs