advent_of_code
AoC
advent_of_code | AoC | |
---|---|---|
4 | 87 | |
1 | 18 | |
- | - | |
8.4 | 8.1 | |
4 months ago | 5 days ago | |
Rust | Python | |
MIT License | GNU General Public License v3.0 or later |
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][Friendly Reminder] Don't commit your input files to Git
Caution: the method I used is not recommended. Use at your own risk, know what you're doing, and have plenty of backups, etc. That said, here are my notes.
-
-🎄- 2022 Day 9 Solutions -🎄-
Once I figured out how to elegantly move the tail using signum() in part 2 it became so much cleaner. Full code is on GitHub, but here's the core of it:
- -🎄- 2022 Day 6 Solutions -🎄-
-
-🎄- 2021 Day 6 Solutions -🎄-
Group the fish by their timer, which can be anything from 0 to 8. The neat part is the rotate_left to decrease the timers of each group. Fish with timer 0 will automatically end up at timer 8, and so the only thing left to do is adding another copy with timer 6. Core function: rust fn multiply(timers: Vec, generations: usize) -> usize { // Index equals timer value, so index 0 contains the count of fish with timer 0 let mut counts_by_timer = vec![0usize; 9]; timers.into_iter().for_each(|f| { counts_by_timer[f] += 1; }); for _ in 0..generations { // A left rotation represents the timer (=index) decreasing by 1. // The fish with timer 0 will not only produce new fish with timer 8, // but also reset their timer to 6 let count_of_fish_with_timer_0 = counts_by_timer[0]; counts_by_timer.rotate_left(1); counts_by_timer[6] += count_of_fish_with_timer_0; // == counts_by_timer[8] } counts_by_timer.into_iter().sum() } Full code at Github
AoC
-
-❄️- 2023 Day 11 Solutions -❄️-
20ms both parts https://github.com/Fadi88/AoC/blob/master/2023/day11/code.py
- -❄️- 2023 Day 9 Solutions -❄️-
- -❄️- 2023 Day 8 Solutions -❄️-
- -❄️- 2023 Day 7 Solutions -❄️-
-
-❄️- 2023 Day 6 Solutions -❄️-
Same Algo as my python code from earlier, now just using math not search space reduction also blazing fast in micro seconds https://github.com/Fadi88/AoC/tree/master/2023/day06
- -❄️- 2023 Day 5 Solutions -❄️-
- [2022-day16] python port to rust performance question
- -🎄- 2022 Day 25 Solutions -🎄-
- -🎄- 2022 Day 24 Solutions -🎄-
- -🎄- 2022 Day 23 Solutions -🎄-
What are some alternatives?
adventofcode - adventofcode.com solutions
advent-of-code - My solutions for Advent of Code
adventofcode - Advent of Code 2022 as part of getting back into Python https://adventofcode.com/
adventofcode - Solutions for problems from AdventOfCode.com
aoc2020 - Advent of Code 2020 - my answers
AdventOfCode-Java - adventOfCode(Language.JAVA);
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
aoc2021 - Advent of Code 2021 Solutions
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
Advent-of-code-2021-golang - Advent of code 2021 Go solutions
aoc2021 - Advent of Code 2021 - my answers
Advent-of-Code - Advent of Code