advent_of_ruby 0.3.1 → 0.3.2

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

@@ -1,13 +1,13 @@
 ---
 - :author: J-Swift
-  :url: https://www.reddit.com/r/adventofcode/comments/e8m1z3/2019_day_10_solutions/fbcvg9u/
+  :url: https://www.reddit.com/r/adventofcode/comments/e8m1z3/2019_day_10_solutions/fbcvg9u
   :body: |-
     Ruby
 
     https://github.com/J-Swift/advent-of-code-2019/tree/master/day\_10
   :replies: []
 - :author: Yardboy
-  :url: https://www.reddit.com/r/adventofcode/comments/e8m1z3/2019_day_10_solutions/fai82fg/
+  :url: https://www.reddit.com/r/adventofcode/comments/e8m1z3/2019_day_10_solutions/fai82fg
   :body: |-
     # Ruby
 
@@ -36,7 +36,7 @@
     After I solved it using only the slope
   :replies: []
 - :author: el_daniero
-  :url: https://www.reddit.com/r/adventofcode/comments/e8m1z3/2019_day_10_solutions/fafbqhm/
+  :url: https://www.reddit.com/r/adventofcode/comments/e8m1z3/2019_day_10_solutions/fafbqhm
   :body: |-
     Ruby.
 
@@ -83,7 +83,7 @@
     ```
   :replies: []
 - :author: petercooper
-  :url: https://www.reddit.com/r/adventofcode/comments/e8m1z3/2019_day_10_solutions/fae1va2/
+  :url: https://www.reddit.com/r/adventofcode/comments/e8m1z3/2019_day_10_solutions/fae1va2
   :body: |-
     **Ruby**
 

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

@@ -1,13 +1,13 @@
 ---
 - :author: J-Swift
-  :url: https://www.reddit.com/r/adventofcode/comments/e92jm2/2019_day_11_solutions/fbczcr4/
+  :url: https://www.reddit.com/r/adventofcode/comments/e92jm2/2019_day_11_solutions/fbczcr4
   :body: |-
     Ruby
 
     https://github.com/J-Swift/advent-of-code-2019/tree/master/day\_11
   :replies: []
 - :author: Kache
-  :url: https://www.reddit.com/r/adventofcode/comments/e92jm2/2019_day_11_solutions/faj25ci/
+  :url: https://www.reddit.com/r/adventofcode/comments/e92jm2/2019_day_11_solutions/faj25ci
   :body: |-
     **Ruby** shortened to 17 lines, not counting `Intcode`:
 
@@ -32,7 +32,7 @@
     ```
   :replies: []
 - :author: el_daniero
-  :url: https://www.reddit.com/r/adventofcode/comments/e92jm2/2019_day_11_solutions/fai7sld/
+  :url: https://www.reddit.com/r/adventofcode/comments/e92jm2/2019_day_11_solutions/fai7sld
   :body: |-
     Ruby again.
 
