| Pronouns | He/Him |
| Occupation | Software Engineer |
Today's was rough in terms of performance and bugs.
I had a system that built an entire map and could print and calculate the test data fine (obviously), but melted on the real data. I did ultimately take that approach and narrow it down to ONLY the target row and it allowed me to solve Part 1.
Part 2 was a whole new process of sliced scan ranges.
https://github.com/ajohns6/AdventOfCode2022/blob/master/AdventOfCode2022/Day15.cs
I never did get a solution for Day #13 working, but I got today's done in about an hour. Shows how strengths and weaknesses can make the difference.
https://github.com/ajohns6/AdventOfCode2022/blob/master/AdventOfCode2022/Day14.cs
I did have a small issue with Part 1 where I didn't actually READ the instructions and was considering height both up AND down, so my input wasn't actually solvable based on that up/down logic. After hand checking the path, I realized that it was impossible, so I must have misunderstood something...
...yep, you can slide your ass down any cliff you want! 🤣
Last year had some pathfinding stuff that at the time just really broke me as I'd never needed that sort of programming. I don't know that I actually ever solved those without actively copying large portions of code.
Happy to say that this year I was able to code my own pathfinding after just reading the concept of pathfinding algorithms.
https://github.com/ajohns6/AdventOfCode2022/blob/master/AdventOfCode2022/Day12.cs
I got the answer, but it's not technically entirely correct in terms of my solution. I seem to be having an off-by-one error of some kind. The letters were discernable, but they seem to be slightly shifted. I will look into solving that specific issue before uploading to GitHub and including that link here.
Not particularly proud, but it works now.
https://github.com/ajohns6/AdventOfCode2022/blob/master/AdventOfCode2022/Day10.cs
Today's Part 2 was just additional implementation of my solution for Part 1 since I'd made a Knot class which Head and Tail classes inherited from. I had a move method that just accepted another Knot as the input, so I just had to run that an additional 8 times on a List of Knots and it was pretty much plug and play.
Part 1 I screwed up because I forgot a comma.
https://github.com/ajohns6/AdventOfCode2022/blob/master/AdventOfCode2022/Day09.cs
WTF...I'm wearing shorts in December!?
World's gonna fuckin' melt in a couple decades...
Today's was actually incredibly simple for part 1, but I was afraid part 2 was going to force me to almost entirely rewrite what I had done for part 1. Thankfully, I came across Tuples and was able to add part 2's functionality pretty seamlessly with my highly compartmentalized solution.
Added an extra feature to return the location of the scenic tree.
https://github.com/ajohns6/AdventOfCode2022/blob/master/AdventOfCode2022/Day08.cs
Today is actually the first one I kind of struggled with. Had some issues because I initially wanted to avoid recursion for the creation of the directory structure, but that only worked in the shallow test directory, so I ended up with recursion anyhow.
Also had a problem where I was not adding identical folder names in different subfolders.
https://github.com/ajohns6/AdventOfCode2022/blob/master/AdventOfCode2022/Day07.cs
Another simple day. I caught a break with part 2 since I'd implemented a dynamic method for checking the 4-length segments, so I could just use it again for the 14-length segments unchanged.
There are some unnecessary checks in here regarding string length and making sure that a message marker was found since we know the data's good, but I did it anyway.
https://github.com/ajohns6/AdventOfCode2022/blob/master/AdventOfCode2022/Day06.cs
