advent_of_ruby 0.3.1 → 0.3.2

data/data/solutions/reddit/ruby/2021/07.yml

@@ -1,6 +1,6 @@
 ---
 - :author: arnoldboy123
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnnkebn/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnnkebn
   :body: |-
     # Ruby Solution
 
@@ -39,7 +39,7 @@
     This is my quick and dirty solution. Not trying to code something perfect but just good enough to do the job of giving me the result in console.
   :replies: []
 - :author: ignurant
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk9rkd/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk9rkd
   :body: |-
     Ruby:
 
@@ -75,22 +75,22 @@
     ```
   :replies:
   - :author: bunceandbean
-    :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnka1xd/
+    :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnka1xd
     :body: I think this has to be on purpose, as the median and mean worked for me as well. I think it probably might be tailored for computer science in the sense that converting (casting) doubles to ints floors the value?
     :replies:
     - :author: KT421
-      :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkfzp0/
+      :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkfzp0
       :body: That's actually dependent on language. R will round to the nearest even number unless you explicitly use `floor()` or `ceiling()`. Other languages floor it.
       :replies: []
   - :author: marshalofthemark
-    :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkbq1j/
+    :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkbq1j
     :body: |-
       If N crabs are to your right and M crabs are to your left, then every step to the right will decrease your fuel needed by N - M. So if you plot fuel needed (y-axis) vs. horizontal position (x-axis) on a Cartesian x-y graph, it will have a slope of N - M.
 
       The global minimum occurs when slope is 0, where there are an equal number of crabs on both sides ... and by definition that happens at the median.
     :replies: []
 - :author: ACProctor
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnlnn23/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnlnn23
   :body: |-
     I'll be honest, I forgot about Gauss. But for anyone else thinking that today is just a one-trick solution, here's how I optimized using recursion with memoization.
 
@@ -129,15 +129,15 @@
     ```
   :replies: []
 - :author: dtinth
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk3yry/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk3yry
   :body: "```ruby\n# Ruby, 54 / 13\ncrabs = gets.split(',').map(&:to_i)\np (0..1000).map { |u| crabs.sum { |x| (x-u).abs } }.min\np (0..1000).map { |u| crabs.sum { |x| n = (x-u).abs; (n*(n+1))/2 } }.min\n```\n\nThe number 1000 was arbitrarily chosen, it was a total fluke that it worked \U0001F605"
   :replies:
   - :author: gurgeous
-    :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk6jpv/
+    :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk6jpv
     :body: Ha, mine is nearly identical! Only difference is that I used \_1 and crabs.max instead of 1000.
     :replies: []
 - :author: BluFoot
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk59fl/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk59fl
   :body: |-
     **Ruby** 79 bytes
 
@@ -147,7 +147,7 @@
     ```
   :replies: []
 - :author: marshalofthemark
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk6ds2/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk6ds2
   :body: |-
     **Ruby (only runs in 3.0+)**
 
@@ -161,7 +161,7 @@
     ```
   :replies:
   - :author: ni3t
-    :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk9cny/
+    :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk9cny
     :body: |-
       You could use `map(&:to_i)` and `min_by` to shorten these up:
 
