advent_of_ruby 0.3.1 → 0.3.2

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

@@ -1,6 +1,6 @@
 ---
 - :author: InitiativeRight6576
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcu1j81/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcu1j81
   :body: |-
     `source = File.readlines('input.txt').map(&:strip)`
 
@@ -31,7 +31,7 @@
     `puts "Sum of extrapolated values is #{ next_values.reduce(&:+) }"`
   :replies: []
 - :author: gurgeous
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclkv7e/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclkv7e
   :body: |-
     371/438
 
@@ -51,7 +51,7 @@
     ```
   :replies: []
 - :author: Symbroson
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcmiwxh/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcmiwxh
   :body: |-
     For my input I could just sum the differences and check for zero, but I realize that for some inputs this might not work.`delta.uniq.size == 1` was my way to go here but I found a silly shortcut for my golf version to detect if I reached the end. Spoiler: `dont.` They will be empty anyways at some point
 
@@ -73,7 +73,7 @@
     ```
   :replies:
   - :author: petercooper
-    :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcmw0n5/
+    :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcmw0n5
     :body: |-
       I'm currently golfing my solution so thought I'd see if anyone else was so neat to see your post! :) I'm currently at 123 bytes:
 
@@ -84,7 +84,7 @@
       Going to look at yours now though as you have some different approaches. I also think mine is very brittle, but it's fine on the input.
     :replies:
     - :author: tenderlove
-      :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcnpqjr/
+      :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcnpqjr
       :body: |-
         I am not a very good golfer. Got it to 144:
 
@@ -96,11 +96,11 @@
         ```
       :replies:
       - :author: eregontp
-        :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcnsmky/
+        :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcnsmky
         :body: Nice, that's both parts in one solution
         :replies: []
       - :author: petercooper
-        :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcopx9z/
+        :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcopx9z
         :body: |-
           You might really dig this. Benoit Daloze got it to 95 bytes!
 
@@ -109,14 +109,14 @@
           (Part one only, so yours is better in terms of solutions per byte ;-))
         :replies: []
     - :author: Symbroson
-      :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcn0y5d/
+      :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcn0y5d
       :body: |-
         Your parsing seems a bit more compact than mine. The operations have to be done twice on a reversed and unreversed array
 
         I also thought about smth like `p 2.times.map{d[s.reverse!]}}.reverse` but I havent had the time to experimebt with it yet
       :replies:
       - :author: eregontp
-        :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcnnwgd/
+        :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcnnwgd
         :body: |-
           I got to 95 bytes:
 
@@ -127,15 +127,15 @@
           The key part was to not append anything but just sum the last element of each row.
         :replies:
         - :author: Symbroson
-          :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcnrrzp/
+          :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcnrrzp
           :body: is that one or both parts?
           :replies:
           - :author: eregontp
-            :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcns172/
+            :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcns172
             :body: Ah my bad, I should have specified that's only part 1.
             :replies: []
 - :author: HAEC_EST_SPARTA
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclmksf/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclmksf
   :body: |-
     ##### [Solution on sourcehut](https://git.sr.ht/%7Eawsmith/advent-of-code/tree/2023-ruby/item/lib/day09.rb)
 
@@ -144,7 +144,7 @@
     _Edit:_ Doh, I meant to reference [Pascal's triangle](https://en.wikipedia.org/wiki/Pascal's_triangle?useskin=vector) instead.
   :replies: []
 - :author: Sharparam
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclmu4r/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclmu4r
   :body: |-
     Short and sweet today:
 
@@ -162,7 +162,7 @@
     Confusingly easy for a day 9 that is _also_ on the weekend.
   :replies: []
 - :author: globalreset
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcllzap/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcllzap
   :body: |-
     1736/1266
 
@@ -195,7 +195,7 @@
     ```
   :replies: []
 - :author: SleepingInsomniac
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclpmil/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclpmil
   :body: |-
     ```ruby
     class Sequence
@@ -221,22 +221,22 @@
     [Part 2](https://github.com/SleepingInsomniac/adventofcode2023/blob/master/2023-12-09/part_2.rb)
   :replies:
   - :author: coderhs
-    :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclqpp6/
+    :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclqpp6
     :body: This is a beauty. I been trying to do recursion, but this approach makes more sense.
     :replies: []
   - :author: yourparadigm
-    :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclulr5/
+    :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclulr5
     :body: "`#each_cons` is the MVP here. I'd totally forgotten it existed."
     :replies: []
 - :author: comforttiger
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcmsy4k/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcmsy4k
   :body: |-
     https://github.com/comforttiger/advent_of_code/blob/main/2023/ruby/day9.rb
 
     im glad today was easier than yesterday. but im ready for tomorrow to be super hard
   :replies: []
 - :author: RelativeLead5
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcmuc1v/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcmuc1v
   :body: |-
     To determine if the end condition was met, I first used "line.sum != 0" instead of "line.uniq != [0]". Took a long time to figure out because works fine on the test input and only two lines in the real input eventually reduce to an array that sums to 0 but isn't all zeros. Doh!! Don't do that.
 
