home.social

#aoc2025 — Public Fediverse posts

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

  1. Juan Vazquez and Cameron Cunning rejoin the show to discuss how we fared with the 2025 Advent of Code competition.

    straypointers.com/e/s4e01.htm

  2. I finished day 6 part 2 of . While I initially tried parsing forward through the lines of input, I eventually moved to parsing right to left. And again used reduce() to get the results of the problems.

  3. I had fun applying reduce() to lists to solve day 6 part 1 of . I learned about reduce() while porting machine learning code to Linux on IBM Power many years back, but I've seldom used it.

  4. I finished day 5 part 2 of . My first approach left me with overlapping ranges, so I had to revamp it. The working solution was much more elegant in addition to working!

  5. CW: Advent of Code Day 11

    Day 11 of #AdventOfCode is a classical graph problem like we're used to from previous years.

    Unlike previously, I immediately thought of checking what the graph looked like with a visualization tool. Luckily, `petgraph` allows to export a graphviz file which can be then used to visualize the nodes and edges.

    From that, it was clear that a few nodes were acting as "bridges" between largers subnets of nodes with no particular arrangement besides being directed towards the next "bridge" layer. Those bridge layers comprised 4 to 5 nodes in my input, and were the only ones with more than 6 incoming edges, so I used that as my filter criterion.

    To gather them, I sorted the graph in topological order and chunked them by their position offset compared to the previous node. When doing this, all the nodes from a bridge layer end up being at most 20 positions away from the previous node in the sorted list.

    Finally, I progressed through each subnet, collecting information about how many paths lead to each one of the end layer's nodes. By multiplying with all the paths leading to each start layer's node, we get the overall total number of paths.

    github.com/beeb/aoc-2025/blob/

    #AoC #AoC2025 #AdventOfCode2025 #RustLang #rust

  6. CW: Advent of Code 2025 day 12 solution

    Day 12 done.

    I really didn't like this one. Basically have to do some bounds checking "it obviously always works" or "it obviously will never work" on it to get it to work on the actual input, but it still NEVER FINISHES on the example. I'm slightly bothered that the problem is more or less unsolvable as written, but I'm really bothered by the actual solution for the input not working on the example. That's not a fun puzzle, that feels like I'm being tricked, like the puzzle was a prank on me. Leaves a real sour taste, especially being the last puzzle of this year's AoC.

    #AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day12 #Day12 #Rust #RustLang #Programming #CodingChallenges #AoC #AoC2025 #AoC2025Day12

  7. I finished day 5 part 1 of in . I wanted to use a big set of integers for the fresh ingredients and check for membership, but the range was too large for the interpreter to handle. I also explored expanding and coalescing ranges, but in the end didn't need to implement it.

  8. I implemented day 4 part 2 of . I refactored the day 4 part 1 code to use directly in the part 2 solution. I learned how to replace characters within strings, i.e. create a new string with slices of the original and the character you want in the particular position.

  9. I solved day 4 part 1 of . My algorithm to find neighbors was good, and my counting was good, but my result was too high. Eventually I figured it out

  10. I finished day 3 part 2 of . I came up with a nice recursive solution with a little optimization.

  11. CW: Advent of Code Solution - Day 7 (Nim)

    I'm so glad I'm writing the solutions in both #nim and Python because I tend to find ways to improve the Python solution with the Nim one and vice versa. Today was one of those days. The biggest thing I learned though is that solving these damned puzzles exhausted will never lead to good things quality-wise.

    Solution: git.jamesthebard.net/jweatherl

    #aoc #aoc2025 #adventofcode #adventofcode2025 #programming #nim

  12. CW: Advent of Code Solution - Day 6 (Nim)

    This one took a smidge more thought as I can't abuse `zip` to rotate 2D sequences. However, just rewrote the rotation as a proc and used that. Instead of `reduce`, it was all `foldl`, and I fought with `char` vs `string` due to some of the processing operations between the normal and cephalopod problem processing.

    Overall, definitely a fun solve.

    Solution: git.jamesthebard.net/jweatherl

    #aoc #aoc2025 #adventofcode #adventofcode2025 #programming #nim

  13. The Advent of Code 2025 Pregame Show

    Cameron Cunning and Juan Vazquez rejoin the podcast to discuss our approaches to the forthcoming Advent of Code 2025 coding competition in December.

    #rust #elixirlang #dlang #Aoc2025 #AdventOfCode #programming

    straypointers.com/e/s3e11.htm

  14. The Advent of Code 2025 Pregame Show

    Cameron Cunning and Juan Vazquez rejoin the podcast to discuss our approaches to the forthcoming Advent of Code 2025 coding competition in December.

    straypointers.com/e/s3e11.htm

  15. The Advent of Code 2025 Pregame Show

    Cameron Cunning and Juan Vazquez rejoin the podcast to discuss our approaches to the forthcoming Advent of Code 2025 coding competition in December.

    #rust #elixirlang #dlang #Aoc2025 #AdventOfCode #programming

    straypointers.com/e/s3e11.htm

  16. The Advent of Code 2025 Pregame Show

    Cameron Cunning and Juan Vazquez rejoin the podcast to discuss our approaches to the forthcoming Advent of Code 2025 coding competition in December.

    #rust #elixirlang #dlang #Aoc2025 #AdventOfCode #programming

    straypointers.com/e/s3e11.htm

  17. The Advent of Code 2025 Pregame Show

    Cameron Cunning and Juan Vazquez rejoin the podcast to discuss our approaches to the forthcoming Advent of Code 2025 coding competition in December.

    #rust #elixirlang #dlang #Aoc2025 #AdventOfCode #programming

    straypointers.com/e/s3e11.htm