Advent-of-Code

A repository holding all of my solutions to Advent of Code problems (by Noble-Mushtak)

Advent-of-Code Alternatives

Similar projects and alternatives to Advent-of-Code

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better Advent-of-Code alternative or higher similarity.

Advent-of-Code reviews and mentions

Posts with mentions or reviews of Advent-of-Code. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-12-18.
  • -🎄- 2022 Day 19 Solutions -🎄-
    67 projects | /r/adventofcode | 18 Dec 2022
    Python 3, 6/13, code here
  • -🎄- 2022 Day 16 Solutions -🎄-
    68 projects | /r/adventofcode | 15 Dec 2022
    Python 3 (to process the input) and C++ (to actually solve the problem), 81/143, view code here
  • -🎄- 2022 Day 13 Solutions -🎄-
    149 projects | /r/adventofcode | 12 Dec 2022
    Python 3, 27/22: Here is my Part 1 and Part 2 code.
  • -🎄- 2022 Day 10 Solutions -🎄-
    201 projects | /r/adventofcode | 9 Dec 2022
    Python 3, 28th on star 1 and 29th on star 2, both parts are <=20 lines of code. Main thing which is notable is that I used "\u2588" instead of # symbols and spaces instead of periods, made the capital letters much easier to read. I also have my solutions in this GitHub repo.
  • Everyone is overcomplicating day 22 ???
    4 projects | /r/adventofcode | 22 Dec 2021
    I also used coordinate compression, but had a slightly different take: Keep a 3D boolean array representing whether each points in our compressed space of points is turned on or off. And then for each instruction, just go through all the points affected by that instruction and set their state to true if the instruction is "on" or false if the instruction is "off". This approach runs in about 2 seconds in Scala, and honestly, I'm not sure that the complex cube intersection approach runs faster than this coordinate compression approach, although it would be nice to see a cube intersection approach written in Scala so we can compare apples to apples.
  • -🎄- 2021 Day 20 Solutions -🎄-
    98 projects | /r/adventofcode | 19 Dec 2021
    Python 3.8.10 82/68
  • Is anyone doing the whole 2021 advent in Haskell?
    4 projects | /r/adventofcode | 15 Dec 2021
    Not sure if you are interested in solutions from past years, but I did Haskell for AoC 2019, although I'm not the best Haskell programmer so some of it is not that well designed. If you're interested, feel free to take a look at my solutions.
  • [2021 Day #14 (part 2)] (extend) Exponentially harder
    1 project | /r/adventofcode | 14 Dec 2021
    I've posted my solution to GitHub here. (It's written in Scala because I am trying to use Advent of Code to learn Scala, but it's probably not idiomatic Scala so if you have any tips/suggestions for improvement, let me know!) When I tested this on the sample, Part 1 took about 20 seconds, part 2 took about 27 seconds, and the extension took about 135 seconds. So this isn't a very good solution, but going from 40 steps to 1000000000 steps gave us only a 5-times factor speed-up, which is evidence that the time complexity of the algorithm is not growing linearly in the number of steps.
  • [2021 Day 7] Applying Slope Trick from Competitive Programming
    1 project | /r/adventofcode | 7 Dec 2021
    If you'd like to see my full Scala solution, you can find it on my GitHub here. Have fun, and thanks for reading!
  • A note from our sponsor - InfluxDB
    www.influxdata.com | 25 Apr 2024
    Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality. Learn more →

Stats

Basic Advent-of-Code repo stats
9
11
7.9
4 months ago

Sponsored
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com