Competitive Programming I – CS211-CP1/2022-Spring

Assignments

• Topic 0: Intro (Ended)
1. Estimating the Area of a Circle
2. Join Strings
3. The Rectangles Are Surrounding Us!
4. Image Decoding
• Topic 1: Useful data structures (Ended)
1. Working at the Restaurant
2. Baloni
3. Dyslectionary
• Topic 2: Complete search (Ended)
1. Paintings
2. Fooling Around
3. Musical Chairs
4. Dobra
• Topic 3: Greedy (Ended)
1. Air Conditioned Minions
2. Virus Replication
3. Distributing Ballot Boxes
• Topic 4: Divide and conquer (Ended)
1. Firefly
2. Out of Sorts
3. Room Painting
• Topic 5: Bisection/BSTA, meet in the middle (Ended)
1. Financial Planning
2. Free Weights
3. Traveling Monk
• Topic 6: Intro to Dynamic Programming (Ended)
1. Train Sorting
2. Restaurant Orders
3. Exact Change
• Topic 7: DP Applications + 2 pointer technique (Ended)
1. Pivot
2. Counting Subsequences (Hard)
3. The Sound of Silence
• Topic 8: Graphs 1: review, DFS/BFS, CC/SCC (Ended)
1. Running MoM
2. Reachable Roads
3. Cantina of Babel
• Topic 9: Graphs 2: floodfill and topological sort intro (Ended)
1. 10 Kinds of People
2. Brexit
3. Pick up sticks
• Topic 10: Graphs 3: Shortest Paths (Ended)
1. Ocean Currents
2. All Pairs Shortest Path
3. Horror List
• Bonus Contest (Fixed) (Ended)
1. Good Morning!
2. Birds on a Wire
3. Suspension Bridges
4. Alphabet
5. Counting Stars
6. Build Dependencies
7. Texas Summers

Teachers