My solutions to Advent of Code 2025 in Rust
cargo run --relase --bin dayAA-B
AA is the day number, B is the part number
day04-3- Optimized by using a bitvec and queuing updatesday04-4- Optimzed with multithreading, however there is little performance gain due to overhead of threading. I also tried cloning the rows below and above but there was no performance gain. I suspect this would be faster on a larger gridday09-3- This finds the largest rectangle with 3 red lights in the corners by finding the normal of an edge and extending it. It doesn't work because the largest rectangle with opposite red lights doesn't always include an edge. The actual solution was simpler and I reused part of this code to make itday10-3- I used a brute force approach (with some optimiztions such as rearranging variables in terms of others). It can do the first few problems but is way too slow to do the more complex ones in a reasonable time. I replaced it with a guassian elimination algorithm and reused some of this code for it