advent_of_ruby 0.3.1 → 0.3.2

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

@@ -1,6 +1,6 @@
 ---
 - :author: p_tseng
-  :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebjsc3u/
+  :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebjsc3u
   :body: |-
     Hello. Ruby, runs in 1 second, using https://en.wikipedia.org/wiki/Summed-area\_table, that would make it O(n^3 )
 
@@ -64,11 +64,11 @@
     ```
   :replies:
   - :author: beached
-    :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebll01x/
+    :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebll01x
     :body: In C++ using summed area tables is \<8ms. One of the few times storing data vs a simple calculation is faster
     :replies: []
   - :author: WikiTextBot
-    :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebjscbq/
+    :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebjscbq
     :body: |-
       **Summed-area table**
 
@@ -79,7 +79,7 @@
       ^[[^PM](https://www.reddit.com/message/compose?to=kittens_from_space) ^| [^Exclude ^me](https://reddit.com/message/compose?to=WikiTextBot&message=Excludeme&subject=Excludeme) ^| [^Exclude ^from ^subreddit](https://np.reddit.com/r/adventofcode/about/banned) ^| [^FAQ ^/ ^Information](https://np.reddit.com/r/WikiTextBot/wiki/index) ^| [^Source](https://github.com/kittenswolf/WikiTextBot) ^] ^Downvote ^to ^remove ^| ^v0.28
     :replies: []
 - :author: ChronJob
-  :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebjppk9/
+  :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebjppk9
   :body: |-
     Ruby
 
@@ -120,15 +120,15 @@
     ```
   :replies:
   - :author: d4be4st
-    :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebleudd/
+    :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebleudd
     :body: Is there a reason you only took 20 points for the width of the biggest square?
     :replies:
     - :author: ChronJob
-      :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebllv6c/
+      :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebllv6c
       :body: Nope. It was an arbitrary cut-off based on how long I was willing to spend searching at that time :P.
       :replies: []
 - :author: oezi13
-  :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebjrbnj/
+  :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebjrbnj
   :body: |-
     Based on my puzzle input - Largest square at 231, 135 with gridsize 8:
 
@@ -200,7 +200,7 @@
     ```
   :replies:
   - :author: imguralbumbot
-    :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebjrbx4/
+    :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebjrbx4
     :body: |-
       ^(Hi, I'm a bot for linking direct images of albums with only 1 image)
 
@@ -209,7 +209,7 @@
       ^^[Source](https://github.com/AUTplayed/imguralbumbot) ^^| ^^[Why?](https://github.com/AUTplayed/imguralbumbot/blob/master/README.md) ^^| ^^[Creator](https://np.reddit.com/user/AUTplayed/) ^^| ^^[ignoreme](https://np.reddit.com/message/compose/?to=imguralbumbot&subject=ignoreme&message=ignoreme) ^^| ^^[deletthis](https://np.reddit.com/message/compose/?to=imguralbumbot&subject=delet%20this&message=delet%20this%20ebjrbx4)
     :replies: []
 - :author: HeyItsBATMANagain
-  :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebk9m8w/
+  :url: https://www.reddit.com/r/adventofcode/comments/a53r6i/2018_day_11_solutions/ebk9m8w
   :body: |-
     # Crystal
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: p_tseng
-  :url: https://www.reddit.com/r/adventofcode/comments/a5eztl/2018_day_12_solutions/ebm4fz5/
+  :url: https://www.reddit.com/r/adventofcode/comments/a5eztl/2018_day_12_solutions/ebm4fz5
   :body: |-
     Part 1: I got confused for a moment because I forgot to actually store the rules. You'll notice that I wrote a `fetch` which errors if the key doesn't exist, since I saw "all patterns are present" in the description. But this made me wonder whether I was missing a pattern, and I spent some time trying to figure out whether my input had accidentally gotten truncated. Then I realised, of course, 32 is in fact the correct number of lines in the input. And then I discovered I actually forgot to store the rules.
 
@@ -51,7 +51,7 @@
     ```
   :replies:
   - :author: OneParanoidDuck
