Top 23 advent-of-code-2015 Open-Source Projects
-
-
Project mention: [2021 Day 18] solving Snailnumber operations, the fast way | reddit.com/r/adventofcode | 2021-12-24
I found some time to reimplement my approach in Rust. It’s fast:
-
SonarLint
Deliver Cleaner and Safer Code - Right in Your IDE of Choice!. SonarLint is a free and open source IDE extension that identifies and catches bugs and vulnerabilities as you code, directly in the IDE. Install from your favorite IDE marketplace today.
-
-
adventofcode
Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020 and 2021 in Scala (by sim642)
-
Project mention: 2021 Day 16 Me spending way too much time trying to handle the garbage bits | reddit.com/r/adventofcode | 2021-12-16
Well, you probably are because that's how I implemented it, lol: https://github.com/AlexAegis/advent-of-code/blob/c6c55bb49838fd214c519b07ed60e1d67cbcc641/solutions/typescript/2021/16/model/packet.interface.ts
-
-
C# code
-
Scout APM
Less time debugging, more time building. Scout APM allows you to find and fix performance issues with no hassle. Now with error monitoring and external services monitoring, Scout is a developer's best friend when it comes to application development.
-
Python "Precompiled solution" featured on github
-
Solution in Go: kvrhdn/Advent-of-Code//advent-of-code-2021/day20/day20.go
-
Part 1 | Part 2
-
Project mention: Advent of Code 2021 Walkthroughs in Python | reddit.com/r/adventofcode | 2022-02-09
(The repo is here.)
-
Python 3
-
Project mention: I'm really proud of solving this year, some close calls for giving up in there for sure! 18, 19, and 24 threw me for a loop. Thanks topaz for another great year 💙 | reddit.com/r/adventofcode | 2021-12-28
repo
-
Project mention: [2021 Day 1-25][Rust] Solutions to all of this year's problems in terse and clean Rust | reddit.com/r/adventofcode | 2021-12-25
2015 in Clojure
-
-
Ruby
-
Project mention: Code made in python with easy understandability and ton of comments | reddit.com/r/adventofcode | 2022-03-01
-
Clojure, quite happy with this one, simply using a stack and the assumptions we know about the input to easily compare, filter and then match.
-
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
-
-
Solution in Kotlin: https://github.com/Shockah/Advent-of-Code/blob/master/src/pl/shockah/aoc/y2021/Day8.kt
-
PHP
advent-of-code-2015 related posts
Index
What are some of the best open-source advent-of-code-2015 projects? This list will help you:
| Project | Stars | |
|---|---|---|
| 1 | adventofcode | 111 |
| 2 | adventofcode | 91 |
| 3 | AdventOfCode | 58 |
| 4 | adventofcode | 46 |
| 5 | advent-of-code | 32 |
| 6 | adventofcode | 27 |
| 7 | adventofcode-solutions | 18 |
| 8 | aoc | 15 |
| 9 | Advent-of-Code | 10 |
| 10 | advent-of-code | 9 |
| 11 | Advent-of-Code | 7 |
| 12 | advent-of-code | 5 |
| 13 | adventofcode | 4 |
| 14 | AdventOfCode2015 | 3 |
| 15 | advent-of-code | 3 |
| 16 | code-challenges | 2 |
| 17 | Advent-Calendar-Python | 1 |
| 18 | advent-of-clojure | 1 |
| 19 | advent_of_code | 1 |
| 20 | adventofcode.com | 0 |
| 21 | adventofcode | 0 |
| 22 | Advent-of-Code | 0 |
| 23 | adventofcode | 0 |
Are you hiring? Post a new remote job listing for free.
