2023-2024 Season

Day 2s at Lunch in Room 160

• Meeting 1: Introduction to Time Complexity (September 18th)
• Meeting 2: Brute Force (September 22th)

2022-2023 Season

• Meeting 1: Introduction to Time Complexity (October 6th)
• Meeting 2: Brute Force (October 14th)
• Meeting 3: Binary Search (October 20th)
• Meeting 4: Welcome Contest Take-Up (October 26th)
• Meeting 5: Basic Data Structures (November 1st)
• Meeting 6: Introduction to Graph Theory (November 7th)
• Meeting 7: Graph Traversals (November 11th)
• Meeting 8: Shortest Path on Unweighted Graphs (November 17th)
• Meeting 9: Shortest Path on Weighted Graphs (December 6th)
• Meeting 10: Prefix Sum Arrays (December 12th)
• Meeting 11: Holiday Contest Take-Up (January 11th)
• Meeting 12: Introduction to Dynamic Programming (January 16th)
• Meeting 13: Debugging and Constant Optimization (January 27th)
• Meeting 14: CCC Preparation (February 3rd)
• Meeting 15: Segment Trees (February 9th)
• Meeting 16: Hashing (March 29th)
• Meeting 17: Hashing Part 2: Electric Boogaloo (April 13th)
• Meeting 18: DSU (April 18th)
• Meeting 19: Kruskal (May 23rd)
• Meeting 20: Probabilistic Solutions (May 30th)
• Meeting 21: Advanced Applications of Data Structures (June 5th)

2021-2022 Season

• Meeting 1: Time Complexity (October 6th)
• Meeting 2: Brute Force (October 13th)
• Meeting 3: Prefix Sum Arrays (October 20th)
• Meeting 4: Intro to Primes & Sieve (October 27th)
• Meeting 5: Basic Data Structures (November 3rd)
• Meeting 6: Practice Problems (November 10th)
• Meeting 7: Binary Search (November 17th)
• Meeting 8: Introduction to Graph Theory (November 24th)
• Meeting 9: Graph Traversal (December 1st)
• Meeting 10: CCC Practice: Graph Traversal (December 8th)
• Meeting 11: Shortest Path: Dijkstra's and SPFA (December 15th)
• Meeting 12: Disjoint Set Union Data Structure + Kruskal's (January 12th)
• Meeting 13: Introduction to Dynamic Programming (January 19th)
• Meeting 14: CCC Practice (2) (January 26th)
• Meeting 15: Line Sweep (February 2nd)
• Meeting 16: CCC Recap (1) (March 2nd)
• Meeting 17: Ad Hoc (March 9th)
• Meeting 18: Bitwise Operators (March 23rd)
• Meeting 19: Constant Optimization and Debugging Tips (March 30th)
• Meeting 20: More Dynamic Programming (April 13th)
• Meeting 21: Fenwick Trees/Binary Indexed Trees (April 20th)
• Meeting 22: Segment Trees (April 27th)
• Meeting 23: SQRT Decomposition (May 4th)
• Meeting 24: (String) Hashing (May 11th)
• Meeting 25: Rolling Hash (May 18th)
• Meeting 26: Binary Search Trees (June 1st)

2020-2021 Season

• Meeting 0: Information Session (October 8th)
• Meeting 1: Code Analysis (October 15th)
• Meeting 2: Welcome Contest Analysis (October 22nd)
• Meeting 3: Problem-Solving Techniques [pt. 1] (October 29th)
• Meeting 4: Problem-Solving Techniques [pt. 2] (November 5th)
• Meeting 5: Applications of Binary Search (November 12th)
• Meeting 6: Applications of Precomputation (November 19th)
• Meeting 7: Fall Contest Analysis (November 26th)
• Meeting 8: Intro to Graph Theory [pt. 1] (December 3rd)
• Meeting 9: Intro to Graph Theory [pt. 2] (December 10th)
• Meeting 10: Extension of BFS (Dijkstra's Algorithm) [December 17th]
• Meeting 11: Intro to recursion [January 7th]
• Meeting 12: Advanced recursion concepts [January 14th]
• Meeting 13: Dynamic Programming [January 21st]
• Meeting 14: Union Find and Minimum Spanning Trees [January 28th]
• Meeting 15: CCC Practice [February 4th]
• Meeting 16: Winter Contest Analysis [February 11th]
• Meeting 17: CCC 2021 Senior Contest Discussion [March 4th]
• Meeting 18: Sliding Window Technique [March 11th]
• Meeting 19: String Hashing [March 18th]
• Meeting 20: More String Hashing [March 25th]
• Meeting 21: (m ore) Dynamic Programming [April 1st]
• Meeting 22: (more) Binary Search [April 8th]
• Meeting 23: ECOO Practice Contest Discussion [April 22nd]
• Meeting 24: Cheese [April 29th]
• Meeting 25: Bitwise Operators [May 6th]
• Meeting 26: Fenwick Trees [May 13th]
• Meeting 27: Random Kahoots! [May 20th]

2019-2020 Season

• Meeting 0: Information Session
• Meeting 1: Getting Started
• Meeting 2: Time Complexity (pt 1)
• Meeting 3: Time Complexity (pt 2)
• Meeting 4: Introduction to Graph Theory
• Meeting 5: Graph Traversal
• Meeting 6: Solving Graph Problems
• Meeting 7: Shortest Path on Weighted Graphs
• Meeting 8: Minimum Spanning Trees
• Meeting 9: Brute Force on a Graph
• Meeting 10: Introduction to Dynamic Programming (Recursion)
• Meeting 11: Introduction to Dynamic Programming (1-Dimentsional States)
• Meeting 12: CCC Preparation (pt 1)
• Meeting 13: CCC Preparation (pt 2)
• Meeting 14: CCC 2020 Problem Take-up