aoc2021
adventofcode
aoc2021 | adventofcode | |
---|---|---|
11 | 86 | |
1 | 16 | |
- | - | |
0.0 | 7.3 | |
over 2 years ago | 5 months ago | |
Python | TypeScript | |
- | - |
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.
aoc2021
-
[2021 Day 24][Python] A brute-force solution in 170 seconds
With only a few small restrictions down from "fully general", I have a brute-force-ish solution in python running in about 15 seconds on my hardware and my input: https://github.com/fizbin/aoc2021/blob/main/aoc24b.py
-
Happy New Year guys! I want to share my recap of Advent of Code 2021, I hope this is allowed.
With day 22, I actually have three different python approaches in my repo; the inclusion/exclusion approach is what I named aoc22c.py.
-
[2021 Day 24] I may have done something clever, I wonder if anyone else used this approach
This sounds vaguely similar to the approach I took on my second python solution, minus one optimization that I used: namely, I determined the maximum allowable value of "z" at the end of each instruction if we were going to end the program with z=0 and used that to throw away states that weren't worth pursuing.
-
2021 Day 22 (Part 2) This algorithm may not be optimal
I've implemented that approach, and my code to do so takes less than five seconds on my machine, so I wonder: have you tried this on the sample input? What does it do there?
- What have been the most computationally complex puzzles over the years (i.e. takes most runtime to complete)?
-
-🎄- 2021 Day 22 Solutions -🎄-
How about a python translation of my haskell solution?
-
Advent of Code 2021 day 22
My solution in my github repo
-
Advent of Code 2021 day 21
Here's the more straightforward Monad-based solution, which unfortunately takes well over a minute to run.
- -🎄- 2021 Day 16 Solutions -🎄-
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?
AdventOfCode2021 - My solutions to https://adventofcode.com/2021
AoC - my personal repo for the advent of code yearly challenge
aoc-2021 - AOC challenge in Haskell
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
advent_of_code - :christmas_tree: Advent of Code 2021 in Kotlin :christmas_tree:
adventofcode - Advent of Code challenge solutions
Advent_of_code_2021 - Rust solutions for 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-Code - Advent of Code
advent-of-code
aoc2021 - Advent of Code 2021 on my homemade 16-bit CPU SCAMP
rockstar - The Rockstar programming language specification