These are my solutions to the annual Advent of Code challenge.
π¦ Implement everything in Rust
π Find generalized solutions that work with every input
βοΈβπ₯ Avoid 3rd party dependencies (if possible and reasonable)
πββοΈββ‘οΈ Try to optimize performance (to the best of my knowledge)
π€ Find clever solutions to complex problems that others might not have found. Some highlights I'm particularly proud of:
- Day 25 of 2018: Combining DBSCAN with a spatial index based on Morton indices. Very fast!
- Day 21 of 2023: Applying bit operations to simulate the cellular automaton, which allowed me to implement a fast and generalized solution that should work on any input.
- Day 25 of 2023: Using Brandes' algorithm to quickly calculate the betweenness centrality of graph nodes.
The solutions are released under the MIT license. See the LICENSE file for more information.