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.
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: abxyz
Part 1: Given a list of sides, determine how many form valid triangles. (Hint: triangle inequality)
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.