
-
-
Nutrient
Nutrient β The #1 PDF SDK Library, trusted by 10K+ developers. Other PDF SDKs promise a lot - then break. Laggy scrolling, poor mobile UX, tons of bugs, and lack of support cost you endless frustrations. Nutrientβs SDK handles billion-page workloads - so you donβt have to debug PDFs. Used by ~1 billion end users in more than 150 different countries.
-
I've described my rules in README:
-
-
Elixir 829/1181
-
Code link
-
Code Here: https://github.com/Bpendragon/AdventOfCodeCSharp/blob/332e303/AdventOfCode/Solutions/Year2022/Day18-Solution.cs
-
CodeRabbit
CodeRabbit: AI Code Reviews for Developers. Revolutionize your code reviews with AI. CodeRabbit offers PR summaries, code walkthroughs, 1-click suggestions, and AST-based analysis. Boost productivity and code quality across all major languages with each PR.
-
Python. Code (Parts 1 and 2)
-
-
-
aoc
My attempts at Advent of Code, along with a smaller helper library to streamline daily AoC tasks. (by hrushikeshrv)
-
-
adventofcode
Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023 and 2024 in Scala (by sim642)
My Scala solution.
-
Python https://github.com/mattbillenstein/aoc/blob/main/2022/18/p.py
-
-
Go
-
Both pars: 0.448s
-
github
-
-
Kotlin (GitHub)
-
-
-
-
I spent time this afternoon sprucing up my helpers for the iex REPL. I spent a bunch of time poking at things in IEx the last couple days and wanted to make sure I would minimize keystrokes if I needed to debug things on my phone while drunk. Turns out Thursday night > Friday night > Saturday night in terms of difficulty, so all those macros have so far saved me zero seconds :-)
-
-
Haskell
-
-
JavaScript - both parts run in 10-20 ms or so
-
-
code
-
part 2 can be found here https://github.com/jstanley0/advent-2022/blob/main/18b.rb
-
-
Rust
-
TypeScript - Part 2 is slow ~ around 10 seconds
-
-
-
My awkward, clumsy, over-engineered solution in Java can be found here.
-
-
-
Python https://github.com/Phil-DS/AdventOfCode2022/tree/master/day18 Nice and easy. Part 1: Run through the list and calculate 6 - (number of adjacent). Part 2: got the negative space using sets, and ran a flood fill to find the air pockets, discarding the one containing (0,0,0). Then, ran the SA calc from part 1 on the air pockets and took that away from the answer to part 1. (Coord range seems to be 0,22 in all 3 dimensions)
-
Scala 30ms + 70ms
-
Here it is :)
-
-
-
Version at time of posting: 492376c (since I've committed since then)
-
Python
-
GitHub
-
Julia - Runtime: 2.7ms, 14.4ms - Outputs: 3494, 2062
-
I agree, I also enjoy writing Clojure, but my solutions (like for this day) are usually far less elegant π
-
Advent_of_Code
A repo revolving around attempting to solve the Advent of Code puzzles with single-statement t-sql (by adimcohen)
-
Rust
-
-
Part 1
-
advent-of-code-go
All 10 years of adventofcode.com solutions in Go/Golang (and a little Python); 2015-2024
-
github - Part 1 is pretty easy - Part 2 I created an inverse cube of the original shape, like a mould for a silicone thing and used the algorithm in part 1 to calculate the sides of the inverse. I just needed to remove the outer sides of the inverse cube to get the solution - To create the inverse, I started from 2 opposite corners of the "bounding box" of the original shape and added a neighbour if it's within bounds and isn't part of the original shape. - With this solution you need to be aware of "hooks" while generating the inverse
-
Code on GitHub.
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives