Competitive Programming I – CS211-CP1/2024-Fall

Assignments

• LATE SUBMISSIONS ONLY (Remaining: 24 days 21:40:49)
1. Simon Says
2. Join Strings
3. Thanos the Hero
4. Image Decoding
5. Victory Through Synergy
6. Adding Words
7. Working at the Restaurant
8. Dance Recital
9. Lektira
10. Connect the Dots
11. Opening Ceremony
12. Fair Division
13. Crazy Driver
14. Annoyed Coworkers
15. Room Painting
16. Batmanacci
17. Ultra-QuickSort
18. Out of Sorts
19. Free Weights
20. Traveling Monk
21. Kayaking Trip
22. Big Boxes
23. Nikola
24. Permutation Descent Counts
25. Plane Ticket Pricing
26. Restaurant Orders
27. Firefly
28. Committee Assignment
29. The Sound of Silence
30. Counting Subsequences (Hard)
31. Alphabet
32. Wi-Fi
33. Logland
34. Horror Film Night
35. Increasing Subsequence
36. Running MoM
37. Cantina of Babel
38. Dominos
39. Proving Equivalences
40. Triangle Drama
41. Daydreaming Stockbroker
42. Kutevi
43. Farey Sequence Length
44. Through the Grapevine
45. Rock Climbing
46. Brexit Negotiations
47. Flood-It
48. All Pairs Shortest Path
49. Virtual Friends
50. Firetrucks Are Red
51. Landline Telephone Network
52. Island Buses
53. A Favourable Ending
54. Invasion
• Topic 0: Introduction and Misc (Ended)
1. Simon Says
2. Thanos the Hero
3. Join Strings
4. Image Decoding
• Topic 1: Useful Data Structures and Complete Search (Ended)
1. Adding Words
2. Working at the Restaurant
3. Dance Recital
4. Lektira
• Topic 2: Greedy (Ended)
1. Opening Ceremony
2. Fair Division
3. Crazy Driver
4. Annoyed Coworkers
• Topic 3: Divide and Conquer, Meet in the Middle (Ended)
1. Room Painting
2. Batmanacci
3. Ultra-QuickSort
4. Out of Sorts
• Topic 4: Bisection/BSTA, Meet in the Middle (Ended)
1. Free Weights
2. Traveling Monk
3. Kayaking Trip
4. Big Boxes
• Topic 5: Intro to Dynamic Programming (Ended)
1. Restaurant Orders
2. Plane Ticket Pricing
3. Permutation Descent Counts
4. Nikola
• Topic 6: DP Applications and 2 Pointer Technique (Ended)
1. Firefly
2. Committee Assignment
3. The Sound of Silence
4. Counting Subsequences (Hard)
• Topic 7: DP2 (Ended)
1. Alphabet
2. Wi-Fi
3. Logland
4. Horror Film Night
5. Increasing Subsequence
• Topic 8: Graphs 1: Review, DFS/BFS, CC/SCC (Ended)
1. Running MoM
2. Cantina of Babel
3. Dominos
4. Proving Equivalences
• Topic 9: Graphs 2: Floodfill and Topological Sort Intro (Ended)
1. Through the Grapevine
2. Rock Climbing
3. Brexit Negotiations
4. Flood-It
• Topic 10: Graphs 3: Shortest Paths and CP2 Introduction (Ended)
1. All Pairs Shortest Path
2. Virtual Friends
3. Firetrucks Are Red
4. Landline Telephone Network
• Topic 11: Random Problem Solving (Ended)
1. Island Buses
2. A Favourable Ending
3. Victory Through Synergy
4. Invasion
• Bonus Contest -- Credit only if in person (Remaining: 21:40:49)

Teachers