rusty-aoc VS advent-of-code

My rusty-aoc repo & today' solution here.

Got my 100th 🦀 rusty ⭐🌟 star 🌠✨ today for 🎄 Xmas 🎅 (my code) 🎉. I had a rough time at first with converting SNAFU back to decimal so I first did things by hand (and a website to get numbers in base 5).

My rust code (43mn for part 1 ; +1h33 for part 2) with a topological sort thanks to the crate petgraph.

Rust, I used Linear Programming too, after I did not found reasonable pruning methods on the search tree. My code is there. I never did LP before, only heard of it, so yesterday was a long day!

Mine in rust too is there: https://github.com/Philippe-Cholet/rusty-aoc/blob/main/aoc2022/day09/src/lib.rs

I use itertools::Itertools which have a nice all_unique (internally, it creates a hashset and insert elements one by one unless it already contains it) but if I really wanted efficiency, I would manage my own hashset because this method is called for each character.

Today, I rewrote it multiple times before I liked a version enough to commit it and push it to my repo. I probably won't rewrite it that many times in a few days once the problem is more "interesting".

[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