advent-of-code

By xdavidliu

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 2023-12-09.
  • -❄️- 2023 Day 10 Solutions -❄️-
    141 projects | /r/adventofcode | 9 Dec 2023
    language c++
  • Advent of Code 2023 is nigh
    19 projects | news.ycombinator.com | 1 Dec 2023
    I did 2016 in Haskell and 2018 in Rust. Haskell was kind of a pain since I had to do a ton of tail recursion. Rust would be a lot easier since it allows you to be imperative when you need to.

    And I definitely only used a tiny subset of either language because I wanted to get the solution as quickly as possible.

    [1] https://github.com/xdavidliu/advent-of-code/tree/main/2016

    19 projects | news.ycombinator.com | 1 Dec 2023
    I didn't have that issue at all; I just looped through the 20 different tokens and found first and last instances of all of them, and compared the very first and very last of all instances.

    https://github.com/xdavidliu/advent-of-code/blob/main/2023/d...

  • Why Haskell Is Interesting?
    4 projects | news.ycombinator.com | 4 Sep 2022
    So I came to Haskell from Scheme background, so the tail recursion was actually natural to me. In fact, about a month ago I did 2016 Advent of Code in Haskell, and toward the end, I felt like I was abusing tail recursion [1] to write iterative algorithms like breadth-first-search by essentially "repeatedly consing on to the params of tails calls", as Lispers would probably call it.

    The whole I'm wondering if I'm just writing Haskell "with a heavy Scheme accent", since I see others' Haskell code make extensive use of state monads (which I still haven't attempted to understand), and I also found others' using way more of the monadic / applicative operators like "bind", etc than I have.

    I found the hard part of Haskell not the iteration, which from tail recursion was completely natural and straightforward, but rather worrying about the efficiency of the "repeatedly consing" part. For things like stacks, the cost is O(1), but for things like Data.Array, I wasn't sure how much shared structure there was; I mean it could totally be copying the entire array every time I "mutate" an element (not really, since it was still sort of "consing" onto the old array and not actually mutating it).

    [1] https://github.com/xdavidliu/advent-of-code/blob/main/2016/d...

  • A note from our sponsor - InfluxDB
    www.influxdata.com | 2 Mar 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
4
0
9.3
2 months ago
Power Real-Time Data Analytics at Scale
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.
www.influxdata.com