Algorithms Engineering – INF237/spring22

Assignments

• Introduction (Ended)
1. Two-sum
2. Greetings!
3. Tarifa
4. Early Winter
5. Even Up Solitaire
• Graphs 1 (Ended)
1. Through the Grapevine
2. Faulty Robot
3. Hoppers
4. One-Way Roads
• Sliding, searching, and sorting (Ended)
1. Tired Terry
2. Firefly
3. Kayaking Trip
4. Film Critics
• Dynamic programming 1 (Ended)
1. Spiderman's Workout
2. Plane Ticket Pricing
3. Restaurant Orders
4. Bridge Automation
• Graphs 2 (Ended)
1. Island Hopping
2. Bumped!
3. Detour
4. Artwork
• Segment trees (Ended)
1. Points of Snow
2. Mega Inversions
3. Movie Collection
4. Nekameleoni
• Geometry 1 (Ended)
1. Imperfect GPS
2. White Water Rafting
3. Pesky Mosquitoes
4. Cleaning Pipes
• Exponential time algorithms (Ended)
1. Social Advertising
2. Map Colouring
3. Holey N-Queens (Batman)
4. Rubik's Revenge in ... 2D!? 3D?
• Dynamic programming 2 (Ended)
1. The Citrus Intern
2. Pokemon Go Go
3. Allergy Test
4. Mag
• Graphs 3 (Ended)
1. Paintball
2. Piano Lessons
3. Water
4. The Darkness
• Geometry 2 (Ended)
1. Dart Scoring
2. Finding Lines
3. Closest Pair
4. Robert Hood
• Strings (Ended)
1. Bing It On
2. Clock Pictures
3. Auto Completion
4. Repeated Substrings
• Mathematics (Ended)
1. I Hate The Number Nine
2. Semi-prime H-numbers
3. Inverse Factorial
4. Factor-Free Tree

Teachers