@@ -66,7 +66,7 @@
     The whole thing can be seen here: [aoc2019/ruby/11.rb](https://github.com/daniero/code-challenges/blob/master/aoc2019/ruby/11.rb)
   :replies: []
 - :author: Yardboy
-  :url: https://www.reddit.com/r/adventofcode/comments/e92jm2/2019_day_11_solutions/fai7p2m/
+  :url: https://www.reddit.com/r/adventofcode/comments/e92jm2/2019_day_11_solutions/fai7p2m
   :body: |-
     # Ruby
 
@@ -93,7 +93,7 @@
     Cause then I had the answer right
   :replies: []
 - :author: MaterialFerret
-  :url: https://www.reddit.com/r/adventofcode/comments/e92jm2/2019_day_11_solutions/fai5kx5/
+  :url: https://www.reddit.com/r/adventofcode/comments/e92jm2/2019_day_11_solutions/fai5kx5
   :body: |-
     # Ruby
 
@@ -102,7 +102,7 @@
     [https://github.com/LesnyRumcajs/advent-of-ruby-2019/blob/master/src/day11.rb](https://github.com/LesnyRumcajs/advent-of-ruby-2019/blob/master/src/day11.rb)
   :replies: []
 - :author: hdf1986
-  :url: https://www.reddit.com/r/adventofcode/comments/e92jm2/2019_day_11_solutions/fahd4f9/
+  :url: https://www.reddit.com/r/adventofcode/comments/e92jm2/2019_day_11_solutions/fahd4f9
   :body: |-
     I did wrote my solutions on Ruby, if there's another intcode problem i'll probably separate my intcodeVM to another module/file.
 
@@ -113,7 +113,7 @@
     Part2: [https://github.com/hdf1986/advent-of-code/blob/master/day11/part2.rb](https://github.com/hdf1986/advent-of-code/blob/master/day11/part1.rb)
   :replies: []
 - :author: p_tseng
-  :url: https://www.reddit.com/r/adventofcode/comments/e92jm2/2019_day_11_solutions/fagct5o/
+  :url: https://www.reddit.com/r/adventofcode/comments/e92jm2/2019_day_11_solutions/fagct5o
   :body: |-
     Ruby [11_intcode_langtons\_ant.rb](https://github.com/petertseng/adventofcode-rb-2019/blob/master/11_intcode_langtons_ant.rb) and [lib/intcode.rb](https://github.com/petertseng/adventofcode-rb-2019/blob/master/lib/intcode.rb) for 96/56 today. Has been cleaned up but the idea is the same.
 

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

@@ -1,20 +1,20 @@
 ---
 - :author: J-Swift
-  :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fbd2dmf/
+  :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fbd2dmf
   :body: |-
     Ruby
 
     https://github.com/J-Swift/advent-of-code-2019/tree/master/day\_12
   :replies:
   - :author: craigontour
-    :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fefyp14/
+    :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fefyp14
     :body: |-
       > Swift
 
       Hi. Please could you explain the logic of your hashing. I see it creates a hash for each axis. How does this get to an answer?
     :replies:
     - :author: J-Swift
-      :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/feirq84/
+      :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/feirq84
       :body: |-
         The general solution relies on the fact that X/Y/Z are actually independent. So you figure out how long X takes to repeat by itself, how long Y takes to repeat by itself, and how long Z takes to repeat by itself. Then you figure out the least common multiple of those for the solution.
 
@@ -44,14 +44,14 @@
         I chose the '\_' and 'x' characters so that the components being joined were unambiguous.
       :replies: []
 - :author: MaterialFerret
-  :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fauykys/
+  :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fauykys
   :body: |-
     Ruby: [https://github.com/LesnyRumcajs/advent-of-ruby-2019/blob/master/src/day12.rb](https://github.com/LesnyRumcajs/advent-of-ruby-2019/blob/master/src/day12.rb)
 
     I believe I came up with relatively clean and short solution - nothing innovative though, looking at the thread. LCMing the x,y and z for part 2. The day I started Advent of Code 2019 in Ruby I abandoned all hope of brute-forcing the solutions. :)
   :replies: []
 - :author: Yardboy
-  :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fam8via/
+  :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fam8via
   :body: |-
     # Ruby
 
@@ -64,14 +64,14 @@
     [https://github.com/Yardboy/advent-of-code/blob/master/2019/puzzle12b/solution.rb](https://github.com/Yardboy/advent-of-code/blob/master/2019/puzzle12b/solution.rb)
   :replies: []
 - :author: petercooper
-  :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/faknhog/
+  :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/faknhog
   :body: |-
     **Ruby**
 
     Because there are so few Ruby solutions here. For the first time this AOC, I caved in and actually used classes and a little structure rather than golfing it as tiny as possible. It still ended up reasonably tight, however: https://github.com/peterc/aoc2019solutions/blob/master/12.rb
   :replies: []
 - :author: hdf1986
-  :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fakngcd/
+  :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fakngcd
   :body: |-
     **Ruby**
 
@@ -82,7 +82,7 @@
     Part 2: [https://github.com/hdf1986/advent-of-code/blob/master/day12/part2.rb](https://github.com/hdf1986/advent-of-code/blob/master/day12/part2.rb)
   :replies: []
 - :author: tckmn
-  :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/faja2gk/
+  :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/faja2gk
   :body: |-
     ruby 28/14
 
@@ -109,37 +109,37 @@
     the strategy, which i assume was the intended one, was to find the period for each coordinate and then lcm them together
   :replies:
   - :author: sophiebits
-    :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fajbk9u/
+    :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fajbk9u
     :body: Um. Tell us more about how you landed on using this hash function.
     :replies:
     - :author: tckmn
-      :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fajc1o1/
+      :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fajc1o1
       :body: that is where my fingers landed on my keyboard
       :replies:
       - :author: sophiebits
-        :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fajd1bh/
+        :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fajd1bh
         :body: Not worried about collisions?
         :replies:
         - :author: tckmn
-          :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fal3bkl/
+          :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fal3bkl
           :body: the original code had fewer digits at the end, i tacked on a few and compared the answers to make sure that didn't happen :P
           :replies: []
   - :author: Kache
-    :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fajfkbc/
+    :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fajfkbc
     :body: |-
       What's the `#ris` method?
 
       Every ruby object has a `#hash` method, by the way, (although I learned from [another comment](https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/faja0lj?utm_source=share&utm_medium=web2x) that it wasn't necessary).
     :replies:
     - :author: tckmn
-      :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fal361d/
+      :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fal361d
       :body: |-
         oh, that's "[r]egex [i]nt[s]", which is a short helper function in my template file that's basically `self.scan(/-?\d+/).map(&:to_i)`
 
         also, that's good to know, thanks!
       :replies: []
   - :author: petercooper
-    :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/faknabz/
+    :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/faknabz
     :body: |-
       While this is paraphrasing somewhat, my solution replaces the `asdfasdf` line with something like:
 
@@ -148,10 +148,10 @@
       .. which nets you something both small and unique to the data, although your solution is different enough that I might be missing something obvious :)
     :replies:
     - :author: tckmn
-      :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fal2y3e/
+      :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fal2y3e
       :body: ah nice - you are definitely not missing anything obvious, this was just the first thing that came to mind when trying to go fast :P
       :replies:
       - :author: petercooper
-        :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fal7ub5/
+        :url: https://www.reddit.com/r/adventofcode/comments/e9j0ve/2019_day_12_solutions/fal7ub5
         :body: To be honest, the pack thing was part of my refactor. My initial "off the cuff" looked more like yours, but was like `a[0] << 48 + a[1] << 32 + a[2] << 16 + a[3]` or something like that, but I've spent a lot of time living in C(!) :-)
         :replies: []

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

@@ -1,13 +1,13 @@
 ---
 - :author: J-Swift
-  :url: https://www.reddit.com/r/adventofcode/comments/e9zgse/2019_day_13_solutions/fbdyaia/
+  :url: https://www.reddit.com/r/adventofcode/comments/e9zgse/2019_day_13_solutions/fbdyaia
   :body: |-
     Ruby
 
     https://github.com/J-Swift/advent-of-code-2019/tree/master/day\_13
   :replies: []
 - :author: Yardboy
-  :url: https://www.reddit.com/r/adventofcode/comments/e9zgse/2019_day_13_solutions/fb5loqa/
+  :url: https://www.reddit.com/r/adventofcode/comments/e9zgse/2019_day_13_solutions/fb5loqa
   :body: |-
     # Ruby
 
@@ -16,7 +16,7 @@
     [https://github.com/Yardboy/advent-of-code/blob/master/2019/puzzle13b/solution.rb](https://github.com/Yardboy/advent-of-code/blob/master/2019/puzzle13b/solution.rb)
   :replies: []
 - :author: hdf1986
-  :url: https://www.reddit.com/r/adventofcode/comments/e9zgse/2019_day_13_solutions/fapgw34/
+  :url: https://www.reddit.com/r/adventofcode/comments/e9zgse/2019_day_13_solutions/fapgw34
   :body: |-
     **Ruby**
 
@@ -36,21 +36,21 @@
     [https://github.com/hdf1986/advent-of-code/tree/master/day13](https://github.com/hdf1986/advent-of-code/tree/master/day13)
   :replies: []
 - :author: vinc686
-  :url: https://www.reddit.com/r/adventofcode/comments/e9zgse/2019_day_13_solutions/fan7f6r/
+  :url: https://www.reddit.com/r/adventofcode/comments/e9zgse/2019_day_13_solutions/fan7f6r
   :body: |-
     [Ruby](https://github.com/vinc/adventofcode/blob/master/ruby/2019/13/)[Screenshot](https://github.com/vinc/adventofcode/blob/master/ruby/2019/13/screenshot.png)
 
     My favorite day so far, very fun! I naively tried to win the game by hand for about a minute before giving up. I also had to hack my `Computer#run` method to get the input from a block and I lost some time there because the last screen after winning the game in autoplay was not printed.
   :replies:
   - :author: ColonelMcColonel
-    :url: https://www.reddit.com/r/adventofcode/comments/e9zgse/2019_day_13_solutions/fan82qb/
+    :url: https://www.reddit.com/r/adventofcode/comments/e9zgse/2019_day_13_solutions/fan82qb
     :body: |-
       Hahaha I did the same too!
 
       I also watched it auto play, I knew I could run it much faster if I just executed the auto-player without rendering at 60FPS, but hey - it was so satisfying!
     :replies: []
 - :author: p_tseng
-  :url: https://www.reddit.com/r/adventofcode/comments/e9zgse/2019_day_13_solutions/fan6cjr/
+  :url: https://www.reddit.com/r/adventofcode/comments/e9zgse/2019_day_13_solutions/fan6cjr
   :body: |-
     Just for fun... of course I solved the problem the regular way at first, but that takes my poor Ruby code _an entire second_ to run, and that's just too slow.
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: Yardboy
-  :url: https://www.reddit.com/r/adventofcode/comments/eafj32/2019_day_14_solutions/fbbicfv/
+  :url: https://www.reddit.com/r/adventofcode/comments/eafj32/2019_day_14_solutions/fbbicfv
   :body: |-
     # Ruby
 
@@ -9,7 +9,7 @@
     [https://github.com/Yardboy/advent-of-code/blob/master/2019/puzzle14b/solution.rb](https://github.com/Yardboy/advent-of-code/blob/master/2019/puzzle14b/solution.rb)
   :replies: []
 - :author: vinc686
-  :url: https://www.reddit.com/r/adventofcode/comments/eafj32/2019_day_14_solutions/faurisj/
+  :url: https://www.reddit.com/r/adventofcode/comments/eafj32/2019_day_14_solutions/faurisj
   :body: |-
     [Ruby](https://github.com/vinc/adventofcode/blob/master/ruby/2019/14/lib.rb)
 

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

@@ -1,13 +1,13 @@
 ---
 - :author: J-Swift
-  :url: https://www.reddit.com/r/adventofcode/comments/eaurfo/2019_day_15_solutions/fbtloxq/
+  :url: https://www.reddit.com/r/adventofcode/comments/eaurfo/2019_day_15_solutions/fbtloxq
   :body: |-
     Ruby
 
     https://github.com/J-Swift/advent-of-code-2019/tree/master/day\_15
   :replies: []
 - :author: petercooper
-  :url: https://www.reddit.com/r/adventofcode/comments/eaurfo/2019_day_15_solutions/fb2lefx/
+  :url: https://www.reddit.com/r/adventofcode/comments/eaurfo/2019_day_15_solutions/fb2lefx
   :body: |-
     [**Ruby**](https://github.com/peterc/aoc2019solutions/blob/master/15.rb)
 
@@ -18,7 +18,7 @@
     _Update: So for part 2 I managed to avoid implementing anything. I just took my maximum distance on the entire map, took away the distance from the origin at the closest intersection to the oxygen tank, then added the length of the passage to to the oxygen tank. No path searching needed as I had the distance values already stored for every single block :-)_
   :replies: []
 - :author: BluFoot
-  :url: https://www.reddit.com/r/adventofcode/comments/eaurfo/2019_day_15_solutions/faxs1m7/
+  :url: https://www.reddit.com/r/adventofcode/comments/eaurfo/2019_day_15_solutions/faxs1m7
   :body: |-
     [Ruby 54/52](https://github.com/acornellier/adventofcode/blob/master/2019/15.rb)
 

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

@@ -1,13 +1,13 @@
 ---
 - :author: Kache
-  :url: https://www.reddit.com/r/adventofcode/comments/ebai4g/2019_day_16_solutions/fb3zrlr/
+  :url: https://www.reddit.com/r/adventofcode/comments/ebai4g/2019_day_16_solutions/fb3zrlr
   :body: |-
     **Ruby**
 
     [Part 1 and 2](https://github.com/Kache/advent_of_code/blob/8ee09f0889873dea5d4fde32ebcd160b5a2dd8b7/2019/solutions.rb#L599), about 10 lines each, runs in 2 secs & 4 secs, respectively
   :replies:
   - :author: craigontour
-    :url: https://www.reddit.com/r/adventofcode/comments/ebai4g/2019_day_16_solutions/fezx2c3/
+    :url: https://www.reddit.com/r/adventofcode/comments/ebai4g/2019_day_16_solutions/fezx2c3
     :body: |-
       > Ruby
 
@@ -24,7 +24,7 @@
       Regards
     :replies:
     - :author: Kache
-      :url: https://www.reddit.com/r/adventofcode/comments/ebai4g/2019_day_16_solutions/ff2c8ir/
+      :url: https://www.reddit.com/r/adventofcode/comments/ebai4g/2019_day_16_solutions/ff2c8ir
       :body: |-
         Unwrapping the `reduce`, the above is same as:
 
@@ -37,11 +37,11 @@
         ```
       :replies:
       - :author: craigontour
-        :url: https://www.reddit.com/r/adventofcode/comments/ebai4g/2019_day_16_solutions/ff39jff/
+        :url: https://www.reddit.com/r/adventofcode/comments/ebai4g/2019_day_16_solutions/ff39jff
         :body: Sorry, I was really after explanation of how reduce(0) works
         :replies: []
   - :author: petercooper
-    :url: https://www.reddit.com/r/adventofcode/comments/ebai4g/2019_day_16_solutions/fb4e57x/
+    :url: https://www.reddit.com/r/adventofcode/comments/ebai4g/2019_day_16_solutions/fb4e57x
     :body: |-
       Woop, Rubyists unite here in the comments :-)
 
@@ -54,6 +54,6 @@
       https://github.com/peterc/aoc2019solutions/blob/master/16.rb
     :replies:
     - :author: vinc686
-      :url: https://www.reddit.com/r/adventofcode/comments/ebai4g/2019_day_16_solutions/fb5105r/
+      :url: https://www.reddit.com/r/adventofcode/comments/ebai4g/2019_day_16_solutions/fb5105r
       :body: I couldn't finish part 2 in time today, I'm really impressed by both of you, my code is a mess by comparison!
       :replies: []

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

@@ -1,6 +1,6 @@
 ---
 - :author: p_tseng
-  :url: https://www.reddit.com/r/adventofcode/comments/ebr7dg/2019_day_17_solutions/fb73yzz/
+  :url: https://www.reddit.com/r/adventofcode/comments/ebr7dg/2019_day_17_solutions/fb73yzz
   :body: |-
     I guess I'll throw my kinda weird solution out there, in the style of some of the weird solutions to day 13.
 
@@ -18,11 +18,11 @@
     I mostly wrote this code since I haven't properly written the code that breaks up the instruction list into three functions yet, so this is just to amuse me while I figure that out and write that...
   :replies:
   - :author: gedhrel
-    :url: https://www.reddit.com/r/adventofcode/comments/ebr7dg/2019_day_17_solutions/fb8xxx5/
+    :url: https://www.reddit.com/r/adventofcode/comments/ebr7dg/2019_day_17_solutions/fb8xxx5
     :body: Yup. I've been reverse engineering the intcode each day after solving the puzzle. Some nice techniques there (including self-modifying code to manage array indexing).
     :replies: []
 - :author: alienpirate5
-  :url: https://www.reddit.com/r/adventofcode/comments/ebr7dg/2019_day_17_solutions/fb6xeny/
+  :url: https://www.reddit.com/r/adventofcode/comments/ebr7dg/2019_day_17_solutions/fb6xeny
   :body: |-
     Ruby: 524/311
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: firetech_SE
-  :url: https://www.reddit.com/r/adventofcode/comments/ec8090/2019_day_18_solutions/fbb0sqh/
+  :url: https://www.reddit.com/r/adventofcode/comments/ec8090/2019_day_18_solutions/fbb0sqh
   :body: |-
     [Ruby, 641/396](https://github.com/firetech/advent-of-code/blob/master/2019/18/keymaze.rb)
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: firetech_SE
-  :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbhgxoo/
+  :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbhgxoo
   :body: |-
     [Ruby, 1485/984](https://github.com/firetech/advent-of-code/blob/master/2019/20/donut.rb)
 
@@ -13,7 +13,7 @@
     Later, I applied some knowledge and tactics from [day 18](https://www.reddit.com/r/adventofcode/comments/ec8090/2019_day_18_solutions/fbb0sqh/) and started precomputing all the paths between portals (using multiple BFSs), followed by two BFSs (one for part 1 and one for part 2) of the precomputed data, the total runtime came down to a more appealing ~0.2s. :)
   :replies: []
 - :author: p_tseng
-  :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbg2tm6/
+  :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbg2tm6
   :body: |-
     58/24. The parsing was the bulk of the difficult work, since BFS is already written and ready to go. I got slowed down on part 1 by type errors (can you believe that I have forgotten how to properly add a single list to a list of lists and had to try no fewer than four times before I got it right?), which is what I get for using a language without static type checking. Did much better on part 2 because it only involved adding another bit to the portals found and adding another dimension to state and by that time I had figured out my type issues. Just had to do a bit of debugging to realise that no, I shouldn't allow traveling to negative depths.
 
@@ -28,7 +28,7 @@
     Haskell: [20_donut_maze.hs](https://github.com/petertseng/adventofcode-hs-2019/blob/master/bin/20_donut_maze.hs) (Haven't gotten around to adding Dijkstra's to this one yet, so this one's just BFS for now)
   :replies:
   - :author: coda_pi
-    :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbg6p0s/
+    :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbg6p0s
     :body: |-
       > Part 2 important note: If you ever go into the same portal more than once, you have repeated a previous position but at a deeper depth and thus you are doomed to wander the halls of Pluto for all eternity.
 
@@ -53,14 +53,14 @@
       I think it may well be the case that you never need to enter level X where X is the number of portals, though.
     :replies:
     - :author: p_tseng
-      :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbg9nq1/
+      :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbg9nq1
       :body: |-
         Thanks, confirmed and acknowledged. Correct path through this maze is of length 18, traveling down through BC twice to depth 2 before exiting up through DE and FG. It's what I get for being too clever I guess. I'll strike out the relevant section of my post.
 
         Note that the map you gave has an interesting property, which is that you can travel from the outer BC portal directly to the inner BC portal. I wonder if it is only the presence of this property that disproves the above principle, and whether the maps given as our inputs lack this property. Or if it has nothing to do with it. I will try to find alternate ways to prove a bound on depth.
       :replies:
       - :author: coda_pi
-        :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbgdp1c/
+        :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbgdp1c
         :body: |-
           Actually, I don't think there's a linear bound on the depth (as a function of the number of portals) to get to the fastest solution. Indeed, imagine a map like this:
 
@@ -95,24 +95,24 @@
           PS This also serves as an example where there's no portal connected directly to itself.
         :replies:
         - :author: metalim
-          :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbi2caf/
+          :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbi2caf
           :body: |-
             That's interesting. So upper bound of levels is around LCM(a,b) where a+b == number of portals.
 
             Don't think, however, that Eric did any "gotchas" in this task. He's kind. Have you noticed, that even outer portals in the task are on same range of coordinates as inner portals? No portals in corners. All of this was done to avoid any uncomfortable parsing.
           :replies: []
     - :author: "[deleted]"
-      :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbg7cdh/
+      :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbg7cdh
       :body: |-
         Nah, whenever you use a portal the second time in the same direction you will end up beeing in the same position as the first time, only some levels deeper. Since start and end are both on level 0 going deeper in levels does not make the solution better.Hence the optimal solution does not have the same portal twice in the same direction in its path.
 
         I think it would be otherwise if we could use negative levels.
       :replies:
       - :author: gedhrel
-        :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbg9trb/
+        :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbg9trb
         :body: 'I think the post you replied to has a concrete counterexample to this statement. You go out twice on the way to the solution: DE -\>(out)-\> DE -\> FG -\> (out) -\> FG -\> ZZ so you must traverse inwards twice through the BC loop first.'
         :replies:
         - :author: "[deleted]"
-          :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbgbgyl/
+          :url: https://www.reddit.com/r/adventofcode/comments/ed5ei2/2019_day_20_solutions/fbgbgyl
           :body: Ah, ok, now I understand. Thanks.
           :replies: []

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

@@ -1,6 +1,6 @@
 ---
 - :author: p_tseng
-  :url: https://www.reddit.com/r/adventofcode/comments/edll5a/2019_day_21_solutions/fbllkye/
+  :url: https://www.reddit.com/r/adventofcode/comments/edll5a/2019_day_21_solutions/fbllkye
   :body: |-
     The story behind this solution is, as usual, twofold:
 
@@ -18,7 +18,7 @@
     Now it runs in about 0.7 seconds, which is within my goal. There could be many more possibilities for the custom opcode, but they require further study of the program before I am able to take advantage of them.
   :replies: []
 - :author: el_daniero
-  :url: https://www.reddit.com/r/adventofcode/comments/edll5a/2019_day_21_solutions/fbjrxiz/
+  :url: https://www.reddit.com/r/adventofcode/comments/edll5a/2019_day_21_solutions/fbjrxiz
   :body: |-
     Haven't gotten to part 2 yet, just wanted to share how nicely it works with Ruby's heredoc strings to blend intcode and jumpcode:
 
@@ -51,7 +51,7 @@
     Haven't looked at other solutions yet, but I solved part 1 manually. The logic is "if there is a hole on either A B or C, but not on D, then jump". Does onviously not work for part 2, so I'll have to work that one out.
   :replies: []
 - :author: Sharparam
-  :url: https://www.reddit.com/r/adventofcode/comments/edll5a/2019_day_21_solutions/fbiol6c/
+  :url: https://www.reddit.com/r/adventofcode/comments/edll5a/2019_day_21_solutions/fbiol6c
   :body: |-
     ## [**Ruby** (366/249)](https://github.com/Sharparam/advent-of-code/blob/master/2019/day21/solution.rb)
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: p_tseng
-  :url: https://www.reddit.com/r/adventofcode/comments/ee0rqi/2019_day_22_solutions/fbnm5sc/
+  :url: https://www.reddit.com/r/adventofcode/comments/ee0rqi/2019_day_22_solutions/fbnm5sc
   :body: |-
     Part 1 was not too bad, especially since Ruby has `rotate` function on arrays.
 
@@ -20,14 +20,14 @@
     Haskell: [22_slam_shuffle.hs](https://github.com/petertseng/adventofcode-hs-2019/blob/master/bin/22_slam_shuffle.hs)
   :replies:
   - :author: Fyvaproldje
-    :url: https://www.reddit.com/r/adventofcode/comments/ee0rqi/2019_day_22_solutions/fbqp1xv/
+    :url: https://www.reddit.com/r/adventofcode/comments/ee0rqi/2019_day_22_solutions/fbqp1xv
     :body: |-
       In my input, there are no 2 adjacent shuffles of the same type. Are there in yours?
 
       At first, I also tried the repetitions route...
     :replies: []
 - :author: tckmn
-  :url: https://www.reddit.com/r/adventofcode/comments/ee0rqi/2019_day_22_solutions/fbnilun/
+  :url: https://www.reddit.com/r/adventofcode/comments/ee0rqi/2019_day_22_solutions/fbnilun
   :body: |-
     ruby (plus some mathematica) 91/18
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: rsthau
-  :url: https://www.reddit.com/r/adventofcode/comments/eefva8/2019_day_23_solutions/fbthisd/
+  :url: https://www.reddit.com/r/adventofcode/comments/eefva8/2019_day_23_solutions/fbthisd
   :body: |-
     Ruby: [both parts](https://topaz.github.io/paste/#XQAAAQBRBAAAAAAAAAA5GUqKNoFH6SMqVwZFsYYqxh4FnZ09RieSSH8z3H6sL03AUlcQkmRnBspAYbyTvczaqGyugOtst3YC3kVpS4F56jNFbmJSnrpqLE9hxeC6BKQA0LPyX/ox6A+hav4qWQ4muJAdqpu70P6TfjJ/nXvlsc5u/twj9HLrvG+pD699I+/OVuFyQ7bGUGGNKQA3z/gIOWuJvpjUpULx0QcIzsJVykfXIsglcsgnVynBcLTUtsYIU1hO2eP+uBACXoAStoj2Fe4kOj0gDjUIFPbJ3paq9Dt9J1YH8RBS3rdYq4txRE+eR1U426ssaSNX/VyuiMn6FtGCEpOyB4kJq53HEQG+ZbmjLZwU+8sl8d/CKjyb1vrm/qjVsqIU/b0+wXbN2vRFL6mOfepRjH5tBKZffcFNJxR1NSj7xKiov3F8B6Ko2LBYeKg5Q/iXBFAtdBYh7byPS7PvM/J5EJZ52cEqcgKxYwN6uzz7kXKYr9/+I/zqLsCs7uUmgo10Ny/t/u/4TZmwtsxrzwIM2F+W/hfJAbHPZtvTfPedP8Gc0mKKOPH7E2xfCySnO3j8QEQ6COz0wIRoqp1Sh/ycHB6Gcn+xJQWn50E+aHqa010rHGPVNZYdQORhwxVMebSevAIRkIzyIY3cGxwXgdZ2Pa7ZYbabnVA9UzEuYZ+v/qmfXA==)
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: p_tseng
-  :url: https://www.reddit.com/r/adventofcode/comments/efca4m/2019_day_25_solutions/fc4qi6w/
+  :url: https://www.reddit.com/r/adventofcode/comments/efca4m/2019_day_25_solutions/fc4qi6w
   :body: |-
     Solved it day-of with mostly manual playing plus machine assistance (replay a list of moves so that I don't lose all my progress, brute-force the pressure pad). I've since gone back and added some nice bells and whistles to the game player, as follows:
 
@@ -30,7 +30,7 @@
     Ruby: [25\_cryostasis.rb](https://github.com/petertseng/adventofcode-rb-2019/blob/master/25_cryostasis.rb)
   :replies: []
 - :author: rsthau
-  :url: https://www.reddit.com/r/adventofcode/comments/efca4m/2019_day_25_solutions/fbzpb4q/
+  :url: https://www.reddit.com/r/adventofcode/comments/efca4m/2019_day_25_solutions/fbzpb4q
   :body: |-
     Ruby: [Code](https://topaz.github.io/paste/#XQAAAQAoBwAAAAAAAAA5GUqKNoFH6SMqVwZFsYYqxh4ExTaLbtf8Alp69UGP9KkSBesmiuVUTdimvKqEHp35RFKztzBU/3FuJv5lldOij8/JmL+Q2WHcQ2y5zCd3FMTB2QOR4oSaHdfg68+rfvTp3WjqEKnUngRyjKlgsL8NxEnXKOBDpzriYeY3qRCQqNNxt1jdGMjJWGzttNCPEZAWwT9c20OyEVP/dmRGJPRlbp9komCqWOQNtHmpFu6v10Qb2awX767abSGKOT3Qui5YZ8EaPN7IvMQCdZPtlN2qfHKzb6TmFeqm6p1WlNCr/2E5o8eR9SEmBALNYIbosLTThyg1JsTaJzTM+dt9gHkG1E3lX0T+vwtVNuXqipmD7jBg4/WZSNDymSifBwjuWg7mflb09TjZdE4lOj+Lu5qS3+IizAdQJ0+YxES3tzBn6qbKOvmTpKh9/NZwW6Bi2yFAoVTOW/VnNBacDOFs8vDG9FE2S6+yKnwWQjnn6DhHDqP2spqMwnJadQgKXz5WQz5YLC4CBnjD4OmQ3HraPN2ioGzjG1dAHCnh22Nx86gNXGD0RHe7Y47TwPgrfXRz64gilLnYH6uTGIMa0Y2JiPLauN6xgaulVWD1sxonlBg8nBU4p9ZXmrI5Jeue3sY6LR7SFEQtJDuB/FlfJpEfNIo6TmHe0RxUzHRQBwOAS5Ao6fQ/1yQX9BRIuIxGnxtLC6Kiz8Yy+P4JtZuqn/0zV1tMZnTN/I9jJdTSlMiY/nv7mUtmLTTelcukouy9b6WvStQqdozCfNoL8df3veLO4sKGzPKCFJaJw0eLspdeCN6FbXo/om+aif3mndfsaJm43ulZPGeGJGg7ZvPZDL/7sroAqYUjlK78jAtQBlsRghtWYqdV1sgaH4HqSr9EwgMnWvjDNiG5X4+P5udHFeeZJu/1jO34jzBYl7XUPFjoFAgqCl2hUA3L6+J7jfCy9jnj6ffaUuPq6ClGqIAMHVU17ru3XhzUkKU+j99wJNH+tfjYZKGp3Y65aB768VqS)