Source: Monkey Map
Part 1
Given a map and a series of instructions formatted as distance + turn (
LorR), find the final position. Any time you would walk off the edge of the map, wrap to the opposite edge.
Given a map and a series of instructions formatted as distance + turn (
LorR), find the final position. Any time you would walk off the edge of the map, wrap to the opposite edge.
Given a series of equations of either the form
dbpl: 5orcczh: sllz + lgvd, determine what the value of the node labeledrootis.
Given a list of numbers
mixthem by moving each number forward/backward in the list based on it’s value. For example, in4, -2, 5, 6, 7, 8, 9moving the-2will result in4, 5, 6, 7, 8, -2, 9. Each number should be moved exactly once in the original order they appeared in the list.
Given a series of given a series of
blueprints, each of which gives instructions for how to build a singlerobotfrom a collection ofmaterialsthat in turn will produce one of a givenmaterialper turn, determine the best order of builds to maximize yourgeode(the most valuablematerial) production for eachblueprintgiven a time limit of24 minutes.
Given a list of 1x1x1 cubes, determine the total surface area of the cubes.
Simulate Tetris on a 7 wide board with a given (infinitely repeated) series of left and right inputs to be applied on each frame before dropping the block and a given (infinitely repeated) set of blocks. Once 2022 blocks have been dropped, what is the total height of the placed blocks?
Given a graph of nodes, some of which have a
pressure(per tick output value) and an agent that can move through the graph and activate specific nodes (so that they output their per tick value every future tick), what is the maximum total output possible in 30 steps?
There are a collections of
Sensors andBeacons. As input, you are given theBeaconclosest to eachSensor(using Manhattan Distance). If aBeaconis not closest to any sensor, it will not appear in this list. Calculate how many points in the given row (y=2000000) cannot contain aBeacon.
Given a series of walls as input, run a falling sand simulation until any new sand falls of the map. Count how many grains of sand we end up with.
Given pairs of
Signals (where aSignalis a nested list ;example:[[1],[2,3,4]]), count how many pairs are ‘in order’.
One Signal is less than the other if: