aoc2021
Our great sponsors
AdventOfCode2021 | aoc2021 | |
---|---|---|
12 | 23 | |
1 | 9 | |
- | - | |
2.6 | 0.0 | |
over 2 years ago | over 1 year ago | |
Perl | Go | |
- | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
AdventOfCode2021
-
-🎄- 2021 Day 18 Solutions -🎄-
Full program on GitHub.
-
-🎄- 2021 Day 15 Solutions -🎄-
Full program including code to deal with heaps, on GitHub.
-
[2021 Day 11 (Part 2)] What input takes the most steps to synchronize?
Program I used for the above results
-
-🎄- 2021 Day 8 Solutions -🎄-
See my solution on GitHub.
-
Day 6 Proof of Correctness
Note also that you can solve this without a complexity dependency on n. Most solutions I have seen, including mine run in time O(tD), where t is the maximum value of a timer, and D the number of generation, requiring O(t) memory. (This is assuming we can do the required arithmetic operations in constant time, and each numbers require a fixed around of memory storage; if the number of fish gets huge, throw in an additional log n in the complexities, where n is the number of fish on the final day).
-
-🎄- 2021 Day 6 Solutions -🎄-
Based on my matrix exponentiation solution, here is a closed-form solution:
-
How do I read today's input ? Part 1
In my Perl solution of today (I assume, you mean 2021, Day 4), I read stuff in paragraph mode ($/ = "") which makes Perl split input on 2 or more newlines.
-
2021 Day #4 (Part 1) [Native Python ONLY] - Conceptual Guidance?
I considered doing that for my (Perl) solution, but given the cards are small, that seemed overkill.
-
-🎄- 2021 Day 4 Solutions -🎄-
Python implementation on GitHub
aoc2021
-
-🎄- 2021 Day 18 Solutions -🎄-
Go, 19196/19041
-
-🎄- 2021 Day 17 Solutions -🎄-
Go, 1093/563
-
-🎄- 2021 Day 16 Solutions -🎄-
Go, 2758/2421
-
-🎄- 2021 Day 15 Solutions -🎄-
Go, 631/732
-
-🎄- 2021 Day 14 Solutions -🎄-
Go 1449/3191
-
-🎄- 2021 Day 13 Solutions -🎄-
Go, 2400/1659
-
-🎄- 2021 Day 12 Solutions -🎄-
Go, 3030/3121
-
-🎄- 2021 Day 11 Solutions -🎄-
Oh also lost about 2-3 minutes on part A initially trying to use my challenge.TileMap so I didn't have to worry about computing x/y but converting to/from rune all the time was taking way too long and was hard to follow. Man, I can't wait until generics!
-
-🎄- 2021 Day 10 Solutions -🎄-
Go, 2815/3818
-
-🎄- 2021 Day 9 Solutions -🎄-
Go, 1730/3574
What are some alternatives?
Elixir - Elixir is a dynamic, functional language for building scalable and maintainable applications
AoC - my personal repo for the advent of code yearly challenge
Advent-of-code - My solutions of adventofcode.com
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
Advent_of_Code_2021_Solutions_Java - Personal AoC/2021 Solutions in Java
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
AdventOfCode2021 - Advent of code 2021
adventofcode - Advent of Code challenge solutions
AdventOfCode2021.jl - Advent of Code 2021 in Julia
adventofcode - Solutions for problems from AdventOfCode.com
adventofcode - Advent of code solutions