-    :url: https://www.reddit.com/r/adventofcode/comments/a5eztl/2018_day_12_solutions/ebx6nm8/
+    :url: https://www.reddit.com/r/adventofcode/comments/a5eztl/2018_day_12_solutions/ebx6nm8
     :body: |-
       Finally, someone else who mentions bit patterns.. Seems like I'm the only idiot to actually do it with bitwise operations on integers. Wanted to because I feel I'm getting a bit too comfortable using fancy language constructs.
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: KeyboardFire
-  :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/eboleqg/
+  :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/eboleqg
   :body: |-
     ruby 2nd/1st
 
@@ -88,7 +88,7 @@
     ```
   :replies:
   - :author: topaz2078
-    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebolgt5/
+    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebolgt5
     :body: |-
       > ruby 2nd/1st
 
@@ -99,34 +99,34 @@
       Note to self, make a 100000-wide grid next time.
     :replies: []
   - :author: dtinth
-    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebomfmk/
+    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebomfmk
     :body: |-
       Congrats on getting 2nd/1st!
 
       Just a bit of tip that you can sort an array by multiple values by using an Array as a sort key: `ca.sort_by!{|c|[c.y,c.x]}`
     :replies:
     - :author: KeyboardFire
-      :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebomq8c/
+      :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebomq8c
       :body: oh cool, i didn't know that. thanks!
       :replies: []
   - :author: jonathan_paulson
-    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebom43c/
+    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebom43c
     :body: Thanks for posting. Your code for handling the rotations (`\ / +`) is really concise!
     :replies: []
   - :author: markasoftware
-    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebomy9b/
+    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebomy9b
     :body: Holy shit, storing x and y component velocities never crossed my mind! Absolutely brilliant!
     :replies: []
   - :author: sigacuckoo
-    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebose9c/
+    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebose9c
     :body: Directions as speed vector really cleans the code up! I used the transition maps like most of the people.
     :replies: []
   - :author: tobiasvl
-    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/eboxdwy/
+    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/eboxdwy
     :body: For me, part 2 seems to be off by one in the X coordinate (I had `54,66` while your code prints out `55\n66`).
     :replies: []
   - :author: VikeStep
-    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebp3lw0/
+    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebp3lw0
     :body: |-
       Just fyi, your example above the code has the permutations switched around for the corners. It should be the following as it appears in your code:
 
@@ -136,23 +136,23 @@
       ```
     :replies:
     - :author: KeyboardFire
-      :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebqu451/
+      :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebqu451
       :body: whoops, fixed that, thanks!
       :replies: []
   - :author: jtgorn
-    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebqm2re/
+    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebqm2re
     :body: Beautiful. What sort of syntax is it ?v ?^ etc.. ?
     :replies:
     - :author: KeyboardFire
-      :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebqu5d6/
+      :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebqu5d6
       :body: it's sugar for single-character strings (e.g. `?v == "v"`)
       :replies:
       - :author: jtgorn
-        :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebtbonm/
+        :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ebtbonm
         :body: Thanks! I have learned one thing today :)
         :replies: []
   - :author: koordinate
-    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ecgbyjm/
+    :url: https://www.reddit.com/r/adventofcode/comments/a5qd71/2018_day_13_solutions/ecgbyjm
     :body: |-
       Nice. Thank you for sharing.
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: ni3t
-  :url: https://www.reddit.com/r/adventofcode/comments/a61ojp/2018_day_14_solutions/ebr5ufg/
+  :url: https://www.reddit.com/r/adventofcode/comments/a61ojp/2018_day_14_solutions/ebr5ufg
   :body: |-
     ## CARD The Christmas/Advent Research & Development (C.A.R.D.) department at AoC, Inc. just published a new white paper on Elf Chocolate Recipes.
 
@@ -42,7 +42,7 @@
     ```
   :replies: []
 - :author: Unihedron
-  :url: https://www.reddit.com/r/adventofcode/comments/a61ojp/2018_day_14_solutions/ebr3em5/
+  :url: https://www.reddit.com/r/adventofcode/comments/a61ojp/2018_day_14_solutions/ebr3em5
   :body: |-
     [Card] [image](https://i.imgur.com/w5qydaR.png)
 
@@ -102,7 +102,7 @@
     ```
   :replies: []
 - :author: _liquidlemon
-  :url: https://www.reddit.com/r/adventofcode/comments/a61ojp/2018_day_14_solutions/ebrask4/
+  :url: https://www.reddit.com/r/adventofcode/comments/a61ojp/2018_day_14_solutions/ebrask4
   :body: |-
     **Ruby**
 
