advent-of-code
aoc2021
advent-of-code | aoc2021 | |
---|---|---|
3 | 8 | |
2 | 1 | |
- | - | |
7.9 | 2.6 | |
5 months ago | over 2 years ago | |
Python | Python | |
- | 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.
advent-of-code
-
-🎄- 2021 Day 4 Solutions -🎄-
Pretty happy with this one ``` def solve() -> List[int]: seen = [] won = [] scores = [] for n in NUMS: seen.append(n) for board in BOARDS: transpose = list(zip(*board)) for i, line in enumerate(board): if (all(num in seen for num in line) or all(num in seen for num in transpose[i])) and board not in won: won.append(board) scores.append(sum(sum(num for num in line if num not in seen) for line in board) * seen[-1]) return scores
-
-🎄- 2021 Day 2 Solutions -🎄-
day02 of doing only one-liners and I already failed for the second part, it would have been a huge mess. The first part is pretty messy as well so if anyone can improve on it I would be very grateful ! https://github.com/masmeert/advent-of-code/blob/master/2021/day02/main.py
-
-🎄- 2021 Day 1 Solutions -🎄-
I actually did the same as you when I first solved it But I saw other people use the l[3] > l[n-3] trick, it didn't make much sense at first but now I get it and it's quite clever. Basically take [1 2 1 3], the windows would be w1=[1 2 1] and w2=[2 1 3], as 2 and 1 appear in both windows what really matters is w1[0] and w2[2] which are unique to each: 1+(2+1) < (2+1)+3 == 1 < 3.
aoc2021
-
Playing with go1.18beta1 generics on Advent of Code
I've been doing similar (in three langs, though Ive fallen behind on go and rust over the past few days) -- https://github.com/A-UNDERSCORE-D/aoc2021/blob/main/aoc/go/util/slice.go is most of my generic go fun, lots of implementations of higher order functions and nice wrappers
-
-🎄- 2021 Day 9 Solutions -🎄-
Python source
-
-🎄- 2021 Day 7 Solutions -🎄-
As usual, first implementation. Actually started by doing sum(range(1, steps+1)), and after solving remembered that theres a math thing for that (sum(0..n) = n * (n + 1) / 2). Nothing super fancy other than that. Code Finally starting to see speedup from pypy. That JIT is amazing but has its costs.
-
-🎄- 2021 Day 6 Solutions -🎄-
https://github.com/A-UNDERSCORE-D/aoc2021/blob/main/aoc/go/six/06.go -- Nothing super fancy. Nice ability to pick arrays over slices here though. Probably contributes a bit of speedup.
- -🎄- 2021 Day 4 Solutions -🎄-
- -🎄- 2021 Day 3 Solutions -🎄-
- -🎄- 2021 Day 2 Solutions -🎄-
- -🎄- 2021 Day 1 Solutions -🎄-
What are some alternatives?
adventofcode - Advent of code solutions
advent-of-code-kotlin - Advent of code 2021 - Kotlin
advent-of-code
AdventOfCode2021 - Solutions to all 25 AoC 2021 problems in Rust :crab: Less than 100 lines per day and under 1 second total execution time! :christmas_tree:
aoc2021
AdventOfCode2021_Julia - Doing the Advent of Code 2021 challenges live in Julia
adventofcode - Solutions for problems from AdventOfCode.com
programming-challenges - My attempts at solving various programming challenges. Leetcode, codewars, adventofcode, etc
aoc - Advent of Code solutions
AdventOfCode2021.jl - Advent of Code 2021 in Julia
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
aoc2021 - Solutions for Advent of Code 2021