Curriculum
Please note that number of lessons are not the same as the number of topics. This is because some topics are discussed over multiple lessons. Also sometimes there are mixed review of multiple topics.
Part 1
Bit Manipulation
Builtin Data Structures
Disjoint Set Data Structure
Binary Indexed Tree
Introduction to Graph Data Structure
Minimum Spanning Tree (MST)
Shortest Path: BFS, Dijkstra,Bellman-Ford, Floyd-Warshall
Directed Acyclic Graphs (DAG)
Tree Algorithms
Part 2
Dynamic Programming
Longest Increasing Subsequence (LIS)
Longest Common Subsequence (LCS)
Edit Distance Algorithms
Subset Sum, 1-0 Knapsack
Dynamic Programming on Trees
Advanced BFS
Range Queries
Queries on a Tree
Computational Geometry
Advanced Sweep Line
Combinatorics, Numeric Algorithms