adventofcode
advent_of_code
Our great sponsors
adventofcode | advent_of_code | |
---|---|---|
86 | 19 | |
16 | 5 | |
- | - | |
7.3 | 8.0 | |
4 months ago | about 2 months ago | |
TypeScript | Dart | |
- | GNU General Public License v3.0 only |
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
- -❄️- 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#.
advent_of_code
-
-❄️- 2023 Day 9 Solutions -❄️-
Here's the relevant extract from my (recursive) solution. Full code on GitHub.
-
-❄️- 2023 Day 8 Solutions -❄️-
Like others, I used lcm. Here's an extract of the solution, omitting parsing and main(). Full solution on GitHub.
-
-🎄- 2022 Day 14 Solutions -🎄-
Solutions to parts 1 and 2 nearly identical and pretty much worked first time. Nothing clever here. This was far simpler than I thought it would be. I probably spent most time trying to think of a mathematical way of getting all points between p1 and p2. In the end, I just constructed two ranges. Full code here.
-
-🎄- 2022 Day 10 Solutions -🎄-
Full code on github.
-
-🎄- 2022 Day 9 Solutions -🎄-
The core of my solution below using numpy (because I'm learning it!). See github for full code.
-
-🎄- 2022 Day 8 Solutions -🎄-
Python 3 solution using numpy. I got held up because I assume (but know better) that numpy arrays are [x,y] instead of [row, col], which is [y,x].
-
-🎄- 2021 Day 14 Solutions -🎄-
Below is the new solution, which works for part 1 and 2. The full code is on GitHub.
-
-🎄- 2021 Day 11 Solutions -🎄-
These are the key functions. The whole code is on GitHub
-
-🎄- 2021 Day 9 Solutions -🎄-
Part 2 (extract shown below) was a matter of starting with the low points found in part 1 then recursively looking around for relevant points. Full code on GitHub
-
-🎄- 2021 Day 8 Solutions -🎄-
Code is on GitHub.
What are some alternatives?
AoC - my personal repo for the advent of code yearly challenge
advent-of-code
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
adventofcode - Advent of Code challenge 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:
Advent-of-Code - Advent of Code
toit - Program your microcontrollers in a fast and robust high-level language.
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
adventofcode - Advent of Code Repo for Zach Attakk
advent-of-code - Advent Of Code Solutions