@@ -173,7 +173,7 @@
       ```
     :replies: []
 - :author: clarabellum
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnmfaet/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnmfaet
   :body: |-
     Came here feeling like "ugh this is inelegant but at least it worked, let's see what other people did" and now I feel validated because it doesn't sound like any of you are super happy with your solutions either haha
 
@@ -184,14 +184,14 @@
     I hit my head against the wall trying to figure out why sometimes the answer was the mean and sometimes the answer was the mean + 1... so I ended up just doing a brute force search within 3 squares of the mean
   :replies: []
 - :author: frontpageminus
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk5fjn/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk5fjn
   :body: |-
     Ruby 1712/1304
 
     [paste](https://topaz.github.io/paste/#XQAAAQB/AQAAAAAAAAARiAqGkkN7pUjVWW5QYxj2CIMqqYvXYJRPYP/bLEpwScA00QMIIzV3y5DQ9XZf+B8zWbGmR8IAPA65zDdVORbjm13caysTw9my+BdK8Rc+SFE0v/r7OwT6/8tktIMeNGOJGmZBxLpMnK21YV+uhweGcwXsY64TkluTP9YGNd+VbPVbBdxmLNF4dlQFFLm0KNRU/9cQxXGAzqWQprhZ/8sHZbg72ffmgmLtbD9WYfJXk5n7ZsX/sWOBwA==)
   :replies: []
 - :author: ni3t
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk90t4/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk90t4
   :body: |-
     ### Ruby
 
@@ -210,11 +210,11 @@
     ```
   :replies: []
 - :author: madethemcry
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkbxsh/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkbxsh
   :body: "# RUBY\n\n[georgiee/advent-of-code-2021/day-07 (GitHub)](https://github.com/georgiee/advent-of-code-2021/tree/main/day-07)\n\n# Notes\n\nOk I was SUPER fast for part 1 (well not fast enough for the leaderboard, ~10mins or so) but then part 2 got me like Day 6 got me: It was running forever. This time I had no immediate clue what was wrong. I tinkered around with the range which I calculated as `range = (input.min..input.max)` so covering the entire x-axis where the crabs are hanging around. In part 1 I was lucky and I could use `input.compact.uniq` instead but this is not working here as we might miss some ideal positions (like the `5` from the example).\n\nSo what now? Let's optimize in a classical way, maybe the code runs slow for all the given permutations. I was using `key.downto(1).inject(:+)` to add up the numbers. That's expensive so what do you do ? Cache it. I used the great `default_proc` fucntionality of the ruby hash. That's a proc invoked for not existing keys. That way I can calculate values for a new key and return previous calculations directly without calculation.`TRIANGLE_CACHE.default_proc = proc { |hash, key| hash[key] = key.downto(1).inject(:+) }`\n\nThis was the first time it worked with painful 6 or so seconds.\n\nI submitted the result but I wanted to see if I can bring that number down. When I searched for `factorial but with addition` I came across the triangle numbers which are familiar to me from statistics (but my mind did not conclude this before google). So instead of adding up all numbers manually I can shortcut and do the math with `n*(n+1)/2` \U0001F918 I removed the cache and replaced it with the direct calculation. It's now 2.7 seconds.\n\nIf I bring back the hash cache, I can shave another 0.75s probably because of the shear amount of permutations I'm processing. I had some ideas for precalculate all permutations to remove duplicates, then calculate and the group the results back to the specific positions to add them up again. But my stamina is gone for this day.\n\nSo it's 1.9s.\n\n# CODE (part 2 only)\n\n```ruby\nrequire 'benchmark'\n\npath = File.join( __dir__ , 'input.txt')\ninput = File.read(path).split(',').map(&:to_i)\n\nrange = (input.min..input.max)\n\n# create a cache for the calculation of the triangle number, saves 0.7s\nTRIANGLE_CACHE = {}\nTRIANGLE_CACHE.default_proc = proc do |hash, key|\n  hash[key] = triangle_number(key)\nend\n\n# search for factorial but with addition\n# and got my hands on the name of the \"algorithm\"\ndef triangle_number(n)\n  n*(n+1)/2\nend\n\ndef cost_to_align(input, position)\n  input.inject(0) do |memo, value|\n    memo + TRIANGLE_CACHE[(value - position).abs]\n  end\nend\n\n# 1.922631 0.008752 1.931383 ( 1.942595)\nputs Benchmark.measure {\n  result = range.to_a.map do |position|\n    fuel = cost_to_align(input, position)\n    [position, fuel]\n  end\n\n  puts result.min_by { _1[1]}[1]\n}\n```"
   :replies: []
 - :author: riffraff
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkg35y/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkg35y
   :body: |-
     I'm happy with the brute force ruby solution for part 2. I think one can be faster if instead of computing all values and doing #min you just terminate early when the previous value is smaller than the current one but I can't express that in a short way :)
 
