advent_of_ruby 0.3.1 → 0.3.2

data/data/solutions/reddit/ruby/2023/14.yml

@@ -1,13 +1,13 @@
 ---
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdcswsg/
+  :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdcswsg
   :body: |-
     Fun today messing with pattern matching... Partial manual for part 2, but still fast etc.
 
     [Github](https://github.com/careyi3/aoc_2023/tree/master/solutions/14)[Video Walkthrough](https://youtu.be/Ta9mF9YuLBg)
   :replies: []
 - :author: Nnnes
-  :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdbokqb/
+  :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdbokqb
   :body: |-
     No half-punchcard-sized solutions for both parts yet? Here's one
 
@@ -30,7 +30,7 @@
     Here's a drop-in replacement for `f()` that reduces total runtime to under 0.9 seconds: [paste](https://topaz.github.io/paste/#XQAAAQAsAQAAAAAAAAAyGUj/Tv+WAV3g/Epryrh8/EkGcaOk2Vq/TzdNF3JIxxliAwe73NuADxZL1UqbLlDPlP1BSWDzX265F9rQceiT3VKKrtzFhN9hkWUz4uKRVnQjVjpCKH8tY8Wr/O/SEUYEG8n2FVbUu5kXHqJF8e6AzlrpGOvaPDZw+3Dn7PaKB43Uf1qd6KfmhX6hDA/1Ih8giCPGvQs7UaBiguCuIWFDCkdloSHE5qxaFd1VXAASaq+NmGwf/7WTyQA=) — very straightforward; just remembers where the next rock should roll to as it iterates through each line. `.`s get replaced by `nil`s because it's a little faster that way. Converting all the single-character strings to integers to begin with saves another ~10% on runtime.
   :replies: []
 - :author: glebm
-  :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdadna3/
+  :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdadna3
   :body: |-
     Both parts start with `tilt_north` and `north_load` functions:
 
@@ -104,11 +104,11 @@
     https://github.com/glebm/advent-of-code
   :replies:
   - :author: globalreset
-    :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdafdnz/
+    :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdafdnz
     :body: I had no idea lazy enumerations were a thing in Ruby. Love this about AoC, just finding out about unique language features that I wouldn't otherwise see.
     :replies: []
 - :author: globalreset
-  :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdad6l7/
+  :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdad6l7
   :body: |-
     3905/1478
 
@@ -117,34 +117,34 @@
     [github](https://github.com/globalreset/advent_of_code_2023/blob/main/2023/14/solution.rb)
   :replies:
   - :author: e36freak92
-    :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdaf7h4/
+    :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdaf7h4
     :body: I stored cycle start and cycle length, then the result is the load from cycle loop\_start + ((total\_cycles - loop\_start) % loop\_len).
     :replies: []
   - :author: schveiguy
-    :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdag59k/
+    :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdag59k
     :body: |-
       The way to find cycles is to use Floyd's Tortoise and Hare algorithm: [https://en.wikipedia.org/wiki/Cycle\_detection](https://en.wikipedia.org/wiki/Cycle_detection)
 
       That tells you that there _is_ a cycle, and then you need to measure the cycle by running it once.
     :replies:
     - :author: globalreset
-      :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdahfp4/
+      :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdahfp4
       :body: It's hard to figure out how Floyd's applies to these grid states. But I'll chew on this a bit and see if I can make the connection.
       :replies:
       - :author: schveiguy
-        :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdc1k8j/
+        :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdc1k8j
         :body: You compare the entire grid (at least that's what I did). Remember, you are just running the same algorithm, on one grid you run it 2x per step, on the other you run it 1x. then compare at each step and see if they are equal -- this means there's a cycle. It's cheap enough because you are comparing what, like 100 strings? If there wasn't a cycle, yeah, it would be super inefficient, but once you get the cycle, you can stop and skip to the end!
         :replies:
         - :author: globalreset
-          :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdffpla/
+          :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdffpla
           :body: Ah! I get it. Run 2 different grids at different rates until they match let's you skip all the storage, so you're only ever storing one grid for the tortoise rate and one for the hare rate. Thanks for clarifying! That's going to come in handy.
           :replies: []
   - :author: globalreset
-    :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdaez2b/
+    :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdaez2b
     :body: okay, tried what I thought the trick might be and dropped 10 seconds off my runtime. 3 seconds is still pretty slow, but my rock moving is probably not the most efficient solution either.
     :replies: []
 - :author: gurgeous
-  :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdagghb/
+  :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdagghb
   :body: |-
     165/776
 
@@ -153,7 +153,7 @@
     [paste](https://topaz.github.io/paste/#XQAAAQCmAwAAAAAAAAAyGUj/TzqOZqu+85MIr+7I2PN0WUff+HeS/WSf1Fe62O1gtVpl8OjMxtl/mhz9FSocwvtz4RdGpsL1Re/3qZhzm9C3LM7XtpH3TBE91Whglx5p6C36lD9FCX71oyeCcfUQ0nIPQX85mZYeDnmO9pRJ3lS5xFaBMRozGIgacXXv/TS7kWytUCvfMtvJ/nMhTMalZbD21+steDVdBSwziMIX8n+/kJfukSfyHRs+x2B/jUgpeDZ/TluULjsq6RkPkALQ2Vc6twgYgUZvmcDg3+Y3iz5aAupStQHtkxAC8YQOtSe5W3sWEMKvsO31XQH2RZv41gkyn+IiRN00boU5SvRNrKrW0WLfK+SFRzZTP+WLgzHpNQaE+jeEyObrGaNC0kWiPE7oH3TT11GazIZUfEZr6axFqiTpqi6ArDslX5lIrVPmVfytbjQFfV/T+mJHeu4/JgLHwaMoehSjZZsJey/DVwkqdWmfUroBMSQFQMC25UVo30y1dcdOosZGpxPSh4w68w3t/T2K59YyY7yaoJACT7s6iHQZN6rLszUis2aA+2NFhs6Wj1FSohX87BkOADPHsodB+Nsi8erZLeW3apbCKG4PJBc+0f2rR0U=)
   :replies: []
 - :author: p_tseng
-  :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdauk3g/
+  :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdauk3g
   :body: |-
     [Language: Haskell]
 
@@ -164,7 +164,7 @@
     Haskell: [14_parabolic_reflector\_dish.hs](https://github.com/petertseng/adventofcode-hs-2023/blob/master/bin/14_parabolic_reflector_dish.hs)
   :replies: []
 - :author: Symbroson
-  :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdc1uax/
+  :url: https://www.reddit.com/r/adventofcode/comments/18i0xtn/2023_day_14_solutions/kdc1uax
   :body: |-
     Nothing special from me today I guess
 

data/data/solutions/reddit/ruby/2023/15.yml

@@ -1,13 +1,13 @@
 ---
 - :author: Alkyonios
-  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdjwijt/
+  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdjwijt
   :body: |-
     [Solution](https://topaz.github.io/paste/#XQAAAQBVBwAAAAAAAAAxmwhIY/VDibXTN1fVPjOQKOvNhTjhh6MlGoy6ibz1iEMOgACrQ5UT6jZCV2MNYRyRjfcPzt7zUln0NoxniFxfK850joUc7UXz65mcQykbFCHKmeB61AlecR4ZUlQWWWT5eePwbOgiMawUdgPMHezxMAPYChpDRZ/18RsF1kYif2mAW7rsyEgP+UPKjWdJC74VBzSlGDTZDhK1wqGSa6+uCaZApJ8LmfyHImGYOYTxTLpigPYtwUceSRKpR3dDeKUD2wruV9tPiMV5ffbcH/yeV4AvkxgQ9FzG7L5oiyNhyytH8ZdeM0cekBIaR7UYumuD+8L2UPCvNowUppzTrzaVynz+K89qyeBizCH9TuoMFPt1IccNJbe7rQSH848ec8FniInEUdSImWUpuFG5YWaKLq3JMBCUAnclPMOIxWF8M7F1L5V9AOJP1dT6jiEqejOT/gvuwVUM0lbyUntFRgCnRHBYml7uCGQwlu17rGIO+om4mqhWctvmj7132imC8Ks+zbGeGVhVxfJmZLoY+zWT5Bvn+vbHI/GjUPd9anMiMXU33GDBUnPbUBmgMAxmTXqNbIM08uJCXqYgLk4bfQIJEtKgXiG4jW79DRcvHVo+s3e60h0Z8QFpKUxeqsv6xtdAMY5PGfEoGZaOO7m9jP1c1RJVJXlv9lkaYs2gmZMagoG0d+KQ57epRi88OYvkW5P2SPhOXpssz1jyDH5W+mLF9dcNE1hQocbMkQlhQefFxLiWjGhNPZqay9LsUYpwf+4MMgf0vtLaUDkS9l1bAwLLt67egX7s/0g0nQA=)
 
     It took an embarrasing amount of time to figure out what "relevant box" meant in part 2, otherwise smooth sailing.
   :replies: []
 - :author: SleepingInsomniac
-  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdj3gsa/
+  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdj3gsa
   :body: |-
     [Part 2](https://github.com/SleepingInsomniac/adventofcode2023/blob/master/2023-12-15/part_2.rb)
 
@@ -43,7 +43,7 @@
     Is it cheating to use a hash map in the hash map implementation? haha.
   :replies: []
 - :author: Nnnes
-  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdfzzzq/
+  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdfzzzq
   :body: |-
     Already put up a solution, but this one deserves its own comment
 
@@ -73,7 +73,7 @@
     `.scan` finds all matches of the regex. For example, `"aa=1 aa=2 aa- os=4 aa=6 os=5"` becomes `[["os", "5"], ["aa", "6"], ["os", "5"]]`. `.uniq` preserves order of the first instance of each element, deleting the second `["os", "5"]`, but the first one already has the `"5"` due to the positive lookahead. All the `aa`s before the `aa-` get ignored due to the negative lookahead.
   :replies: []
 - :author: SleepingInsomniac
-  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdfea3e/
+  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdfea3e
   :body: |-
     Part 1 Solution
 
@@ -96,7 +96,7 @@
     ```
   :replies: []
 - :author: Nnnes
-  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdfpx7r/
+  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdfpx7r
   :body: |-
     Easy half-punchcard day again
 
@@ -113,7 +113,7 @@
     - Ruby guarantees Hashes stay in order, so no extra ordering code needed for that part of the problem statement.
   :replies: []
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdg8a2m/
+  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdg8a2m
   :body: |-
     Mercifully easier than the last few days!
 
@@ -122,7 +122,7 @@
     [Video Walkthrough](https://youtu.be/cVG4S9MZ_pg)
   :replies: []
 - :author: Symbroson
-  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdgbuzp/
+  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdgbuzp
   :body: |-
     ```ruby
     input = $<.read.tr("\r\n", '').split(',')
@@ -141,7 +141,7 @@
     ```
   :replies: []
 - :author: RelativeLead5
-  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdgoi4d/
+  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdgoi4d
   :body: |-
     PARTS 1 & 2
 
@@ -177,28 +177,28 @@
     ```
   :replies: []
 - :author: globalreset
-  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdfg60v/
+  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdfg60v
   :body: |-
     This was straight-up a reading comprehension problem. I probably wasted 2 minutes on part 1 because I couldn't accept how easy it was. And another 10 minutes on part 2 because I had no clue what it was trying to say with the boxes and focal lengths. I eventually got there.
 
     [github](https://github.com/globalreset/advent_of_code_2023/blob/main/2023/15/solution.rb)
   :replies: []
 - :author: Unhappy_Adeptness_93
-  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdfk34a/
+  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdfk34a
   :body: |-
     [Github solution](https://github.com/andyAtChime/advent_of_code/blob/solutions-2023/2023/code/day_15.rb)
 
     This was real easy, once I grokked the prompt. Bummed there's no scale problem to solve today, but nbd, off to bed!
   :replies: []
 - :author: gurgeous
-  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdfk8om/
+  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdfk8om
   :body: |-
     Pretty straightforward IMO. Only took a few minutes and got it right on the first try, which is rare for me. Ruby makes these problems real easy.
 
     [paste](https://topaz.github.io/paste/#XQAAAQDwAQAAAAAAAAAyGUj/TxK9OVMABPZ1+6kdVpmDcy636sJnvuQ9xEHSh/N4El930DvPBYXafRaInATDNw2+ta4UMyG+hWEGO6MiAJhm2q6S+1NEgtkb+fLJFq4o5ckQ4k7+Tx+GYY8nM2FwbmHCyI2LkahpnEkJQjXbe0JAuXfY5374G/77MhHYKWaGolc3iin/X3Juh/aZYZM1yZxV1Cvz2xxtcSq4eKaTmn6DShqcO2cSrBb/xY9sMP1AnEqkGoinghLyKAzAAT1/4vuPQgFy2s27VtuA1Mpv5u26wChELg8o3Ugu47DSK01+fv3cj4JOMMIKECz8IhA9gne+/5VybgP0aLo0pUbtPBeA/+2vhcNVnqqACmP67NCHRChqsN083MIUHf1Nec97XNVTlQy3WkYhwyfgDJqT/uSOF1VVjJAZm53mmWj7tQY0dVCP+0JlpA==)
   :replies: []
 - :author: Annual-Management613
-  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdftvfj/
+  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdftvfj
   :body: |-
     ```ruby
     # frozen_string_literal: true
@@ -236,7 +236,7 @@
     ```
   :replies: []
 - :author: stanimirov
-  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdfxje1/
+  :url: https://www.reddit.com/r/adventofcode/comments/18isayp/2023_day_15_solutions/kdfxje1
   :body: |-
     part 1 (76 characters):
 

data/data/solutions/reddit/ruby/2023/16.yml

@@ -1,6 +1,6 @@
 ---
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdn3qv8/
+  :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdn3qv8
   :body: |-
     Simple enough one for today, relatively easy part 2 aswell!
 
@@ -9,42 +9,42 @@
     [Video Walkthrough](https://youtu.be/v6RRjYtKZp0)
   :replies: []
 - :author: gurgeous
-  :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdku2vm/
+  :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdku2vm
   :body: |-
     I had to visualize in order to debug my implementation, as always. Fun vector math in there.
 
     [paste](https://topaz.github.io/paste/#XQAAAQBtAwAAAAAAAAARiAtiSZmv5W81CEWn2ldCAgetNtQcNTWMJW3x9RERU/qSgOgOyl0i2EBY2pG2rjun37SjK/wfQuoGDrY0vbfaYJlby+LJV3hN04Vzt7BkwuWUXe0hvtn0T3oedYSccPBPc/EquONkD0ayk2xic/8FQU+MC9qv0E+H+A8M6MGXUoqY0gQrfBT6DOgx4CYECRm7MuGpsJ2ustySNRuaAJJVmE6bptToK0/b/KwkzChYrUxzjPmNtA4v/zBSykwYkNlu3Yge/12O+TX4VIzwFr/fiovveuMItj/Y3o1TG+d3RemXhHdLHOvjTfeVp+30c7DVWXb9s/p4Ac1KZirbOLMfvuxDk7X+UhZmpObQja54oaxrEtwqykMRsUtaH6TMEm7QT5jf3i7jpopy3RSyzRvZBHBB+H9b/B5zYNA1ULULbgKaLGOtoRdfvPW0yVKtXjzbFAjiCfoYam/x4gsH4FNvam/SHHOwefPJl7+GWMx0RiMtilg2BQ2wlRlKsczt46+ozrHIykZbNF/gvt3eXayEYii3e4LGNdgs2xXTnqw/s6Jjb4nOCnoqHXZ0ycv2auM/Zti9BHDi22aBHX5b2QET/b3OvA==)
   :replies: []
 - :author: globalreset
-  :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdl0q2i/
+  :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdl0q2i
   :body: |-
     Spent so long debugging this. I was immediately very happy with my solution. Short and efficient enough. But I had a bug in part 1 until I figured out that I should start one space off the map for how my routine was written. Then in part 2 it turned out that starting one space off the map made a lot of sense.
 
     [github](https://github.com/globalreset/advent_of_code_2023/blob/main/2023/16/solution.rb)
   :replies: []
 - :author: RelativeLead5
-  :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdmb639/
+  :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdmb639
   :body: |-
     PARTS 1 & 2
 
     [pastebin](https://pastebin.com/E60df0LL)
   :replies:
   - :author: selbysaurus_
-    :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdmvwl4/
+    :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdmvwl4
     :body: How fast was this for part 1?
     :replies:
     - :author: RelativeLead5
-      :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdngqru/
+      :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdngqru
       :body: Around 10-12 milliseconds on my mac m1.
       :replies:
       - :author: selbysaurus_
-        :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdoc3nc/
+        :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdoc3nc
         :body: |-
           Yikes! Mine was taking just over 10 seconds, and after much refactoring I realised the difference was your use of `Set` instead of an array for storing the visited points. One quick change and I'm faster by a factor of 1000.
 
           Time to go and read up about sets, I think!
         :replies:
         - :author: RelativeLead5
-          :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdouu7f/
+          :url: https://www.reddit.com/r/adventofcode/comments/18jjpfk/2023_day_16_solutions/kdouu7f
           :body: Yep, quite the difference and the number of visited nodes isn't even that large but searching arrays is pretty slow.
           :replies: []

data/data/solutions/reddit/ruby/2023/18.yml

@@ -1,6 +1,6 @@
 ---
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/18l0qtr/2023_day_18_solutions/kdxofxy/
+  :url: https://www.reddit.com/r/adventofcode/comments/18l0qtr/2023_day_18_solutions/kdxofxy
   :body: |-
     More or less a day 10 repeat!
 
@@ -9,7 +9,7 @@
     [Video Walkthrough](https://youtu.be/oZDYH-c4_3c)
   :replies: []
 - :author: jstanley0
-  :url: https://www.reddit.com/r/adventofcode/comments/18l0qtr/2023_day_18_solutions/kdxk8y7/
+  :url: https://www.reddit.com/r/adventofcode/comments/18l0qtr/2023_day_18_solutions/kdxk8y7
   :body: |-
     For part 1, I just did a flood fill. I thought "Ordinarily they'd probably say multiply each dig distance by a billion in part 2, but this time there are colors and they're not used in part 1, so they've gotta be involved in the second part!"
 
@@ -29,7 +29,7 @@
     Note that this code processes the part 1 input twice, with the flood fill and the scanning algorithm, as a sanity check.
   :replies: []
 - :author: GMarshal
-  :url: https://www.reddit.com/r/adventofcode/comments/18l0qtr/2023_day_18_solutions/kdv3ktc/
+  :url: https://www.reddit.com/r/adventofcode/comments/18l0qtr/2023_day_18_solutions/kdv3ktc
   :body: |-
     2681/2823
 
@@ -40,7 +40,7 @@
     [part 2](https://gist.github.com/thecog19/64bd518b3c3c9b525f3b705fd1ca58c6)
   :replies: []
 - :author: _tfa
-  :url: https://www.reddit.com/r/adventofcode/comments/18l0qtr/2023_day_18_solutions/kdv3r5y/
+  :url: https://www.reddit.com/r/adventofcode/comments/18l0qtr/2023_day_18_solutions/kdv3r5y
   :body: |-
     (Part 2)
 
@@ -67,7 +67,7 @@
     ```
   :replies: []
 - :author: RelativeLead5
-  :url: https://www.reddit.com/r/adventofcode/comments/18l0qtr/2023_day_18_solutions/kdvvg9u/
+  :url: https://www.reddit.com/r/adventofcode/comments/18l0qtr/2023_day_18_solutions/kdvvg9u
   :body: |-
     Pretty straightforward. I really thought the colors were going to mean something more doing part 1, so I started thinking about how I might generalize for part 2, lol.
 

data/data/solutions/reddit/ruby/2023/19.yml

@@ -1,6 +1,6 @@
 ---
 - :author: _tfa
-  :url: https://www.reddit.com/r/adventofcode/comments/18ltr8m/2023_day_19_solutions/ke5y75c/
+  :url: https://www.reddit.com/r/adventofcode/comments/18ltr8m/2023_day_19_solutions/ke5y75c
   :body: |-
     (Part 2)
 
@@ -37,11 +37,11 @@
     ```
   :replies:
   - :author: craigontour
-    :url: https://www.reddit.com/r/adventofcode/comments/18ltr8m/2023_day_19_solutions/ked1kfe/
+    :url: https://www.reddit.com/r/adventofcode/comments/18ltr8m/2023_day_19_solutions/ked1kfe
     :body: This is what I have been trying to do but couldn't work out how. Good job.
     :replies: []
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/18ltr8m/2023_day_19_solutions/ke2pze2/
+  :url: https://www.reddit.com/r/adventofcode/comments/18ltr8m/2023_day_19_solutions/ke2pze2
   :body: |-
     Fun one today, similar appraoch to contract large numbers using ranges as was used in a previous solution this year.
 
@@ -50,7 +50,7 @@
     [Video Walkthrough](https://youtu.be/ck-owPcU5pA)
   :replies: []
 - :author: grimlyforming
-  :url: https://www.reddit.com/r/adventofcode/comments/18ltr8m/2023_day_19_solutions/ke2bt2u/
+  :url: https://www.reddit.com/r/adventofcode/comments/18ltr8m/2023_day_19_solutions/ke2bt2u
   :body: |-
     I know an instruction-set emulation with conjunction/disjunction problem when I see it, but I needed about 2 hours to figure out what to do. The key insight came when I jotted down the constraints, hoping for an inductive epiphany.
 
@@ -75,7 +75,7 @@
     https://pastebin.com/rn1VWhG4
   :replies: []
 - :author: GMarshal
-  :url: https://www.reddit.com/r/adventofcode/comments/18ltr8m/2023_day_19_solutions/ke06v22/
+  :url: https://www.reddit.com/r/adventofcode/comments/18ltr8m/2023_day_19_solutions/ke06v22
   :body: |-
     1855/1545
 
@@ -84,7 +84,7 @@
     A pretty neat solution involving range math. Its very verbose but I like that its understandable. Essentially each \> or \< is a split operation that divides the range.
   :replies: []
 - :author: globalreset
-  :url: https://www.reddit.com/r/adventofcode/comments/18ltr8m/2023_day_19_solutions/ke0czap/
+  :url: https://www.reddit.com/r/adventofcode/comments/18ltr8m/2023_day_19_solutions/ke0czap
   :body: |-
     I nearly leapt from my chair when my part 2 worked first try (well, after it parsed cleanly). Skimming around here, I worry I might've over-complicated it, but I went with a DP-like solution where I explored every path that got me to an A, trimming down my 'xmas' ranges as I passed through each piece of each rule. And it came out pretty readable for me, so I'm happy with it.
 

data/data/solutions/reddit/ruby/2023/20.yml

@@ -1,6 +1,6 @@
 ---
 - :author: RelativeLead5
-  :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke9prw0/
+  :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke9prw0
   :body: |-
     Parts 1 & 2
 
@@ -9,7 +9,7 @@
     Thanks to everyone for the hints on Part 2. I left part 2 running while I was gone for a couple of hours and when it wasn't done when I came back, the head scratching began.
   :replies: []
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke7jig8/
+  :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke7jig8
   :body: |-
     Fun one today, lcm for the win (again)!!
 
@@ -18,14 +18,14 @@
     [Video Walkthrough](https://youtu.be/yjPjLHpHbnk)
   :replies: []
 - :author: globalreset
-  :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke5i6ni/
+  :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke5i6ni
   :body: |-
     I'm a SystemVerilog RTL designer who works with flip flops all day and I had a hell of a time parsing this description in part 1. For part 2, I just let a (0..).find loop run while I thought about it and deconstructed the circuit on paper. Saw that there was a conjunction on 'rx', so immediately started throwing in debug to see how how often the inputs to that conjunction were toggling. Thank Zeus for Ruby's built-in LCM. In the end, I'm really happy with how simple the code came out for this.
 
     [github](https://github.com/globalreset/advent_of_code_2023/blob/main/2023/20/solution.rb)
   :replies:
   - :author: PillarsBliz
-    :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke5vdbi/
+    :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke5vdbi
     :body: |-
       I'm a computer engineer, have messed with NAND gates and flipflops through my life / school, and I feel like it made the problem harder for me.
 
@@ -34,18 +34,18 @@
       And 2, even if 4 pulses are simultaneously generated for a NAND gate, the output pulses 4 times, NOT once. I was just simulating the entire circuit at once and it took me forever to catch this.
     :replies:
     - :author: globalreset
-      :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke6vbm3/
+      :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke6vbm3
       :body: I agree that having an understanding of how flops work probably did make this harder. I don’t think I had any multiple driver issues on my flops. But I did have that exact same problem of waiting on the “final” state of each flop after a button push. For part 1, my pulse counter was counting every pulse it processed in one of two buckets. So for part 2, I just modified my pulse counter to keep a record of high/low pulses received at each node, then waited for at least one low pulse on the flops that fed the last conjunction. I still wasn’t sure this was going to result in all the flops being the right state for the conjunction to change (what if the lcm got one of the 4 to an odd state and the rest of the 4 to an even state). I thought I was still going to have work to do, but nope.
       :replies:
       - :author: PillarsBliz
-        :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke6zkrq/
+        :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke6zkrq
         :body: |-
           I ended up making an input queue for every gate input, but that felt really dirty.
 
           I saw someone else made a general FIFO pulse array, just processing one at a time, which was probably a cleaner idea.
         :replies:
         - :author: globalreset
-          :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke71sl6/
+          :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke71sl6
           :body: |-
             The general fifo is what I did. I think the “button push” function could hardly be simpler than this:
 
@@ -73,7 +73,7 @@
             ```
           :replies: []
 - :author: Symbroson
-  :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke6jmc1/
+  :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke6jmc1
   :body: |-
     Ugly, [but works](https://github.com/alex-Symbroson/Advent-of-Code/blob/master/2023%2F20.rb)
 
@@ -82,7 +82,7 @@
     I was confused at first because the first cycle where all of the switches that trigger the node before rx was one lower than the rest of the looping cycles. Thats why I initially tried to use chinese reminder theorem to calculate lcm with offset but that wasn't the answer. Probably just a mistake caused by a wrong start offset so it detects the loop at the third cycle.
   :replies: []
 - :author: JelloRough
-  :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke5jsj9/
+  :url: https://www.reddit.com/r/adventofcode/comments/18mmfxb/2023_day_20_solutions/ke5jsj9
   :body: |-
     Because I don't see other Ruby solutions here is the [paste]([https://raw.githubusercontent.com/hugomosh/adventura-de-codigo/sandbox/2023/day20.rb](https://raw.githubusercontent.com/hugomosh/adventura-de-codigo/sandbox/2023/day20.rb))
 

data/data/solutions/reddit/ruby/2023/21.yml

@@ -1,6 +1,6 @@
 ---
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/18nevo3/2023_day_21_solutions/keh3elw/
+  :url: https://www.reddit.com/r/adventofcode/comments/18nevo3/2023_day_21_solutions/keh3elw
   :body: |-
     Very slow second part, but works, the maths trick for part 2 threw me for a loop!
 
@@ -9,7 +9,7 @@
     [Video Walkthrough](https://youtu.be/99Mjs1i0JxU)
   :replies: []
 - :author: kateba72
-  :url: https://www.reddit.com/r/adventofcode/comments/18nevo3/2023_day_21_solutions/kebuguk/
+  :url: https://www.reddit.com/r/adventofcode/comments/18nevo3/2023_day_21_solutions/kebuguk
   :body: |-
     [Source](https://github.com/Kateba72/advent_of_code/blob/main/aoc/y2023/d21.rb)
 
@@ -50,11 +50,11 @@
     And after ~3 hours, I eliminated the last off-by-one error and got the correct solution
   :replies:
   - :author: Draco18s
-    :url: https://www.reddit.com/r/adventofcode/comments/18nevo3/2023_day_21_solutions/kec8yj3/
+    :url: https://www.reddit.com/r/adventofcode/comments/18nevo3/2023_day_21_solutions/kec8yj3
     :body: I ended up with a very similar diagram in [my own doodly notes](https://github.com/Draco18s/Advent-of-Code-2023/blob/main/Day21.cs#L276).
     :replies: []
 - :author: Symbroson
-  :url: https://www.reddit.com/r/adventofcode/comments/18nevo3/2023_day_21_solutions/kebeey6/
+  :url: https://www.reddit.com/r/adventofcode/comments/18nevo3/2023_day_21_solutions/kebeey6
   :body: |-
     Executes in ~1.5 seconds. [link to solution](https://github.com/alex-Symbroson/Advent-of-Code/blob/master/2023/21.rb)
 
@@ -63,7 +63,7 @@
     Optimized the time by adding a cache, because each step with the same parity can be calculated from the previous step with the same parity, plus the new steps. So we only need to re-calculate the current unvisited positions.
   :replies:
   - :author: Symbroson
-    :url: https://www.reddit.com/r/adventofcode/comments/18nevo3/2023_day_21_solutions/keboy52/
+    :url: https://www.reddit.com/r/adventofcode/comments/18nevo3/2023_day_21_solutions/keboy52
     :body: |-
       I was able to optimize the quadratic formula by solving the quadratic formula equation system for `x = [-1, 0, 1]`, basically walking back in history. Halved execution time to about `650ms`
 

data/data/solutions/reddit/ruby/2023/22.yml

@@ -1,6 +1,6 @@
 ---
 - :author: globalreset
-  :url: https://www.reddit.com/r/adventofcode/comments/18o7014/2023_day_22_solutions/kefyqao/
+  :url: https://www.reddit.com/r/adventofcode/comments/18o7014/2023_day_22_solutions/kefyqao
   :body: |-
     Nice straight-forward one after yesterday's. For part 1, I created a collection of all the brick coordinates and then populated a grid to help with collision detection. Falling was just iterating through all of the bricks (sorted by the lower z value) and checking if the next z coordinate down was empty and moving the brick if not. Then I made two hashes, one to store all bricks above and another for below. I was surprised how fast the part 2 ran, I was expecting that a bfs per brick would've been a time sink.
 
@@ -22,7 +22,7 @@
     [github](https://github.com/globalreset/advent_of_code_2023/blob/main/2023/20/solution.rb)
   :replies: []
 - :author: '0x623'
-  :url: https://www.reddit.com/r/adventofcode/comments/18o7014/2023_day_22_solutions/kefrpta/
+  :url: https://www.reddit.com/r/adventofcode/comments/18o7014/2023_day_22_solutions/kefrpta
   :body: |-
     Bit manipulation
 

data/data/solutions/reddit/ruby/2023/23.yml

@@ -1,6 +1,6 @@
 ---
 - :author: baseballlover723
-  :url: https://www.reddit.com/r/adventofcode/comments/18oy4pc/2023_day_23_solutions/kgdwvdw/
+  :url: https://www.reddit.com/r/adventofcode/comments/18oy4pc/2023_day_23_solutions/kgdwvdw
   :body: |-
     : [Github](https://github.com/baseballlover723/advent-of-code/blob/master/2023/ruby/).
 

data/data/solutions/reddit/ruby/2023/25.yml

@@ -1,6 +1,6 @@
 ---
 - :author: kateba72
-  :url: https://www.reddit.com/r/adventofcode/comments/18qbsxs/2023_day_25_solutions/keucgrf/
+  :url: https://www.reddit.com/r/adventofcode/comments/18qbsxs/2023_day_25_solutions/keucgrf
   :body: |-
     I had a blast today. This summer, I had a lecture on flow algorithms, which included an algorithm for finding a minimum cut. So, I took this opportunity to revise my knowledge and implement a flow algorithm for the first time.
 

data/data/solutions/reddit/ruby/2024/01.yml

@@ -1,13 +1,13 @@
 ---
 - :author: HAEC_EST_SPARTA
-  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/m0c0fmv/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/m0c0fmv
   :body: |-
     [Solution on sourcehut](https://git.sr.ht/%7Eawsmith/advent-of-code/tree/2024-ruby/item/lib/day01.rb)
 
     Using Ruby for this problem almost felt like cheating: between `Array#transpose` and `Enumerable#tally`, I barely had to write any code of my own :) My Ruby is definitely a bit rusty, so this was a nice opportunity to review those classes' interfaces in preparation for future days.
   :replies: []
 - :author: el_daniero
-  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzvccp8/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzvccp8
   :body: |-
     > This looks like a job for ... [Trans Pose](https://ruby-doc.org/3.3.6/Array.html#method-i-transpose)! :)
 
@@ -25,7 +25,7 @@
     ```
   :replies: []
 - :author: riffraff
-  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lztxpm4/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lztxpm4
   :body: |-
     7062/1094 I could have made it to the first 1k if I didn't have to help my wife with something between the two parts :D
 
@@ -56,7 +56,7 @@
     edit: usual complaint, I hate that ruby's `Array#zip` with a block returns `nil`
   :replies: []
 - :author: FCBStar-of-the-South
-  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzx6a3o/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzx6a3o
   :body: |-
     ```ruby
     lines = File.readlines('input1.txt', chomp: true)
@@ -87,7 +87,7 @@
     My very first Ruby script, critiques more than welcome!
   :replies: []
 - :author: Sharparam
-  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lztwobe/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lztwobe
   :body: |-
     ```ruby
     left, right = ARGF.readlines.map(&:split).map { _1.map(&:to_i) }.transpose
@@ -98,7 +98,7 @@
     Initially had a small bug in my part 2 with using `find` instead of `count`, I blame sleep deprivation!
   :replies: []
 - :author: The_Jare
-  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzufxbj/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzufxbj
   :body: |-
     ```ruby
     l1, l2 = ARGF.each.map(&:split).transpose.map {|x| x.map(&:to_i).sort }
@@ -107,7 +107,7 @@
     ```
   :replies: []
 - :author: glebm
-  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzunulz/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzunulz
   :body: |-
     ```ruby
     lists = $<.map { _1.scan(/\d+/).map(&:to_i) }.transpose
@@ -122,15 +122,15 @@
     ```
   :replies:
   - :author: stellar_opossum
-    :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzuqguv/
+    :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzuqguv
     :body: "`left_element * right_list.count(left_element)`. Now that's `lazy`"
     :replies:
     - :author: glebm
-      :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzuzfy6/
+      :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzuzfy6
       :body: That's quadratic, you're making the computer do all the work, so inconsiderate!
       :replies: []
 - :author: vinc686
-  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzusygn/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzusygn
   :body: |-
     https://github.com/vinc/advent-of-code
 
@@ -149,11 +149,11 @@
     ```
   :replies: []
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzut10v/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzut10v
   :body: "[https://github.com/careyi3/aoc\\_2024/tree/master/solutions/1](https://github.com/careyi3/aoc_2024/tree/master/solutions/1)"
   :replies: []
 - :author: Cheswick32
-  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzw82qi/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzw82qi
   :body: |-
     The first day always feels like a test of "So how much thought we putting into running this thing?".
 
@@ -162,7 +162,7 @@
     [Paste](https://topaz.github.io/paste/#XQAAAQA1BQAAAAAAAAA5GUqKNoFH6SMqgz5/p0SQOJLmsq1ZB0a/1piD4YtOTl2yryMSPb8yt+HzPgs17kMK3qa5Pt4XB0i+P157YAYOjqPnnUayVBdNcP2YpHcA4r3Y+MR8fkwdqbk0WawDRDBeQKH/SQvLD4n5TgrbeiQ/D4eTIWxM62dZwygva6quKx2/9Uyy7AZBhywh5jp5z5L03KUMCcbXBCpAj7raYZaeBrU/ABVkIUOL4vo5b26uNY8YphcqbCWnmSktj3KUqxUFxqRzk1tnEawkklHFBTy9qP7wRZSC7ZAPqxZpAvJgqUWsz3nPJSNOmGSUj8xIst85XDJv1YojTeG6YIGzJCIsFTvmpE++CfYzEmsCjhct2EAixl3SPSOSJmpjNa1T7ojdJeZLsdzM19XbycmPJ1ndMUeJMsA0KZu7dZZZuW1M+jC4icyESt5m7D4lUJdHy4SPrzgI9C1SUxkM13YNcnGA8UPyqOXtespj1ltgM1AnHpKbkuEoETy/LRGGPuEH4K5dfGGFlb9jRS9NPe1ix5HeQdoEwYHbPFU/mH/odgPP6//lQ3jvSbqkxxTaKRvMvmEWWGmmBUSbmwvpTjtlnPr7YEar767MJoAONUBzHxY67Nu4zXlVVfnzfKQHT/CXvARSNBZJf8EkJStTB507isAwz9wFlZUxZ9uPXyS7BG6asaHjPmVHW+wmSTgnPFkGiZXeusyi44je3g0cEEZXA5kbKyBwN7Nip79YTaNDAcPrqUUeJzPY1L/gdZhIKi3vS6QK8+V2rx0g6xcR6uEO+82kf01Aw8hO3CdDAwr9pwqNBYgBGZYuoaraAD6DppkjnyOH/mo9RA==)
   :replies: []
 - :author: zaniwoop
-  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzwfu9m/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzwfu9m
   :body: |-
     ```ruby
     # part 1
@@ -187,7 +187,7 @@
     ```
   :replies: []
 - :author: Robowiko123
-  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzwhsbr/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzwhsbr
   :body: |-
     ```ruby
     # Part 1
@@ -198,6 +198,6 @@
     ```
   :replies:
   - :author: vmaskmovps
-    :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzxkt83/
+    :url: https://www.reddit.com/r/adventofcode/comments/1h3vp6n/2024_day_1_solutions/lzxkt83
     :body: Check your post, right now everything is a code block, including the Language header
     :replies: []