Competitive Programming I – CS211-CP1/2022-Fall

Assignments

• Topic 0: Introduction and Misc (Ended)
1. Simon Says
2. Thanos the Hero
3. Join Strings
4. Reseto
• Topic 1: Useful Data Structures and Complete Search (Ended)
1. Flag Quiz
2. Peg Solitaire
3. Tautology
• Topic 2: Greedy (Ended)
1. Postal Delivery
2. Crazy Driver
3. Annoyed Coworkers
• Topic 3: Divide and Conquer (Ended)
1. Firefly
2. Out of Sorts
3. Synchronizing Lists
• Topic 4: Bisection/BSTA (Ended)
1. Small Schedule
2. Suspension Bridges
3. H-Index
• Topic 5: Intro to Dynamic Programming (Ended)
1. Alphabet
2. Exact Change
3. Spiderman's Workout
• Topic 6: DP Applications and 2 Pointer Technique (Ended)
1. The Sound of Silence
2. Counting Subsequences (Hard)
3. Grade Curving
4. Pivot
• Topic 7: DP2 (Ended)
1. Keyboards in Concert
2. Svada
3. Horror Film Night
• Topic 8: Graphs 1: Review, DFS/BFS, CC/SCC (Ended)
1. Reversing Roads
2. Balls and Needles
3. Dominos
• Topic 9: Graphs 2: Floodfill and Topological Sort Intro (Ended)
1. Coast Length
2. Collapse
3. Managing Packaging
• Topic 10: Graphs 3: Shortest Paths (Ended)
1. Single source shortest path, time table
2. Button Bashing
3. All Pairs Shortest Path
• Bonus Contest! (Ended)
1. Brexit Negotiations
2. Triangle Drama
3. Texas Summers
4. DA-Sort
5. Financial Planning
6. Fountain
7. Divisible Subsequences

Teachers