Advent of Code: Day 12

2015-12-12

Source

Part 1: Sum all integer values in a JSON object.

Advent of Code: Day 11

2015-12-11

Source

Part 1: Find the next string in Lexicographical_order that matches these rules:

Must contain three neighboring, ascending letters (ghi)
Must not contain any of the letters i, o, or l
Must contain two distinct pairs of letters

Advent of Code: Day 10

2015-12-10

Source

Part 1: Repeat a Look-and-say sequence 40 times. Return the length.

Advent of Code: Day 9

2015-12-09

Source

Part 1: Given a list of distances between cities of the form London to Dublin = 464, calculate the shortest route that visits each city exactly once.

Advent of Code: Day 8

2015-12-08

Source

Part 1: Given an escaped string of the form "\xa8br\x8bjr\"", convert it to the escaped form: br js. Calculate the total difference of lengths between the former (16) and the latter (5).

Advent of Code: Day 7

2015-12-07

Source

Part 1: Given a list of definitions of the form 123 -> x, NOT e -> f, and x AND y -> z, with possible operations NOT, AND, OR, LSHIFT, and RSHIFT, find the value of a. Assume all values are 16-bit integers.

Advent of Code: Day 6

2015-12-06

Source

Part 1: Given a 1000 by 1000 grid of lights and a list of instructions of the form (turn on|turn off|toggle) 5,10 through 15,20, determine how many lights are on.

Advent of Code: Day 5

2015-12-05

Source

Part 1: A ’nice’ string contains at least three vowels, one double letter (such as xx), and none of the strings ab, cd, pq, or xy. Count nice strings.

Advent of Code: Day 4

2015-12-04

Source

Part 1: Mine Adventcoins. Basically, find the lowest integer such that the string {prefix}{integer} has an md5 hash with at least 5 leading zeros. ¹²³

Advent of Code: Day 3

2015-12-03

Source

Part 1: Given a string of <>^v characters which mean move west, east, north, or south respectively and starting at the origin, how many unique positions do you pass through?