adventofcode
Some flavors of implementations for the Advent of Code challenges (by gansanay)
adventofcode
Solutions for problems from AdventOfCode.com (by bhosale-ajay)
adventofcode | adventofcode | |
---|---|---|
8 | 86 | |
0 | 16 | |
- | - | |
4.1 | 7.3 | |
over 2 years ago | 4 months ago | |
Python | TypeScript | |
MIT License | - |
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.
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-12.
-
-🎄- 2021 Day 13 Solutions -🎄-
Python 3
-
-🎄- 2021 Day 12 Solutions -🎄-
Python 3, to be cleaned a bit
-
-🎄- 2021 Day 11 Solutions -🎄-
Python 3, nothing much to say. I'd like to find something nicer for applying patches like +1 to all adjacent positions...
-
[2021 day 8] a bit better than brute force, by filtering possible permutations based on input. What do you think?
As I wasn't really ready at 6am this morning to get into the segment-by-segment deduction, I went down a different route, link here.
-
-🎄- 2021 Day 8 Solutions -🎄-
Python 3, O(n log n) for part 2 if I am not mistaken
-
-🎄- 2021 Day 6 Solutions -🎄-
Python 3: a quite expected implementation for both parts, using a dict
-
-🎄- 2021 Day 4 Solutions -🎄-
Python 3
-
-🎄- 2021 Day 3 Solutions -🎄-
A Python solution I liked to write but still thinking there's an ultimately elegant way to do it.
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 2023-12-09.
- -❄️- 2023 Day 10 Solutions -❄️-
- -❄️- 2023 Day 9 Solutions -❄️-
- -❄️- 2023 Day 8 Solutions -❄️-
-
-❄️- 2023 Day 7 Solutions -❄️-
The only code differs for two parts is as follows - https://github.com/bhosale-ajay/adventofcode/blob/master/2023/ts/D07.test.ts - under 80 lines.
-
-❄️- 2023 Day 6 Solutions -❄️-
Easy day TypeScript, P1 - Brute Force, P2 - Formula
- -❄️- 2023 Day 5 Solutions -❄️-
-
-❄️- 2023 Day 4 Solutions -❄️-
[LANGUAGE: TypeScript] Github - Under 40 lines, all parts running under 8ms.
-
-❄️- 2023 Day 1 Solutions -❄️-
[LANGUAGE: TypeScript] TypeScript - Running under 30ms (both parts)
-
-🎄- 2022 Day 25 Solutions -🎄-
F# This year I solved puzzles using TypeScript as well as F# - Day 18, 19, and 22 TBD
-
-🎄- 2022 Day 24 Solutions -🎄-
F# - After looking at some Python solution calculated the position of blizzard for nth time instead of maintaining the grid, which makes it easier with F#.