aoc22
Solutions for Advent of Code 2022 in Rust (by morlinbrot)
aoc22 | advent-of-code-julia | |
---|---|---|
3 | 12 | |
0 | 8 | |
- | - | |
10.0 | 0.0 | |
over 1 year ago | over 1 year ago | |
Rust | Julia | |
- | - |
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.
aoc22
Posts with mentions or reviews of aoc22.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-11.
-
-🎄- 2022 Day 12 Solutions -🎄-
Here's just the interesting bit, full solution here. ``` fn dijkstra(unvisited: &mut Unvisited, start: Pos, end: Pos) -> Option { fn update_neighbor(unvisited: &mut Unvisited, cur: &Node, pos: Pos) { if let Some(neigh) = unvisited.get_mut(&(pos)) { // Steepness check. if neigh.val <= cur.val + 1 { neigh.dist = neigh.dist.min(cur.dist + 1.); } } }
-
-🎄- 2022 Day 9 Solutions -🎄-
Tiny little thing you could do to make this even more succinct: Use `abs()` on `dx` and `dy`, that's what I did!
-
-🎄- 2022 Day 5 Solutions -🎄-
HashMap for parsing stacks and Vec> for operations. Full code here.
advent-of-code-julia
Posts with mentions or reviews of advent-of-code-julia.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-19.
-
-🎄- 2022 Day 20 Solutions -🎄-
Julia using linked list
-
-🎄- 2022 Day 16 Solutions -🎄-
I used your solution and implement it in Julia. It takes 58.756 ms for part 1 and 60.697 ms for part 2.
-
-🎄- 2022 Day 14 Solutions -🎄-
Julia simple solution simulating the sand. Too much code duplication but nothing better comes to my mind.
-
-🎄- 2022 Day 12 Solutions -🎄-
Julia
-
-🎄- 2022 Day 11 Solutions -🎄-
Julia using ResumableFunctions for parsing, DataStructures for queue and OrderedCollections for Dict.
-
-🎄- 2022 Day 10 Solutions -🎄-
Julia. For part 1 there is no need to save the value for each cycle but this is necessary for part 2.
-
-🎄- 2022 Day 9 Solutions -🎄-
Julia without black magic.
-
-🎄- 2022 Day 6 Solutions -🎄-
Julia using the same solution for both problem.
-
-🎄- 2022 Day 5 Solutions -🎄-
Julia using DataStructures Stack
-
-🎄- 2022 Day 2 Solutions -🎄-
Julia using modular arithmetic
What are some alternatives?
When comparing aoc22 and advent-of-code-julia you can also consider the following projects:
Advent-of-Code
AoC2022
aoc - Advent of Code
aoc_2022
advent_of_code_2022 - Advent of code 2022
AdventOfCode
aoc2022 - advent of code
advent-of-code-2022 - My solutions for the https://adventofcode.com puzzles (2022) 🎄🎅
aoc22 - advent of code 2022 | typescript
advent-of-code-2022 - Solutions to AoC 2022 in zig
advent-of-code - C++ solutions of advent of code
aoc2022
aoc22 vs Advent-of-Code
advent-of-code-julia vs AoC2022
aoc22 vs aoc
advent-of-code-julia vs aoc_2022
aoc22 vs advent_of_code_2022
advent-of-code-julia vs AdventOfCode
advent-of-code-julia vs aoc2022
advent-of-code-julia vs advent-of-code-2022
advent-of-code-julia vs aoc22
advent-of-code-julia vs advent-of-code-2022
advent-of-code-julia vs advent-of-code
advent-of-code-julia vs aoc2022