AoC-2023
code for Advent of Code for 2023 (trying to learn Common Lisp) (by argentcorvid)
adventOfCode
By matheusstutzel
AoC-2023 | adventOfCode | |
---|---|---|
1 | 17 | |
0 | 6 | |
- | - | |
9.0 | 7.5 | |
about 1 month ago | 5 months ago | |
Common Lisp | Python | |
BSD 3-clause "New" or "Revised" 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.
AoC-2023
Posts with mentions or reviews of AoC-2023.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-04.
-
-❄️- 2023 Day 1 Solutions -❄️-
Edit: link to github
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-07.
-
-❄️- 2023 Day 8 Solutions -❄️-
Part 1 straightforward implementation. Treat it as a graph and just follow the instructions.
-
-❄️- 2023 Day 7 Solutions -❄️-
Part 1 -> simple implementation, sort the list using a custom function. The main component is the function extractInfo which returns the number of pairs and the number of times the card with the most duplicates appears.
-
-❄️- 2023 Day 6 Solutions -❄️-
Part 1/Part 2 the only difference between them is the parse. Solved using Bhaskara formula
-
-❄️- 2023 Day 5 Solutions -❄️-
Part 1 brute force mapping each seed
-
-❄️- 2023 Day 4 Solutions -❄️-
Part 1: set intersection
-
-❄️- 2023 Day 1 Solutions -❄️-
Part 1 is nothing fancy, just scanned the data
- -🎄- 2022 Day 25 Solutions -🎄-
- -🎄- 2022 Day 24 Solutions -🎄-
- -🎄- 2022 Day 23 Solutions -🎄-
- -🎄- 2022 Day 20 Solutions -🎄-
What are some alternatives?
When comparing AoC-2023 and adventOfCode you can also consider the following projects:
aoc2023
adventofcode
Algorithms-in-Java
advent-of-code - Advent of Code
AdventOfCode-2023 - Solutions for Advent of Code 2023
advent-code-challenges
advent-of-code-2023-golang
AoC2023 - Advent of Code 2023
advent-of-code-solutions - Repository for my work on the Advent Of Code challenges
aoc23 - My solutions to Advent of Code 2023
advent-of-code-2023
advent-of-code-2023
AoC-2023 vs aoc2023
adventOfCode vs adventofcode
AoC-2023 vs Algorithms-in-Java
adventOfCode vs advent-of-code
AoC-2023 vs AdventOfCode-2023
adventOfCode vs advent-code-challenges
AoC-2023 vs advent-of-code-2023-golang
adventOfCode vs AoC2023
AoC-2023 vs advent-of-code-solutions
adventOfCode vs aoc23
AoC-2023 vs advent-of-code-2023
adventOfCode vs advent-of-code-2023