August 21, 2023 | Introduction to Competitive Programming |
August 25, 2023 | Standard Template Library |
August 28, 2023 | Complete Search |
August 30, 2023 | Divide and Conquer |
September 1, 2023 | Greedy Algorithms |
September 6, 2023 | Introduction to Dynamic Programming |
September 8, 2023 | Graph Representations |
September 11, 2023 | Minimum Spanning Trees |
September 13, 2023 | Graph Traversals 1 |
September 15, 2023 | Single Source Shortest Path |
September 20, 2023 | All Points Shortest Path |
September 25, 2023 | Graph Traversals 2 |
September 27, 2023 | Prime Numbers |
October 2, 2023 | GCD |
October 4, 2023 | Inclusion/Exclusion |
October 9, 2023 | DP: LCS and LIS |
October 11, 2023 | DP: Palindromes |
October 13, 2023 | DP: Knapsack |
October 16, 2023 | No Class (Senate Meeting) |
October 18, 2023 | Combinatorics |
October 20, 2023 | Bit Manipulations |
October 23, 2023 | Fast Exponentiation |
October 25, 2023 | Catalan Numbers |
October 27, 2023 | DP: Knapsack 2 |
October 30, 2023 | LCA and Binary Lifting |
November 1, 2023 | TSP |
November 3, 2023 | Edit Distance |
November 6, 2023 | KMP String Matching |
November 8, 2023 | Rabin-Karp Algorithm |
November 10, 2023 | Sqrt Decomposition |
November 13, 2023 | No Class (Senate Meeting) |
November 15, 2023 | Segment Trees |
November 17, 2023 | Fall Break Preview |
November 27, 2023 | Lazy Segment Trees |
November 29, 2023 | Points, Lines, and Vectors |
December 1, 2023 | Shapes |
December 4, 2023 | Convex Hull |
December 6, 2023 | Line Sweep |