AoC 2021 Day 22: Cubinator

2021-12-22 in Programming

Source: Reactor Reboot

Part 1: Given a series of 3D cubes that either turn ON all or turn OFF all points in their region, calculate how many points in the region (-50..50,-50..50,-50..50) are ON at the end.

AoC 2021 Day 20: Enhancinator

2021-12-20 in Programming

Source: Trench Map

Part 1: Given a 9->1 cellular automota update function (take the pixel and 8 surrounding pixels as a 9-bit index into the function) and a binary image, apply the function twice and count the number of ’lit’ pixels. Assume that the canvas is infinite.

AoC 2021 Day 19: Point Matchinator

2021-12-19 in Programming

Source: Snailfish

Part 1: You will be given a series of Scanners, each of which will tell you the location (from their point of view) of a series of Beacons. Each Scanner may be flipped or rotated in increments of 90 degrees in any direction. Determine where each Scanner and Beacon is by overlaying the maps (with at least pairwise 12 matches).

AoC 2021 Day 18: Pairs of Pairs

2021-12-18 in Programming

Source: Snailfish

Part 1: Given the following definition of Snailfish numbers, add a series of Snailfish numbers and return the magnitude of the result.

AoC 2021 Day 16: Depacketinator

2021-12-16 in Programming

Source: Packet Decoder

Part 1: Given a recursive binary packet definition (see below), parse the given packet. Return the sum of each packet’s `version`.

AoC 2021 Day 12: Submarine Spider

2021-12-12 in Programming

Source: Passage Pathing

Part 1: Given a list of edges in a bi-directional graph, count the number of paths from `start` to `end` such that nodes named with lowercase letters are visited once, and nodes with uppercase letters can be visited any number of times.

AoC 2021 Day 11: Octopus Flashinator

2021-12-11 in Programming

Source: Dumbo Octopus

Part 1: Simulate a grid of numbers such that on each tick: advance all numbers by 1, any number that increases over 9 will ‘flash’ and add 1 to all neighbors (recursively, but each cell can only flash once) and then reset to 0. Count the number of flashes in the first 100 ticks.

AoC 2021 Day 10: Chunkinator

2021-12-10 in Programming

Source: Syntax Scoring

Part 1: Given a sequence of () [] {}, and <> with nesting allowed. Find the first syntax error (where the wrong closing symbol is used). Scoring 3, 57, 1197, and 25137 respectively for each error, calculate the total error score.

AoC 2021 Day 9: Local Minimum Deminifier

2021-12-09 in Programming

Source: Smoke Basin

Part 1: Given a heightmap, find all local minimums. Return the sum of (minimum height + 1) for each local minimum.

AoC 2017 Day 12: Gridlock

2017-12-12 in Programming

Source: Digital Plumber

Part 1: A network of nodes is defined by a list of lines formatted as such:
2 <-> 0, 3, 4
In this case, node 2 is connected to 0, 3, and 4 and vice versa.
How many nodes are in the group that contains the node 0?

JP's Blog

Programming, Topic: Data Structures

Recent posts (Page 3 of 6)

AoC 2021 Day 22: Cubinator

Source: Reactor Reboot

Part 1: Given a series of 3D cubes that either turn ON all or turn OFF all points in their region, calculate how many points in the region (-50..50,-50..50,-50..50) are ON at the end.

AoC 2021 Day 20: Enhancinator

Source: Trench Map

Part 1: Given a 9->1 cellular automota update function (take the pixel and 8 surrounding pixels as a 9-bit index into the function) and a binary image, apply the function twice and count the number of ’lit’ pixels. Assume that the canvas is infinite.

AoC 2021 Day 19: Point Matchinator

Source: Snailfish

AoC 2021 Day 18: Pairs of Pairs

Source: Snailfish

Part 1: Given the following definition of Snailfish numbers, add a series of Snailfish numbers and return the magnitude of the result.

AoC 2021 Day 16: Depacketinator

Source: Packet Decoder

Part 1: Given a recursive binary packet definition (see below), parse the given packet. Return the sum of each packet’s `version`.

AoC 2021 Day 12: Submarine Spider

Source: Passage Pathing

Part 1: Given a list of edges in a bi-directional graph, count the number of paths from `start` to `end` such that nodes named with lowercase letters are visited once, and nodes with uppercase letters can be visited any number of times.

AoC 2021 Day 11: Octopus Flashinator

Source: Dumbo Octopus

Part 1: Simulate a grid of numbers such that on each tick: advance all numbers by 1, any number that increases over 9 will ‘flash’ and add 1 to all neighbors (recursively, but each cell can only flash once) and then reset to 0. Count the number of flashes in the first 100 ticks.

AoC 2021 Day 10: Chunkinator

Source: Syntax Scoring

Part 1: Given a sequence of () [] {}, and <> with nesting allowed. Find the first syntax error (where the wrong closing symbol is used). Scoring 3, 57, 1197, and 25137 respectively for each error, calculate the total error score.

AoC 2021 Day 9: Local Minimum Deminifier

Source: Smoke Basin

Part 1: Given a heightmap, find all local minimums. Return the sum of (minimum height + 1) for each local minimum.

AoC 2017 Day 12: Gridlock

Source: Digital Plumber

All posts

Programming, Topic: Data Structures

Recent posts (Page 3 of 6)

Source: Reactor Reboot

Part 1: Given a series of 3D cubes that either turn ON all or turn OFF all points in their region, calculate how many points in the region (-50..50,-50..50,-50..50) are ON at the end.

Source: Trench Map

Part 1: Given a 9->1 cellular automota update function (take the pixel and 8 surrounding pixels as a 9-bit index into the function) and a binary image, apply the function twice and count the number of ’lit’ pixels. Assume that the canvas is infinite.

Source: Snailfish

Source: Snailfish

Part 1: Given the following definition of Snailfish numbers, add a series of Snailfish numbers and return the magnitude of the result.

Source: Packet Decoder

Part 1: Given a recursive binary packet definition (see below), parse the given packet. Return the sum of each packet’s version.

Source: Passage Pathing

Part 1: Given a list of edges in a bi-directional graph, count the number of paths from start to end such that nodes named with lowercase letters are visited once, and nodes with uppercase letters can be visited any number of times.

Source: Dumbo Octopus

Part 1: Simulate a grid of numbers such that on each tick: advance all numbers by 1, any number that increases over 9 will ‘flash’ and add 1 to all neighbors (recursively, but each cell can only flash once) and then reset to 0. Count the number of flashes in the first 100 ticks.

Source: Syntax Scoring

Part 1: Given a sequence of () [] {}, and <> with nesting allowed. Find the first syntax error (where the wrong closing symbol is used). Scoring 3, 57, 1197, and 25137 respectively for each error, calculate the total error score.

Source: Smoke Basin

Part 1: Given a heightmap, find all local minimums. Return the sum of (minimum height + 1) for each local minimum.

Source: Digital Plumber

All posts

Part 1: Given a recursive binary packet definition (see below), parse the given packet. Return the sum of each packet’s `version`.

Part 1: Given a list of edges in a bi-directional graph, count the number of paths from `start` to `end` such that nodes named with lowercase letters are visited once, and nodes with uppercase letters can be visited any number of times.