aoc
adventofcode
aoc | adventofcode | |
---|---|---|
4 | 86 | |
2 | 16 | |
- | - | |
8.2 | 7.3 | |
4 months ago | 4 months ago | |
Go | TypeScript | |
MIT License | - |
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
-
Y'all are getting way too excited
Using Dijkstra and starting from `z` the solution was 2x faster than BFS in my case. By starting from `z` it constraint is that you can go to a neighbor only if the height difference is 1, that is faster than starting from `a`. For the priority I used that the amount of steps from the start to the current node inspected, meaning the nodes with shortest paths are inspected first. I counted the number of cycles (each time an element is popped out the queue) For part 1 I get ~5000 cycles with Dijkstra and ~8000 with BFS. Cannot see if there is something wrong with my BFS implementation Solution in Go
-
-π- 2022 Day 7 Solutions -π-
Go
-
-π- 2022 Day 5 Solutions -π-
Go solution abusing of slices
-
Advent of code: Rust, Go, and Binary operators
Hi everyone, I got late into the advent of code problems and currently I'm solving day 3 and 4. I've been writing my solutions in rust and go (see my aoc repo), and today, while solving day 03 I came across with an interesting comparison between rust and go code that I'd like to share in this post.
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#.
What are some alternatives?
advent-of-code-2021 - π My Advent of Code solutions in Rust. http://adventofcode.com/2021
AoC - my personal repo for the advent of code yearly challenge
AdventOfCode2021 - My solutions for the https://adventofcode.com/2021 challenge.
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
adventofcode - Advent of Code challenge solutions
AOC2021 - Solutions for the Advent Of Code 2021
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
advent-of-rust - πadvent of code in rust π¦ (32%)
Advent-of-Code - Advent of Code
advent_of_code_2021 - My solutions to the challenges from Advent of Code 2021
advent-of-code