UNSW CPMSoc

Term 1 Week 1 - Acing Technical Interviews - (Slides)
Term 1 Week 4 - Hashing in the Real World - (Slides)
Term 1 Week 7 - Introduction to Dynamic Programming - (Slides) - (Questions)
Term 1 Week 9 - Disjoint Set Unions (with Citadel Securities) - (Slides)
Term 2 Week 1 - Advanced Dynamic Programming - (Slides) - (Questions)
Term 2 Week 3 - Tackling Coding Interviews with C++ - (Slides)
Term 2 Week 8 - Applying Graph Theory to Bioinformatics (BINFSoc Collab) - (Slides)
Term 2 Week 9 - COMP2521 Revision Session (CSESoc Collab) - (Slides)

Term 1 Week 3 - Technical Interview Workshop - (Slides)
Term 1 Week 5 - Intro to Competitive Programming - (Slides) - (Questions)
Term 1 Week 7 - When Combinatorics and Flow Networks Intersect - (Slides) - (Recording)
Term 2 Week 4 - Dynamic Programming - (Slides) - (Questions)
Term 2 Week 6 - Misc. Problem Solving - (Slides)
Term 2 Week 8 - Further Dynamic Programming - (Slides) - (Questions)
Term 2 Week 10 - Graph Theory (2521 Revision) - (Questions)
Term 3 Week 4 - Stacks and Queues - (Slides) - (Questions) - (Code)
Term 3 Week 8 - Interactive + Communication problems - (Slides) - (Questions)

Workshop 0 - Intro to CP - (Slides) - (Honeycomb) - (Studex) - (Trading at IMC 1) - (Trading at IMC 2)
Workshop 1 - Progressive Problem Solving - (Slides) - (Gameboy) - (Martian DNA)
Workshop 2 - Lowest Common Ancestor - (Slides) - (LCA implementation)
Workshop 3 - Floyd Warshall - (Slides)
Workshop 4 - Disjoint Set Union Find - (Slides)
Workshop 5 - Topological Sort - (Slides)
Workshop 6 - Euler Tours - (Slides)
Workshop 7 - ICPC - Introduction & Dynamic Programming - (Slides)
Workshop 8 - ICPC - Segment Trees - (Slides)
Workshop 9 - ICPC - Final Preperation - (Slides) - (Problem Statements) - (Solutions)

Number Theory - (Notes/Problems) - (Workshop)
Analytic Number Theory, Series and Generating Functions - (Notes/Problems) - (Workshop)
Problem Solving Session - (Notes/Problems) - (Workshop)
Elementary Algebra - (Notes/Problems) - (Workshop)

VJudge group (for problem sets)

Introduction to Competitive Programming / Prefix Sums - (Slides) - (Code) - (Recording) 05-03-21: Added annotated code for all problems in the slide, along with writeup for all subtasks of Walkscotch. 04-03-21: Changed extension question on last slide, added link to math workshop Facebook event
- Solving your first problem - (Recording)
- Difference arrays (Extension) - (Recording)
- Walkscotch - (Editorial and solution in (Code)) - (Recording)
Additional References - Prefix Sums, Difference Arrays, Kadane's Algorithm (Walkscotch)
Problem Set Editorials - B (see Prefix Sum - Motivation, in (Code)) - C - D
Stacks - (Slides) - (Code) - (Recording)
Binary Search - (Slides)
The Problem Solving Process - (Slides) - (Code) - (Recording)
Graph Theory I - (Slides) - (Code) - (Recording)
Dynamic Programming I - (Slides) - (Recording)
Term 3 Week 1 - (Slides) - (Implementation Problem Sheet) - (Discussion Problem Sheet) - (Recording)
Term 3 Week 2 (Dynamic Programming) - (Slides) - (Code)- (Easy Problem Sheet) - (Hard Problem Sheet) - (Recording)
Term 3 Week 3 (Data Structures) - (Presented Problems) - (Easy Problem Sheet) - (Hard Problem Sheet) - (Recording)
Term 3 Week 4 (Graph Theory) - (Presented Problems) - (Easy Problem Sheet) - (Hard Problem Sheet) - (Recording)
Term 3 Week 5 (Revision) - (Problems - South Pacific Regionals (Division 2) 2020) - (Recording)
Term 3 Week 6 (Divisionals Debrief) - (Problems - South Pacific Divisionals 2021) - (Recording)

Past Workshops