advent_of_ruby 0.3.1 → 0.3.2

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

@@ -1,6 +1,6 @@
 ---
 - :author: yourparadigm
-  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m0zmy7o/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m0zmy7o
   :body: |-
     767/751
 
@@ -9,11 +9,11 @@
     [Github](https://github.com/phene/advent-of-code/blob/main/2024/08/8.rb)
   :replies:
   - :author: FCBStar-of-the-South
-    :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m0zs1g0/
+    :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m0zs1g0
     :body: Ah this is a nice implementation. I should've thought about passing the range of search as a parameter instead of just duplicating my part 1 code with some extra logic haha
     :replies: []
 - :author: NullT3rminated
-  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m0zn5lg/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m0zn5lg
   :body: |-
     1460/1044
 
@@ -22,15 +22,15 @@
     perhaps the worst code I've ever written. But it works.
   :replies:
   - :author: yourparadigm
-    :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m0znay2/
+    :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m0znay2
     :body: Fellow fan of `Array#permutation` I see! Could have just used `Array#combination`, though.
     :replies:
     - :author: NullT3rminated
-      :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m0znlsy/
+      :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m0znlsy
       :body: I think they should add `Array#digg` to the standard library
       :replies: []
 - :author: _tfa
-  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m10ymdx/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m10ymdx
   :body: |-
     ```ruby
     input = File.read("input.txt").split("\n")
@@ -69,18 +69,18 @@
     ```
   :replies:
   - :author: Ill_Information_9522
-    :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m1b1zz8/
+    :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m1b1zz8
     :body: I've been using your complex number trick for grids... thanks again, works like a charm! Need to catch up on your solutions after spending the last day catching up myself on the puzzles. How much harder will it get? :p
     :replies: []
 - :author: FCBStar-of-the-South
-  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m0zrsv3/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m0zrsv3
   :body: |-
     [paste](https://topaz.github.io/paste/#XQAAAQCWBwAAAAAAAAA5GUqKNoFH9WVqAtfQAlEIpeJL/pI3jz8l8zNIKbgBcDs8e/jkEufM3yoDFdhZ+yEf8qLEaYbQkVMczFDglBo54Df7x04iyapFESymP4RpA8pK7/Oo81GULm0seNo4p2lgswLwoNgGrdZhMabcEyYWZIT4KUpQErXdOPoKse6pKtT3JZL0rB1tPM2EkwStv2DpPpJo+GKSP9yHTrSm9ZneZ+KYGmUTRxErhBtg93jpclModLhQSpnwYneVUFMFQiCrkqDGmefi8uKhKQ88epNB0Tncu4DKTPI8YoXaPXuHPsbsntKZGWQaj7wAXSBNEMAf9DV6sn5/VtUy6wrVNIHfnJFjsNXb7+T5Y76WZ0sC1cSadqiooQ6syScsmSrKQ3nxYn0uSWlZzv2DILX4sEXAosmJXvjRGXdMlynUjmqvxz7XMi6vvhpvcf7gTbUIckFKkEV1PDWV+U91MaX4ZgkX13RB8RIRsbrA2m4/1WtjB9ymoJd+5QzhxwTyYsRXg4+S1l8rb4n5oa3p8S5HB+PekoacUxxCnMdFGEBR+e+dkcKd/Boqm788e+/5YS6p19zjz0UIweVnSOOSGO7VJoTmWeKQI9kI7g4/y+jfN4ThSSz3cJVxbw9Trl6Zt/At5DRknhmggN3EIev3B/11n0YEgQ6U/t3/OsBHvlh4DXMxjcYL0HlqvNy2QdAlPNHuFd9bCKsELx3HpPjRg7YsIASS01aViLS3PEsi4cYg/ldcZgIHNYE09pTe5EMBnvGL4BTGlSvDc7zqy1HM7PUCGxywfdCeH57c8n+C3HfE8lRLT3f/EkIJNkE+MCtBaC2KBBGJO9P+gYOQVjaVf+X5Ujf05SsiIUbPSnOV0xPZ6i9J/+v5axI=)
 
     Abuse of Ruby map and not my proudest code
   :replies: []
 - :author: alexbaguette1
-  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m0zsyz0/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m0zsyz0
   :body: |-
     Suprised it worked this easily.
 
@@ -91,7 +91,7 @@
     [Part 2](https://topaz.github.io/paste/#XQAAAQBaAgAAAAAAAAA5GUqKNoFH6SMqoVC09YUYpRrZq3oCFpfxXu9nP0lKhMM6pt8OBX3NbPRuatlL47kGgI+ZTKskiShBT3sxm24XXUTwUH9yfPPOQGUeUudn/tXPSUVxzv9ThJ5G/RRixgnwBWorLUqr1mm99Ia1IzKBJTQyDdXDkIePw1MRehVyM+daRqSRKfiVxilt2RkzP3lWzxE1uaql2iSOyz40jXQsa6h+btA4+MX2s/vTr3Gi3emXq9WNzcpGDbecGD0QnDECukkKO206GNETwJaH60N6ilAoUmk/BHSxCUFHjtX1+jcMCE1Odp/zGCV8OitbdBRgy6WB881aE0qXcq5LZ7rgrEUeaE7HSyJV+ryMwNWqqXdpR9FTHdn/mDvbtFVS7xh6J2pg3YXAc4T3qR72QURNe+3JNGbKSBUlQqlsk6SvDsOBvV3fpotIxajopInM2QHToU1ozeC1Seqfg/7eXukKhqjbb5BqmZEhAP/4Ehvh)
   :replies: []
 - :author: el_daniero
-  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m10n7o3/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m10n7o3
   :body: |-
     ```ruby
     input = File.readlines('input08.txt').map(&:chomp)
@@ -127,11 +127,11 @@
     ```
   :replies: []
 - :author: Stronbold
-  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m11b8pf/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m11b8pf
   :body: "[Solution](https://github.com/Alvaro-Kothe/Advent-of-Code/blob/main/2024/day08.rb)"
   :replies: []
 - :author: fredster231
-  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m11jdl1/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m11jdl1
   :body: |-
     Full code: https://gist.github.com/scockram/7749109cfd64074051dd33b69817222d
 
@@ -153,14 +153,14 @@
     ```
   :replies: []
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m11vdbe/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m11vdbe
   :body: |-
     Took longer to code this than I thought, but it was pretty straight forward, my initial instinct worked perfectly and the change for part 2 was trivial. Manhatten distance and some algebra. Solution runs in a few milisecond.
 
     [https://github.com/careyi3/aoc\_2024/tree/master/solutions/8](https://github.com/careyi3/aoc_2024/tree/master/solutions/8)
   :replies: []
 - :author: globalreset
-  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m104v61/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m104v61
   :body: |-
     Pretty straightforward one today but I got hit hard by reading comprehension. I totally missed that the antennas themselves became antinodes in part 2. After I was done I went back and tightened my code up and realized this whole thing becomes really simple if you represent the x,y coordinates as complex numbers.
 
@@ -179,7 +179,7 @@
     [github - solution](https://github.com/globalreset/advent_of_code/blob/main/challenges/2024/08/solution.rb)
   :replies: []
 - :author: RivtenGray
-  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m10dpu8/
+  :url: https://www.reddit.com/r/adventofcode/comments/1h9bdmp/2024_day_8_solutions/m10dpu8
   :body: |-
     [Github](https://github.com/rivten/aoc-2024/blob/main/08/rivten/08.rb)Learning Ruby for this year's AoC, I like how I get more comfortable with Ruby and the code is reducing in size while keeping clarity (or so I think !)
 

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

@@ -1,10 +1,10 @@
 ---
 - :author: FCBStar-of-the-South
-  :url: https://www.reddit.com/r/adventofcode/comments/1ha27bo/2024_day_9_solutions/m1815dt/
+  :url: https://www.reddit.com/r/adventofcode/comments/1ha27bo/2024_day_9_solutions/m1815dt
   :body: "[paste](https://topaz.github.io/paste/#XQAAAQB1BQAAAAAAAAAyGkrNYxPxU6xvuZs/8lAz4jUZdGtcxCNrBlC+wPZSIDCK+g6seBP+9oUsdbVzJL5ksqfGzfPMJiBUynSKfmWy48YAHBo3XXqY09VJhNgCNrGH4b5VkevJmdwCZ48IvIsCD4C41qLQ4TCOpq4PSwIHaAHcgyjTmp7fXbB6N+JhgKUFq4I+e3H5Tf7IpIqgJYEqikCAW7JZWjcfIcyYtAEpH8Deaa6NOC4yGDlh3SmtkTAi+5I+uhmwsoV/uygBiM5P0xx2DklvGiyGSYUr0LxxZ5ZWgaR6DV8amRFRD1OTMSs0xaCht3gm9f7PbYnsdLS/+AWidd2Vz/yFZFss3oHjCEOTYaneg9x27vCrMcdmCX9k09H/SYEIPZyJpO7og862N0n5XbUIABEmNhEuu/KHiUHRfpJ16RFPsPg0RSxJcQ36bjxRLksZsSNLXZObB2YmiSHqwYWZruEABgOGEjWn1NdF7XwLijc9evs6dadKH+CxIieymrVEpcG51j9+8aES2D5k/gjxtUAChtJsWKJDcv8jdy8KwmpQa+q7dOsRO7hLkUsbkYQnajDl7c9K1mafLwIXXGQHGN3Xs00YOnV7Kd41mqamwyEGLbHV0inapBOBK6ByHN0WH3yfUoE80E25GVeqx2/v/CivLZZ2erhIpXo0OICU+1Az7hJfwpsMOnLKOS53OmBbm0TWYGZoipp6TPapv1pOfzkaKA/4cHnZFAjqrA6c6Mgx//MJAm8=)"
   :replies: []
 - :author: globalreset
-  :url: https://www.reddit.com/r/adventofcode/comments/1ha27bo/2024_day_9_solutions/m17lx73/
+  :url: https://www.reddit.com/r/adventofcode/comments/1ha27bo/2024_day_9_solutions/m17lx73
   :body: |-
     I was really proud of my part 1 approach, even though the code is not very tidy. I never expanded the filesystem but instead calculated the checksum as I go through, alternating between calculating it on a file node from the left and then popping a file off the end and trying to squeeze it into the next free space.
 
@@ -13,20 +13,20 @@
     [github - solution](https://github.com/globalreset/advent_of_code/blob/main/challenges/2024/09/solution.rb)
   :replies: []
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/1ha27bo/2024_day_9_solutions/m18upf8/
+  :url: https://www.reddit.com/r/adventofcode/comments/1ha27bo/2024_day_9_solutions/m18upf8
   :body: |-
     Didn't really enjoy today, but we got it done, brute force with minor optimisations.
 
     [https://github.com/careyi3/aoc\_2024/tree/master/solutions/9](https://github.com/careyi3/aoc_2024/tree/master/solutions/9)
   :replies: []
 - :author: Infinite-Club4374
-  :url: https://www.reddit.com/r/adventofcode/comments/1ha27bo/2024_day_9_solutions/m16d4z9/
+  :url: https://www.reddit.com/r/adventofcode/comments/1ha27bo/2024_day_9_solutions/m16d4z9
   :body: |-
     All of my solutions are super verbose just cuz my mind doesn’t work the same way as some of you folks but idc I’m completing them and I’m pretty happy about that
 
     https://github.com/Leftyxiv/advent_of_code/blob/main/2024/day9/day9.rb
   :replies: []
 - :author: Stronbold
-  :url: https://www.reddit.com/r/adventofcode/comments/1ha27bo/2024_day_9_solutions/m16xzes/
+  :url: https://www.reddit.com/r/adventofcode/comments/1ha27bo/2024_day_9_solutions/m16xzes
   :body: "[Solution](https://github.com/Alvaro-Kothe/Advent-of-Code/blob/main/2024/day09.rb)"
   :replies: []

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

@@ -1,6 +1,6 @@
 ---
 - :author: Sharparam
-  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1bi93k/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1bi93k
   :body: |-
     ```ruby
     require 'matrix'
@@ -37,7 +37,7 @@
     Today felt quite easy, probably because this type of problem has occurred several times in years past.
   :replies: []
 - :author: riffraff
-  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1bxurp/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1bxurp
   :body: |-
     Reused once more my grid class to get neighbors. I misunderstood part 1 and solved it as part1, so it took nothing to to part2 after I finally did part1 :D
 
@@ -68,7 +68,7 @@
     ```
   :replies: []
 - :author: globalreset
-  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1bgwpx/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1bgwpx
   :body: |-
     Man, I was feeling good about this one. Thought I went so fast. I accidentally got the sample data result for part 2 while I was doing part 1 because I forgot to check my 'visited' set. So just had to comment out that line and part 2 was correct on first try. About a minute between part 1 completion and part 2.
 
@@ -103,15 +103,15 @@
     ```
   :replies: []
 - :author: _tfa
-  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1cnys0/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1cnys0
   :body: "[https://gist.github.com/thofoer/88bb2c1308a3beb5f822229c999bcd73](https://gist.github.com/thofoer/88bb2c1308a3beb5f822229c999bcd73)"
   :replies: []
 - :author: Stronbold
-  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1cpkyf/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1cpkyf
   :body: "[Solution](https://github.com/Alvaro-Kothe/Advent-of-Code/blob/main/2024/day10.rb)"
   :replies: []
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1cvcfo/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1cvcfo
   :body: |-
     Frustrated myself by misreading the problem and overcomplicating it. It was actually a fairly simple recursive path finding algorithm. No real clever optimisations, runs in a few miliseconds.
 
@@ -120,7 +120,7 @@
     [https://github.com/careyi3/aoc\_2024/tree/master/solutions/10](https://github.com/careyi3/aoc_2024/tree/master/solutions/10)
   :replies: []
 - :author: FCBStar-of-the-South
-  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1dok13/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1dok13
   :body: |-
     Yea I fell into the solve part 2 before part 1 trap because I did not read the question carefully. Initial hunch was to BFS from 0s but backtracking from 9s is much easier to implement.
 
@@ -153,7 +153,7 @@
     ```
   :replies: []
 - :author: el_daniero
-  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1du98p/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1du98p
   :body: |-
     I, too, accidentally solved part 2 before part 1.
 
@@ -184,7 +184,7 @@
     ```
   :replies: []
 - :author: Infinite-Club4374
-  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1chhwm/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hau6hl/2024_day_10_solutions/m1chhwm
   :body: |-
     (the%20best%20duh)
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: '442401'
-  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1ll9mf/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1ll9mf
   :body: |-
     Very educational. I enjoyed today's puzzle.
 
@@ -11,7 +11,7 @@
     [paste](https://topaz.github.io/paste/#XQAAAQCmBAAAAAAAAAARiEJHiiMzw3cPM/1Vl+2nyBa63n8Kw3D1UZFlD3WW8r2Z9pYT30X7PnBBcHhvVYDeawoIrg724t03bzRtEFKq3EaQt+aC2nR+OYZ4ictRUUGoc6jrCQVGb7WP1dLwVfa9/LKeRJi29rlBtKwnVWc4lWefLECWCktqIUoW+ZB6J7BaZfFkFGJOzYANtSlttzIq2Iz3IQRjI5tBoZvyQV4GGv8xFfmNYDJ1WTqxTWVl9u3qdRXUZMqzOuXpnmDVL/Zr5MVYGuP/hZwXkjyeLgoyKdhJuSqd6AX2tKF2X8NB49J/pwWJQFdIRRTUbnvgOy/9HZzkTaGEM82pY1TrjjI5DFEtR71rtVFxC0BTqaP0FISfyYxQvXNNssTTo8UUjXn6YqxG1/e7IZVKTJmE89Oy6CT0WlJ2YcsmwxTXyttFrM105lV0LVLtuNp0P8O3Oo2AgFaquxsbphYUoD8Y02TMTlnz17QWll4gWjG1ikQnFa8uJG6+0C7y3KPeNc7DCiTctA3xcnmIq3hKqWwNpfmcPWf7LLmOu9/k9qi4O9yXFOmCz8wmurFjA1Of7IshfqGJK8WrlAuEXStJ/ztkQanjW5vji0h+LSjyqDXXmrAnLJTrSGQLLaHf+/f9sgUhcaOkZAXMS9UIK7GL8HgjL0BnqSnLSF3Rhiu+MZtoMcL9h1ho9znbXq4uUtlrwdeTMe7kUrU2tuL0lz5627dFQ8L+uCP3)
   :replies: []
 - :author: The_Jare
-  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1l8pbn/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1l8pbn
   :body: |-
     I still see very few Ruby solutions, so happy to post mine. It just keeps a hash of different elements and how many of each there are, iterates the hash once per blink. I like this approach more than recursive + memo but I can't say why. I don't know which is faster.
 
@@ -44,18 +44,18 @@
     ```
   :replies:
   - :author: feyn
-    :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1nsg5s/
+    :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1nsg5s
     :body: |-
       > return [vs[...l/2].to_i, vs[l/2..].to_i] if l % 2 == 0
 
       Instead of `vs[...l/2]`, I read it as `vs[...1/2]`. I was so surprised that you can use `1/2` in a range to take half of a string. I tried in in IRB and was sadly dissapointed :D
     :replies:
     - :author: The_Jare
-      :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1o2vrg/
+      :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1o2vrg
       :body: Haha yeah I need to avoid using lowercase L as a single-letter variable even if this case looks oddly appropriate:)
       :replies: []
 - :author: Nnnes
-  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1htopa/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1htopa
   :body: |-
     Took a bit of fiddling but here's a half-punchcard-sized full solution I'm happy with. Credit to /u/AlexTelon for the idea of dealing with the numbers as strings most of the time - my solutions with `Math.log10(n).to_i + 1` or `(d = n.digits.reverse).size` could fit (and ran about twice as fast), but the line breaks were awful.
 
@@ -72,7 +72,7 @@
     - `@c` has about 127k entries when the program is finished. The largest number is 14 digits long, or 46 binary bits.
   :replies:
   - :author: AlexTelon
-    :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1hxyx1/
+    :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1hxyx1
     :body: |-
       Nice one!
 
@@ -81,7 +81,7 @@
       Nice trick with`(..)+` !
     :replies: []
 - :author: el_daniero
-  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1i215l/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1i215l
   :body: |-
     ```ruby
     input = [125, 17]
@@ -110,7 +110,7 @@
     ```
   :replies: []
 - :author: _tfa
-  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1hv9va/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1hv9va
   :body: |-
     ```ruby
     input = File.read("input.txt").split.map{|z| [z, 1]}.to_h
@@ -136,7 +136,7 @@
     ```
   :replies: []
 - :author: FCBStar-of-the-South
-  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1iy63k/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1iy63k
   :body: |-
     ```ruby
     require_relative 'utils'
@@ -174,7 +174,7 @@
     Looked up lantern fish after seeing all the posts referencing it. Looked it up and immediately knew this is the algorithm to go for. It was not obvious that the number of distinct stones scales slowly/converges!
   :replies: []
 - :author: globalreset
-  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1hi4yx/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1hi4yx
   :body: |-
     Wasted a bunch of time memoizing a dfs search before I abandoned it. Even cutting off large paths of the search with the cached counts was killing me in time/space. Then it dawned on me to just operate directly on the cache rather than using the call stack to hold it or an array in memory. This solution runs in 80ms.
 
@@ -200,7 +200,7 @@
     ```
   :replies: []
 - :author: ni3t
-  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1hit82/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1hit82
   :body: |-
     Since we don't get the fancy @cache annotation that pythonistas can use I had to implement it myself:
 
@@ -232,22 +232,22 @@
     ```
   :replies: []
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1i5ox1/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1i5ox1
   :body: |-
     Not too bad today, part 1, simple brute force approach to get the logic correct, second part, recursive solution with caching.
 
     [https://github.com/careyi3/aoc\_2024/tree/master/solutions/11](https://github.com/careyi3/aoc_2024/tree/master/solutions/11)
   :replies: []
 - :author: Stronbold
-  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1ilqae/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1ilqae
   :body: "[Solution](https://github.com/Alvaro-Kothe/Advent-of-Code/blob/main/2024/day11.rb)"
   :replies: []
 - :author: eggselent_folk
-  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1jwn7s/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1jwn7s
   :body: "~200ms for part 2\n\nI spent a lot of time finding optimization because simplest solution for part 1 does not work at all for part 2 \U0001F923\n\nAfter a while, finally I got to\\>!analyzing the pattern and found out it can be memoized.!\\<\n\n```ruby\ninput = '2701 64945 0 9959979 93 781524 620 1'.split(' ').map { |x| x.to_i }\n\n$memoize = {}\ndef blink(num, i)\n  return $memoize[\"#{num}-#{i}\"] if $memoize[\"#{num}-#{i}\"] != nil\n  return 1 if i > 75\n\n  return $memoize[\"#{num}-#{i}\"] = blink(1, i + 1) if num == 0\n\n  len = num.to_s.length\n  if len % 2 == 0\n    return $memoize[\"#{num}-#{i}\"] = blink(num.to_s[0...(len/2)].to_i, i + 1) +\n                                     blink(num.to_s[(len/2)...len].to_i, i + 1)\n  end\n\n  return $memoize[\"#{num}-#{i}\"] = blink(num * 2024, i + 1)\nend\n\ntotal = 0\ninput.each { |num| total += blink(num, 1) }\nputs total\n```"
   :replies: []
 - :author: JAntaresN
-  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1kjzf7/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hbm0al/2024_day_11_solutions/m1kjzf7
   :body: |-
     I treated it like a tree, and did a dfs with memoization, which worked quite well
 

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

@@ -1,42 +1,42 @@
 ---
 - :author: _tfa
-  :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1ttukt/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1ttukt
   :body: |-
     Long and complicated solution, but finally it worked.
 
     [https://gist.github.com/thofoer/fcdda1a0743f193f878590dd9042378f](https://gist.github.com/thofoer/fcdda1a0743f193f878590dd9042378f)
   :replies: []
 - :author: FCBStar-of-the-South
-  :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1rqteo/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1rqteo
   :body: |-
     Not proud of this one. First instinct was to get all the distinct edges and do some sort of union find to collect them into sides. Was annoying to implement with the orientation and stuff. Eventually came to the sub for help and just decided to go with the counting corners and 16 different cases.
 
     [paste](https://topaz.github.io/paste/#XQAAAQALCwAAAAAAAAA5GUqKNoFH9WVqAtfQAlEIpeJL/pI3jz8l8zNIKbgBcDs8fKlEL/CNiVvHcK3eo2f1wG2uFy9c4gJqYPLUFmRQObk0r1ZXyU23Tm34gRt6y0eQyY1K3b+i262JFsBcUTwua3DLm6KTBbQg8CC8Rodb9gL52GlTW0N2qORt7dBV4CwUpm3lLu6RLl1ogK0d63e9tyuueHgAgtxDMoatd9vGGfGZnY21xRp25IJiEMKhh6Ke86I4FrZ8W9A37xgrFUJUloGcNqKnSchj7irMNiXDS00k5w9V9YulY2B59SdWfQ14ghDCtqD3XnYKarwPGUY07fC3AijJRjv8HS3WPreoiuTIRBr7jkEuNp+a5WplzZDFSvUA+SGvi/PwnaD6/ZivkZFvbyeGBve+j0ziP92qTpuA5DmMkD2uZQDd+y2oke9Tk70dnbo77SUwQW4eBW4AHYcFQ9W/I+dsop7XLo3cgYxJyi94YHJA5Vvh7jJXh9FAEoE9lQAeU0T1kuZFrNislGm9IDh1+f9nrO1HUPOnaovDrBljkmE7FeHjbjQHYGpKdAX2cognxu58PU7LwXRVCWlNbGSYa/60kDDAqw2gmNBJ74N2E6qTmkhe3vxmWX628uns27Zsp9WIQBOvdglNCGkAcbq1PLl9zIxjwYDAFZ86ZJXkfMZls0TiaLAN57rItao/tYvm9HaNAkrjlPMvcWl2QbkCPZgFl6j7upXZH8qJjP91A9cMAP6oww0PYbukUe/Oqt4VwubY1JScxdH7567llJM0gBq97AYi6UUUv/BD+crMh2ZoKCP5bR9xMub4YFHsJSbjNk8RfkIHoVa8SVXfWdN5ryqLk0c3iT+FRgTbd3gPOcKMgw35FIsTYCUah2N/Hvi9z6y7yA23tURikbXuDpMuIhiw/4Ve+nGvMGAsL6B/bWYABDb2btKaFeDRO+Yh/AidiuA6GgFTlbpJNkWgooMHH7n6hEs6THsdLxLwM5UpXNxwvD+F2RnUF/HzGFb6R424CjWQCsUzYpFIHF56/3z4m1SKfcODNZH2o13nGEsYhHv3lfuDLZheKTIDtldt0JBcCONc3mGHNCGSuiId8Z2Ue678cKufKm7MfB/0hnlAXs5yF9g3uimDv5ihxe20x1f3z1BKNmvVIUzxquHODfLhkYyLXv36hWmo5kW0841c9eGMdYrA5+P/+ggtgg==)
   :replies: []
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1pa6ug/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1pa6ug
   :body: |-
     Probably the most messy code I've written this year so far for finding side counts for part 2, but aside from that, straight forward version of the "count islands problem", easy solution with recursion. Part 2 usues part 1 as a tool to generate the data to compute the sides. I'm 100% sure there is a better way to do it, but this worked!
 
     [https://github.com/careyi3/aoc\_2024/tree/master/solutions/12](https://github.com/careyi3/aoc_2024/tree/master/solutions/12)
   :replies:
   - :author: Physium
-    :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1zyrxc/
+    :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1zyrxc
     :body: |-
       I just want to say thank you for writing this in ruby. As messy as you think it is, i was able to visualise how you counted sides and implemented a similar approach to you.
 
       You are the only one that use a dfs approach that i could understand and relate to. THANK YOU!
     :replies:
     - :author: careyi4
-      :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m21b5to/
+      :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m21b5to
       :body: Ahh you are very welcome! Glad it helped!!
       :replies: []
 - :author: Stronbold
-  :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1p6fhq/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1p6fhq
   :body: "[Solution](https://github.com/Alvaro-Kothe/Advent-of-Code/blob/main/2024/day12.rb)"
   :replies: []
 - :author: firetech_SE
-  :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1qhvc1/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1qhvc1
   :body: |-
     Spent a lot of time thinking today, but happy to have come up with a solution without using any kinds of hints.
 
@@ -51,14 +51,14 @@
     ^1) ^Using ^Set ^instead ^of ^Array ^for ^quicker ^deletion ^in ^part ^2.
   :replies: []
 - :author: eggselent_folk
-  :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1qtvud/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1qtvud
   :body: |-
     I stored direction of fences (perimeters), and then traverse all perimeters to only increase number of sides once for each continuous perimeters with the same direction.
 
     [CODE](https://topaz.github.io/paste/#XQAAAQABDQAAAAAAAAA0m4poOBCMfthGvIqKnJBTU3eCvWf8e8dOecf0I5sIQTLtbcTd+HjCfYpKjvhIQVogm5aX2yu9Jh6koUIOjZBgppsFea2VpHS3B1Hw1hnHVet4Q3X4nWbYdyk1Fdj8ZETXiirCwsSaIuTtQS2Cf6RQdrrPc4iWsZq9WY0FeWxa7rzevx3vVvzzMvpf/2KddB/dnF3XEfrg4cuVuebBZSYZKbebtS/y84FY5p65+hRuUoOvrLmOYR7pg6ORXwYnidFYSxbwxgpUVMso/ehH87PNgziYVRAtA9wdB5gmqnYjUfSqQZFaoIzNTtofuCZDH1TJo9WkxvGM69CcelhxLB+rJJxQ6SePoEayFUpXcriKQM0ltyuBcXvz3/+RzR8exM577LPyezUWkU4Cdii1RCZDBEyF8VON66xlnjLJv5NVaIxrHTkb78hJZfmwDXudeAFuHMHM9jQ92+7nzRCsQXB/PwgYm0uq4YBiBSHhtg87uXifXW0V8FTlLNbagP1utEZEF2lQ4e6hboWY1roXQO/5G8FSl63dVdp3q4ZXKwxvuFnSYQM0fJWwVqEvT9QF3R1lityGYvuzw9a6/zBP9PEJpzdRYMroDuUQPG0aFRBWPMB7ikXEjZB+4jUC1opmUhNLFtSAUruQL72AcXRvHOYRrUTybUSIXt6U/W6SR6Wk0yXrYNfrL/WVXAcnVto4/BBF8/0Lg7rTuC3QLKjrKXGCRLzgMXM3RRon7IBnoNwzCqlm4HkbrlVvli81Q5gHfOQkREzKdVPJ4oSIvX/2U0NjExT7LYLsXxRMJREGOyKwBQkMBv0oM4wOlbwPStVaEknV7ExY0Wr93Z0bG3MT4bk1a53s7Wj56Ur+F+SvrJe6lXrfls+Ys0ELJy5sroWzwkhqpEv2JCYah+fRN2EYGIsj8K6UCY3SIO4Yt75yMBo6agnqDOkZYH39tERA+ZnB/20hIRR1rNHxNJwqQulaC3N4UtsEfF2Tlyj6gD9NoNrzQz6tAzriYQC3n+ZhkiLFbmROjwXOc8Otnv/F5ge+)
   :replies: []
 - :author: globalreset
-  :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1nplow/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hcdnk0/2024_day_12_solutions/m1nplow
   :body: |-
     I had to get out the old pencil and paper to figure out how to count unique sides of a shape. Happy with this solution. My get\_regions function is basically "go to every (unseen) point and do a bfs for that point's matching neighbors". Used Vector to make stepping in a given direction simple.
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: mpyne
-  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1yfahi/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1yfahi
   :body: |-
     I actually did this in Rust first but I think Ruby makes this pretty elegant in conjunction with a bit of more advanced high school algebra
 
@@ -33,7 +33,7 @@
     ```
   :replies: []
 - :author: Symbroson
-  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1uhhgl/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1uhhgl
   :body: |-
     golfed both parts: 164 bytes
 
@@ -45,7 +45,7 @@
     ```
   :replies: []
 - :author: globalreset
-  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1to61k/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1to61k
   :body: |-
     My strategy started off thinking I was going to do some dynamic programming to get to the result. But I quickly scrapped that and fell on my trusty Z3 solver. Which made part 2 pretty trivial. So after I was done, I went back and re-educated myself about how to solve a system of equations (without a solver!). And Cramer's rule came in handy.
 
@@ -70,7 +70,7 @@
     [github - solution](https://github.com/globalreset/advent_of_code/blob/main/challenges/2024/13/solution.rb)
   :replies: []
 - :author: riffraff
-  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1trx40/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1trx40
   :body: |-
     I initially solved part 1 with brute force, knowing it would not work, then I went straight to Z3 cause I need to save brain cycles for future problems :)
 
@@ -119,7 +119,7 @@
     ```
   :replies: []
 - :author: Sharparam
-  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1u0zjj/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1u0zjj
   :body: |-
     [LANGUAGE: Python]
 
@@ -130,14 +130,14 @@
     But for part 2 that obviously wouldn't work, so I had to switch to Python to get (easy) access to Z3: [[GitHub]](https://github.com/Sharparam/advent-of-code/blob/main/src/2024/13/part2.py)
   :replies: []
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1uaeue/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1uaeue
   :body: |-
     Easy maths today!
 
     [https://github.com/careyi3/aoc\_2024/tree/master/solutions/13](https://github.com/careyi3/aoc_2024/tree/master/solutions/13)
   :replies: []
 - :author: _tfa
-  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1uasny/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1uasny
   :body: |-
     ```ruby
     @input = File.read("input.txt")
@@ -158,14 +158,14 @@
     ```
   :replies: []
 - :author: Stronbold
-  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1ut6aq/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1ut6aq
   :body: |-
     [Solution](https://github.com/Alvaro-Kothe/Advent-of-Code/blob/main/2024/day13.rb)
 
     Solved with linear algebra.
   :replies: []
 - :author: FCBStar-of-the-South
-  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1uz84m/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1uz84m
   :body: |-
     ```ruby
     require_relative 'utils'
@@ -205,7 +205,7 @@
     Sure love when the input is nice to you.
   :replies: []
 - :author: iwanttoseeyourcatpls
-  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1tjnxv/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hd4wda/2024_day_13_solutions/m1tjnxv
   :body: |-
     [github](https://github.com/ggggbbybby/aoc2024/blob/master/day13.rb)
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: JAntaresN
-  :url: https://www.reddit.com/r/adventofcode/comments/1hdvhvu/2024_day_14_solutions/m22vdlg/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hdvhvu/2024_day_14_solutions/m22vdlg
   :body: |-
     [github link](https://github.com/jw-rx-93/advent-of-code-2024/blob/main/day14/day14.rb)
 
@@ -9,21 +9,21 @@
     Part 2, simply using part 1 to brute force until a tree appeared. Honestly all I had to do was look for the trunk, but this required me to know what the tree looked like before hand, so it's a bit cheesing it. Originally I considered looking for a pattern where I would check for a 3, 5, 7 pattern but the trunk approach was easier since it is a simple 3, 3, 3 pattern.
   :replies: []
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/1hdvhvu/2024_day_14_solutions/m21yspj/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hdvhvu/2024_day_14_solutions/m21yspj
   :body: |-
     Fun simulation code, but the second part got me a little bit. Then I decided to dump 10000 iterations of ascii terminal vis into a text file. ctrl-f for a long chain of '#' characters, found it and had the iterations also dump into the file above each frame. Very silly solution but worked!
 
     [https://github.com/careyi3/aoc\_2024/tree/master/solutions/14](https://github.com/careyi3/aoc_2024/tree/master/solutions/14)
   :replies: []
 - :author: '442401'
-  :url: https://www.reddit.com/r/adventofcode/comments/1hdvhvu/2024_day_14_solutions/m211gxk/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hdvhvu/2024_day_14_solutions/m211gxk
   :body: |-
     [paste](https://topaz.github.io/paste/#XQAAAQD5BwAAAAAAAAARiEJHiiMzw3cPM/1Vl+2nyBa63n8Kw3D1UZFlD3WW8r2Z9pYT30ODveiMJ3JeJFSTLhdWR3FmXt2oGu9YdB1CZE/gbIVlI1reXAJ8hMN6/7ctv/R0Gq8QgadIdMfp96vKa6SL0+aCJbqFXXQPgfIdtmSyzc0vmg67mqsuw6FBP+h6e62YhnTlA1M9ZB4fFkq2IwKQB3KdY5OyU39DVK423dPSFsZaMUaZPmrWqRemZmUxTaFe24U0F1OH+kMj9WfvRpS/5KxpCmVKWoOWV7aD7HWNapE4+uUuy17VxFh6KVOPIImIePgLUWBrVJ/WORNx9hCMM3kZqnkhtbkRO42eksRrlrGae6ac6HcQqh5yUioH8o8bzSFTg3A1vW9LB1HIGBCZIkfD3VwQnG2ktnq3YTPhdrIQ8NtFTNQmjIHdIecGZiJ0wC8FRwbMm+WHj0gQIf2hZ4xOrJS/bmKCP0bJcJCzjmnoJ+kS8PZQFSWoodkIqxgRMweGE3RPHQZLcTiIt+fgz1tN1Rbh5x6gRMDqBr/GY8aHHaqmskM1EE1Sa74Kwe5JhfrTTMKTlkq0Je4ijjQ5eAv/FjUBlecdUedPKHfOjU1rEKRASgTZYtkR+4RAhOxN9by1+TXX3blFMS8hi1tn3gR5cfBDbXvZpLpflD7DLDwqnrKtUUcBxT6GHaDW6W8mcmN4nmzT8qlFAQ6jitlOL5r/NgjSTKH66lezo5vMLcs+BKZILQnr1kzjGLVJZlrAjfLqdDch+WBLK1HIY+SFJ2iEwiVcIPqZIm1E7vLIUSn8AU16MgmufZMgMLEt2AYJYPsECZtSF1s6Zyv30w5BfgCM+XFx49FDUHBaCsK7IYiy/G3H9WNVHbP5xTafb6QCGL8etSb3/0B5rQA=)
 
     Ashamed to say that I had to take a hint from the main thread. Of course the safety factor will be low when the robots are playing at being a Christmas tree.
   :replies: []
 - :author: yourparadigm
-  :url: https://www.reddit.com/r/adventofcode/comments/1hdvhvu/2024_day_14_solutions/m1zapc1/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hdvhvu/2024_day_14_solutions/m1zapc1
   :body: |-
     1115/747
 
@@ -32,14 +32,14 @@
     [GitHub](https://github.com/phene/advent-of-code/blob/main/2024/14/14.rb)
   :replies: []
 - :author: FCBStar-of-the-South
-  :url: https://www.reddit.com/r/adventofcode/comments/1hdvhvu/2024_day_14_solutions/m20hz1s/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hdvhvu/2024_day_14_solutions/m20hz1s
   :body: |-
     [paste](https://topaz.github.io/paste/#XQAAAQBdBAAAAAAAAAA5GUqKNoFH9WVqAtfQAlEIpeJL/pI3jz8l8zNIKbgBcDtBnHwB0CRbBF+F9hNoUjkUtOS/X/ERl2aixnmPmVTO8ihaWOMh31/f3Q1zLWH7F6R00l6RGeDO0jreNP7EvY3PTzZqtcxb5RsbMz90I/ZfBOsQAywaMAjun3bW8cpyFEqjc0j8kCBgmmJoHhu7yQZzRIH+xNVGSrO0yyJmVrOksWBbA0KVUYsy6Cucdruq/mvoGJ3UGoFATeyeBHnDxnTEH4gPglavFLM46aTOP0hnROPZIPB3fAGxD0sixBXxyyABiNhLnUjFQ6oM+UsSM3bdPrCVRUoCrwGKCCc+fKEIXUkP7RQuWYoDTAiaEACjEhU8h8GZtNaeZ/A02TehyOrl40bLkwhruWJHKKW/Mqn2a353+CqsWg7QdVONzNr0CEq4NF4ogz5ss3LlIWpM9PYlijrCYUJ1HQJ21p/SZrbQTr/nQWYBmfPTclbCzZmeCqnu7Y+kxTxmAFIbMHZDtH+O+1FYyjzNGIY6dY7jDqHEn1QEUcE1iJPwH/tjIcnK8krcYKfHCK2yOBdUJVAWuPwvy2I7LPaxsOAA0Ko7gwYhcnvO25vqHNYB7SfSvqW0OdvkQqG34hejARc2x8X56QSnmwG14bgmJVvJceQ8Xw2JCCMtC3N5lxTYyb3/+IEJsg==)
 
     Why code when manual inspection do trick (and probably faster too)
   :replies: []
 - :author: Stronbold
-  :url: https://www.reddit.com/r/adventofcode/comments/1hdvhvu/2024_day_14_solutions/m20p7jj/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hdvhvu/2024_day_14_solutions/m20p7jj
   :body: |-
     [Solution](https://github.com/Alvaro-Kothe/Advent-of-Code/blob/main/2024/day14.rb)
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: FCBStar-of-the-South
-  :url: https://www.reddit.com/r/adventofcode/comments/1hele8m/2024_day_15_solutions/m28qx6c/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hele8m/2024_day_15_solutions/m28qx6c
   :body: |-
     [paste](https://topaz.github.io/paste/#XQAAAQCTDwAAAAAAAAA5GUqKNoFH9WVqAtfQAlEIpeJL/pI3jz8l8zNIKbgBcDs8fKlEL/C49oYSKRg6kqFigCWb/16n+qCCjbP0ro+FJ5Lds084T3zBc6WcbkVlzWed3N6KtpvKaegCunJV8PM0gPtPpMyqCFRqRG829y5sW84lHf6woq6lGRggpQyqR7GtmLGaPMMY2BfleWpgpEm1HehYyjrmilBo/w/R+WezfouXB0TNNU1kP96i35zUeTHQbIPC8LikUpClkoA0K0fyiHTaY50HOGOb0GF4HgcCtxyh+HZH/HjFPjZOooy8IMOSaSor4dxQGsMNj5+zyUhqSqMndNhvIFm6VhtpkWIwAXSUBhlhz+GGp9pBDlFIOwmJ4dG0Z0vZ052IDprrvXxMEZfPDTBi0YQNNXwjgaFbp0YV+nJE01p6+6E6ouZVVwPfENnpQ/s4SQvFUy9UtsDHIax2xVu1kC4z++FnjSiKBF7yoR1cGjM/BBgXAS+mDoTOBPM+IGuMf8FEChkj3s/klR6Rmq9SfA+GXHymPtePyM8CQWJ3P0+RqmPKwNilieD7nmHgYcoAk63dDvN/12gan6NF+n4j8SQH77hBbmPa495jy3FG0ZuXVf/ti15gvzxQtXUfOsXfUAQFXwgFDZiwN1+fG5Qs7HWRCMAhmN1FlluDk0rwSgiYZO5o/K+S93Y8kmpv4OyfGivuYUiwP/PF+YeUMJFPR8WVT0sHESeKriG78MOOhYN/DKvMK7Ev+68IXsMHf4IavaQKetmm/Ol0VNWaz2mn3ejAVCPQcVnrfEQKFW0o+zlVOtBu2qv05dqpQxpU776Y++8iXbWDRs7Aotg0FU2TLIPhkybf6VnWpYKMmGK2l1LU7Ip/hMGZ7gvJKqYS2RcHo4Fj2O/F7BTP7Ke+JGatcs8lSZ+YtP4YX9rkIbKqeo2kdn/4S+Hw16RBmkE0q3p/Ww93JGmNbYa18XminY40lisb5OP3ZF42BYAJomWUIj/1qQfrM9T70Veju3/bInk4wxmRN1GLBYUObx5SZ/RCRSNwINfUpEnEU4ZmsML8eSHiYzoy9xwWjFTOCmNYw1dAKjhGrzCj8Yh+lCw3SYT7p8JFVw0YlT2uKBQE5b+rUnHpWKr4A3wGRW92ycqFzunDlKtXKUPDQxcH8JukIVks3P01tYqJqn9YPesFaPjf2SXQ3A5cJTZKjHr/DCLhF6Fg45bklpG6uY09yTL3XZ0bKmz6qDCzs4LvgMZyqLc4XWgofyfJI1EvgQgVHP7LW0oRZ7yskMWxlbuzhza7N/gCiW7ZN51J6B3wHF06LRSdof//eZDSmiJVL7Chu4dZJ+uLiIUZHEwP+4xXQpZFJbE7jKQpIPv7cO8Z95Fj0ygFHrS24c+KoJqWFcps0jbx+sJX8AhIZ4w6iBQT7IHOQ6SX1ifet5izobBHGJxCpNS5uqzk2MK5+8MGp/7FCJbQCD7R2t/jJg1Ifo+0dzDYxLwKhMjFP+jCfJIZ1E2kotRRd5kxYefiAUPqV+j0kgzI6iL/iB6PVBLFqC6T0gF5x/jmqeBOLOggncddkFERNBlOOS5ml/tyJl10irhFcmt+iv5AVlkVyL62ULAH60KmcTrWrJll4TZ2cIN0DugFaOtHL+TE8pJ/UoERX0eUfqPhWkuJ16MmmO8pkkviYICpvZK6753+eWen)
 
@@ -9,18 +9,18 @@
     This was my 250th stars all events together! I will probably put a pause on the remaining 10 days until the new year and just enjoy my travel now
   :replies: []
 - :author: JAntaresN
-  :url: https://www.reddit.com/r/adventofcode/comments/1hele8m/2024_day_15_solutions/m27vmxb/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hele8m/2024_day_15_solutions/m27vmxb
   :body: |-
     [day15 ruby](https://github.com/jw-rx-93/advent-of-code-2024/blob/main/day15/day15.rb)
 
     Not proud of what i wrote cuz it's alot, but part 2 is almost the same as part1, only really needed a special looping condition for the up and downs since overlapping between 2 indices is only possible there, while left and right movement is irrelevant since we can treat [, and] the same as O in horizontal movement
   :replies: []
 - :author: Stronbold
-  :url: https://www.reddit.com/r/adventofcode/comments/1hele8m/2024_day_15_solutions/m27hdah/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hele8m/2024_day_15_solutions/m27hdah
   :body: "[Solution](https://github.com/Alvaro-Kothe/Advent-of-Code/blob/main/2024/day15.rb)"
   :replies: []
 - :author: yourparadigm
-  :url: https://www.reddit.com/r/adventofcode/comments/1hele8m/2024_day_15_solutions/m24tmi4/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hele8m/2024_day_15_solutions/m24tmi4
   :body: |-
     1385/1756
 
@@ -29,7 +29,7 @@
     [Github](https://github.com/phene/advent-of-code/blob/main/2024/15/15.rb)
   :replies: []
 - :author: Sharparam
-  :url: https://www.reddit.com/r/adventofcode/comments/1hele8m/2024_day_15_solutions/m257pq6/
+  :url: https://www.reddit.com/r/adventofcode/comments/1hele8m/2024_day_15_solutions/m257pq6
   :body: |-
     (1843/4158)