aocrunner
advent-of-code-2022
Our great sponsors
aocrunner | advent-of-code-2022 | |
---|---|---|
10 | 1 | |
163 | 0 | |
- | - | |
0.0 | 10.0 | |
4 months ago | over 1 year ago | |
TypeScript | Rust | |
ISC 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.
aocrunner
-
Advent of Code Automation for Javascript/Typescript
This is the original repo: https://github.com/caderek/aocrunner
-
Is it possible to do the challenges in javascript?
Yes, if you want an easy setup you can try this: aocrunner
-
-π- 2022 Day 3 Solutions -π-
My template for JS and TS: AoC Runner
-
AoC Runner for JavaScript and TypeScript
More: GitHub
-
Just learned that APIs for AoC existed
For JS and TS there is aocrunner
- Advent of Code 2021
-
Is there a way to grab data directly from Javascript ?
You need to Add the session cookie, hereβs how I do it in aocrunner:
-
Advent of Code 2021 starts in less than an hour!
Github: https://github.com/caderek/aocrunner
- AoC runner for JavaScript and Typescript - ultra-fast, with simple CLI, customizable template, simple testing utility, live reload, and adventofcode.com integration
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
What are some alternatives?
esbuild - An extremely fast bundler for the web
AdventOfCode2022
AOC2022 - Advent of Code in Rust
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
adventofcode-2022
advent-of-code - My solutions for adventofcode.com
Advent-of-Code - coding challenge solutions
advent - Solutions to https://adventofcode.com/
Advent-of-Code-2022 - This is my answers to resolve the problems of the competition Advent of the code
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
Advent-of-Code-Solutions - This repository includes my solutions to the Advent of Code puzzles using *python*.
adventofcode - :christmas_tree: Advent of Code (2015-2023) in C#