advent_of_ruby 0.3.1 → 0.3.2

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

@@ -1,6 +1,6 @@
 ---
 - :author: skawid
-  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf7vzdf/
+  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf7vzdf
   :body: |-
     Ruby!
 
@@ -9,7 +9,7 @@
     Part 2 took some head scratching to find an algorithm that didn't take forever.
   :replies: []
 - :author: "[deleted]"
-  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf7tg41/
+  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf7tg41
   :body: |-
     **ruby**
 
@@ -22,7 +22,7 @@
     This is a brute force solution but it stops looping when it finds the target for both parts. The approximate completion time is ~5 seconds.
   :replies: []
 - :author: el_daniero
-  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf7edop/
+  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf7edop
   :body: |-
     # Ruby
 
@@ -52,18 +52,18 @@
     ```
   :replies:
   - :author: zeeba_neighba
-    :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf7sog7/
+    :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf7sog7
     :body: Nice! I didn't know about `.lazy` I want to implement that in the future
     :replies: []
 - :author: dearshrewdwit
-  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf79fe3/
+  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf79fe3
   :body: |-
     Functional [Ruby](https://github.com/dearshrewdwit/adventofcode/blob/master/2020/9/cypher-functional.rb) with recursion
 
     Edit: got told off for pasting code, sorry! See link for code
   :replies: []
 - :author: kawzeg
-  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5pkr1/
+  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5pkr1
   :body: |-
     **Ruby**
 
@@ -76,7 +76,7 @@
     ```
   :replies: []
 - :author: damyvv
-  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5q7sm/
+  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5q7sm
   :body: |-
     **Ruby**
 
@@ -89,7 +89,7 @@
     ```
   :replies: []
 - :author: petercooper
-  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5n55h/
+  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5n55h
   :body: |-
     # Ruby
 
@@ -106,14 +106,14 @@
     ```
   :replies: []
 - :author: frontpageminus
