Part 1: Generate noise using a modified dragon curve:
- Start with data
a- Create a copy of the data
b, reverse and invert it (0 <-> 1)- Create the string
a0b
Repeat until you have enough data, truncate at the end if needed.
From this string calculate a checksum as follows:
- xor each pair of bits, concatenate the results
- If the resulting string has an even length, repeat; if it’s odd, stop
Calculate the checksum of a given initial state expanded to
272bits.
Part 1: Given a series of openings one second apart, each with
npositions that advance one position per second, what is the first time you can start the simulation so that you pass each in position0.
Part 1: Calculate a series of MD5 hashes (the same as Day 5). A hash is considered valid if it contains a triple (three characters in a row) and somewhere in the next 1000 hashes there is a quintuple of that same character.
What index produces the 64th key?
Part 1: Generate a procedurally generated maze using the following equation:
- x^2 + 3x + 2xy + y + y^2 + c
xandyare the coordinates of a point andcis a constant.
Count the number of bits for each point. Even is open spaces, odd is walls.
What is the shortest route from
(0, 0)to(31, 39)?
Part 1: Create a virtual machine that has four registers (
a,b,c, andd) and can process the following instructions:
cpy x y- copiesxintoy(xcan be an integer or a register)inc x- increases registerxby onedec x- decreases registerxby onejnz x y- jumps overyinstructions ifxis not zero (xcan be an integer or a register)
What is the final value in register
a?
Part 1: Input will be a list of the following form:
- The first floor contains a hydrogen-compatible microchip and a lithium-compatible microchip.
- The second floor contains a hydrogen generator.
- The third floor contains a lithium generator.
- The fourth floor contains nothing relevant.
You have an elevator that can move exactly 1 or 2 items. You can only leave a microchip on a floor with a non-matching generator if a matching generator is also present.
Move all items to the top (4th) floor.
Part 1: Create a sorting machine using input of the following form:
value X goes to bot A- an input to botAbot A gives low to (bot|output) B and high to (bot|output) C- a sorter that takes two inputs and sends them to the specified bots or output channels
Find the bot that compares the values
17and61.
Part 1: A file is compressed by including compression markers of the form
(#x#)...where the first number tells how many characters to copy and the second is how many times to copy them. SoA(2x3)HA!becomesAHAHAHA!.
Part 1: Implement a 50x6 pixel screen with the following commands:
rect AxBturn on a rectangle of pixels in the top left cornerrotate row y=A by Brotates rowAright byBpixelsrotate column x=A by Brotates columnAdown byBpixels
After a given sequence of commands, how many pixels are on?
Part 1: The input is a list of strings, potentially containing sequences in square brackets. Find all strings that have an ABBA sequence (two characters followed by the same two in reverse order) outside of any square brackets, but no ABBA sequences in square brackets.