advent-of-code-2022
Advent of Code 2022 solutions in Ruby (https://adventofcode.com/2022) (by damyvv)
adventofcode
My attempt at the Advent of Code (by korylprince)
advent-of-code-2022 | adventofcode | |
---|---|---|
1 | 3 | |
2 | 1 | |
- | - | |
10.0 | 0.0 | |
over 1 year ago | 5 months ago | |
Ruby | Python | |
- | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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
Posts with mentions or reviews of advent-of-code-2022.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-15.
-
-🎄- 2022 Day 16 Solutions -🎄-
The code is horrible, but performance is great. The basic idea of the algorithm is to consider all the valves we can move to. We compute how long it will take to move to a valve, and we also precompute how much pressure will be released in total by this valve using the remaining time. Then, if there are paths that have an equal distance, we only have to consider the path that has the highest potential pressure release. This drastically reduces the iterations needed, hence the low runtime. Also, the distances are not precomputed, but they are cached. This is more efficient, since we don't need all paths (for example we can skip all paths that have 0 flow rate, as we will never move to them, only pass them).
adventofcode
Posts with mentions or reviews of adventofcode.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-15.
-
-🎄- 2022 Day 16 Solutions -🎄-
Go
-
-🎄- 2021 Day 19 Solutions -🎄-
Python 3
-
[2021 Day 14 (Part 2)] Further optimization?
I solved part 2 by using 2 maps: one to track pair counts, and one to track element counts.
What are some alternatives?
When comparing advent-of-code-2022 and adventofcode you can also consider the following projects:
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
adventofcode2022
adventofcode - Solutions for problems from AdventOfCode.com
aoc2022
Advent-of-Code - A repository holding all of my solutions to Advent of Code problems
personal_code - random code that I have lying around
advent-of-code
aoc2021 - My solutions for the 2021 Advent of Code
advent-of-code-2022 - Solutions to AoC 2022 in zig
adventofcode - my solutions to advent of code
AdventOfCode2020 - Solutions to all 25 AoC 2020 problems in Rust :christmas_tree:
Advent-Of-Code-2022 - Kotlin repository for tracking progress in the Advent of Code challenges.
advent-of-code-2022 vs adventofcode
adventofcode vs adventofcode2022
advent-of-code-2022 vs adventofcode
adventofcode vs aoc2022
advent-of-code-2022 vs Advent-of-Code
adventofcode vs personal_code
adventofcode vs advent-of-code
adventofcode vs aoc2021
adventofcode vs advent-of-code-2022
adventofcode vs adventofcode
adventofcode vs AdventOfCode2020
adventofcode vs Advent-Of-Code-2022