Easy Puzzles (11/11)

---

Easy puzzles are perfect if you are new to programming, or learning how to use a new language, as they involve all the basics. You will have to master conditional (if then else) and control flow (for, while) statements, to handle numerical variables, arrays, strings. You will also probably need to use basic algorithms such as linear search and sorts.

• Onboarding - C, Java, Python3: input/output operations, basic conditional statements.
• Power of Thor - C, Java, Python3: same.
• Skynet, the Chasm - C, Java, Python3: same.
• Mars Lander, level 1 - C, Java, Python3: same + control flow statements.
• The Descent - C, Java, Python3: same + linear search.
• Temperatures - C, Java, Python3: same + more advanced string manipulation + dealing with large dataset.
• Chuck Norris - C, Java, Python3: same.
• ASCII Art - C, Java, Python3: a lot of string manipulation.
• MIME type - C, Java, Python3: using a dictionary.
• Defibrillators - C, Java, Python3: more advanced string manipulation, linear search.
• Horse-racing Duals - C, Java, Python3, Bash: sort, linear search.

Medium Puzzles (17/17)

---

More advanced algorithms, graph theory.

• Skynet, the Virus - Java, Python3: graph, shortest path, breadth first search.
• APU, Init Phase - C, Python3: graph traversal.
• Teads Sponsored Challenge - Java: trees (radius, diameter), breadth first search.
• Mars Lander, level 2 - C: complex but easy technically.
• Winamax Sponsored Challenge - Python3: easy, control flow statements.
• Heat Detector - C: binary search.
• The Paranoid Android - C: complex but easy technically.
• Indiana, level 1 - Python: switch statement.
• Stock Exchange Losses - C: linear search.
• Network Cabling - C: easy, maths.
• Conway Sequence - C: string manipulation.
• Telephone Numbers - C: Radix tree.
• Dwarfs standing on the shoulders of giants - C: Graph, dictionary.
• Bender, a depressed robot - C: nothing new, a lot of switch statements.
• Scrabble - C: easy, string manipulation and linear search.
• The Gift - C: sort, recursive algorithm.
• Mayan Calculation - C: a lot of string manipulation.

Hard Puzzles (9/16)

---

Even more complex and advanced algorithms.

• CGX Formatter - Java: OOP (inheritance / polymorphism).
• The Labyrinth - Java: graph, shortest path, breadth first search.
• Skynet, the bridge - Java: backtracking in a game state tree.
• TAN Network - Java: pathfinding with Dijkstra.
• Surface - Java: flooding algorithm.
• Super Computer - Python: Earliest Deadline First scheduling.
• Genome Sequencing - Python: string manipulation, slicing, bruteforce.
• Bender, the money machine - Java: Longest path search in a weighted directed acyclic graph.
• Bender, algorithmic complexity - Python: data fitting, possibly least square fitting.

Very hard Puzzles (2/7)

---

These puzzles are supposed to be even harder, but that's debatable.

The resistance - Python: memoization, Patricia trees.

Shadows of the Knight 2 - Python: 2D binary search.