@@ -260,7 +260,7 @@
     ```
   :replies:
   - :author: RelativeLead5
-    :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcnk4qf/
+    :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcnk4qf
     :body: |-
       or the recursive 1 liner if you prefer:
 
@@ -271,7 +271,7 @@
       ```
     :replies: []
 - :author: snowe2010
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcllm00/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcllm00
   :body: |-
     I found today really easy thankfully. Hardest part was remembering the language features haha
 
@@ -330,7 +330,7 @@
     ```
   :replies: []
 - :author: dhruvasagar
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclne6v/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclne6v
   :body: |-
     ```ruby
     def diffs(sequence)
@@ -357,11 +357,11 @@
     ```
   :replies:
   - :author: snowe2010
-    :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclnwfi/
+    :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclnwfi
     :body: each\_cons made this day silly easy, and yet your solution is still somehow so much simpler than mine lol
     :replies: []
 - :author: yourparadigm
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclut62/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kclut62
   :body: |-
     [Language: Ruby
 
@@ -384,7 +384,7 @@
     ```
   :replies: []
 - :author: _tfa
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcm07xz/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcm07xz
   :body: |-
     ```ruby
     input = File.read("input2.txt").split("\n").map(&:split).map{|l| l.map(&:to_i)}
@@ -403,14 +403,14 @@
     ```
   :replies: []
 - :author: Piggelinmannen
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcmaqvk/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcmaqvk
   :body: |-
     Build a rather large algorithm for 1. Then one for 2. Then I noticed 2 was simply 1 with reversed inputs. And then I noticed 1 was simply a matter of summing differences...
 
     [Link to github](https://github.com/jlugner/2023-aoc/blob/master/solutions/day9/solution.rb)
   :replies: []
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcmeyu3/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcmeyu3
   :body: |-
     Nice problem today, almost the exact same code for parts 1 and 2!
 
@@ -419,7 +419,7 @@
     [Video Walkthrough](https://youtu.be/Yl8J0-gKAEA)
   :replies: []
 - :author: Annual-Management613
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcmg4iz/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcmg4iz
   :body: |-
     An "easy" day I guess, really happy with the solution.
 
@@ -461,7 +461,7 @@
     ```
   :replies: []
 - :author: eregontp
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcno6po/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcno6po
   :body: |-
     Part 1
 
@@ -504,7 +504,7 @@
     ```
   :replies: []
 - :author: glebm
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcll05x/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcll05x
   :body: |-
     Doing it explicitly bottom-up:
 
@@ -563,7 +563,7 @@
     ```
   :replies: []
 - :author: lycheejuice225
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcm01va/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcm01va
   :body: |-
     ```ruby
     ans = 0
@@ -585,7 +585,7 @@
     It was quite simple today even though I thought it'd be of good level.
   :replies: []
 - :author: tenderlove
-  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcnisgp/
+  :url: https://www.reddit.com/r/adventofcode/comments/18e5ytd/2023_day_9_solutions/kcnisgp
   :body: |-
     Took me a while to realize that rows have negative numbers and the sum can be zero without all numbers being zero \>\_\<
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: DietNerd
-  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kvufdp7/
+  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kvufdp7
   :body: |-
     [Parts 1 and 2](https://topaz.github.io/paste/#XQAAAQAXNwAAAAAAAAASGYkm63iu4NWbH5iiQnrEVZCKBk6gY+uqrSla5wl7AJiYzQ/UXydifRuHEs/0Jffa3oCuv5/XaoSQAuQsL2sahY4Z6n6QkSR/hYFEbE1wJ9OWMmUUgOJ4KA9frqZf/q3MMnTeV0mU1P4HGzhYFHe7KCSzBRq0PJYTqlDB1ObFQdFd/fHVPlZxJI+mH9FE9mK1RpcBgh4UAbg9/0KyIM6zAp4oIvcF7pXoEZ63VAmrLRaqtc/A05j943yONMiduocWJEXHQZ47QvW0NWilRyxuC4+uwDTkC2s6bTQdtXrFuuEw4mj3smF7zoMPKTpJ19QjhgBSdiEm4VOWy1B5TDegDDZt1UiUtrbutSoePhCdbwerQpc+07S7oJXuw2rfbYpkVluFKMjon+hLPrIw8bvBA/S1fSiXBrGQ9qsV3jY/tnNWd5mOWBXXGcdCrmxf+898zjJlj3T50FUMnuTGlz01O3XYJ3zpXKySI1eNSZxjy2yOmdwmNG00fnC6rTXlWFSzwR4gHcUERw8jMqbjkXySzxoHo3/UuSm9DtbaWdH5DGSHwDeyZZhIKFdMSM4aYRTdfyi0nkZNoRVqgVnpiYu+YkrGn4i1tSTV4/l8O3U69JElHLU4Khmn6Z7vHQjVEMrG1e9IynEla+JlSPesQKOnluS9TsYc0UgDw33uNIQ4X7Vb3syFVDw+RGnWfflsn0q4DAD619amRrgLFr7dHKjwdQP/LKBaZ5Nsj7mGErNKrczUKl9836Holb30/YhHM0HU1r2oOGIopbktOXPzg3U8O/MDnKd0H5o+VcTIYKzHYWMNpE7z05NcE6u4fuB070SKp/5cdj8v6Py/3zWWVUdGXLYvtpEtZzkjemP5q/T+jaStck+zRk0tRVLg3dqQXuTAbA2E83ovD9Er63jn+uBXmZLnaOq+PWF6hDas22lv4+3oilTtiGrox517KkqOtwv049RoQOo7T9YBXEPNzilhFxcd7Z9y9fFyOJyeLlrJfO/HdETnmCzu36gIh68FlNycBErmn0R1f7Kp9gB9XLtMjxPbjzlVg7RUfTMAeJzPihtcIloNnzQgrGruYsm6WYssjegq0vfBlvmB9O/FZfGElPBv1SUpykKBzrzNaPsN2HDLVHKwia9IuDU8cYXFu1ZDD0W2JTaMpaF3fwQLWvMPxmH3dlJF7S+tv00FekBdNMgtAFwOF9iALwteioP7+LTLSH+ZhvcepFXeaVk8ZUKpM06NJ6NSUNYLx7kWHXSvU44WIzEVy+iMuoc5dashRI/nlS4yVNNZSuZEvtz/ImtQBt34UwWFMIx39oFrQunY0A5LBxGicHvG6XYYQkUXXA4sYpFUrcErzt0hKG4cn84jVaDbfZnLohGaUvtTaWtXaZMfVEPf3DTzQMAqPSo09TRwfjxyVwYtT5egVeMNyh/9p4fp8bFfg3kW3YKrVfaPdT6R4oBWOBDMrfzVmV3KA/oS+w75X2q6PYc02lrfjEJKbicoJzX/WpVvz/irtBW7pHn0PVTnuBJq/sA4u/nFpwIlonr/Dr7EQg20dp5GScoRTdfc0Ja6hHFLxaQDJ+Gx8NmaLNsz8zuJRo6sHrLgB7/4jQ9y+24mDsyYJe60v7sazjSw8F9gxNExB3+5DblUMmQadgKIH0rrPJw4zefFPNVnltKKd9ulkSeQn6EozLDcYCib13/RQrFwxTkcofqLB9YNLxTa3WTSKxYsxDdx63vehAZTYtBl6l+KSimxu2YzabyQSGV/Jgyvxs25QaMpp0A7sYk/ujpzaY+G6g+1fI6ZuVgbqxus0jdLODgiichruIaptBTUSNVHlqBCOCcsZaFvPX+va0Axcm4hJZkGxOIpowZ0gBBqp6wtbQ3ZdcJQBINpI/ZYregyh0WCrYdkyhIFPhstVw3vvE4xV68INEk1s/iEmmRbimjwls/2de+WT88Ta0AMpX3bBjXcFU/mJIP7d/6+IeajjQOkrfRoagB4yNybiVhjXxsVmwfW/7ohXoSky2gfaVFfdRQ6ubETb3Vuydlpqrxbb9UGgQBkwT5dIoG3fbeuP1giMn1uf4zcHO84Y3/wJqmU32cMCMH7orrTJIZPaP8SlIPcET8SNwMgtzY4Q2ctRVnC/mOh1LE2hsI24teW3tMuQ1aIfuZ2mZ0HTnQDJxnohNDj5QadmdCyhdSftWrtTqsv9FlKxDCOV1/vc1x8z0t+inXKeP5QQsX+9W84cMwPl+la89ydEWifpacgsGmuLVD70AofjfHENKX+7hVE64rSVOvwf0YdxpcLOyjaEVWHkedSygCnDtLcDOIedTOtGZRe7YYn3UN/rfS4HUS8Flz+Jj6vDoXLPtY8NRu5HiHty3uMK9kS2TFHpL7tv2GBHrDk//LGmWVSm92xzyZqUGQBPqWe/yt7M9HN1eExNEUU1K7GXCn5Y7yZejvlVdgmlVjFIYCjiFjotCfNdGXxshKg8RtYOcvd6bBAjrE+8DpCEWuj+q7IlFvG5Vzg+rx8W3L3y2owk+sUOw4lntQ1nYC4+L0nFE6l3v6Gd2PTR/c6MGGEJdEYhF2PnibpOMzENToxtxBHo/nhaznil42TirVqB1DDTIE8tscf3oupt7CqaqiI5uPu3j/Q0p/vV7jel0ajA2lNBhgCakbbVALdtS68JK71TQM2WXZ83BBULlewacmk2wPAUMtYDQ7a2sUTEB8hnIzi6xK+IhY1cH7NS5NukG9Y/tbrPr0kgsyrhLUxgOUYOy2MJI03d+a3gTkHW0UdSh5udM+f9zSsvwvmpmGRkPb+6/cf+T+g16zM679kUL5Ta3thilzUpdY11Hno1czAReECBuCUM3j63yfvnWKygiSXzNeteS1/NpB90jz+0hKZsMO6hImYNVFKA91Q840MJ1IUj3LfRr8vWqLBaeWRzhPDsE9M0pdQZQUA0mph3pWH6VWYAp7ZBJIu19PE9buXXAymrMjTFIXpfJXUvlqn7t+ZL6QePCiWMqblZVvoCYFkAppCcUK0gNgY0khMENPx1nfZgOdNFvwCri884tkpJrfcKBrl0y+FV4DXQEzg/TtXwfNEbyHtN0gHofeu1m61CJFLTxQOwH1RIqqt8riyjQ6hAi1cpnls027bSdA/Wmww6FSN2ukJWffTKae0UgQiRqhGfKn0So77tOKJ5bEGQqkeJgMZkmp+6CXP+ZSpts7C2wxYOltBdvXwNT5+i2O2VXcJjcx3ELcCecrGCnUP9yKzgumdiN0D2f7xcPOEYouS5XRsWiNi+3phrh4yrAAOx4a/S+kRgjU0SUYPsdaLz+DLvUPVV1fZj11ImFDomFsK6QlX0Afl5vA2yhMosM1gaalkzkRbSPh/fcsFGlhZDBKCzIvjM01tQ24bWCQPbyirukVEgEOQLbvT9PLLQ0x227ZXuczxL3BBKSxCVVchzeWQriNewctIUJ7eAoJ/AaSJIqjZXhAI5ra+AZjK11jR/71YJ8/hlGDjAbQUo3mVkYbvQc7CnUFWDwkmgrCnBd1ZiZ1EFRi8DLuVu6VflsUiSnE/TwatqHZGnU25+QNd3rwUET7fkIVMZxv3bvgLk7yLmIQG9t46MBSoQ5KMj2uje2u6fC6ctRsWN+nsRr5QuQk8pwZJHG5a1mCSKxMXobEofMRluChCtJ0qDM5Euw+0yd/WdhxWfPwkL3fWN6ewHEUV+vtHHbRdAj8QstQ1PZQ28wrkXcQN5RcsXbk5SBs2P8P/y3ni+ckewQWXkn82YVqxAtaw1k9SO2kZiWloRVO6zwie4JCuCqxg5dxbm0cztsNcRSzvter8ItTOi6a4C/R4scNH3av58r1tzQE7II7v/VW01lmXnub9caEsb+7UQFmxSJgxGT6ib+T2pMGp4UGcUg6lsfLUpp6e4syE4ldIYvimJAqPWRZ8LUqrRbj3QKFD78Ydui1rfASJ2dEM19U8+JLY4gDqhq86gtRAnCarR8SRjqJdcLNYHEWYtTgREu7kdIfKW2TjH/bMGuxNHQigLXPQsTRmCUSbDYZnPhP2nRBVB/q6GaAiktGkHxxRJ4HC8315VPUPp0a0V5V1Lpbh5QyKh/BGozIZ8GO02kwaP1Y+oI/f55qUyMRU5UyGLogPSQZyNMXiL/JuWhpld/fF+3LM1H7BRNEaJHSh4k/hLnvXM0OtITIkFnN4dU/mOibZYlQsybLfw/uwH/WU02ohPdqfOxBH9Dj8ZBdIaonFcKyapwcm2Rf7fFCmyLW68RTfi/aadhzFeofW/Zv5YTpKBJ8cPbyNHXbtL/UVvpL/iXkOqrrklA2XgQZAqH7sDNDU6P/7pguf)
 
@@ -13,7 +13,7 @@
     For the groups, I did basically the same thing, but had to first gather all of the groups, using a similar algorithm to the flood fill, letting the biggest group take over every time they intersected. Then for each group, gather the directions away between pipes, and iterate each one until it hit something. The main wrinkle is the huge group in the center. I put that off because I figured it would be more complex to handle. When I had a full solution with everything but that group, I printed the output to a file to look at it, and just decided that it was probably outside considering that it was right in the center and all of the singles and small groups around it didn't find a path to the outside. So I submitted that and it was right.
   :replies: []
 - :author: kateba72
-  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcqkyrx/
+  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcqkyrx
   :body: |-
     331/66
 
@@ -26,7 +26,7 @@
     [https://github.com/Kateba72/advent\_of\_code/blob/main/aoc/y2023/d10.rb](https://github.com/kateba72/advent_of_code/blob/main/aoc/y2023/d10.rb)
   :replies: []
 - :author: glebm
-  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcqw6za/
+  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcqw6za
   :body: |-
     Code shared between both parts:
 
@@ -161,37 +161,37 @@
     https://github.com/glebm/advent-of-code
   :replies:
   - :author: PassifloraCaerulea
-    :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcr41on/
+    :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcr41on
     :body: |-
       Interesting. I didn't think of part 1 as "breadth-first search" at all. After you figure out which two directions to go from 'S', you can move both directions simultaneously and stop when they meet at the farthest point(s). After 'S' you don't branch anymore because you can't backtrack while you're traversing the loop/circle/ring/whatever. But, I am not familiar with the ins and outs of graph traversal terminology.
 
       As for part 2, the only thing I'd heard of that it looked like was the even-odd rule for polygon filling, so I did a quick read-up on that and sorta worked it out on my own. Guess it's more or less the same thing.
     :replies:
     - :author: glebm
-      :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcr4qey/
+      :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcr4qey
       :body: |-
         Going in both directions simultaneously in Part 1 is a special case of flood fill, which itself is a special case of BFS. Since BFS is simple to implement, I went straight for it rather than implementing a custom solution. If we hit a point in BFS that we've already seen, that's the answer.
 
         For part 2, even-odd rule is exactly the same thing as the crossing number method (look like it's another name for it that I haven't heard before).
       :replies: []
     - :author: glebm
-      :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcr5134/
+      :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcr5134
       :body: BTW, my favourite solution today is a Shoelace formula + Pick's theorem [https://www.reddit.com/r/adventofcode/comments/18evyu9/comment/kcqu687/?utm\_source=share&utm\_medium=web2x&context=3](https://www.reddit.com/r/adventofcode/comments/18evyu9/comment/kcqu687/?utm_source=share&utm_medium=web2x&context=3)
       :replies:
       - :author: PassifloraCaerulea
-        :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcr7kev/
+        :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcr7kev
         :body: "That sounds neat, but is too much math to wrap my head around in a reasonable amount of time \U0001F635"
         :replies:
         - :author: glebm
-          :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcruqoe/
+          :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcruqoe
           :body: I've added a solution with Shoelace + Pick to the original comment and the repo. The implementation is super simple!
           :replies:
           - :author: PassifloraCaerulea
-            :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcscih3/
+            :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcscih3
             :body: Wow that's impressive.
             :replies: []
 - :author: '0x623'
-  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcr3hkx/
+  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcr3hkx
   :body: |-
     [LANGUAGE: Ruby + [Netpbm](https://en.wikipedia.org/wiki/Netpbm#PBM_example) + GIMP + Sublime]
 
@@ -207,7 +207,7 @@
     https://i.postimg.cc/ZnwWSfCr/eg.gif
   :replies: []
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kct46qo/
+  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kct46qo
   :body: |-
     This was a rough one for me today! Point in Polygon for the second part tripped me up for a while on the boundry logic. Also stack depths for recursion in the first part! I had a day of it...
 
@@ -216,7 +216,7 @@
     [Video Walkthrough](https://youtu.be/ObIshEUQmVE)
   :replies: []
 - :author: jstanley0
-  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcqp5v3/
+  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcqp5v3
   :body: |-
     Part 1 was pretty straightforward. I probably could have been faster had I just hard-coded the shape of the piece under the S rather than make my code infer it, but I went for the general solution. The first bit of code I wrote described which cells a piece connects to, and it was useful for both parts:
 
@@ -273,7 +273,7 @@
     ```
   :replies:
   - :author: DeadlyRedCube
-    :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcqq8in/
+    :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcqq8in
     :body: |-
       > If the point has exits, it is not outside the loop
       >
@@ -282,7 +282,7 @@
       oh I like the "turn every piece into a 3x3 grid" solution, that's really clever!
     :replies: []
 - :author: PassifloraCaerulea
-  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcr4zey/
+  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcr4zey
   :body: |-
     [Part 1](https://pastebin.com/cz0W1449)
 
@@ -299,21 +299,21 @@
     Part 2 reminded me of the even-odd rule for polygon filling, so that's what I based my solution on. Hadn't heard of "point-in-polygon" before, though I see the Wikipedia page on the latter does link to the former. I of course had to try doing a simple flood fill from the outside even though the instructions told us it wouldn't work! :-P
   :replies: []
 - :author: comforttiger
-  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcs6838/
+  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcs6838
   :body: |-
     https://github.com/comforttiger/advent_of_code/blob/main/2023/ruby/day10.rb
 
     this one was hard!
   :replies: []
 - :author: HAEC_EST_SPARTA
-  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcudbrw/
+  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcudbrw
   :body: |-
     ##### [Solution on sourcehut](https://git.sr.ht/%7Eawsmith/advent-of-code/tree/2023-ruby/item/lib/day10.rb)
 
     Well this puzzle was a bit more difficult: Part 1 was straightforward enough, but I struggled a bit to grasp the sub-unit gaps in the loop for Part 2. I ended up going with the standard line-crossing parity check for determining whether points were inside the polygon formed by the loop, but effectively resorted to trial and error to determine how the bent pipes should be handled.
   :replies: []
 - :author: Symbroson
-  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcu76r9/
+  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcu76r9
   :body: |-
     Late to the party, but here is my solution. Pretty compact and I will make a golfed version too as edit.
 
@@ -355,7 +355,7 @@
     ```
   :replies: []
 - :author: Symbroson
-  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcu88c1/
+  :url: https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcu88c1
   :body: |-
     As promised, the golfed version of [my solution](https://www.reddit.com/r/adventofcode/comments/18evyu9/2023_day_10_solutions/kcu76r9). got it to 430 bytes:
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: SleepingInsomniac
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcyshi4/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcyshi4
   :body: |-
     [Part 1](https://github.com/SleepingInsomniac/adventofcode2023/blob/master/2023-12-11/part_1.rb)
 
@@ -11,7 +11,7 @@
     For part 2, I just counted how many times a galaxy pair crossed an expansion and added that to the distance.
   :replies: []
 - :author: jstanley0
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcwuxjw/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcwuxjw
   :body: |-
     I stored the galaxy coordinates as a hash from X coordinate to array of Y coordinates, and I expanded space with the following function:
 
@@ -46,14 +46,14 @@
     [Full solution](https://github.com/jstanley0/advent-2023/blob/main/11.rb)
   :replies: []
 - :author: gurgeous
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcvc079/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcvc079
   :body: |-
     Nice easy one after last night:
 
     [paste](https://topaz.github.io/paste/#XQAAAQCpAgAAAAAAAAARiAqGkkN2w8uW9zdu4QV9huA3XtLPyAMJ+BUFIW/0tlJ05GEjbzGbpJ/rHVTmRpgeuahr+5Hp9htXWjnoQu+9zgWkc88D6vYgpVMbYUeyugJvbW3A+du35kd185oV5nxgW6/J2rVW8v5uYC0jQV5YOF2RCj5i7dO6DacK23eyXmS8fQWenB1IA+8s05eV9rHUM0WiMpIvdBH9ftZSYWJEZDMxCXLPnXDdXDqerxTKp7HwuKLeSP6Mo1tEbuQX9nePbO6W2zCP23Kcm3ySvBRW9hwXaplvlDcPfI50Ge+wczTtKOjwza+JFhwP4zd7G1F98lgiTFrJmyV3y79dTbRWZ4xNQRbipOxSKSiDnKauebwnEAa3JVSjTEDkKdf5FyXpuLoprBkj9t6MnxkJHlNNbp2HYazcreTAcniNf3rt/rassEMO2Own5/A48+qsitDoNZqSKxbBnXydIQfJ2pb3hT/+nZ9lkmyxRp3HjH5bKfYRZH5/Tkbd1eZC5DtxfQRRUd5chnH/zDNOMA==)
   :replies: []
 - :author: glebm
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcvc6tn/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcvc6tn
   :body: |-
     Parts 1 and 2 (for part 1, change `1000000` to `2`):
 
@@ -88,7 +88,7 @@
     https://github.com/glebm/advent-of-code
   :replies: []
 - :author: Jonathan_Frias
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcw0fyd/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcw0fyd
   :body: |-
     I used native ranges to signify the distance between the range bounds and some fancy matrix transpose stuff :)
 
@@ -134,7 +134,7 @@
     ```
   :replies: []
 - :author: Symbroson
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcw2i1k/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcw2i1k
   :body: |-
     I'm extracting all row and col indices of empty lines
 
@@ -163,7 +163,7 @@
     ```
   :replies: []
 - :author: Annual-Management613
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcw3kts/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcw3kts
   :body: |-
     One day less!
 
@@ -214,14 +214,14 @@
     ```
   :replies: []
 - :author: WindyMiller2006
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcw7r3p/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcw7r3p
   :body: |-
     [paste](https://pastebin.com/x6TtP1ML)
 
     Haven't seen much love for Ruby on here, so here's my solution
   :replies: []
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcwfawq/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcwfawq
   :body: |-
     Nice one today, simple hash map for the points, some maths for handling expansion and then Manhattan distance!
 
@@ -230,14 +230,14 @@
     [Video Walkthrough](https://youtu.be/ccrQzihAfhU)
   :replies: []
 - :author: comforttiger
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcwjgx8/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcwjgx8
   :body: |-
     https://github.com/comforttiger/advent_of_code/blob/main/2023/ruby/day11.rb
 
     im glad i found out about #transpose and #combination, they were useful here
   :replies: []
 - :author: Symbroson
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcwrhp5/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcwrhp5
   :body: |-
     Update of my [previous solution](https://www.reddit.com/r/adventofcode/comments/18fmrjk/comment/kcw2i1k), which doesnt calculate on point but on the axes individually.
 
@@ -273,7 +273,7 @@
     ```
   :replies: []
 - :author: michiexile
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcx4jfv/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcx4jfv
   :body: |-
     Running time: 100ms for each part of the problem.
 
@@ -302,14 +302,14 @@
     Ruby's `Array#combination` and recognizing the Manhattan distance letting me use `(from[0]-to[0]).abs + (from[1]-to[1]).abs` for the pairwise distances wrapped it all up.
   :replies: []
 - :author: coderhs
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcvdzk7/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcvdzk7
   :body: |-
     Took me a while to google and find this formula called Manhattan distance. Once that was found it was easy. [https://xlinux.nist.gov/dads/HTML/manhattanDistance.html](https://xlinux.nist.gov/dads/HTML/manhattanDistance.html)
 
     [https://gist.github.com/coderhs/eb4c9ff2aa5c5f71f3a7f1fd104b9bc0](https://gist.github.com/coderhs/eb4c9ff2aa5c5f71f3a7f1fd104b9bc0)
   :replies: []
 - :author: Sharparam
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcve1am/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcve1am
   :body: |-
     ```ruby
     require 'set'
@@ -344,7 +344,7 @@
     Part 2 took a bit to figure out :| But I like when I can combine both parts in the same code.
   :replies: []
 - :author: globalreset
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcvh44q/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcvh44q
   :body: |-
     6825 / 6309
 
@@ -353,7 +353,7 @@
     [github](https://github.com/globalreset/advent_of_code_2023/blob/main/2023/11/solution.rb)
   :replies: []
 - :author: HAEC_EST_SPARTA
-  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcvj8up/
+  :url: https://www.reddit.com/r/adventofcode/comments/18fmrjk/2023_day_11_solutions/kcvj8up
   :body: |-
     ##### [Solution on sourcehut](https://git.sr.ht/%7Eawsmith/advent-of-code/tree/2023-ruby/item/lib/day11.rb)
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: Symbroson
-  :url: https://www.reddit.com/r/adventofcode/comments/18ge41g/2023_day_12_solutions/kd1g2u9/
+  :url: https://www.reddit.com/r/adventofcode/comments/18ge41g/2023_day_12_solutions/kd1g2u9
   :body: |-
     It took me 4 very long hours of tryharding ways to optimize the recursion until it dawned me that all my efforts were wasted and I should maybe use caching to solve part 2.
 
@@ -13,11 +13,11 @@
     [paste](https://topaz.github.io/paste/#XQAAAQBeBQAAAAAAAAA5GUqKNoFH6SMqfBlGQHyGCNGeiQzN+nrwlZ3Ae8mLEFKGLOUItrisg/NJEqxJxWBXT4eTjntttsPpM9AXPGdGXOwMWb7IQAgdlGCPMyZp3oczzrD+4eRQ5ckatQD338LwEgnZ3JISCWt1lHeA6pE3PRIqrm1qY2GgDSpfG/gOloCZF76swcanH/i2UgmI/X9D897yfIv0ADaskQ48nFlBWKoynhFeyhKktnIU2GXBjhExEzIz2/hyeXcYcIybnj6NHlUo/a1N+j/zh7wJja8x2uCY/ZF3GjOEFyySecdKnNYWDXQZvd0X2YnuX7cJuOS5+hrdzqexWUL8Eb/HNWGasCVxShzyqal0MLdj5MdP6O0dwDyfxZdYDbYl+Pa6by/dXq1Tb+nmruh2AwxRxDimqckCsSZzr7uaTLCixXxZYLDkf9bJDDy1UG5VDsPYFxPtArMdH/4cj0xdj7xMmHfifzHgsDRbWeB70BGMAE9/kLtaFcklGJV+WKXjpS5CyjQK9eVScmwRJ4aV1zlzbi9ALNI1SDf98kJ7pFK4uPAdyHpfZ86WZKuz/K4vG6rf3PqWrqPAmNJbsvwJsxT8xDnhPeu+ba8UzmJirPW37lRLWKeKZOzi9x3LIt3dHsQ+jrJFcG34dPupjIypfUcy04Vs3zNWg+C9npHzB/XNPyJQIocxwBI2jH9JqU9kE4VSvQfcuidDYyGHQOpKZ+EjgXhmkx4u3VTtc2KimAN48E845PA99tWv80vJOfUR3eXkd6WAmp0Nc4oELiOsFKzlSeJ4J8P+zH2W)
   :replies:
   - :author: squirrelhoodie
-    :url: https://www.reddit.com/r/adventofcode/comments/18ge41g/2023_day_12_solutions/kd1iqul/
+    :url: https://www.reddit.com/r/adventofcode/comments/18ge41g/2023_day_12_solutions/kd1iqul
     :body: Luckily, I figured out the caching solution a bit quicker, but I let my inefficient code run for 32 minutes before I implemented the cache and found the correct solution in a runtime of... about 0.3 seconds. Insane what a difference it makes. My guess is that non-caching code would have needed at least 5 to 10 hours.
     :replies:
     - :author: Symbroson
-      :url: https://www.reddit.com/r/adventofcode/comments/18ge41g/2023_day_12_solutions/kd1oe23/
+      :url: https://www.reddit.com/r/adventofcode/comments/18ge41g/2023_day_12_solutions/kd1oe23
       :body: |-
         I timed the individual input lines and let it run on 20 processes for about an hour, and it reached about line 450. the times varied from milliseconds, to couple minutes up to half an hour for a single line! (from what I monitored)
 
@@ -26,7 +26,7 @@
         I bet programmers from the networking/web field would've used caching from the start in part one
       :replies: []
 - :author: Alkyonios
-  :url: https://www.reddit.com/r/adventofcode/comments/18ge41g/2023_day_12_solutions/kd3d838/
+  :url: https://www.reddit.com/r/adventofcode/comments/18ge41g/2023_day_12_solutions/kd3d838
   :body: |-
     Kind of surprised of how "quickly" I got part 1 (20-25 minutes), to a problem that seemed quite complex initially.
 
@@ -39,7 +39,7 @@
     [Solution](https://topaz.github.io/paste/#XQAAAQAWBAAAAAAAAAAFCPgHbQq4AMkIJWYxjn/lQHzoMyngt1m2nqwQAsFhnyZiivVjX2w6tjXvSZGmy/ibWueEk4o+QVkOa1UTKMY3rdRICK6J0hSL4zizJIURMjcNS0WzGAwUti6/yy57f/va8alZ5M9IC4ZYy2mxqpQF7xqqoo0va6gPKuVGZSmPnBQDZx0eVYx3qOi3SfTodmzms+aapJCYTYlnL3MOqLkTpEsUvdz2mSshrz6KBHyxDbG3cBTAk81X3uH7OBHeHGZpuf5KEX+COIVnu6reV0QMHyLkXSAa5gcgzDifiotVRlkP6lX9q1okNBxNeV2lpCbhdhCOn9amEbFH4qeGxxWGdu7YrgVRfdkn+JMJZzTCd8nBkYJXxCIjGR5c8WrMFi4SXNazNsS2JWDNphQtdzaIY32iIwCC8YfPkBs+ZOcQ2jmOdS+EC4EViB3+p3LSOhLyzKMptaDnK3Mjmq4BLCXhP54sOxUH03sIhbOiRSJbmFEtKqnf1LNYXTBBKmuaww5/3lIMvHT/yTrthg==) (@input is just an array of every line in the input)
   :replies: []
 - :author: glebm
-  :url: https://www.reddit.com/r/adventofcode/comments/18ge41g/2023_day_12_solutions/kd2vepr/
+  :url: https://www.reddit.com/r/adventofcode/comments/18ge41g/2023_day_12_solutions/kd2vepr
   :body: |-
     Part 1: Brute force all possible `?` substitutions and count the valid ones.
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: careyi4
-  :url: https://www.reddit.com/r/adventofcode/comments/18h940b/2023_day_13_solutions/kdb034y/
+  :url: https://www.reddit.com/r/adventofcode/comments/18h940b/2023_day_13_solutions/kdb034y
   :body: |-
     A day late but still going, this was tough!
 
@@ -9,14 +9,14 @@
     [Video Walkthrough](https://youtu.be/ng88PiHxLCo)
   :replies: []
 - :author: grimlyforming
-  :url: https://www.reddit.com/r/adventofcode/comments/18h940b/2023_day_13_solutions/kd9sbam/
+  :url: https://www.reddit.com/r/adventofcode/comments/18h940b/2023_day_13_solutions/kd9sbam
   :body: |-
     [https://pastebin.com/iwbrMUac](https://pastebin.com/iwbrMUac)
 
     I tried the brute-force method of changing every character in the graph, wasn't getting the answer, and it was too cumbersome to debug. Then I realized that instead of changing every char and looking for a reflection, look for a modified reflection. The wrapper around the code is too full of print stmts etc, but I'm happy with the core solution.
   :replies: []
 - :author: glebm
-  :url: https://www.reddit.com/r/adventofcode/comments/18h940b/2023_day_13_solutions/kd5o37o/
+  :url: https://www.reddit.com/r/adventofcode/comments/18h940b/2023_day_13_solutions/kd5o37o
   :body: |-
     No clever tricks needed today, simply brute-force.
 
@@ -73,11 +73,11 @@
     https://github.com/glebm/advent-of-code
   :replies: []
 - :author: Various_Frosting4888
-  :url: https://www.reddit.com/r/adventofcode/comments/18h940b/2023_day_13_solutions/kd6hozf/
+  :url: https://www.reddit.com/r/adventofcode/comments/18h940b/2023_day_13_solutions/kd6hozf
   :body: "[https://pastebin.com/gRvQvrWx](https://pastebin.com/gRvQvrWx)"
   :replies: []
 - :author: Symbroson
-  :url: https://www.reddit.com/r/adventofcode/comments/18h940b/2023_day_13_solutions/kd6j5b3/
+  :url: https://www.reddit.com/r/adventofcode/comments/18h940b/2023_day_13_solutions/kd6j5b3
   :body: |-
     My initial code was horrible, after cleanup it actually looks quite nice.
 
@@ -125,7 +125,7 @@
     ```
   :replies: []
 - :author: Unhappy_Adeptness_93
-  :url: https://www.reddit.com/r/adventofcode/comments/18h940b/2023_day_13_solutions/kd72ekb/
+  :url: https://www.reddit.com/r/adventofcode/comments/18h940b/2023_day_13_solutions/kd72ekb
   :body: |-
     Finding hamming distance in part 2 was easy after using int representations of the rows/columns for debugging on part 1.