Let’s do this (Advent of Code) thing again!
I’m sticking with Rust again. I still use Python when I need to hammer out something quickly, but if I want to do something correctly (and especially if I want it to be fast), you can’t beat Rust.
Let’s see how it goes!
Full solutions will once again be posted to GitHub (including previous years and possibly some I haven’t written up yet): jpverkamp/advent-of-code
A quick follow up to Advent of Code 2023: testing and timing.
It’s been bothering me a bit that I haven’t had a generic way to run tests and timing on every problem as I’m going.
So let’s fix it!
Full solution for today (spoilers!)
Given an undirected graph, find 3 edges that split the graph into two connected components. Return the product of the component’s sizes.
Full solution for today (spoilers!)
Given a set of 3D vectors (origin + velocity), count how many times the vectors would intersect. Ignore the Z-coordinate for this part; the collisions do not have to be at the same time.
Full solution for today (spoilers!)
Find the longest non-overlapping path through a maze with walls (
#) and one way paths (^v<>).
Full solution for today (spoilers!)
Given a series of 3D blocks, allow them to fall until the simulation is stable. Any cube of a block is sufficient to support another block, ignore rotations etc.
How many blocks are not the sole supporter for any other block?
Full solution for today (spoilers!)
Given a(n infinite) grid of walls
#, count how many points can be reached by exactly 64 steps from a starting point.
Full solution for today (spoilers!)
Simulate a virtual circuit with
highandlowpulses and four kinds of chips:
- Broadcast - Re-transmit all pulses
- Flip-flops - On a
lowpulse, toggle internal state; if it was on, sendhigh; otherwise sendlow- Conjunction - Remember input from each attached module; if all inputs were
high, send alow, otherwise sendhigh- Output - Do nothing; just receive pulses
Count the product of
lowandhighpulses sent after 1000lowinputs tobroadcaster.
Full solution for today (spoilers!)
You are given a series of parts with 4 ratings as such:
{x=787,m=2655,a=1222,s=2876}In addition, you are given a series of rules describing a graph as such:
px{a<2006:qkq,m>2090:A,rfg}In this example, if you are at the node
px, ifa < 2006, move toqkq. Otherwise, ifm > 2090move toA. If no other case matches, the last defaults torfg.
AandRare special cases for accept and reject.Calculate the sum of sum of all four ratings for all nodes that end at
Accept.
Full solution for today (spoilers!)
Given a sequence of direction + distance that draws a polygon, calculate the area.