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".

for my solution, I used a bitset as an auxillary data structure. The trick is that since chracters are all lower case there's only 26 of them. This means if you use a u32 where each bit is a chracter, you can just OR the slice together and count the number of bits after ORing. https://github.com/Isawan/advent-of-code/blob/master/2022/src/bin/day6-fast.rs