advent-of-code
adventofcode
advent-of-code | adventofcode | |
---|---|---|
3 | 12 | |
2 | 6 | |
- | - | |
7.9 | 4.7 | |
5 months ago | 5 months ago | |
Python | Python | |
- | - |
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.
adventofcode
-
-🎄- 2021 Day 17 Solutions -🎄-
Python day 17 solution (GitHub). Not the fewest lines of code, but used dataclasses and modular functions to try improve readability -- I got very confused with keeping track of indices of velocities vs coordinates in other people's posted solutions. I find dataclasses in Python can be a great way to be descriptive about the quantities you are iterating
-
-🎄- 2021 Day 15 Solutions -🎄-
Python day 15 solution (GitHub) using Networkx for graph algorithm and Numpy for building the bigger grid. Solutions to other days available in this repo
-
-🎄- 2021 Day 14 Solutions -🎄-
Python day 14 solution (GitHub). Tried splitting out the logic into individual functions to aid readability.
-
-🎄- 2021 Day 13 Solutions -🎄-
Python day 13 solutions (GitHub). Using Dataclasses to improve readability
-
-🎄- 2021 Day 7 Solutions -🎄-
Python solution (GitHub) using Gauss formula for part 2
-
-🎄- 2021 Day 6 Solutions -🎄-
Python solution using deque (GitHub). Much faster than my first attempt, lol
-
-🎄- 2021 Day 5 Solutions -🎄-
Python day 5 solutions using Bresenham's algorithm (Github)
-
-🎄- 2021 Day 4 Solutions -🎄-
Python solution day 4 OOP (GitHub). Probably not the fewest lines of code but uses dataclasses and OOP to manage the states of each bingo card
-
-🎄- 2021 Day 2 Solutions -🎄-
Python day 2 solution (GitHub)
-
-🎄- 2021 Day 1 Solutions -🎄-
Python day 1 solution (GitHub) using numpy's convolve function for sliding window calc
What are some alternatives?
adventofcode - Advent of code solutions
fp-ts - Functional programming in TypeScript
advent-of-code
CSpydr - A static typed low-level compiled programming language inspired by Rust and C
aoc2021
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
adventofcode - Solutions for problems from AdventOfCode.com
advent-of-code - Advent Of Code Solutions
aoc - Advent of Code solutions
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:
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
AdventofCode2021