@@ -152,7 +152,7 @@
     ```
   :replies:
   - :author: kamireri
-    :url: https://www.reddit.com/r/adventofcode/comments/a61ojp/2018_day_14_solutions/ebvh39s/
+    :url: https://www.reddit.com/r/adventofcode/comments/a61ojp/2018_day_14_solutions/ebvh39s
     :body: |-
       There's a small bug in the last if/else statement in the block. When the next digit doesn't match the one that we're expecting in the pattern, it might be the first digit of the pattern. I've put a revised version below. It now produces the correct result for the '01245' test input.
 
@@ -199,7 +199,7 @@
       ```
     :replies: []
 - :author: jtgorn
-  :url: https://www.reddit.com/r/adventofcode/comments/a61ojp/2018_day_14_solutions/ebtfakm/
+  :url: https://www.reddit.com/r/adventofcode/comments/a61ojp/2018_day_14_solutions/ebtfakm
   :body: |-
     I love ruby
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: leio10
-  :url: https://www.reddit.com/r/adventofcode/comments/a6chwa/2018_day_15_solutions/ebvjsbq/
+  :url: https://www.reddit.com/r/adventofcode/comments/a6chwa/2018_day_15_solutions/ebvjsbq
   :body: |-
     [Ruby]
 
@@ -9,7 +9,7 @@
     My biggest problem was that I was considering the _reading order_ when choosing the next step for moving, but not doing it to choose the target adjacent square. I even passed the part 1 with this error, but not the part 2. I finally fixed adding the target to array in [https://gist.github.com/leio10/6a73c9380348a2ff57d54185d1d40d25#file-aoc-day15-rb-L85](https://gist.github.com/leio10/6a73c9380348a2ff57d54185d1d40d25#file-aoc-day15-rb-L85)
   :replies: []
 - :author: "[deleted]"
-  :url: https://www.reddit.com/r/adventofcode/comments/a6chwa/2018_day_15_solutions/ebxknfq/
+  :url: https://www.reddit.com/r/adventofcode/comments/a6chwa/2018_day_15_solutions/ebxknfq
   :body: |-
     This took me a while, and my solution in **Ruby** is a bit verbose - but I tried to make it easy to follow (at least for myself) to minimize mistakes.
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: p_tseng
-  :url: https://www.reddit.com/r/adventofcode/comments/a6mf8a/2018_day_16_solutions/ebw7asl/
+  :url: https://www.reddit.com/r/adventofcode/comments/a6mf8a/2018_day_16_solutions/ebw7asl
   :body: |-
     A very fun logic puzzle!
 
@@ -92,22 +92,22 @@
     ```
   :replies:
   - :author: BluFoot
-    :url: https://www.reddit.com/r/adventofcode/comments/a6mf8a/2018_day_16_solutions/ebw7nrw/
+    :url: https://www.reddit.com/r/adventofcode/comments/a6mf8a/2018_day_16_solutions/ebw7nrw
     :body: |-
       > raise 'You forgot an instruction...' if instructions.size != 16
 
       I wish I'd written this, would have saved me a lot of time!!
     :replies:
     - :author: sigacuckoo
-      :url: https://www.reddit.com/r/adventofcode/comments/a6mf8a/2018_day_16_solutions/ebx88wi/
+      :url: https://www.reddit.com/r/adventofcode/comments/a6mf8a/2018_day_16_solutions/ebx88wi
       :body: Hahaha :( I lost so much time because i forgot to add one of the commands to the list.
       :replies: []
   - :author: ButItMightJustWork
-    :url: https://www.reddit.com/r/adventofcode/comments/a6mf8a/2018_day_16_solutions/ebwdjta/
+    :url: https://www.reddit.com/r/adventofcode/comments/a6mf8a/2018_day_16_solutions/ebwdjta
     :body: 'regarding your spoiler/hint: I just assuned that this was the case and implemented the necessary code.'
     :replies: []
 - :author: BluFoot
-  :url: https://www.reddit.com/r/adventofcode/comments/a6mf8a/2018_day_16_solutions/ebw7hzj/
+  :url: https://www.reddit.com/r/adventofcode/comments/a6mf8a/2018_day_16_solutions/ebw7hzj
   :body: |-
     Ruby, #117/127. Somehow skipped over the binary OR instructions in part 1, and had brain lag trying to figure out part 2. But overall happy with the solution!
 
@@ -189,7 +189,7 @@
     ```
   :replies: []
 - :author: nuvan
-  :url: https://www.reddit.com/r/adventofcode/comments/a6mf8a/2018_day_16_solutions/ebw8q6u/
+  :url: https://www.reddit.com/r/adventofcode/comments/a6mf8a/2018_day_16_solutions/ebw8q6u
   :body: |-
     **Ruby** 177/321
 
@@ -308,6 +308,6 @@
     ```
   :replies:
   - :author: BluFoot
-    :url: https://www.reddit.com/r/adventofcode/comments/a6mf8a/2018_day_16_solutions/ebx06fa/
+    :url: https://www.reddit.com/r/adventofcode/comments/a6mf8a/2018_day_16_solutions/ebx06fa
     :body: Tabs?! In Ruby?! HERESY!
     :replies: []

data/data/solutions/reddit/ruby/2018/17.yml

@@ -1,6 +1,6 @@
 ---
 - :author: p_tseng
-  :url: https://www.reddit.com/r/adventofcode/comments/a6wpup/2018_day_17_solutions/ec0lfem/
+  :url: https://www.reddit.com/r/adventofcode/comments/a6wpup/2018_day_17_solutions/ec0lfem
   :body: |-
     I found this one fun because it was a mix of novel and interesting. My favourite so far.
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: p_tseng
-  :url: https://www.reddit.com/r/adventofcode/comments/a77xq6/2018_day_18_solutions/ec15imz/
+  :url: https://www.reddit.com/r/adventofcode/comments/a77xq6/2018_day_18_solutions/ec15imz
   :body: |-
     The below is NOT the code I used to get into the leaderboard (since that was mostly vanilla)... it is instead kind of insane code. My leaderboard code took 3-4 seconds to run and I was not satisfied.
 
@@ -200,22 +200,22 @@
     ```
   :replies:
   - :author: evonfriedland
-    :url: https://www.reddit.com/r/adventofcode/comments/a77xq6/2018_day_18_solutions/ec2fdb2/
+    :url: https://www.reddit.com/r/adventofcode/comments/a77xq6/2018_day_18_solutions/ec2fdb2
     :body: Thanks for sharing your code, p\_tseng. Are there any good (perhaps with diagrams) walkthroughs of the lookup table approach you might recommend?
     :replies:
     - :author: p_tseng
-      :url: https://www.reddit.com/r/adventofcode/comments/a77xq6/2018_day_18_solutions/ec2qyur/
+      :url: https://www.reddit.com/r/adventofcode/comments/a77xq6/2018_day_18_solutions/ec2qyur
       :body: |-
         This is an interesting one because I don't think I found anything with diagrams, but I found Stack Exchange answer https://codereview.stackexchange.com/questions/42718/optimize-conways-game-of-life/42790#42790 to be useful.
 
         (In case it hasn't already been mentioned, day 18 bears enough resemblance to Conway's Game of Life that the opportunities for speedups are similar between the two. Therefore, search results for "fast game of life" or "optimise game of life" are likely to be useful. I only knew this because this is not the first time it's come up in Advent of Code, since we had https://adventofcode.com/2015/day/18 )
       :replies: []
   - :author: xepherys
-    :url: https://www.reddit.com/r/adventofcode/comments/a77xq6/2018_day_18_solutions/ed9mx0t/
+    :url: https://www.reddit.com/r/adventofcode/comments/a77xq6/2018_day_18_solutions/ed9mx0t
     :body: Very nice. I'm trying desperately to rewrite this in C#, but not knowing Ruby is making it slightly difficult. Building your lookup table initially and your iterate func mostly make sense... I'm sure I can figure it out eventually lol.
     :replies: []
 - :author: BluFoot
-  :url: https://www.reddit.com/r/adventofcode/comments/a77xq6/2018_day_18_solutions/ec1244r/
+  :url: https://www.reddit.com/r/adventofcode/comments/a77xq6/2018_day_18_solutions/ec1244r
   :body: |-
     Ruby, 246/190.
 
@@ -274,6 +274,6 @@
     ```
   :replies:
   - :author: ka-splam
-    :url: https://www.reddit.com/r/adventofcode/comments/a77xq6/2018_day_18_solutions/ec14om3/
+    :url: https://www.reddit.com/r/adventofcode/comments/a77xq6/2018_day_18_solutions/ec14om3
     :body: Please, fix your code formatting?
     :replies: []

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

@@ -1,6 +1,6 @@
 ---
 - :author: ni3t
-  :url: https://www.reddit.com/r/adventofcode/comments/a7j9zc/2018_day_19_solutions/ec4s3z4/
+  :url: https://www.reddit.com/r/adventofcode/comments/a7j9zc/2018_day_19_solutions/ec4s3z4
   :body: |-
     # Ruby 2.5
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: nuvan
-  :url: https://www.reddit.com/r/adventofcode/comments/a7uk3f/2018_day_20_solutions/ec5y7tq/
+  :url: https://www.reddit.com/r/adventofcode/comments/a7uk3f/2018_day_20_solutions/ec5y7tq
   :body: |-
     **Ruby** 117/91
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: KeyboardFire
-  :url: https://www.reddit.com/r/adventofcode/comments/a86jgt/2018_day_21_solutions/ec8fsc5/
+  :url: https://www.reddit.com/r/adventofcode/comments/a86jgt/2018_day_21_solutions/ec8fsc5
   :body: |-
     ruby, 21/24. i'm posting the interesting bit because this wasn't actually my part 2 code (i bruteforced it), but i'm glad i managed to finish the reverse engineering by hand before the leaderboard got capped, so:
 
@@ -34,15 +34,15 @@
     8595037 and 65899 are presumably per-user constants. all those bitwise ands with ffffff are just to make `b` behave as if it were an unsigned 24-bit int. this solves part 2 in a few milliseconds (my brute force took several minutes).
   :replies:
   - :author: jonathan_paulson
-    :url: https://www.reddit.com/r/adventofcode/comments/a86jgt/2018_day_21_solutions/ec8fycp/
+    :url: https://www.reddit.com/r/adventofcode/comments/a86jgt/2018_day_21_solutions/ec8fycp
     :body: What do you mean by "I bruteforced it" for part 2? You have to know to look for a cycle to figure out when to print the answer, right?
     :replies:
     - :author: KeyboardFire
-      :url: https://www.reddit.com/r/adventofcode/comments/a86jgt/2018_day_21_solutions/ec8g32j/
+      :url: https://www.reddit.com/r/adventofcode/comments/a86jgt/2018_day_21_solutions/ec8g32j
       :body: yeah, i knew based on the challenge description that it'd have to cycle, so i just ran the input through my "emulator" without any optimizations and printed the values of the register whenever they were compared to register 0, then found when that first started cycling.
       :replies: []
 - :author: Etsap1
-  :url: https://www.reddit.com/r/adventofcode/comments/a86jgt/2018_day_21_solutions/ec9fybq/
+  :url: https://www.reddit.com/r/adventofcode/comments/a86jgt/2018_day_21_solutions/ec9fybq
   :body: |-
     My brute force solution took almost 30 minutes to run. Here is the optimized version in ruby, which usually runs in less than 20ms:
 

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

@@ -1,13 +1,13 @@
 ---
 - :author: Immediate_Channel
-  :url: https://www.reddit.com/r/adventofcode/comments/a8i1cy/2018_day_22_solutions/ecc2o5o/
+  :url: https://www.reddit.com/r/adventofcode/comments/a8i1cy/2018_day_22_solutions/ecc2o5o
   :body: |-
     My **ruby** solution takes 188 seconds to run with a handrolled A\*. What am I doing wrong?
 
     https://pastebin.com/raw/WtZ8ALEK
   :replies:
   - :author: dark_terrax
-    :url: https://www.reddit.com/r/adventofcode/comments/a8i1cy/2018_day_22_solutions/ecc6n6k/
+    :url: https://www.reddit.com/r/adventofcode/comments/a8i1cy/2018_day_22_solutions/ecc6n6k
     :body: |-
       I don't know Ruby at all, but just glancing at your solution, my guess is that the inner loop of your pathfinding solution is going to be insanely expensive due to not using a proper priority\_queue.
 
@@ -20,7 +20,7 @@
       I would try finding a decent priority\_queue implementation in Ruby and use that.
     :replies:
     - :author: Immediate_Channel
-      :url: https://www.reddit.com/r/adventofcode/comments/a8i1cy/2018_day_22_solutions/eccam6h/
+      :url: https://www.reddit.com/r/adventofcode/comments/a8i1cy/2018_day_22_solutions/eccam6h
       :body: |-
         Hey, thanks! I changed it to use a priority queue and my runtime went from 188 seconds to 5.
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: BluFoot
-  :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecdbygg/
+  :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecdbygg
   :body: |-
     **Ruby**. 700/102. Wasted half an hour from missing a minus sign in the regex scan... Yay.
 
@@ -53,23 +53,23 @@
     ```
   :replies:
   - :author: rawling
-    :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecddxdj/
+    :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecddxdj
     :body: This is roughly what I did (just... much better), and both my code and it get the same, wrong answer.
     :replies:
     - :author: metalim
-      :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecde25n/
+      :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecde25n
       :body: Because it happens to work only for his specific input. It's not a general solution. Doesn't work for any of my inputs.
       :replies:
       - :author: rawling
-        :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecdeju5/
+        :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecdeju5
         :body: Yeah, I think I can visualise a situation where the shrinking grid homes in on a local maximum but misses the global maximum that was hiding between grid points.
         :replies: []
   - :author: xiongtx
-    :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecejs06/
+    :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecejs06
     :body: "> Wasted half an hour from missing a minus sign in the regex scan... Yay.\n\n\U0001F602 Every day I fall into a different \U0001F573️...and it seems I'm never alone!"
     :replies: []
 - :author: p_tseng
-  :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecddocv/
+  :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecddocv
   :body: |-
     So, despite having done well today, I just found an input that my solution doesn't work for, so it's definitely not general. It worked for me, but I'll have to look into a better approach for other inputs. The zoom in/zoom out strategy seems like it has a ton of promise so I'm going to try that next.
 
@@ -161,14 +161,14 @@
     ```
   :replies:
   - :author: rcuhljr
-    :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecddx2g/
+    :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecddx2g
     :body: |-
       > So, despite having done well today, I just found an input that my solution doesn't work for, so it's definitely not general. It worked for me, but I'll have to look into a better approach for other inputs. The zoom in/zoom out strategy seems like it has a ton of promise so I'm going to try that next.
 
       You're not alone, I've been pulling my hair out over my solution. I came here for some sanity checks, and people were generally taking naive approaches similar to what I was doing (moving closer looking for better local maximas). Taking that I tried some other solutions with my data to see if I just had a problem with my implementation, so far I've tried 4 other solvers and none has yielded a correct solution, I'm going to try the Z3 sat solver next and see how it does, but that's a super unsatisfying (hah) approach.
     :replies: []
   - :author: p_tseng
-    :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/echnznq/
+    :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/echnznq
     :body: |-
       At this point, I've explored a bunch of solutions and I'm going to throw my hat in with the strategy of splitting the search space into octants and calculating an **upper bound** of the number of intersections for the regions created. When you contract down to a single point, you know the bound is exact. When all remaining candidates have upper bounds smaller than the best you've found so far, you terminate the search because you know you can do no better than what you've already found.
 
@@ -358,15 +358,15 @@
       ```
     :replies: []
   - :author: metalim
-    :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecdeoxn/
+    :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecdeoxn
     :body: "> Yep, doesn't work for both of my inputs. As other 5 solutions from this thread. So far best approach for me was picking random points, then check around, LMAO."
     :replies:
     - :author: rawling
-      :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecdvdyg/
+      :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/ecdvdyg
       :body: "> Edit: This solution is completely bogus. It got the \"right answer\" because it identified a local maximum that just so happened to have an equal Manhattan distance from the origin as my real answer. It thinks the maximum has 834 bots, but my real maximum has 980 bots.\n\nLove it \U0001F602"
       :replies: []
 - :author: maus80
-  :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/echuncc/
+  :url: https://www.reddit.com/r/adventofcode/comments/a8s17l/2018_day_23_solutions/echuncc
   :body: |-
     Ruby (pure/no gems) implementation (for part 2) that I believe (should) work on any input
 

data/data/solutions/reddit/ruby/2018/24.yml

@@ -1,6 +1,6 @@
 ---
 - :author: dtinth
-  :url: https://www.reddit.com/r/adventofcode/comments/a91ysq/2018_day_24_solutions/ecfzhjm/
+  :url: https://www.reddit.com/r/adventofcode/comments/a91ysq/2018_day_24_solutions/ecfzhjm
   :body: |-
     **Ruby** , #30/#24
 
@@ -125,7 +125,7 @@
     ```
   :replies: []
 - :author: BluFoot
-  :url: https://www.reddit.com/r/adventofcode/comments/a91ysq/2018_day_24_solutions/ecfz1y9/
+  :url: https://www.reddit.com/r/adventofcode/comments/a91ysq/2018_day_24_solutions/ecfz1y9
   :body: |-
     **Ruby,** 74/48. Loved this one!
 
@@ -224,10 +224,10 @@
     ```
   :replies:
   - :author: Unihedron
-    :url: https://www.reddit.com/r/adventofcode/comments/a91ysq/2018_day_24_solutions/ecg1wzj/
+    :url: https://www.reddit.com/r/adventofcode/comments/a91ysq/2018_day_24_solutions/ecg1wzj
     :body: "`0.upto(Float::INFINITY)` can be rewritten to `0.step` for generalization; `.step` with no arguments provided will go on indefinitely with `step=1` (thus allowing lazy enumerable operations)."
     :replies:
     - :author: BluFoot
-      :url: https://www.reddit.com/r/adventofcode/comments/a91ysq/2018_day_24_solutions/ecgh61w/
+      :url: https://www.reddit.com/r/adventofcode/comments/a91ysq/2018_day_24_solutions/ecgh61w
       :body: Thank you! That's great.
       :replies: []

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

@@ -1,6 +1,6 @@
 ---
 - :author: KeyboardFire
-  :url: https://www.reddit.com/r/adventofcode/comments/a9c61w/2018_day_25_solutions/eci5rgz/
+  :url: https://www.reddit.com/r/adventofcode/comments/a9c61w/2018_day_25_solutions/eci5rgz
   :body: |-
     ruby, 10/58:
 
@@ -32,15 +32,15 @@
     well, i really shouldn't be complaining, because i had tons of fun doing the puzzles, which i'm sure consumed lots of free time to make. thanks so much /u/topaz2078 for all the work it took to organize this! :)
   :replies:
   - :author: Porky623
-    :url: https://www.reddit.com/r/adventofcode/comments/a9c61w/2018_day_25_solutions/eci69yp/
+    :url: https://www.reddit.com/r/adventofcode/comments/a9c61w/2018_day_25_solutions/eci69yp
     :body: I feel for you, last year I missed exactly one star and I didn't want to copy paste a solution so I just went to sleep and got the last two stars the next day. This year, though, I was prepared, as you will be next year should you decide to participate again!
     :replies: []
   - :author: dan_144
-    :url: https://www.reddit.com/r/adventofcode/comments/a9c61w/2018_day_25_solutions/eci6pf9/
+    :url: https://www.reddit.com/r/adventofcode/comments/a9c61w/2018_day_25_solutions/eci6pf9
     :body: Day 23 Part 2 was the only solution that took me over 24 hours as well. I finished it up this afternoon in anticipation of Part 2 since I'd been forewarned that it required all 49 other stars.
     :replies: []
   - :author: craigontour
-    :url: https://www.reddit.com/r/adventofcode/comments/a9c61w/2018_day_25_solutions/ecicggk/
+    :url: https://www.reddit.com/r/adventofcode/comments/a9c61w/2018_day_25_solutions/ecicggk
     :body: |-
       Hi. Well done on AoC. I'm new to it too, but only managed handful of stars. I have learned lots, but far more still to learn.
 
@@ -55,7 +55,7 @@
       is the + [x,y,z,ew]] superfluous?
     :replies: []
 - :author: p_tseng
-  :url: https://www.reddit.com/r/adventofcode/comments/a9c61w/2018_day_25_solutions/eci7dju/
+  :url: https://www.reddit.com/r/adventofcode/comments/a9c61w/2018_day_25_solutions/eci7dju
   :body: |-
     I admit I took a cheap shot on this problem. I already had Union-Find written for last year's day 14, so I just imported it and most of my time was spent reminding myself how I was supposed to use it.
 
@@ -116,7 +116,7 @@
     Thanks for a great month!
   :replies:
   - :author: koordinate
-    :url: https://www.reddit.com/r/adventofcode/comments/a9c61w/2018_day_25_solutions/edwqqtn/
+    :url: https://www.reddit.com/r/adventofcode/comments/a9c61w/2018_day_25_solutions/edwqqtn
     :body: |-
       Thank you. For kicks, here is a Swift translation of your code: