Solutions to codingame challenges as a way to learn and practice new programming languages. To view the full description of the problem and the input/output format please refer to https://codingame.com
Compete in multiplayer games against bots developed by other players.
Fight for the control of the world (represented as an hexagonal map) prioritize the control of patinum producing zones to produce more troops.
Claim ownership of cells in a grid. Move onto a neutral cell or surround a collection of neutral cells to get points. Go back in time a defined number of turns to confuse your opponent or try a different strategy.
Destroy zombies quickly to earn points and make sure to keep the humans alive to get the highest score that you can manage.
The goal is to outlive your opponents, the rules of the game are similar to Bomberman played in a 13 units wide and 11 units high grid.
Shoot enemies before they collect all the incriminating data. The closer you are to an enemy, the more damage you do but don't get too close or you'll get killed.
Your objective is to produce a maximum amount of cyborgs in order to destroy those of your opponent. To this end, you must take ownership of factories that will enable you to increase the size of your cyborg army.
In this game, you are in command of pirate ships and your goal is to avoid running out of rum. If all the rum dries up on a given ship, your crew will go mad and you will lose the ship. Barrels of rum are placed randomly across the map. You must control the movements of your ship in order to collect the barrels of rum before your opponent does.
Produce medicines and maximize your score by transporting items across a medical complex.
The game is played on a square grid of a given size. Both players start with two units placed randomly on the grid. Both players take it in turns to perform one action with one of their units. To score points, players must get a unit to climb up cells and reach a height of 3 levels.
Single player bot programming with predefined tasks (Ordered by difficulty)
A basic problem to allow Thor to reach the coordinates of the light of power in a 2D field.
Find the highest mountain out of a list of mountains.
Your program must analyze records of temperatures to find the closest to zero.
Land the spaceship on the platform. (Only vertically movement involved)
In this problem you have to find the two numbers that are closest to each other among a list of numbers. The list might be really large.
The goal of the problem is to simulate an old airport terminal display: your program must display a line of text in ASCII art.
A string is an encoded form of digital values and you have to transform those values into a “unary” string such as 0 00 000 0...
The goal of this exercise is to make you find the closest point to given geographic coordinates (latitude and longitude).
Back to basics with this puzzle where you have to associate file names with their MIME type
The goal is to find, when they exist, the horizontal and vertical neighbors nodes from a two dimensional array. The difficulty is in the number of nested loops that this puzzle can make you write. Do not get lost!
The goal of this puzzle is to guess the coordinate of a bomb (line and column of a 2 dimensional array). You will have to make a guess at each step of the puzzle and adjust it from given feedbacks.
This problem plays out on a graph where a “virus” moves from node to node, in search of an exit. There are several exits and you have to cut access to these exits by finding the best link to cut each turn.
Guide the clones towards the exit of the maze, stop when you’re going away from the exit, continue if you are going the right way. You are given the position and direction of your clones.
- cpp implementation
- cpp code golf
- rust implementation
- rust code golf
- Javascript implementation
- Javascript code golf
Given a list of numbers, you have to find not the minimal value but the maximal drop. Be careful that a drop can span on several values!
Your program must determine the winner of a game of War, a simple two-player card game.
The goal of this puzzle is to make you work with a mathematical series: The Conway Sequence. Discover how to generate terms of a series interatively.
The goal of this problem is to make you work with 2D coordinates in a big environnement. You will have to manage and extrapolate the speed of a spaceship and make it land on a flat ground at correct speed.