Source: Signals and Noise
Part 1: Given a list of strings, find the most common character in each position.
Part 1: Given a list of strings, find the most common character in each position.
Part 1: Generate a series of hashes: MD5(salt + index). For each hash starting with five zeros, write down the sixth character.
Part 1: A room is described as a name, a sector ID, and a checksum as follows:
aaaaa-bbb-z-y-x-123[abxyz] name: aaaaa-bbb-z-y-x sector ID: 123 checksum: abxyzA room is valid if the checksum contains the five most common letters if the name (ties broken alphabetically).
Part 1: Given a list of sides, determine how many form valid triangles. (Hint: triangle inequality)
Part 1: Take a keypad with the following layout:
1 2 3 4 5 6 7 8 9Using the instructions UDLR for Up, Down, Left, and Right respectively, move a ‘finger’ around over the keypad. At the end of each line of instructions, output the current digit.
Part 1: Starting at
0,0and given a string ofL#/R#to turn left / right and move#squares, where do you end up?
Part 1: Take the relation:
Arrange the values according to Cantor’s diagonal argument. Find the value at a specific cell.
Part 1: Split a list of integers into three groups of equal sum. Find the grouping such that the smallest group has the least items, breaking ties by the smallest product for that group.
Part 1: Create a simple virtual machine with two registers (a and b, non-negative integers) and six instructions:
hlf (a|b) - divide the given register by half, round downtpl (a|b) - triple the given registerinc (a|b) - add 1 to the given registerjmp [+-]\d+ - jump forward/backwards by the given number of instructionsjie (a|b), [+-]\d+ - if the given register is even, jumpjio (a|b), [+-]\d+ - if the given register equals one, jumpPart 1: Simulate an RPG mage battle; finding the winning solution using the least mana. See the original writeup for more details.