-  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf51h87/
+  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf51h87
   :body: |-
     Ruby 1507/706. I forgot to convert the input to ints before adding them, took way too long to figure out
 
     [paste](https://topaz.github.io/paste/#XQAAAQAgAwAAAAAAAAARiAqGkkN7pUjVWW5PmC0L6aBapSEWgmKw16LRnqk8MWLR0XniOEFoHImRzzHbojWP9/KPFyWlRwlf9iuxcCPOF3cwEecpGcDtvpNvX4s0TtaqjSZswu4WXzB4X+spXJnNaUo+Ps9+3O4csu9ETgBALRvcc9ZR+UPnydkXsoHeX+33uO/7/2yBUoveTl2fr3r+Jy7H+D54SKUuwx0M6/UxysDIRhXg9Dv2j2a7kq4NOtwIha7MtDbRnx6Tw3+ut++qywRaWTxfAfNSHL3oM42iMLdYMnWgjghR7j9CaieSdPBdBFVH1zbUy9/WeWaq0KyidvNc7sR7vGScKZIQPjOyuda6ArYH6YUWlUD89mOQmOQ+6VYVMWQAVnpltYDTCUQb8zy8JVeg9mRtYfIbiww3iGoYPAhPj1K8toNHLFmCm0FZShbrZRQ3ykgTWFe+UKSNaAZfqk85RfS8myg7s+sv78rxm0xyyYVHR17MWUf+VX9B0sL9v/3lUNU=)
   :replies: []
 - :author: ni3t
-  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf546jm/
+  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf546jm
   :body: |-
     # Ruby
 
@@ -127,15 +127,15 @@
     ```
   :replies: []
 - :author: odlp
-  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5msmo/
+  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5msmo
   :body: Here's my [solution in Ruby](https://github.com/odlp/advent-of-code-2020/blob/main/day-9/solution.rb).
   :replies: []
 - :author: blafunke
-  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf55til/
+  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf55til
   :body: "[**Ruby**](https://topaz.github.io/paste/#XQAAAQBpAwAAAAAAAAARiEJHiiMzw3cPM/1Y611SZZy8dLcvLPFv5CaI5QAeyDUOD9g6sOqRoHNTUi8vG310j7C40PhkIuDkIfK9LbzmPHL5jWRBHMH9yR5NOmbSsS4BF8FHwzXFHxMtBLjdmCODNvRiPMNfQOxOhHvbbHDUYEWvYg64I3tbZ81WBS4PHm35X/+55lmYBGw6YCnMN07oZ0H/AEjR3rbRTE5ymST2UKrtHL6Yh63ofbNkU2lzC7bD3iwrETmuXRjnwMjuZc7jSw9G6rLKh27rgesAUJ7g8ftT8bd5Qhl7iK0P1b+rzWXc1ZiSA+UT9Awiu/1ZWRCre6OVjiXjnkKhbMZn4nwQTO2D2WiLX2UkWIIZTr4l1YvaPKyv1bAQAOlPoq8RelGPKzWNUqWMSr2O+p2YLL2+ZKf8k4ehfC/1bgVEZSaOF1vF6ghkYmL2rZoM60T6K6Wt+fsFzr25lydHVFElzYffJYgTmXMvXBRkU4wxrSWS+/6r6mBkSCvYACeNV/63RDu0L0IwV2nuwOmHCPPjt3W5c2NbPeSN5sH5G+jLZ1fNgvoKh6mdqBn/+QQsQQ==)"
   :replies: []
 - :author: zxywx
-  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf56juf/
+  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf56juf
   :body: |-
     # Ruby Solution
 
@@ -171,7 +171,7 @@
     ```
   :replies: []
 - :author: CodeIsTheEnd
-  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5aq7n/
+  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5aq7n
   :body: |-
     **Ruby:** 4:37/11:27, 345/634
 
@@ -180,11 +180,11 @@
     Gah, I tried to get fancy and it cost me! For Part 1 I was initially going to sort the previous 25 numbers so it would be easier to check if two numbers added up to the solution, before I realized that then I wouldn't know which value to remove from the sorted array. (Nevermind that you can still check if any two numbers sum to the value in linear time even with them being sorted (See Day 1), and that with the index I could easily figure out which value I needed to remove...) Then in Part 2 I initially tried to implement the linear time solution, but it didn't work, and I mistakenly thought it _couldn't_ work so switched over to the standard n^2 solution.
   :replies:
   - :author: petercooper
-    :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5njrb/
+    :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5njrb
     :body: Fellow Rubyist chiming in again :-D We ran similar times today (you just beat me overall, I was slightly ahead for part 1) but I had a very different approach this time unlike other days. I'm pretty amazed you got all of that down within that time! :-)
     :replies: []
 - :author: Krakhan
-  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5df5n/
+  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5df5n
   :body: |-
     # Ruby
 
@@ -193,26 +193,26 @@
     [paste](https://topaz.github.io/paste/#XQAAAQD7AgAAAAAAAAAnFUW8WzF1WEoJx9V0hOKfg4NcZ7WDhdZEbbwcIoUqv1+y3wBBrL2nBKRx9PDu2eqWV5w7eZ8p/dHEMvzPdtqMoTg8ubrtrjtjf+6OUUPiJ/l+L7PA7kZxnaeraDwwz5V1gGClahEcV2kJenOadVBIJ49iA9X8aOwk6+7R1PQM0mZ1tbA5Y+v4uw3Ahoex/N1uRfqzZZlyC+P4dedhdXKTtribrpUo1Fddw/X+BJWtL4SsNvlu7knEoKdp/MH1xPp8+a8mO7ghXgj4sXWzCR9pgloJxk3KEgEuwzOOmt+dKoBkZG3xxrvM5ncaTP3mvDxVzDpNWNye8TAsqw37cXV71KHLNiK3Ye/6nt3K55hKxDc5PnqUoc2BUbiTW65lBEsWeLvMM/ZFp3U1TCaohJvgE6/C0y2CQpYUG8s+XPirj4NRjUQN1rqCIk9Llry2/SKcsCAAZACHGUAGzIBN3CyUXRhV9qZL9n5VU8wX8NRmV5vwCIATOmH3mtdYidbQ1wH+RD7RJf9yZbkA)
   :replies:
   - :author: petercooper
-    :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5neve/
+    :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5neve
     :body: One way is to refactor out the nested loop. `each_cons` would assist in this situation. Consider that `arr.each_cons(3)` will return an enumerator of each block of 3 elements. See my solution elsewhere on this post if you want to see it in situ.
     :replies: []
   - :author: Intro245
-    :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5oq1j/
+    :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf5oq1j
     :body: One solution for this problem that works in most languages is to put the loops into a separate function and use `return` to break out. So in this case, the return value could be either `contiguous_numbers` or the solution to part 2.
     :replies: []
 - :author: 2k3
-  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf6hsy4/
+  :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf6hsy4
   :body: |-
     Another [Ruby](https://github.com/Kyrremann/advent-of-code/blob/main/y2020/day-09.rb) solution.
 
     Most interesting for me was to use `combination()` in the first part.
   :replies:
   - :author: sky_badger
-    :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf6itm4/
+    :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf6itm4
     :body: Interesting to see a different language (I'm doing AoC in Python). Did you know the input file is different for every competitor? So the hardcoded target in star\_2() will only work for your input. You cold make the solution more generic by storing the star\_1() result in a variable and using that as your star\_2() target instead. Just a though. Is Ruby fast?
     :replies:
     - :author: 2k3
-      :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf6mkxl/
+      :url: https://www.reddit.com/r/adventofcode/comments/k9lfwj/2020_day_09_solutions/gf6mkxl
       :body: |-
         Didn't think about the different input, should use the return value for part two. Thanks!
 

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

@@ -1,13 +1,13 @@
 ---
 - :author: blafunke
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfhhpxr/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfhhpxr
   :body: |-
     [Ruby](https://pastebin.com/33r1dfnx)
 
     Fairly efficient in both space and time I think. Sorting is the worst part.
   :replies: []
 - :author: Markavian
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfdzoe0/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfdzoe0
   :body: |-
     Here's my node js solution for Day 10. It's not the best.
 
@@ -18,7 +18,7 @@
     Roll on day 11...
   :replies: []
 - :author: ACProctor
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfd237l/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfd237l
   :body: |-
     ## Ruby
 
@@ -100,14 +100,14 @@
     ```
   :replies:
   - :author: SnooEagles6377
-    :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/ghah2my/
+    :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/ghah2my
     :body: |-
       Thanks for the thorough discussion of part 2, it helped me simplify my solution.
 
       For part one, let me help you simplify yours :) To count the differences between numbers, you can use `each_cons(2)` and subtract them. Then if you are using a newer Ruby, use `.tally` to do the count (otherwise you can do `group_by(&:itself).values.map(&:size)`). Turns part one into a one-liner.
     :replies: []
 - :author: Krakhan
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfci2wh/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfci2wh
   :body: |-
     # Ruby
 
@@ -116,7 +116,7 @@
     [paste](https://topaz.github.io/paste/#XQAAAQAhBAAAAAAAAAAwmQhJeBEoRoycf4oaE6QWXYzfGQaKTTe+cU2mAjnDZZItrEaWBFPT3hHlTOWkxk6YOPCJEnKolvO7Ow+6ckmMp5BV9q+olHDzGgr2rZwcmYbSYEeLWBGusH9v/96/Q3ULKOZlj844B/25KTOxdHmL5xtk45Tn4/snm7Tou+uusWsNu6QgT6Xs22yTiuzQFEea9w9bESJraONWuhJq/SQYHCP0DZd8sfpE4ZCY2DMM6AorXNmG4hb6Yi6V04n1bcJ0wvxdNHj0G/3pL79OqrQL1GZjRnV1vRGE0Owc0p/GslWn/SSUFjwKhwU6GiurE0OVPrgyHVpi5qymZ7eexe+rrVguBV58hvO7GJdHEUtI/xEg0TbONZsOy1NDZ1AyIVyoLLR9bKT4EGfRbnv8CVwM+BB/WSoeSSC66wCGO3YvQbWkWgf7du1+QclxpJoW/ODcwc0A7wn035rKz3ClexwwPTjHqqMlf7rWlNVJ0q2yixzmvfsFPc4R9JrZeoyCtt9MF5XBlh03veR5vYej33f6RnupqkSRO1FLMCbEpx/BmjWDREdmIsQLx0u8BjOyxgjeBL+6Qrmsu568QUfzpbWFmmWVKuf+y0ynnSn1AK1izUYAUAOpIM4XUOHnrgRhfp67yQj7pDErG8usgmVW64M02usd0WAr/z4TNwA=)
   :replies: []
 - :author: jtgorn
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfcaf2q/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfcaf2q
   :body: |-
     Has anyone seen this solutions? Ruby:
 
@@ -131,7 +131,7 @@
     ```
   :replies:
   - :author: mattaman101
-    :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gffj2jv/
+    :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gffj2jv
     :body: |-
       > c = [nil,nil,nil,1]
       >
@@ -140,19 +140,19 @@
       Man, nice work. I recognized it was a dp question, and started memorizing, and then switched to tabulation but I couldn't get it to work. I had the idea, but this made it so much easier to realize.
     :replies: []
   - :author: Karl_Marxxx
-    :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfcw7sb/
+    :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfcw7sb
     :body: Can you explain the logic of part 1 to me? Also, how does part 2 work? Isn't i a value from the input (not an index)?
     :replies:
     - :author: jtgorn
-      :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfg6ak2/
+      :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfg6ak2
       :body: Sorry, I do not understand your question about part 2.
       :replies:
       - :author: Karl_Marxxx
-        :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfkp7c4/
+        :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfkp7c4
         :body: I was confused because you are using the value from a as an index into c. This confused me because I assumed you would quickly run into an indexing out-of-bounds error. Another user pointed out that ruby simply backfills nils up until the needed index, which I hadn't known before.
         :replies: []
     - :author: jtgorn
-      :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfg65zs/
+      :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfg65zs
       :body: |-
         Part 1 actually assumes that there are no differencies of 2. With such assumptions: imagine the list of differencies. It only consists of 3s and 1s. The total sum of that list should give input joltage of your device (a.max+3). If there are A 3s and B 1s, the total sum is A\*3+B. You know how many differencies there are (a.count+1) which gives you two equasions:
 
@@ -164,11 +164,11 @@
         it is easy to calculate A and B from that and calculate A\*B.
       :replies:
       - :author: Karl_Marxxx
-        :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfkosty/
+        :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfkosty
         :body: Awesome, thanks!
         :replies: []
     - :author: '442401'
-      :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gffkzmv/
+      :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gffkzmv
       :body: |-
         This is quite beautiful.
 
@@ -179,7 +179,7 @@
         In part 2, yes `i` is the value from the input but it is also being used as an index into the array. `a.each { |i| c[i+3] = c[i..i+2].compact.sum }` says that every time an adaptor with a value 1 greater than the previous is added to the collection, the number of possible arrangements will increase by the sum of the previous 3 possible arrangements whereas adding an adaptor with a value 3 greater than the previous maximum will not alter the number of possible arrangements.
       :replies: []
 - :author: gurgeous
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf90tw1/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf90tw1
   :body: |-
     Ruby, 265/382, after cleanup:
 
@@ -201,7 +201,7 @@
     ```
   :replies: []
 - :author: hltk
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf91xad/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf91xad
   :body: |-
     Ruby. Part 2 uses the hash table's constructor (recursively) for building the dp.
 
@@ -220,7 +220,7 @@
     ```
   :replies: []
 - :author: petercooper
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf9oykp/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf9oykp
   :body: |-
     # Ruby
 
@@ -234,7 +234,7 @@
     ```
   :replies: []
 - :author: el_daniero
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfamvp0/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfamvp0
   :body: |-
     # Ruby
 
@@ -279,14 +279,14 @@
     ```
   :replies: []
 - :author: frontpageminus
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf90ccm/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf90ccm
   :body: |-
     Ruby 500/359. Probably could make this fancier, but the memoization got part two under a second.
 
     [paste](https://topaz.github.io/paste/#XQAAAQCSAwAAAAAAAAARiAqGkkN7pUjVWW5Qxng6Sa5RIpX45F8jD+UzAnG94fGsw92jqpPvt0f0lNYaCwwDk7adI7w0p58gIuu0WGbp0gmxYNjQhRjLVp0BOJ0lsE6giFORUZUludzYZM7a4FlFlc+5/guuelyungcIh33yxUBBjWlPJ0U05V+eQYrAbgbA6GiLxvwnwFe1QFaagyl0KD/pkR5uhPQfcdeX0VuKuqHU/5jrkF7j4UMryIm5CXIg/zVRrO99t/j+wONt0KJnBfDup9zbXYVG2/MJRFoByudziiUXK3oTtYxfzWKxF2/dUGhWsDnm8IIix3J4qF/aC0tnAIKPwisdRD+zqyvW0mTdtYK+B2uev0kwa6/0Jd6Ps8bMxsDgPUdu6g6ws3b+XEwvuPnitlqe9fzhGYmj9z3DYM3wAYPhxY21gJytiK/mHUREK+OOLkApZgntdpj77ZIkWN4ClUwy7vqmMgJRjxBncMSoLy3/1aVvzQ==)
   :replies: []
 - :author: Unihedron
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf91536/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf91536
   :body: |-
     Ruby 149/44.
 
@@ -309,7 +309,7 @@
     ```
   :replies: []
 - :author: CodeIsTheEnd
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf9cr2t/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf9cr2t
   :body: |-
     **Ruby:** 8:06/29:01, 1409/1335
 
@@ -320,7 +320,7 @@
     Part 2 didn't go much better. I spent a while implementing a recursive solution, which I eventually got written "correctly" only to then realize that it wouldn't never finish in time. (It was only at this point I read the comment about "more than a trillion"...) Rather than switch to a dynamic programming/memoization method, I broke up the input into "chunks" where the end of one chunk was separated by the start of the next chunk by 3, indicating that both adapters HAD to be used. Then I could compute how many different chains there were in each shorter chunk, using the same solution I had already come up with, then multiple those all together.
   :replies:
   - :author: petercooper
-    :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf9ouwx/
+    :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf9ouwx
     :body: |-
       Part 2 of this one totally beat me too for a while. I failed to notice the "over a trillion" comment and wrote a very naive recursive search (though over a graph) and went down the same rabbit hole you did! :-D
 
@@ -334,7 +334,7 @@
       ```
     :replies: []
 - :author: Robert-Damoc
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf9nvaj/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf9nvaj
   :body: |-
     You can also find the solution in the following link: [Day 10 Solution in Ruby](https://github.com/robert-damoc/Advent-of-Code/blob/master/2020/Day10/day10.rb) - This repo includes solutions for past days too.
 
@@ -387,14 +387,14 @@
     ```
   :replies: []
 - :author: AmazedAlligator
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfag6bj/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfag6bj
   :body: |-
     Super Simple **Ruby** solution for part 2 which counts paths in a directed graph. Not nearly as succinct as the other one but hopefully it's easy to understand.
 
     [https://github.com/m7rk/adventofcode2020/blob/master/10.rb](https://github.com/m7rk/adventofcode2020/blob/master/10.rb)
   :replies: []
 - :author: "[deleted]"
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfb338j/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfb338j
   :body: |-
     Ruby
 
@@ -429,7 +429,7 @@
     ```
   :replies: []
 - :author: Karl_Marxxx
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfbq4f4/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfbq4f4
   :body: |-
     # Ruby
 
@@ -455,7 +455,7 @@
     ```
   :replies:
   - :author: theGalation
-    :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfc5lbn/
+    :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfc5lbn
     :body: |-
       THANK YOU
 
@@ -464,15 +464,15 @@
       If I get this in a whiteboard I am eating the markers.
     :replies:
     - :author: Karl_Marxxx
-      :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfc641m/
+      :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfc641m
       :body: It's a dynamic programming approach. Lemme know if you'd like me to help break it down!
       :replies: []
   - :author: theGalation
-    :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfc7gp1/
+    :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gfc7gp1
     :body: This is some good ruby magic.
     :replies: []
 - :author: anericod
-  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf9dsvd/
+  :url: https://www.reddit.com/r/adventofcode/comments/ka8z8x/2020_day_10_solutions/gf9dsvd
   :body: |-
     # Ruby
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: Krakhan
-  :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/gffp3au/
+  :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/gffp3au
   :body: |-
     # Ruby
 
@@ -9,14 +9,14 @@
     [paste](https://topaz.github.io/paste/#XQAAAQBECwAAAAAAAAAkk4bN/Dq9JvpdmcyYGaBc7LQX/buFf1oDyCAw4zc/6HyE0/lc22e478Mw/zzhx1WgUiFjq9QIRbKna4otu0Ap5rU8ChjwBjw1pbLYvr04QDdpNlXzWCuuoQkSkHb3fx0GjDHFLj7US6MrO+lBB01QaueCu9jCDv2FBezBSuEJGFvdewTPqrZCf808GJ3ne1O4hAK4nwh7YE4ecLnAXVwFFWlQVp7eGe6rau6+utPDJ6WiOtp6ec2BxhAro2iK7WMRNQSXS5ngHVYCIUL0S8GTQ7T3v5GCJTi3u7L538V+cEm9g9W1RotbwGGCF3cK/fvfSMH+wpqW3P4hKNpKcVw2H4d1nYkrv7VCCTiZNtTtmusKckhC8UzovPGA+bURvMUW+pM0A2xY9X7WTGeof8fP0KYp4UydB+fPouiZdcE5bHlUUGnKkQGUhhmptbDeYaQUz47DCUb44Ha3ia4k5m0EywRNVHcgDtBqNF1ZYus4SEHfk01/gvgX7uCBEdcFuEvJandmXH6kfafkbFkJWJWtPV2YtCDN2KRm7TDpS7e6Oy8YUeUhTXzmPs6HMANBVoyD4jGe6oHKUmPdnC7j8tVG9RjLeR5GUlFC9eX91+IG0DfqxOaSE3tAurvGMRyFonxAYZEExDJ4JoLALnyfgD6XnSznVAo9d0p0IipmIGGsUPZCodOr6d4xAHY/mEdFEXBEZKuf0vrJFuI3XQBFC1B0VYfDwz6t66Q2EtsNqn0a6GVZvIZ9OT52MJ3L+miUBw9uuNcwY/5vVWSx32abo3xSplOIlucst6XxRJJ7O3xZNf6HwTV5mMYsj/jymdPOm9CC+d44tmsYLorb4Omi7MEgBVn2rmUqKHIpI6k70UhL5nAI52xkgkkSUsZaNZdOVuoyrSjmvSR2oBxH9bIwP2yngLPOa5cUJYcSZ+9JqSuopZ4A8qIDYXiLTsnBwxhexqO6BKwb3hUfdiN5YBuzddr2y3Xg76cibBCKmoXb5HlWPb/9onPZFUag87e95+oSsve/x85qNbMLgPiarjBtFuxHBWLmqnjPqbCZGlmd1OvDq9jnlJt0y689bba2FXDJ7j+Wpkb8FvWTnhvdIRVt4+Holo2w3vzyoNbyZCJjqWOEIL/H5eCHxrIDFMGMCPxfU7pQOIgE28r+Aujt+S01vNRE5q+dnaLqiN7NCGGHzQUoPME3ZiukTQnruNjalZcekmJ499EvOSe2iTtA3nf3VhRUh3RwzjgCF3y+zFnpQT31AhXuydVQ1uMCLAEOkj6Mh6fgWfrlpElJcWmRedKL9uzxNBOTsnr+2s79g1UZh7yC2ODXxq6XPMFDeqPljAakR8kH3MoKcvj8QSLl)
   :replies:
   - :author: Krakhan
-    :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/gfgbunl/
+    :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/gfgbunl
     :body: |-
       Better solution that uses one less copy on each iteration, skipping floor tiles in the main loop and not saving them when looking up surroundings, and just caching each of the seat visibilities. About 3-4 seconds on each part now, much better.
 
       [pastebin](https://pastebin.com/gshb1ebL)
     :replies:
     - :author: mr_banana_lord
-      :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/ggghzwi/
+      :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/ggghzwi
       :body: |-
         Late to the party, but nethertheless I would like to share my solution as it's even faster (1.3s).
 
@@ -25,7 +25,7 @@
         [https://github.com/MrBananaLord/adventofcode/blob/master/day\_11/task\_2.rb](https://github.com/MrBananaLord/adventofcode/blob/master/day_11/task_2.rb)
       :replies: []
 - :author: CodeIsTheEnd
-  :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/gfdicvy/
+  :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/gfdicvy
   :body: |-
     **Ruby:** 9:08/26:44, 138/643
 
@@ -36,7 +36,7 @@
     I lost TONS of time because I didn't re-initialize my starting location when exploring in different directions in Part 2. This led to very confusing output and serious concern that I didn't understand something about Ruby scoping rule.
   :replies: []
 - :author: gurgeous
-  :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/gfd7730/
+  :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/gfd7730
   :body: |-
     Ruby 317/181
 
@@ -45,18 +45,18 @@
     Two things I've learned since last year (1) use arrays for directions (2) use ranges for bounds checking!
   :replies:
   - :author: lasagnaman
-    :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/gfd8qkv/
+    :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/gfd8qkv
     :body: yooooo your tip (1) is sick. Stealing that for the future.
     :replies: []
 - :author: frontpageminus
-  :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/gfdkgih/
+  :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/gfdkgih
   :body: |-
     Ruby 11227/8772. Fell asleep before the problems were released again ¯\_(ツ)\_/¯
 
     [paste](https://topaz.github.io/paste/#XQAAAQBOBgAAAAAAAAARiAqGkkN7pUjVWW5PyUyHG0Kg1qjbFQsxMn57rA2U8PFRT9HwDm/jKPypT8lhWbRv+5Mo6S7pU2e8bFUf9NSngYwD8fRFsFWwB/qQX9QCKImN+t63gpP8aHfrzxMICG/37U3JjprLqRfhXS0Z+cF/uQf5vPg3nOuFgbBZO0SfqYfqd3OT73cAby2RoHQ6BnemvsZkbpJdG/Io69nx211VbrO9zYqlDzGrqss3RkolVDBNJIVCrnlQDG7oEBUTFlA2Cb/HvJ5At2q3DlSwX4tfMx7Br+Gl/d7zi1zicV5XnqkPZSxsopagVzF5EY2Cwyz/4teszqzY6k2CYgHPD4x1T1/ubJWSmev/nOKWuyN3+Z9Ruci+L7icqOhP52XsaITKLi2k5H7fJPfeIT9lfFjzEwB4WUUkX77ycS7iDXRl7oYp81WebaJgACdwHkcXdaWGGjT70fgM+5l4tOsZN44Z9wfh1nGeympHMzfWxLaxyRUsYC/uINKVA9lZGEKRlBWLLcw48t0G1CpeoFVuaRwSK26PrzKVRfnpqr1L9ZM7QfczoKtvpU6l3HgXV1nMsW6A/vy8TAJ5lqn+vsb/vb5Fp1+e0nOwcOublmWNb3B373LdoiH1Wp/k/x3GQuE5qWFJx/IDDtdEjS76W9T6nzrunfPOSPZS4ElnCOkyBWVq+2GgLZk1RY0DOfwMomfYfc4+WlMciCBkZjfKuRbIXwkxyQGhZFv+Tj6t)
   :replies: []
 - :author: wholarry
-  :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/gfeu6gb/
+  :url: https://www.reddit.com/r/adventofcode/comments/kaw6oz/2020_day_11_solutions/gfeu6gb
   :body: |-
     [Ruby](https://github.com/dgokman/advent_of_code_2020/blob/main/aoc_2020_11.rb)
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: adjudicator
-  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gflr8bq/
+  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gflr8bq
   :body: |-
     OO Ruby:
 
@@ -9,14 +9,14 @@
     Just using the 90 degree neg/swap vector rotation trick. Still took a while to figure out!
   :replies: []
 - :author: odlp
-  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfkejes/
+  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfkejes
   :body: |-
     [Ruby](https://github.com/odlp/advent-of-code-2020/blob/main/day-12/solution.rb)
 
     Enjoyed cracking out `Array#rotate!` ([ref](https://ruby-doc.org/core-2.7.2/Array.html#method-i-rotate-21)) to adjust the direction in part 1!
   :replies: []
 - :author: willkill07
-  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfjy87o/
+  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfjy87o
   :body: |-
     # Swift
 
@@ -27,22 +27,22 @@
     Done: C (2) , C++ (6) , Java (3), OCaml (1), Python (4), Bash (5), Swift (12) Todo (well, ones to choose from): F#, Haskell, Lisp, C#, Javascript, Typescript, Perl, Ruby, Scala, Rust, Assembly, Kotlin, FORTRAN, D, Go, Nim, Awk, Sed, Perl
   :replies:
   - :author: its_a_gibibyte
-    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfkblw5/
+    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfkblw5
     :body: This is an awesome idea, and a cool way to familiarize yourself with a bunch of different languages. What about Raku? If you're planning on doing Perl anyway, it'd be nice to do them one after another and compare the two.
     :replies:
     - :author: willkill07
-      :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfl7nx4/
+      :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfl7nx4
       :body: |-
         Well /u/ **abigail** mentioned that I have Perl twice to choose from... so I’ll add Raku to the potential list
 
         I have some familiarity with most of these, so it’s just a matter of **doing** it
       :replies: []
   - :author: __Abigail__
-    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfk9wvu/
+    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfk9wvu
     :body: Perl twice? Good choice.
     :replies: []
   - :author: i_have_no_biscuits
-    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfk6bu5/
+    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfk6bu5
     :body: |-
       ... GWBASIC?
 
@@ -51,7 +51,7 @@
       (You can dip your toe in the water with QBASIC if you want...)
     :replies: []
 - :author: parentheses-of-doom
-  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfi249v/
+  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfi249v
   :body: |-
     [Ruby](https://github.com/Prajjwal/advent-of-code/blob/master/2020/ruby/day_12.rb)
 
@@ -60,14 +60,14 @@
     Runs lightning fast, too, since the cartesian transforms are just static lookups.
   :replies: []
 - :author: petercooper
-  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfiw6qf/
+  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfiw6qf
   :body: |-
     # Ruby
 
     Kept it [short and sweet](https://gist.github.com/peterc/ef27494a081c48334d1ef29ff67f9f4c) today. I don't do both solutions in one file so mushed them together here.
   :replies: []
 - :author: gurgeous
-  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfhsb4b/
+  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfhsb4b
   :body: |-
     Ruby, 50/305
 
@@ -78,7 +78,7 @@
     Edit: here's how you do it with Ruby's Complex number support. I gotta learn this https://gist.github.com/gurgeous/a719b780fa5b117ec5a8f6ede5280985
   :replies:
   - :author: ald_loop
-    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfhsjry/
+    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfhsjry
     :body: |-
       > sigh. I admire those who can do this quickly with complex numbers.
       >
@@ -87,26 +87,26 @@
       Does not compute
     :replies: []
 - :author: frontpageminus
-  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfhsbhf/
+  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfhsbhf
   :body: |-
     Ruby 744/1520. My brain absolutely shut down trying to figure out how to do the L/R rotations in part two.
 
     [paste](https://topaz.github.io/paste/#XQAAAQCpBgAAAAAAAAARiAqGkkN7pUjVWW5N06C9m0mxVKYwp83rTcRiKZucKy4ybNfbMp0Ut7lQYAGdIiY8Ss+49n+2YO5gh8nFh4IluugFFJd3MqZpehAvPqerIS/eDJJ2lyaUXh9xddAmGUA0ojALOLzyegeztuXdWijKBp8cEPi0NK7+91NXXH/EhX8o5hu7nYFFl4On5dMfZvkztMvb3fPtC6TGigR9H7AFB2A/pk8coLYV3mGmhrEPnZHPq5pP7zf/zYc+QoJz0xkPD/6QKN/Jrs6G1iDx49lR5RMaensNbQPWgMptlmx6kX6mTCM+ibVSDl9A8iR9E7iyTh0mopQ3Skv2luUBJCk0uDJVnfso2BGS4GuhOhGkC2Xe9G6tVRlGMn0SNsteteL4PjNn+vJJCVcRWZbKwvbGqrts/7x5zolt/H4SLZX48cW9Y1Vc5ONnIBk2ojQae/HDyU3vPX/RBaP5BM+672pBjqKRu+wfOPuudYBojizeRH5PGf/gUtHPJVHzfubM+ULS6VDU53wuH0Aggi5Ebrhn9i2/0zpt70KzKpvU4ycvVx9Nz7pBJv/2rpp4)
   :replies:
   - :author: sentry07
-    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfhtb5p/
+    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfhtb5p
     :body: I misread the second part and thought it was still rotating the ship. Then I fixed it and screwed up an if statement and my 180 rotations weren’t happening. I shouldn’t do these when I’m tired.
     :replies: []
   - :author: nospamas
-    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfi5fdd/
+    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfi5fdd
     :body: If you ever need a reference in future googling for "Coordinate rotation rules" or "Coordinate rotation table" will get you something like [this](https://useruploads.socratic.org/V4G3pprQT5evsH3JS5Zy_9D861043-9375-4DC6-85EE-5FDA751F5053.png). You could probably work it out with a piece of paper but way easier to google.
     :replies:
     - :author: frontpageminus
-      :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfkcc48/
+      :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfkcc48
       :body: Yeah, that would’ve been much easier than drawing it out. Thanks!
       :replies: []
 - :author: "[deleted]"
-  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfhxo8f/
+  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfhxo8f
   :body: |-
     # Ruby
 
@@ -115,7 +115,7 @@
     [https://gist.github.com/Clashbuster/b66c950a6ad762a378d5c3c54d78c1a5](https://gist.github.com/Clashbuster/b66c950a6ad762a378d5c3c54d78c1a5)
   :replies: []
 - :author: Krakhan
-  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfi05h8/
+  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfi05h8
   :body: |-
     # Ruby
 
@@ -124,7 +124,7 @@
     [pastebin](https://pastebin.com/RdhqEzCa)
   :replies:
   - :author: jtgorn
-    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfipktf/
+    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfipktf
     :body: |-
       I have the same approach, however I prefer another style of coding
 
@@ -154,14 +154,14 @@
       ```
     :replies: []
   - :author: Krakhan
-    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfi7jcv/
+    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfi7jcv
     :body: |-
       More compact version that uses complex numbers for both parts after realizing the generalisation noting that Part 1 is just a 'waypoint' at (1, 0) as well. Edit: Realized as I woke up that the only thing needed to change was whether you're moving the ship or waypoint. So, corrected function here below for that.
 
       [pastebin](https://pastebin.com/SDzcS0mx)
     :replies: []
 - :author: CodeIsTheEnd
-  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfi084b/
+  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfi084b
   :body: |-
     **Ruby:** 7:16/14:30, 347/257
 
@@ -170,7 +170,7 @@
     Reasonably satisfied with this one. I imagine people who do more competition coding have rotation matrices down pat. Lost some time in Part 2 due to a bad find/replace.
   :replies: []
 - :author: el_daniero
-  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfizpvb/
+  :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfizpvb
   :body: |-
     # Ruby
 
@@ -244,6 +244,6 @@
     Also, for part two at first I had `puts ship_x + ship_y` at the bottom (forgot the `.abs` part) and ended up with the same resulta as part1; Is there a pattern here, or just coincidence?
   :replies:
   - :author: el_daniero
-    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfmwdd8/
+    :url: https://www.reddit.com/r/adventofcode/comments/kbj5me/2020_day_12_solutions/gfmwdd8
     :body: 'Also made an online visualization thing here: [https://daniero.netlify.app/aoc/2020/12/part2](https://daniero.netlify.app/aoc/2020/12/part2) (WIP)'
     :replies: []