AOC2023
advent-of-code
AOC2023 | advent-of-code | |
---|---|---|
7 | 34 | |
0 | 29 | |
- | - | |
8.4 | 5.6 | |
5 months ago | 5 months ago | |
F# | Python | |
- | - |
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.
AOC2023
- -❄️- 2023 Day 9 Solutions -❄️-
-
-❄️- 2023 Day 8 Solutions -❄️-
Can check it here: https://github.com/vorber/AOC2023/blob/main/src/day8/Program.fs
-
-❄️- 2023 Day 7 Solutions -❄️-
[LANGUAGE:F#]https://github.com/vorber/AOC2023/blob/main/src/day7/Program.fsAfter the difficulty roller-coaster of the previous days I expected this one to be a bit more challenging :)
- -❄️- 2023 Day 6 Solutions -❄️-
- -❄️- 2023 Day 5 Solutions -❄️-
-
[2023 Day 3][Prolog] Bye guys see you next year
Did day 3 in F# without using 2d arrays (or explicit loops, or recursive calls). All the information you need is very local - you only need to look back and forward at most 1 line, so as soon as you can transform your sequence of lines into sequence of 3-line windows - you don't need 2d anymore. Can check it out here: https://github.com/vorber/AOC2023/blob/main/src/day3/Program.fs Keep in mind that this is only my 3rd day of using F#
advent-of-code
-
-❄️- 2023 Day 11 Solutions -❄️-
[LANGUAGE: Python 3] 153/75 Raw solution
-
-❄️- 2023 Day 10 Solutions -❄️-
One could instead count |F7 (that's what I do in my refactored solution), but counting all the bends would miscount the vertical segments (FJ would end up canceling itself out).
-
-❄️- 2023 Day 8 Solutions -❄️-
That sounds like what I suggested here, actually. I don't have anything in my library with quite the right API yet, but I already have most of what you describe coded out. (It looks like I whipped it up for 2017 Day 13.)
-
-❄️- 2023 Day 7 Solutions -❄️-
[LANGUAGE: Python 3] Embarrassing/Embarrassing Ugly raw solution code
-
-❄️- 2023 Day 6 Solutions -❄️-
[LANGUAGE: Python 3] 66/101 Raw solution code
-
-🎄- 2022 Day 22 Solutions -🎄-
Python 3 21/12
-
-🎄- 2022 Day 20 Solutions -🎄-
It doesn't, but you can use a separate list, wrapper classes, and deque.index to find where the values live. I may be biased but I think that my solution (ultimately using deque) isn't as complex as a custom linked list.
-
-🎄- 2022 Day 19 Solutions -🎄-
Part 2 assumes you did part 1 properly. I did not! I'm pretty sure that the intended solution is to do a sort of reverse search (have a target number of geodes and work backwards to see if that's possible to achieve) but I was just not having success coming up with a way to do that. It's probably going to be blindingly obvious once I figure it out, but that might be an exercise for tomorrow.
-
-🎄- 2022 Day 15 Solutions -🎄-
Python 3 9/15!!!
-
-🎄- 2022 Day 14 Solutions -🎄-
Python 3 44/45
What are some alternatives?
Adevnt-of-Code-in-Rust - Solutions to Advent of Code puzzles in Rust :crab:.
AdventOfCode.Template - Advent of Code C# (.NET 8) template. Based on AoCHelper (https://github.com/eduherminio/AoCHelper)
aoc-2023 - My Advent of Code 2023 Solutions [Moved to: https://github.com/AJMansfield/aoc]
tqdm - :zap: A Fast, Extensible Progress Bar for Python and CLI
advent-of-code-2023 - My javascript solutions for Advent of Code 2023 - feedback is welcome
advent-of-code-2022 - advent of code 2022
advent_of_code - C++23 solutions to advent of code puzzles -- various years complete.
advent_of_code
advent-of-code
slushy - Advent of Code 2022 in Rust
advent-of-code - Advent of Code 2023 workspace
LEARN__Coding-Practices-and-Datastructures - Daily Coding Practices, Data structures, otherwise testing and some stuff. (Some garbage/some stuff)