adventofcode
Advent of code solutions (by julian-west)
aoc-2021-clj | adventofcode | |
---|---|---|
7 | 12 | |
0 | 6 | |
- | - | |
1.8 | 4.7 | |
over 2 years ago | 5 months ago | |
Clojure | Python | |
- | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
aoc-2021-clj
Posts with mentions or reviews of aoc-2021-clj.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-14.
-
-🎄- 2021 Day 15 Solutions -🎄-
I'm very late to the party, so I'll just reply to your comment with my solution source and tests. Like you, my initial solution was very slow for part 1 (slower than yours, I think). After refinement, part 2 finishes in about 30 seconds whereas yours takes roughly 60 seconds on my machine. I haven't examined your solution much, but I'm guessing the difference is (unsurprisingly) the queue of remaining nodes.
-
-🎄- 2021 Day 14 Solutions -🎄-
Clojure, source and tests. Brute forced part 1 but refined the solution for part 2 which runs in about 30ms (not bad, I'd say!).
-
-🎄- 2021 Day 13 Solutions -🎄-
Catching up once again. Here's the Clojure source (no tests this time... but here's the parsing source. Here's how I ran it at the REPL:
-
-🎄- 2021 Day 9 Solutions -🎄-
Clojure, source and tests. Part 1 was simple but I couldn't get anything going for part 2 after a couple of hours. I initially tried a naive DFS approach (which I know essentially nothing about) but wasn't successful in constructing a tree from a low point.
-
-🎄- 2021 Day 7 Solutions -🎄-
Finally caught up! Here's the Clojure source and tests for today.
-
-🎄- 2021 Day 6 Solutions -🎄-
Catching up from a set back on day 5 (I almost had a working sweep algorithm but gave up) and the weekend in general. Here's the Clojure source and tests. As usual, feedback welcome!
-
-🎄- 2021 Day 4 Solutions -🎄-
Clojure, source and tests. Any feedback welcome!
adventofcode
Posts with mentions or reviews of adventofcode.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-16.
-
-🎄- 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?
When comparing aoc-2021-clj and adventofcode you can also consider the following projects:
Advent-of-Code - Advent of Code
fp-ts - Functional programming in TypeScript
adventofcode - Advent of code solutions
CSpydr - A static typed low-level compiled programming language inspired by Rust and C
AdventOfCode2021 - Advent of code 2021
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
AdventOfCode2021 - My solutions to https://adventofcode.com/2021
advent-of-code - 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:
AdventofCode2021
aoc-typescript
MoreLINQ - Extensions to LINQ to Objects
aoc-2021-clj vs Advent-of-Code
adventofcode vs fp-ts
aoc-2021-clj vs adventofcode
adventofcode vs CSpydr
aoc-2021-clj vs AdventOfCode2021
adventofcode vs adventofcode
aoc-2021-clj vs AdventOfCode2021
adventofcode vs advent-of-code
adventofcode vs AdventOfCode2021
adventofcode vs AdventofCode2021
adventofcode vs aoc-typescript
adventofcode vs MoreLINQ