Search
1000 results for “davemq”
-
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!
-
I solved day 4 part 1 of #aoc2025. My algorithm to find neighbors was good, and my counting was good, but my result was too high. Eventually I figured it out
-
I finished day 3 part 2 of #AdventOfCode2025. I came up with a nice recursive solution with a little optimization.
-
@darth_hideout It would be a way to learn all about ActivityPub and how to search older Mastodon posts. Hmm. #HangTrek #SalaccPit #startrekgifs
-
@darth_hideout It would be a way to learn all about ActivityPub and how to search older Mastodon posts. Hmm. #HangTrek #SalaccPit #startrekgifs
-
@darth_hideout It would be a way to learn all about ActivityPub and how to search older Mastodon posts. Hmm. #HangTrek #SalaccPit #startrekgifs
-
@darth_hideout It would be a way to learn all about ActivityPub and how to search older Mastodon posts. Hmm. #HangTrek #SalaccPit #startrekgifs
-
@darth_hideout It would be a way to learn all about ActivityPub and how to search older Mastodon posts. Hmm. #HangTrek #SalaccPit #startrekgifs