@@ -232,7 +232,7 @@
     ```
   :replies:
   - :author: lygaret
-    :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkh3r7/
+    :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkh3r7
     :body: |-
       how to go from O(n) to O(log n)? binary search!
 
@@ -263,7 +263,7 @@
       ```
     :replies: []
 - :author: icyFur
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkk3ah/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkk3ah
   :body: |-
     I did this in Ruby: For part one ([full code](https://getsturdy.com/advent-of-code-2021-uoeIDQk/browse/day07/kiril/partone.rb)) the least fuel is at the median - def median(input) sorted = input.sort len = sorted.length (sorted[(len - 1) / 2] + sorted[len / 2]) / 2 end
 
@@ -302,7 +302,7 @@
     ```
   :replies: []
 - :author: bobtom8482
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnlholw/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnlholw
   :body: |-
     Continuing trying to learn Ruby for my first job (!).
 
@@ -311,7 +311,7 @@
     [linky](https://topaz.github.io/paste/#XQAAAQCKAwAAAAAAAAAxmwhIY/U9T3vi0RAbnIXPKO8G25aDTAtzs9PptRokuGsXXB+f8iGcRzobqJqEdB6RdPjOtf4bhTtlr/VEsbh9/Gj2J7g/UNSTfusRq973DNk7ZVkoRWqHamdfPjmc2YjbVZ0XsPgJINxElHlW2wNkTTPSvi8QqBkV68QSBTvQhsP7U9PX9U1YIDK266jldcHbnJ1eetuH5hX0krMpWHnln2eSxWKywWBRHobhzKB4IiZS8DFP7K18hO29FjLcPHRO3TCXJGCVOzYiFHxLQLYHIMdsIGAQHg7b4Ur5HnJKTfaBxfU4kUPrjO40jsRTbu6Xtb9YwX0MqrVBWOyfhbch8orUGDooYIRBsGyCTgVMJEfs2R4H0GP3llStQbh5bsMA9kBPu/GF3ve4E7XP2Pq82/lObN+Jbw59I3LXAskX8jszr8lkf5eHZy+wbP27K/qzsZs4IQZ1F8X0HKzUizgdrSAukiBoZ92yzoJsuz58wrgpHvRkRnGV1nu0wkILfm6oH+TAKEwr/kUetBusfEaLJvwCPTqLDzJ+RE6c8/+C/Gf2)
   :replies: []
 - :author: BramboraSK
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnlqz8g/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnlqz8g
   :body: |-
     My **Ruby** solution
 
@@ -342,7 +342,7 @@
     ```
   :replies: []
 - :author: zxywx
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk6ssa/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk6ssa
   :body: |-
     # Ruby
 
@@ -376,7 +376,7 @@
     ```
   :replies:
   - :author: zxywx
-    :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnka24h/
+    :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnka24h
     :body: |-
       I realise now I could replace my brute-force fuel calculation with this:
 
@@ -387,7 +387,7 @@
       ```
     :replies: []
 - :author: Archer_Winter
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk7o4d/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnk7o4d
   :body: |-
     Ruby Solution
 
@@ -400,14 +400,14 @@
     # part 2sums[i] = numbers.map { |num| (0..(num - i).abs).sum }.sump iendp sums.min`
   :replies: []
 - :author: "[deleted]"
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnklwsw/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnklwsw
   :body: |-
     Ruby: [https://github.com/sreedevk/advent-of-code/blob/main/ruby/2021/day7/main.rb](https://github.com/sreedevk/advent-of-code/blob/main/ruby/2021/day7/main.rb)
 
     Elixir: https://github.com/sreedevk/advent-of-code/blob/main/elixir/lib/twenty21/day7.ex
   :replies: []
 - :author: CodeIsTheEnd
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkmx1t/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkmx1t
   :body: |-
     **Ruby** : 5:00/10:26
 
@@ -416,7 +416,7 @@
     Tried to outsmart Part 1 and jumped to using the average instead of just being inefficient and computing everything. Turns out that'd be useful for Part 2, but I had just rounded the average, it still would've been incorrect! I messed up computing triangle numbers too (did squares first). Just bad all around.
   :replies: []
 - :author: ldhmachin
-  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkqmt1/
+  :url: https://www.reddit.com/r/adventofcode/comments/rar7ty/2021_day_7_solutions/hnkqmt1
   :body: |-
     **Ruby**
 

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

@@ -1,6 +1,6 @@
 ---
 - :author: ignurant
-  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnudsbi/
+  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnudsbi
   :body: |-
     Wow. I think I spent like 12 hours on this. I can't even remember the paths I've travelled, but each of them included "If you use bit masking, I bet there's a way you can just cycle through things and eliminate candidates and it eventually just cycles into place". Messing with bits is something I think can be very powerful, but I'm not great at thinking through. I definitely spent a fair amount of time over-planning for what my solution eventually became.
 
@@ -56,14 +56,14 @@
     ```
   :replies: []
 - :author: SnooConfections2453
-  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnrjfze/
+  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnrjfze
   :body: |-
     My solution in ruby: [https://github.com/ciscou/aoc/blob/master/2021/08.rb](https://github.com/ciscou/aoc/blob/master/2021/08.rb)
 
     As always, trying to make the solution both compact and readable.
   :replies: []
 - :author: zxywx
-  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnrs3ax/
+  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnrs3ax
   :body: |-
     # Ruby
 
@@ -107,7 +107,7 @@
     ```
   :replies: []
 - :author: dtinth
-  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnoonjl/
+  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnoonjl
   :body: |-
     ```ruby
     # Ruby, 307 / 38
@@ -135,7 +135,7 @@
     [`Array#permutation`](https://ruby-doc.org/core-2.7.0/Array.html#method-i-permutation) and [`String#tr`](https://ruby-doc.org/core-2.7.0/String.html#method-i-tr) saved the day for me. Part 2 takes about 30 seconds to run. I tripped up because of the line breaks in the example that was not present in the actual input. (The code is slightly cleaned up.)
   :replies: []
 - :author: weiss_i_net
-  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnrbszu/
+  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnrbszu
   :body: |-
     **Ruby**
 
@@ -185,7 +185,7 @@
     ```
   :replies: []
 - :author: ri7chy
-  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnotqnq/
+  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnotqnq
   :body: |-
     [Python](https://topaz.github.io/paste/#XQAAAQArBgAAAAAAAAA0m0pnuFI8c/sCZpj3cAYdf1rmsJFkgD8wKleJtNqyXMCOhQ13+lVFP2dZxMw8i3ZaKeFIM0NkVCdUIOlsL0xIzvycUZp06Mz0PYAtpRlU/ZWO7b7Iau/lEl8G6nUyw7iV+USWzPGR1Wum/8B3cfzRJ9pTOaER/KtcDECKDJVYQmFQSNzwD19lzYl1lQW/Fr0qAC0KlBP5WrUby14MudUPXEjw/Txm11dMX7K4F+KduflJ8pGMWn7zB12WTiMLL/n7klA1uYdoOzS+dVu6o/lg+cOgdKPFlUmWxDKC8vTgQ3tjtYU3S1HwAVNxntRWhTWluOifQagXl2WRCK2gMLBzOofYi7c8djpLTB5hqIjKcqtOITqZRrXxTaXYl//2noggxvOy9cttyVM1XzbU2Y0zcF8qYC6FAyAPNifaWgO55Hk2BnYWkJ1WkHk/M63JyOdzETo5RAjUtNODRrNPeIJx350FC6dzRgmLF+9XOQ5DR/eGpRQRjndJVT9lObQLT8t40zeu3FaT9jnlr8C5QnYpT+AjLCm3PAOtbscBSDN8ryzHS8QSd45Hxu3F9JkOjeH3HgobZSPxcen2UxQRuunFlDDCtZFvn4YZmuWAcwQrECxWhr5tHO3aTH3ZAIYB6j/7hfPw7yIiD/yQH8eltqQ8uYTkzAEU1PZ18odH29hHsT969jLc4j6ishCl/77rVcA=)
 
@@ -194,18 +194,18 @@
     used counter for checking the common letters.
   :replies:
   - :author: jdyarrington
-    :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnoyz7p/
+    :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnoyz7p
     :body: I stared at the problem, mostly the numbers showing the segments displayed for about 40 minutes. Then I saw the same pattern that you do in your code and came to almost the same exact methodology as you. Neat!
     :replies:
     - :author: ri7chy
-      :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnpnsor/
+      :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnpnsor
       :body: |-
         runs in a good time as well.
 
         your code?
       :replies:
       - :author: jdyarrington
-        :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnqbgwb/
+        :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnqbgwb
         :body: |-
           Python
 
@@ -218,7 +218,7 @@
           Edit: I have no clue how to format code on reddit so replaced it with a pastebin. Also adding additional thoughts/comments.
         :replies: []
 - :author: icyFur
-  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnps70y/
+  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnps70y
   :body: |-
     Tricky one, at least until it clicked that it's about sets. Here is the full working solution in [Ruby](https://getsturdy.com/uoeIDQk/changes/495e69ca-c17e-4956-a0e6-0ec3c3961f7a)
 
@@ -292,7 +292,7 @@
     It's important to populate the lookup tables in this order. [Full code here](https://getsturdy.com/uoeIDQk/changes/495e69ca-c17e-4956-a0e6-0ec3c3961f7a)
   :replies: []
 - :author: frontpageminus
-  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnoqj6s/
+  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnoqj6s
   :body: |-
     Ruby 205/816
 
@@ -301,7 +301,7 @@
     [paste](https://topaz.github.io/paste/#XQAAAQAPBwAAAAAAAAARiAqGkkN7pOxE/jDIaqDrFWcgz0npJEVu8JMye3H5Wr2Siem6T/HmXnye4iMQFreC88u4FwGGtRFQHFKYvr8DfgV4/GqZtINLzjxBN/vu3b+rz6QkckCBnspFqIvXW0CKUc4vrq8DKK8U4l67J5sSl2yrqu9a7Vg2pIugY2dX+nwErW3pO9cCrmjtrafemkIGkl8Vg6gNadXOn7cywBXKhHL+b3Fda63ZClGlQdqSKcGlT8zX4D6QDrNDWQ+YRiS+HO46Zx+y8lk5Dqe8U4pFYQSmjPfoFtCVpDESnx8Z/R4ZBcw/eTVnAFIgUFvucYjE3B9lDeKXMb9ucQJpAuxRWDQueuogMBxBexqv2IsV8j0S15Vw4Hbbl7RVys89908Lr6KUjEHHt61qzWPnBR0/7TcNXpMgAgqcNZRKwSWmNpSWJFzWzt/0wVUu1YPcPF/Nxs/QCwiylpSaQcxZg6p+hCbf4tCBJV4M44+hqEogLX321W2YBLohUKGv2Tnbj8IxHvSDlqQ9jV1OrIHmFLg5JsYMBtO3cWRH/JWxZpWjaY7GSHL+GCaqpQjz8oUvRE0HTlPgvBBIUsoBa+TXL0+2T2otfYEIF4ro6GSDR5OMufGKZHoS7W955lMSV+m2LZD1oPryhNdPWgH2Fn7iAnyTLosHFtKmaPKA3yGIuRfzUEyVXmHPFtMW4xIgqqD2aAfjg6l/Pohe1F5yVSxbTmY78TUdbBM8M6fvggbKBS5t5n6F4aP+fSHu)
   :replies: []
 - :author: ni3t
-  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnorgs4/
+  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnorgs4
   :body: |-
     ### Ruby
 
@@ -342,7 +342,7 @@
     **END**
   :replies: []
 - :author: marshalofthemark
-  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnorr06/
+  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnorr06
   :body: |-
     **Ruby** - second top 1000 of the year
 
@@ -402,7 +402,7 @@
     ```
   :replies: []
 - :author: CodeIsTheEnd
-  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnosop0/
+  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnosop0
   :body: |-
     **Ruby** : 5:22/25:53, 338/271
 
@@ -425,7 +425,7 @@
     Okay, maybe too complicated...
   :replies: []
 - :author: snowe2010
-  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnoynl0/
+  :url: https://www.reddit.com/r/adventofcode/comments/rbj87a/2021_day_8_solutions/hnoynl0
   :body: |-
     Ruby
 

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

@@ -1,10 +1,10 @@
 ---
 - :author: icyFur
-  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/ho9vhch/
+  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/ho9vhch
   :body: My solution in [Ruby](https://getsturdy.com/advent-of-code-2021-uoeIDQk/browse/day09/kiril/solve.rb)
   :replies: []
 - :author: CodeIsTheEnd
-  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hntirld/
+  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hntirld
   :body: |-
     **Ruby** : 4:44/10:20, 248/94!
 
@@ -19,7 +19,7 @@
     Part 2 was fun. Good, quick, easy to understand solution, and I was able to debug pretty quickly. I treated points outside of the cave as having a height of 10 and that worked well!
   :replies: []
 - :author: "[deleted]"
-  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hnu6cc0/
+  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hnu6cc0
   :body: |-
     Ruby
 
@@ -32,7 +32,7 @@
     `Range (min … max): 396.0 ms … 579.9 ms 10 runs`
   :replies: []
 - :author: ignurant
-  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hnwljmj/
+  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hnwljmj
   :body: |-
     **Ruby** Pt 2:
 
@@ -136,7 +136,7 @@
     ```
   :replies: []
 - :author: dtinth
-  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hntgbwa/
+  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hntgbwa
   :body: |-
     Ruby, 67 / 55
 
@@ -145,14 +145,14 @@
     I was in a hurry and wasn’t able to think of `h.times.to_a.product(w.times.to_a)` so I just write two-level for loops `(0...h).each do |i| (0...w).each j |i| …; end end`. GitHub Copilot helped a lot in preventing silly mistakes (I usually use the wrong variables when writing for loops).
   :replies: []
 - :author: firetech_SE
-  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hntiico/
+  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hntiico
   :body: |-
     [Ruby 906/854](https://github.com/firetech/advent-of-code/blob/%F0%9F%8E%84/2021/09/basins.rb)
 
     I felt I was unusually slow today, but still ended up in top 1000 for both parts (only second time that has happened this year). I guess having implemented BFS umpteen times (not complaining, I like BFS) for all the previous years has made me well prepared. :D
   :replies: []
 - :author: ni3t
-  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hntkb9y/
+  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hntkb9y
   :body: |-
     ### Ruby
 
@@ -218,11 +218,11 @@
     ```
   :replies:
   - :author: scarfaceDeb
-    :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hntoxi6/
+    :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hntoxi6
     :body: Interesting.. you did it without using any recursion
     :replies: []
 - :author: scarfaceDeb
-  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hnto9ze/
+  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hnto9ze
   :body: |-
     **Ruby**
 
@@ -269,7 +269,7 @@
     https://github.com/scarfacedeb/advent-of-code/blob/master/2021/day9/run.rb#L11-L51
   :replies: []
 - :author: frontpageminus
-  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hntpfx8/
+  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hntpfx8
   :body: |-
     Ruby 1178/7093
 
@@ -278,7 +278,7 @@
     [paste](https://topaz.github.io/paste/#XQAAAQCEAwAAAAAAAAA5GUqKNoFH6SMqoVC09YUYkw2S+mIMHB1CSWV0VTWnX51e2y38yPqPFYGVMviZ8FB5y/cUcsDLuOHhkKbbmFYqG9sheuX5AEAeDEPRiP+Nw37hH8iTmGu5oHBy41LsFOIs+tUoQBongxBHkrf8yx5NtMifXoJotBBCd49DRK8jPUyZSriOjwAEWapdv/aLvzjCn4M1CDQKnzUBAVp138+jc3ruOfGlrPNYgWFzac/8RWzP30ilKn+FFIYamX/hgZvIn9IYRuXwhrVgxzjYMXaAkKSl/Lg8ST3V0UesQYF8crHoOhvToAVXR1mxfsrJVEw1GZxiQDpcmpX2qwy5q/A0aLyopQBc+WmhiVSPOPrI9OjpkzETcdPH03Dffq35kr2VxpjxxTmC7JfVTHZXunkTfDt5dlPtfqJG1tGXoRW/RYJoCpmUQrIUx+UkWl4wgr2pvG/gHq1DeWJcuKBl4BILH4eIpc9kZ5/9+hvz1mJk76TT33kx/lwdW0/c+ajTuOfZ8lBI58MDQaTtfsHwnOClghazEe+AaHwqRW3/UZJ8RXUlSF9OKEFNS6AVPMoQJ5yZERcUy166GDeuUEDpWtuxByxFKuglawdbIIOu1bbiurkSOBbXLJM4DSDIbqf5OVdC3MX/9pM9mg==)
   :replies: []
 - :author: weiss_i_net
-  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hnuj3ye/
+  :url: https://www.reddit.com/r/adventofcode/comments/rca6vp/2021_day_9_solutions/hnuj3ye
   :body: |-
     **Ruby**
 

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

@@ -1,17 +1,17 @@
 ---
 - :author: "[deleted]"
-  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/htakj5o/
+  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/htakj5o
   :body: |-
     # Ruby
 
     [https://gist.github.com/Clashbuster/d2f7dc3246f109b987a278d98197c6f0](https://gist.github.com/Clashbuster/d2f7dc3246f109b987a278d98197c6f0)
   :replies: []
 - :author: icyFur
-  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/ho9vo1a/
+  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/ho9vo1a
   :body: Stack solution in [Ruby](https://getsturdy.com/advent-of-code-2021-uoeIDQk/browse/day10/kiril/partone.rb)
   :replies: []
 - :author: BluFoot
-  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/hnyezvj/
+  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/hnyezvj
   :body: |-
     **Ruby** 181 bytes
 
@@ -30,7 +30,7 @@
     ```
   :replies: []
 - :author: marshalofthemark
-  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/hnyaxxl/
+  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/hnyaxxl
   :body: |-
     **Ruby**
 
@@ -62,7 +62,7 @@
     ```
   :replies: []
 - :author: scarfaceDeb
-  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/hnye6zt/
+  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/hnye6zt
   :body: |-
     **Ruby**
 
@@ -106,7 +106,7 @@
     ```
   :replies: []
 - :author: Spock_42
-  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/hnywep4/
+  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/hnywep4
   :body: |-
     This is my Ruby solution to Part 2. Part 1 is similar, just a different scoring pattern. Just learning Ruby for the first time via AoC, so any C&C is appreciated.
 
@@ -130,7 +130,7 @@
     ```
   :replies: []
 - :author: ignurant
-  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/hnzgtbl/
+  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/hnzgtbl
   :body: |-
     I've found the last two days to be a bit of a slog, so I felt recharged that this one was straightforward (at least for my skillset). I rather enjoyed the decoy sample answer in Pt. 1 -- My thought was "oohhhohooo!! You're bringin' it now!!!!"
 
@@ -139,14 +139,14 @@
     [Ruby Pt. 2](https://tzarnal.github.io/Opal/#XQAAAQA3AgAAAAAAAAAoE8VAZTehaYnyuwTEaiO9AUDb7/afhxrRSAd9icyTM7XPlxTtju/5+jsKCkzkv04DoByTRxGROD4qLI5UATpNcGmondUpNWtajrRddQxTip90X2bBWlszn2h/fNUPz2qXseqes5e7KHuniHH80b/Yc9AHgpmyg50G2/yUDzH4jETOs7I/PnrJCAC34SApsl/bIrNjpJcVrOXnCuuY+Ef5QcevxBZiLYiMVE3RXSG5ckZ9527ttVO1A811aIiqHq2ueJ2IwC+PAzO3IXQDmChIoD9lsrShdx7yqRDstYqFlaGjb8RcHkhXyqvuRvhCmiaraAyQaU5yFHMWxBZB1rX6zscUgaTNiUOYFr7i4gksOBD2Lfu9N922uzpzC3jnG6qhIereIv6th4ihmORZ2buUV5L/8DjY3Q==)
   :replies: []
 - :author: ndnenkov
-  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/hnzwb46/
+  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/hnzwb46
   :body: |-
     **Regex (Ruby)**
 
     https://gist.github.com/ndnenkov/3e003f0ea8b91b91d8e6c8351bdfefe8
   :replies: []
 - :author: frontpageminus
-  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/hnyad2r/
+  :url: https://www.reddit.com/r/adventofcode/comments/rd0s54/2021_day_10_solutions/hnyad2r
   :body: |-
     Ruby 1094/951
 

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

@@ -1,10 +1,10 @@
 ---
 - :author: icyFur
-  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/hoaazas/
+  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/hoaazas
   :body: My solution in [Ruby](https://getsturdy.com/advent-of-code-2021-uoeIDQk/changes/47771b9e-e206-47cc-92c7-79688a38d96b)
   :replies: []
 - :author: scarfaceDeb
-  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho3f5kw/
+  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho3f5kw
   :body: |-
     **Ruby**
 
@@ -64,15 +64,15 @@
     https://github.com/scarfacedeb/advent-of-code/blob/master/2021/day11/run.rb
   :replies:
   - :author: ignurant
-    :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho48vq5/
+    :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho48vq5
     :body: "`repeated_permutation` There we go! I spent like 15 minutes annoyed that I couldn’t Ruby up my directions array. I was trying varieties of `permutation` and `combinations` and zip and such. I had not previously seen _repeated_ permutation. Just what the Dr. ordered!"
     :replies:
     - :author: scarfaceDeb
-      :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho4h6pt/
+      :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho4h6pt
       :body: "Yeah, I found so many useful tricks and lesser known methods in Ruby stdlib in the last 10 days too \U0001F600"
       :replies: []
 - :author: madethemcry
-  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho3d5si/
+  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho3d5si
   :body: |-
     # RUBY
 
@@ -105,18 +105,18 @@
     I think a custom enumerator would make sense here. Then you could write like so for part 1 `cave.take(100)`and for part 2 `cave.take_while`. Both read fantastic. Time is up for today so I won't refactor that but I liked the day very much!
   :replies: []
 - :author: ignurant
-  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho3ila0/
+  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho3ila0
   :body: |-
     I enjoyed this one quite a bit. Somewhat inspired by the DragonRuby Game Toolkit, I modeled it as a world with mobs, so pretty literally.
 
     [Ruby pt 2](https://tzarnal.github.io/Opal/#XQAAAQAFCAAAAAAAAAAxmwhIY/VC+lD6cQOd9lyYAPDWpaReqe9sGQ0BG7rP377TcEubHCvPC0CdwEGG2DqBjJUjG9Qcu7O+lL54KYOxOEJM7AcW7Pd8w7FxmoLcR2zO1eCiO0FZqwtNsUbeQ6sWzT6C/RhB2q0AOugEPQy5xCe5GC1oGJxV01hET95B00Lw8Rg6cyqlVXgA++bbrcnY4G0Libb8Eqbxto4/CzYdUgka+xU7+1wCx+wI1mk7f5I2Pfp/7b/VRoGwr7x65ZzNo8uZBWTXrf8t9sqBe7zOcbPr7pqBzX2amlOVi86MBcXc/V8enThbmQV47A0BDbrBAam46e2k5TuYyDAybVJSMQ9Vp1dHTq+ET3W9wdNAVxcbxk6Tb8RyWBUxL0GHNij+ll5Q9vBbL7XUwc9mOewPBCIfrUD0I465DdatsUVIaMnJe1ifC4xeOG/2/mhhmGbrapJA+4tjC/DUMzu8cTyjqv9CnVsQVI4dUmqGEa8TxZczZKglrS/o69sI0hMpXOqt8Zy69NWcVCGswK6uTb4llvmlb0FG2nvfDL6TyMlMktDLIivE3xobs94pj28PvKl+GrKdicGRvG+wmcRqlozp3ps7+gxXcBSfxacDh4BM0WhBp7A1kMPgJnXcdddZ6vjOZbt1XG6FeFPw052rrKi/KJYzXlbzTucPPChFG7+x17fq0tWtlB5/r9z1iKDpzawLFyUCL8PRDGYfltcwuBcMEKQ/+MaRFTNw3cZ8sIkFmkSvGL72MJNZTcM+BnPgNNxUdCM1VW0LaLa+O9DX8SOjXJBUgb/3IO0VtEzkPJVaw5mOU2lWY7Ok8HBls4TJMvL2MQTYphhvSXzeYylc5IZYS7cHfuBxZhB0mVTwlyIwyKaj3QEMwmJA2jHYeITH8AV/WDy9B7/qY/vpr1c3swpp0NmyAw+MIsylAXCEt0wpRwegHOnCLKb2KZ4IRScn0CeY0b/aXYJ6kFEEUkcskVV+hzQ0Fyf+AOAt5ujCiQN/OK4zYsVyOhJFEt6TVVQjY4U0jgJroo5Bbl1eSg+VE66kG7jSv4fzBJtn3ddGDXiefP78KG7S)
   :replies:
   - :author: conthomporary
-    :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho3j7po/
+    :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho3j7po
     :body: 'All right, I''ll admit it: "throw :MY\_EYES!" got a chuckle out of me'
     :replies: []
 - :author: '442401'
-  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho3py2s/
+  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho3py2s
   :body: |-
     **Ruby**
 
@@ -125,18 +125,18 @@
     https://github.com/fig/Advent-of-Code/blob/main/2021/Day11/solution.rb
   :replies: []
 - :author: frontpageminus
-  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho34hw7/
+  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho34hw7
   :body: |-
     Ruby 746/640
 
     [paste](https://topaz.github.io/paste/#XQAAAQD5AwAAAAAAAAA2mEpiKBEva3oI7tVd9n7D3wNtbmwq32cmfy4Y74dHhdKFKKEoq7i2+I0L99HPs2sbZTY+fHeCVZlf/VgJb0PVyQlFo+sOcvoMcZPwKTjXY2RCOfFIJZQfjmHRYyRfseBHsxipEyQ7snZdsfuICl5bp6Wkck68u4kQcM7qWcHWT1zD2Zgd7IXFshVjwpJQUdbl2HZcJ4DTLJzChhwDbRX2s84FwEx6VQD3L8z9kjLoTTtrZ7V0T8n61Ei6eBb55LAusH0b31KKCMutu37h5D6SN5CkwDMo/sMnECDyB61EI40qDMHAVkIw+xFPuUMt96gi9S69B5jdrc559kEvLTT6Q3MThRK+8XVJi6ZDf03yg/WtoSBUzyKqR3xKQVx/bF3nXdWrHdRuhLOX1iq4JT77Pr5jodum9DPDTlSaM/BmTmYti8j2MGJt/7dIAPeaUBhNVf/fqYxw)
   :replies: []
 - :author: dhruvasagar
-  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho3fwjr/
+  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho3fwjr
   :body: Ruby - https://github.com/dhruvasagar/comp/blob/master/adventofcode/2021/day11/day11.rb
   :replies: []
 - :author: hrunt
-  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho41e39/
+  :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho41e39
   :body: |-
     **Python 3**
 
@@ -145,6 +145,6 @@
     Not a lot to say about this one. For square grids like this, I find using a dictionary of (x, y) coordinates is cleaner than using nested lists. Once I built the step function to serve Part 1, Part 2 was a breeze.
   :replies:
   - :author: kupuguy
-    :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho435k7/
+    :url: https://www.reddit.com/r/adventofcode/comments/rds32p/2021_day_11_solutions/ho435k7
     :body: You don't need the extra parentheses `grid[(x, y)]` is cleaner if you just write `grid[x, y]`. You are right about the dict though; though I started using nested lists then quickly switched to a dict.
     :replies: []