#aoc2025 — Public Fediverse posts
Live and recent posts from across the Fediverse tagged #aoc2025, aggregated by home.social.
-
Juan Vazquez and Cameron Cunning rejoin the show to discuss how we fared with the 2025 Advent of Code competition.
#rust #elixirlang #dlang #Aoc2025 #AdventOfCode #programming
-
Juan Vazquez and Cameron Cunning rejoin the show to discuss how we fared with the 2025 Advent of Code competition.
#rust #elixirlang #dlang #Aoc2025 #AdventOfCode #programming
-
Juan Vazquez and Cameron Cunning rejoin the show to discuss how we fared with the 2025 Advent of Code competition.
#rust #elixirlang #dlang #Aoc2025 #AdventOfCode #programming
-
Juan Vazquez and Cameron Cunning rejoin the show to discuss how we fared with the 2025 Advent of Code competition.
#rust #elixirlang #dlang #Aoc2025 #AdventOfCode #programming
-
Juan Vazquez and Cameron Cunning rejoin the show to discuss how we fared with the 2025 Advent of Code competition.
#rust #elixirlang #dlang #Aoc2025 #AdventOfCode #programming
-
and day 12, done.
Which means: 524* total, done for the yeah before Christmas (that was touch and go for a minute there), wooo!
https://github.com/Balise42/AoC2025/blob/main/day12.py for the last one
-
and day 12, done.
Which means: 524* total, done for the yeah before Christmas (that was touch and go for a minute there), wooo!
https://github.com/Balise42/AoC2025/blob/main/day12.py for the last one
-
PHEW. Advent of Code day 10b is done.
this was painful and this is ugly af, but THERE.
-
PHEW. Advent of Code day 10b is done.
this was painful and this is ugly af, but THERE.
-
With a little bit of delay because of vacation, but here we go! #adventofcode #aoc2025
-
With a little bit of delay because of vacation, but here we go! #adventofcode #aoc2025
-
I just completed "Lobby" - Day 3 - Advent of Code 2025 #AdventOfCode #aoc2025 https://adventofcode.com/2025/day/3
Solution Code => https://github.com/wanderingeek/aoc-2025/blob/main/day3/solution.py
Stacks are the way!
-
I loved this years difficulty in #aoc2025 and that it lasted only 12 days. It needed just the right amount if time investment to stay fun. My only regret is spending hours writing a brute force solution for day 12.
-
and there, day 9 is in the box too: https://github.com/Balise42/AoC2025/blob/main/day09.py
-
and there, day 9 is in the box too: https://github.com/Balise42/AoC2025/blob/main/day09.py
-
All right, I'm on holidays, I'm on a train, it's the correct time to go back to #AdventOfCode that I have left. I'm still missing day 9b and 10b (the former because it's evidently too slow for my limited patience, the latter because I think I now have the right approach but it's either going to be annoying or math-heavy), BUT I went to have a look at 11 as a palate cleanser without much belief and it fell without much issue, so there.
https://github.com/Balise42/AoC2025/blob/main/day11.py -
All right, I'm on holidays, I'm on a train, it's the correct time to go back to #AdventOfCode that I have left. I'm still missing day 9b and 10b (the former because it's evidently too slow for my limited patience, the latter because I think I now have the right approach but it's either going to be annoying or math-heavy), BUT I went to have a look at 11 as a palate cleanser without much belief and it fell without much issue, so there.
https://github.com/Balise42/AoC2025/blob/main/day11.py -
I just completed "Gift Shop" - Day 2 - Advent of Code 2025 #AdventOfCode #AOC2025 https://adventofcode.com/2025/day/2
Solution code here => https://github.com/wanderingeek/aoc-2025/blob/main/day2/solution.py
ALL HAIL REGULAR EXPRESSIONS!
-
I just completed "Gift Shop" - Day 2 - Advent of Code 2025 #AdventOfCode #AOC2025 https://adventofcode.com/2025/day/2
Solution code here => https://github.com/wanderingeek/aoc-2025/blob/main/day2/solution.py
ALL HAIL REGULAR EXPRESSIONS!
-
I finished day 6 part 2 of #aoc2025. 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.
-
I finished day 6 part 2 of #aoc2025. 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.
-
I finished day 6 part 2 of #aoc2025. 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.
-
I finished day 6 part 2 of #aoc2025. 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.
-
I finished day 6 part 2 of #aoc2025. 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.
-
I had fun applying reduce() to lists to solve day 6 part 1 of #aoc2025. I learned about reduce() while porting machine learning code to Linux on IBM Power many years back, but I've seldom used it.
-
I had fun applying reduce() to lists to solve day 6 part 1 of #aoc2025. I learned about reduce() while porting machine learning code to Linux on IBM Power many years back, but I've seldom used it.
-
I had fun applying reduce() to lists to solve day 6 part 1 of #aoc2025. I learned about reduce() while porting machine learning code to Linux on IBM Power many years back, but I've seldom used it.
-
I had fun applying reduce() to lists to solve day 6 part 1 of #aoc2025. I learned about reduce() while porting machine learning code to Linux on IBM Power many years back, but I've seldom used it.
-
I had fun applying reduce() to lists to solve day 6 part 1 of #aoc2025. I learned about reduce() while porting machine learning code to Linux on IBM Power many years back, but I've seldom used it.
-
I finished day 5 part 2 of #aoc2025. 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!
-
I finished day 5 part 2 of #aoc2025. 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!
-
I finished day 5 part 2 of #aoc2025. 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!
-
I finished day 5 part 2 of #aoc2025. 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!
-
I finished day 5 part 2 of #aoc2025. 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!
-
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.
https://github.com/beeb/aoc-2025/blob/main/src/days/day11.rs
-
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.
https://github.com/beeb/aoc-2025/blob/main/src/days/day11.rs
-
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.
https://github.com/beeb/aoc-2025/blob/main/src/days/day11.rs
-
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.
https://github.com/beeb/aoc-2025/blob/main/src/days/day11.rs
-
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.
https://github.com/beeb/aoc-2025/blob/main/src/days/day11.rs
-
I have zero experience with Lua. I'm interested on learning it a bit to see if then I can start tinkering with LÖVE for some video game prototyping.
I'm going to try to run through some of the challenges of Advent of code 2025 to force me to learn the basics. Wish me luck!
-
I have zero experience with Lua. I'm interested on learning it a bit to see if then I can start tinkering with LÖVE for some video game prototyping.
I'm going to try to run through some of the challenges of Advent of code 2025 to force me to learn the basics. Wish me luck!
-
And, also as in the last years, the #aoc2025 puzzles were something happens on a 2d grid were the most enjoyable to me. I just love pushing bolders around, removing paper stacks, walking through labyrinths, … Bonus points if DFS is part of the solution. Looking forward to next year #programming #adventofcode
-
And, also as in the last years, the #aoc2025 puzzles were something happens on a 2d grid were the most enjoyable to me. I just love pushing bolders around, removing paper stacks, walking through labyrinths, … Bonus points if DFS is part of the solution. Looking forward to next year #programming #adventofcode
-
#aoc2025 was as nice as it was the last years. A much beloved throwback to what I learned at some point in university and rarely use in daily work. #programming #adventofcode
-
#aoc2025 was as nice as it was the last years. A much beloved throwback to what I learned at some point in university and rarely use in daily work. #programming #adventofcode
-
CW: Advent of Code 2025 day 12 solution
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
-
CW: Advent of Code 2025 day 12 solution
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
-
CW: Advent of Code 2025 day 12 solution
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
-
CW: Advent of Code 2025 day 12 solution
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
-
CW: Advent of Code 2025 day 12 solution
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