AdventOfCode.Template VS advent-of-code

Earlier this year, I wrote about scripting and automation in VSCode using typescript as part of an ongoing project to reduce time consuming repetitive actions in my professional life. So this seemed like a perfect opportunity to do something similar at a more targeted domain space. Additionally, I'd seen a few examples of AOC runners floating around (pre-built libraries and templates that come with hope to help streamline the mechanics of participating in AOC). There are a few solutions in the .NET ecosystem, but they're all in C#!

You can use it 'as-is', or start from this template to better understand how it works 😊

I didn't really care about executing times, but using C# I ran into array size limits which made me switch to my approach. I'm using eduherminio/AdventOfCode solver framework which returns 0.5ms as a result, which I'm pretty sure is not correct tough. Adding a stopwatch to the executing method returns 3ms. Hope that helps.

Great, me too! Check out this c# template on github for an easy way to manage the problems

[LANGUAGE: Python 3] 153/75 Raw solution

One could instead count |F7 (that's what I do in my refactored solution), but counting all the bends would miscount the vertical segments (FJ would end up canceling itself out).

That sounds like what I suggested here, actually. I don't have anything in my library with quite the right API yet, but I already have most of what you describe coded out. (It looks like I whipped it up for 2017 Day 13.)

[LANGUAGE: Python 3] Embarrassing/Embarrassing Ugly raw solution code

[LANGUAGE: Python 3] 66/101 Raw solution code

Python 3 21/12

It doesn't, but you can use a separate list, wrapper classes, and deque.index to find where the values live. I may be biased but I think that my solution (ultimately using deque) isn't as complex as a custom linked list.

Part 2 assumes you did part 1 properly. I did not! I'm pretty sure that the intended solution is to do a sort of reverse search (have a target number of geodes and work backwards to see if that's possible to achieve) but I was just not having success coming up with a way to do that. It's probably going to be blindingly obvious once I figure it out, but that might be an exercise for tomorrow.

Python 3 9/15!!!

Python 3 44/45