Advent-of-Code
Advent-of-Code | AdventOfCode2021 | |
---|---|---|
4 | 12 | |
5 | 1 | |
- | - | |
6.9 | 2.6 | |
5 months ago | over 2 years ago | |
Python | Perl | |
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.
Advent-of-Code
-
[2022 day 14, part 2] I optimized my code to run 6000 times faster
For example, this was my solution for day 01 2021
-
-🎄- 2021 Day 19 Solutions -🎄-
To find the match, I created a Jupyter Notebook to visualize the points with the simple example. After staring 30 minutes into 3d charts, I finally figured out that whenever I find a rotation that matches, then there must be a vector v, which occures a lot of times when comparing each p1 from scanner 1 with each point p2 from scanner 2, because we only have to shift it by this vector to align with the scanner 0 (see jupyter notebook first plot).
-
-🎄- 2021 Day 13 Solutions -🎄-
Python 3, <1ms runtime
-
-🎄- 2021 Day 6 Solutions -🎄-
Python3
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
What are some alternatives?
adventofcode2020 - Python solutions to https://adventofcode.com/2020
Elixir - Elixir is a dynamic, functional language for building scalable and maintainable applications
adventofcode - :christmas_tree: Advent of Code (2015-2023) in C#
Advent-of-code - My solutions of adventofcode.com
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
adventofcode - Advent of Code challenge solutions
adventofcode - Solutions for problems from AdventOfCode.com
adventofcode
adventofcode - Advent of code solutions
advent-of-code-2021 - My solutions to advent of code 2021 in deno/TS
advent-of-code - Advent of Code Solutions