aoc22
Solutions for Advent of Code 2022 in Rust (by morlinbrot)
aoc2022
My solutions for Advent of Code 2022 (by tumdum)
aoc22 | aoc2022 | |
---|---|---|
3 | 10 | |
0 | 2 | |
- | - | |
10.0 | 5.2 | |
over 1 year ago | 5 months ago | |
Rust | Rust | |
- | GNU Affero General Public License v3.0 |
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.
aoc2022
Posts with mentions or reviews of aoc2022.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-14.
-
[2022 Day 15] today is the day
Mine is taking ~115ms on my 9 years old i5-3340M :D
-
-๐- 2022 Day 15 Solutions -๐-
Rust - just collect in range intervals per line. Sum of lengths is basically p1 and p2 is just a loop over rows looking for one with more than one interval. Total runtime for both parts is ~650ms. twitch, youtube.
-
-๐- 2022 Day 13 Solutions -๐-
Rust. Obs crashed and I didn't notice it until the end so here are partial recordings: twitch, youtube.
-
-๐- 2022 Day 12 Solutions -๐-
It's 'cheating' only in the sens that I wanted to measure real i/o so it would be cheating in my case. And funnily enough I had a bug there that I just fixed :D
-
[2022 Day11 (Part2)] [python] brute force
My real solution runs in 19ms and is here. The one with BigUint is on a branch here.
-
-๐- 2022 Day 11 Solutions -๐-
Simple rust solution that solves both parts with same function. Recordings twitch and youtube.
-
-๐- 2022 Day 9 Solutions -๐-
Rust / Recording
-
-๐- 2022 Day 8 Solutions -๐-
Rust with runtime ~450ยตs
What are some alternatives?
When comparing aoc22 and aoc2022 you can also consider the following projects:
Advent-of-Code
adventofcode
aoc - Advent of Code
aoc-2022 - Solutions to the Advent of Code 2022, just for fun ๐
advent_of_code_2022 - Advent of code 2022
adventofcode - Python solutions to Advent of Code puzzles, https://adventofcode.com/
advent-2022
aoc-2022 - Code for Advent of Code 2022
aoc2022
aocaml - AoC in OCaml, for maximum typing pleasure
NetworkX - Network Analysis in Python
rust-mos - Empowering everyone to build reliable and efficient software.