home.social

#adventodcode — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #adventodcode, aggregated by home.social.

  1. John @[email protected] ·
    CW: Advent of Code 2025 Day 11 Spoilers

    After the last few days of difficult puzzles, today was a breath of fresh air.

    Counting paths through a DAG is a classic memoizable recursive puzzle. Part 1 was just that.

    Part 2 adds two new variables to track, but you just add them to the memoized parameters (Python's `@cache` operator makes that easy) and keep do the same thing, with the addition of updating the flags if you're on either the `dac` or `fft` nodes.

    Easy peasy, runs almost instantly.

    codeberg.org/biesnecker/aoc-an

    #adventodcode #adventofcode2025 #python

    #adventodcode #adventofcode2025 #python
  2. John @[email protected] ·
    CW: Advent of Code 2025 Day 11 Spoilers

    After the last few days of difficult puzzles, today was a breath of fresh air.

    Counting paths through a DAG is a classic memoizable recursive puzzle. Part 1 was just that.

    Part 2 adds two new variables to track, but you just add them to the memoized parameters (Python's `@cache` operator makes that easy) and keep do the same thing, with the addition of updating the flags if you're on either the `dac` or `fft` nodes.

    Easy peasy, runs almost instantly.

    codeberg.org/biesnecker/aoc-an

    #adventodcode #adventofcode2025 #python

    #adventodcode #adventofcode2025 #python
  3. John @[email protected] ·
    CW: Advent of Code 2025 Day 11 Spoilers

    After the last few days of difficult puzzles, today was a breath of fresh air.

    Counting paths through a DAG is a classic memoizable recursive puzzle. Part 1 was just that.

    Part 2 adds two new variables to track, but you just add them to the memoized parameters (Python's `@cache` operator makes that easy) and keep do the same thing, with the addition of updating the flags if you're on either the `dac` or `fft` nodes.

    Easy peasy, runs almost instantly.

    codeberg.org/biesnecker/aoc-an

    #adventodcode #adventofcode2025 #python

    #adventodcode #adventofcode2025 #python
  4. John @[email protected] ·
    CW: Advent of Code 2025 Day 11 Spoilers

    After the last few days of difficult puzzles, today was a breath of fresh air.

    Counting paths through a DAG is a classic memoizable recursive puzzle. Part 1 was just that.

    Part 2 adds two new variables to track, but you just add them to the memoized parameters (Python's `@cache` operator makes that easy) and keep do the same thing, with the addition of updating the flags if you're on either the `dac` or `fft` nodes.

    Easy peasy, runs almost instantly.

    codeberg.org/biesnecker/aoc-an

    #adventodcode #adventofcode2025 #python

    #python #adventofcode2025 #adventodcode
  5. John @[email protected] ·
    CW: Advent of Code 2025 Day 11 Spoilers

    After the last few days of difficult puzzles, today was a breath of fresh air.

    Counting paths through a DAG is a classic memoizable recursive puzzle. Part 1 was just that.

    Part 2 adds two new variables to track, but you just add them to the memoized parameters (Python's `@cache` operator makes that easy) and keep do the same thing, with the addition of updating the flags if you're on either the `dac` or `fft` nodes.

    Easy peasy, runs almost instantly.

    codeberg.org/biesnecker/aoc-an

    #adventodcode #adventofcode2025 #python

    #adventodcode #adventofcode2025 #python
  6. William @[email protected] ·

    #adventodcode 5 🤡🤐

    #adventodcode