https://github.com/lpenz/adventofcode2021
Code for the 2021 puzzles at https://adventofcode.com/2021/
https://github.com/lpenz/adventofcode2021
advent-of-code advent-of-code-2021 rust
Last synced: 2 months ago
JSON representation
Code for the 2021 puzzles at https://adventofcode.com/2021/
- Host: GitHub
- URL: https://github.com/lpenz/adventofcode2021
- Owner: lpenz
- License: mit
- Created: 2021-11-30T19:11:59.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2024-02-18T20:32:25.000Z (about 1 year ago)
- Last Synced: 2025-01-20T15:57:06.226Z (4 months ago)
- Topics: advent-of-code, advent-of-code-2021, rust
- Language: Rust
- Homepage:
- Size: 85.9 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README

[](https://github.com/lpenz/adventofcode2021/actions)
[](https://coveralls.io/github/lpenz/adventofcode2021?branch=main)# adventofcode2021
Code for the 2021 exercises at https://adventofcode.com/2021/
## Noteworthy days (spoiler alert!)
Some interesting things that happened on specific days:
- Day 08: 7-segment digit reconstruction.
- Day 10: delimiter matching.
- Day 12: depth-first search.
- Day 13: origami!
- Day 15: uniform-cost search (Dijkstra); puzzle B code pending - the
grid is too big, we need to support different underlying structs in
[sqrid].
- Day 16: binary parsing using [nom].
- Day 17: discrete parabolic trajectories.
- Day 19: linear transformations using matrices - and an actual list
of all valid linear rotational matrices.
- Day 22: positive and negative area cuboids - reminds me of firewall
rule analysis.
- Day 24: used [rayon] for parallelism and [dashset] for cache to get
a viable brute-force performance.:arrow_left: 2020
2022 :arrow_right:[sqrid]: https://github.com/lpenz/sqrid
[nom]: https://github.com/Geal/nom
[rayon]: https://github.com/rayon-rs/rayon
[dashset]: https://github.com/xacrimon/dashmap