rusty-aoc VS adventofcode

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

The only code differs for two parts is as follows - https://github.com/bhosale-ajay/adventofcode/blob/master/2023/ts/D07.test.ts - under 80 lines.

Easy day TypeScript, P1 - Brute Force, P2 - Formula

[LANGUAGE: TypeScript] Github - Under 40 lines, all parts running under 8ms.

[LANGUAGE: TypeScript] TypeScript - Running under 30ms (both parts)

F# This year I solved puzzles using TypeScript as well as F# - Day 18, 19, and 22 TBD

F# - After looking at some Python solution calculated the position of blizzard for nth time instead of maintaining the grid, which makes it easier with F#.