advent-of-code-2022
adventofcode
advent-of-code-2022 | adventofcode | |
---|---|---|
1 | 44 | |
0 | 307 | |
- | - | |
10.0 | 9.5 | |
over 1 year ago | 3 months ago | |
Rust | C# | |
- | 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
-
-🎄- 2022 Day 3 Solutions -🎄-
Rust 3a: use day_03::{intersect, priority}; fn main() { let input = include_bytes!("../../../input/day_03.txt"); let sum_of_priorities = input .split(|&byte| byte == b'\n') .map(|line| line.split_at(line.len() / 2)) // split into equally sized compartments .map(|(l, r)| intersect([l.iter().copied(), r.iter().copied()])) // find the intersection of the compartments .map(priority) // map to priorities .sum::(); println!("{}", sum_of_priorities); } 3b: use day_03::{intersect, priority}; fn main() { let input = include_bytes!("../../../input/day_03.txt"); let lines = input.split(|&byte| byte == b'\n').collect::>(); let sum_of_priorities = lines .chunks(3) .map(|chunks| intersect(chunks.iter().map(|chunk| chunk.iter().copied()))) .map(priority) // map to priorities .sum::(); println!("{}", sum_of_priorities); } shared code (module: `day_03`): use std::collections::HashSet; pub fn intersect(sets: I) -> u8 where I: IntoIterator, Set: IntoIterator, { let common = sets .into_iter() .map(|set| { let set: HashSet = HashSet::from_iter(set); set }) .reduce(|l, r| &l & &r); *common.unwrap().iter().next().unwrap() } pub fn priority(item: u8) -> u32 { (if item >= b'a' { item + 1 - b'a' } else { item + 27 - b'A' }) as u32 } repo: https://github.com/foresterre/advent-of-code-2022
adventofcode
- -❄️- 2023 Day 11 Solutions -❄️-
-
-❄️- 2023 Day 9 Solutions -❄️-
https://github.com/encse/adventofcode/blob/master/2023/Day09/Solution.cs
- -❄️- 2023 Day 7 Solutions -❄️-
- -❄️- 2023 Day 6 Solutions -❄️-
- -❄️- 2023 Day 5 Solutions -❄️-
- -🎄- 2022 Day 25 Solutions -🎄-
- -🎄- 2022 Day 24 Solutions -🎄-
- -🎄- 2022 Day 23 Solutions -🎄-
- -🎄- 2022 Day 22 Solutions -🎄-
- -🎄- 2022 Day 21 Solutions -🎄-
What are some alternatives?
aocrunner - Advent of Code runner
codewars.com - Issue tracker for Codewars
AdventOfCode2022
projecteuler - Project Euler problems in Awk.
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
data-engineer-roadmap - Roadmap to becoming a data engineer in 2021
advent-of-code - My solutions for adventofcode.com
mal - mal - Make a Lisp
advent - Solutions to https://adventofcode.com/
advent-of-code-2020 - Solutions for AdventOfCode 2020
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
Exercism - Scala Exercises - Crowd-sourced code mentorship. Practice having thoughtful conversations about code.