My Advent of Code solutions for 2020-2024
By switching the lists I was using as stacks out with a deque, I appear to have achieved a teeeensy speed improvement. List `append()` and `pop()` methods have at most a O(n) time complexity, where deques have a O(1) time complexity. https://docs.python.org/3/library/collections.html#collections.deque Signed-off-by: AKU <tom@tdpain.net> |
||
---|---|---|
challenges | ||
lib | ||
runtime | ||
template | ||
.gitignore | ||
generate-benchmark-graph.py | ||
go.mod | ||
go.sum | ||
LICENSE | ||
README.md |
Advent of Code 🎄
Solutions to Advent of Code challenges.
Puzzle inputs and descriptions are not included in this repository. You'll have to get these yourself from the AoC website. Here's why.