https://github.com/michel-kraemer/adventofcode-rust

My solutions to the Advent of Code (in Rust)
https://github.com/michel-kraemer/adventofcode-rust

advent-of-code advent-of-code-2015 advent-of-code-2015-rust advent-of-code-2016 advent-of-code-2016-rust advent-of-code-2017 advent-of-code-2017-rust advent-of-code-2018 advent-of-code-2018-rust advent-of-code-2023 advent-of-code-2023-rust advent-of-code-2024 advent-of-code-2024-rust

Last synced: 21 days ago
JSON representation

My solutions to the Advent of Code (in Rust)

• Host: GitHub
• URL: https://github.com/michel-kraemer/adventofcode-rust
• Owner: michel-kraemer
• License: mit
• Created: 2023-12-01T19:17:22.000Z (about 1 year ago)
• Default Branch: main
• Last Pushed: 2024-12-15T08:42:06.000Z (25 days ago)
• Last Synced: 2024-12-15T09:29:53.337Z (25 days ago)
• Topics: advent-of-code, advent-of-code-2015, advent-of-code-2015-rust, advent-of-code-2016, advent-of-code-2016-rust, advent-of-code-2017, advent-of-code-2017-rust, advent-of-code-2018, advent-of-code-2018-rust, advent-of-code-2023, advent-of-code-2023-rust, advent-of-code-2024, advent-of-code-2024-rust
• Language: Rust
• Homepage: https://adventofcode.com/
• Size: 288 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Advent of Code

These are my solutions to the annual [Advent of Code](https://adventofcode.com)

challenge.

## Goals

🦀 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](2018/day25/src/main.rs): Combining DBSCAN with a spatial

  index based on Morton indices. Very fast!

* [Day 21 of 2023](2023/day21/src/main.rs): Applying

  [bit operations](2023/day21/src/bitarray.rs) 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](2023/day25/src/main.rs): Using

  [Brandes' algorithm](https://doi.org/10.1080/0022250X.2001.9990249) to

  quickly calculate the betweenness centrality of graph nodes.

## License

The solutions are released under the **MIT license**. See the

[LICENSE](LICENSE) file for more information.