Aug 29, 2023 · 4 min read · Day 12 of the 2017 Advent of Code was a fun one. In it, we're given a series of 'programs' that are connected to one another via 'pipes,' and we have to find out, no matter how roundabout the path, how many programs can connect to program 0. Now I'm ...
Join discussionAug 27, 2023 · 3 min read · Iterators. They're confusing. They're (sorta) pointers. They're mostly pointers. But they're not quite normal pointers. They're magic in C++ and manipulating data with the standard library requires some clever usage of them. AoC 2017 Day 6 requires u...
Join discussionAug 26, 2023 · 2 min read · Advent of Code 2017 Day 5 is a fun little diversion. Basically, we have the world's simplest assembly code: each line has a line number, and a jump command. Every time a jump is taken, its value increases by one. We have to solve the problem of figur...
Join discussionAug 26, 2023 · 4 min read · Turtles all the way down. I won't be sharing all the code I used to solve day 3, but there's a 'new' form of memory that writes in a spiral, using every node, and we have to work with this. There's a mathematical way to solve this If you notice, the ...
Join discussionAug 16, 2023 · 3 min read · Nested FOR loops... gross or practical? You decide! (Spoiler alert they're both) https://adventofcode.com/2017/day/2 For part 1 of this challenge, I wrote a simple min/max checker algo, you've probably run into this in CS classes or any number of tut...
Join discussionAug 16, 2023 · 3 min read · /H2 I spent the summer taking an intense course in IBM HLASM, letting my C++/Javascript fall by the wayside. That's what I was staring at/working with for the past few months. I absolutely loved working in assembler, but it's time to get back to mor...
Join discussion