WeekDateLecture
1January 21, 2026Course Introduction
January 23, 2026IO
2January 26, 2026Disjoint Sets
January 28, 2026Divide and Conquer
January 30, 2026Complete Search
3February 2, 2026Coding Session
February 4, 2026Single Source Shortest Path
February 6, 2026Floyd-Warshall
4February 9, 2026Coding Session
February 11, 2026Trees
February 13, 2026Strongly Connected Components
5February 16, 2026Special Topic
February 18, 2026Kruskal’s Algorithm
February 20, 2026Bit Manipulation
6February 23, 2026Special Topic
February 25, 2026Sqrt Decomposition
February 27, 2026Segment Trees
7March 2, 2026Special Topic
March 4, 2026Lazy Segment Trees
March 6, 2026Fenwick Trees
8March 9, 2026Special Topic
March 11, 2026Greedy Algorithms
March 13, 2026Dynamic Programming
9March 16, 2026Spring Break
March 18, 2026Spring Break
March 20, 2026Spring Break
9March 23, 2026Coding Session
March 25, 2026Longest Common Sequence
March 27, 2026DP Palindromes
10March 30, 2026Coding Session
April 1, 2026Coding Session
April 3, 2026DP Edit Distance
11April 6, 2026Coding Session
April 8, 2026DP Knapsack
April 10, 2026Tree DP
12April 13, 2026Coding Session
April 15, 2026DP KMP
April 17, 2026Rabin Karp
13April 20, 2026Coding Session
April 22, 2026Primes and GCD
April 24, 2026Fermat’s Little Theorem and Euler’s Totient Function
14April 27, 2026Coding Session
April 29, 2026Combinatorics
May 1, 2026Points, Lines, Vectors, Shapes
15May 4, 2026Coding Session
May 6, 2026Geometry: Convex Hull

38 items under this folder.