advent-of-code-2022
adventofcode
advent-of-code-2022 | adventofcode | |
---|---|---|
8 | 44 | |
0 | 307 | |
- | - | |
10.0 | 9.5 | |
over 1 year ago | 3 months ago | |
D | C# | |
- | 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.
advent-of-code-2022
-
-🎄- 2022 Day 14 Solutions -🎄-
Slow dlang solution that simulates sand drops one grain at a time, one pixel at a time. Here's the main loop for part 2. The occupied[grain] = true assignment is due to the fact that the standard library doesn't have a hashset (to my knowledge), so instead I'm putting Points in an associative array while discarding the values.
-
-🎄- 2022 Day 13 Solutions -🎄-
Dlang solution, using JSON parsing from the standard library. At first I misunderstood the problem and kept getting failures in the second pair. I thought [2,3,4] vs [4] meant that the right list will run out of items after having successfully compared 2 and 4, but then I learned that this would only happen if 2 and 4 were equal (thanks to this thread). This made me realize that a binary comparison wasn't enough and pushed me to write the convoluted ternary comparison function below :
-
-🎄- 2022 Day 12 Solutions -🎄-
Dlang solution using BFS. Relevant part :
-
-🎄- 2022 Day 11 Solutions -🎄-
Dlang solution as usual, here's the class that handles monkey business :
-
-🎄- 2022 Day 10 Solutions -🎄-
Dlang solution. For part 2 I initially thought that the X register contains values exceeding 40, so I kept appending pixels to the CRT while comparing them to the sprite, and in the end I printed the string in chunks of 40. Only later did I realize my mistake
-
-🎄- 2022 Day 9 Solutions -🎄-
Dlang bruteforce solution. For some reason I thought the rope was 9 knots long and kept getting off by one results. Relevant part 2 portion :
-
-🎄- 2022 Day 8 Solutions -🎄-
Dlang bruteforce solution
-
-🎄- 2022 Day 7 Solutions -🎄-
Dlang solution, part 2. I'm embarrassed by this code but I'm sharing it because it took a lot of effort to write it. Previous solutions are available in this repo
adventofcode
- -❄️- 2023 Day 11 Solutions -❄️-
-
-❄️- 2023 Day 9 Solutions -❄️-
https://github.com/encse/adventofcode/blob/master/2023/Day09/Solution.cs
- -❄️- 2023 Day 7 Solutions -❄️-
- -❄️- 2023 Day 6 Solutions -❄️-
- -❄️- 2023 Day 5 Solutions -❄️-
- -🎄- 2022 Day 25 Solutions -🎄-
- -🎄- 2022 Day 24 Solutions -🎄-
- -🎄- 2022 Day 23 Solutions -🎄-
- -🎄- 2022 Day 22 Solutions -🎄-
- -🎄- 2022 Day 21 Solutions -🎄-
What are some alternatives?
codewars.com - Issue tracker for Codewars
projecteuler - Project Euler problems in Awk.
data-engineer-roadmap - Roadmap to becoming a data engineer in 2021
mal - mal - Make a Lisp
advent-of-code-2020 - Solutions for AdventOfCode 2020
Exercism - Scala Exercises - Crowd-sourced code mentorship. Practice having thoughtful conversations about code.
build-your-own-x - Master programming by recreating your favorite technologies from scratch.
libcurl - A command line tool and library for transferring data with URL syntax, supporting DICT, FILE, FTP, FTPS, GOPHER, GOPHERS, HTTP, HTTPS, IMAP, IMAPS, LDAP, LDAPS, MQTT, POP3, POP3S, RTMP, RTMPS, RTSP, SCP, SFTP, SMB, SMBS, SMTP, SMTPS, TELNET, TFTP, WS and WSS. libcurl offers a myriad of powerful features
vulkano - Safe and rich Rust wrapper around the Vulkan API
build-your-own-x - 🤓 Build your own (insert technology here) [Moved to: https://github.com/codecrafters-io/build-your-own-x]
advent-of-code-2019 - Advent of Code 2019 Solutions (Spoilers!)
tlaplus - TLC is a model checker for specifications written in TLA+. The TLA+Toolbox is an IDE for TLA+.