advent_of_ruby 0.2.0 → 0.3.0

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

@@ -0,0 +1,163 @@
+---
+- :author: ni3t
+  :url: https://www.reddit.com/r/adventofcode/comments/e5bz2w/2019_day_3_solutions/f9j0jt5/
+  :body: |-
+    360/417 Ruby
+
+    https://github.com/ni3t/advent-2019/blob/master/3_crossed_wires.rb
+
+    Got tripped up by summing positions with negative values (not using absolute values) on part 1
+
+    Part 2 I was sorting by the closest single coordinate instead of the closest manhattan distance.
+  :replies: []
+- :author: J-Swift
+  :url: https://www.reddit.com/r/adventofcode/comments/e5bz2w/2019_day_3_solutions/f9j1apy/
+  :body: |-
+    Ruby
+
+    https://github.com/J-Swift/advent-of-code-2019/tree/master/day\_03
+  :replies: []
+- :author: Gck2702
+  :url: https://www.reddit.com/r/adventofcode/comments/e5bz2w/2019_day_3_solutions/f9jv0zh/
+  :body: |-
+    Ruby solution. Didn't make a global leaderboard since it's at 6AM local time :P
+
+    https://topaz.github.io/paste/#XQAAAQBJBAAAAAAAAAAQaJiMp0UZLyWlQpSWTlWUUSuzd7lhK3T+nEg+s2o+JfblImA+wf+fiDqUH1dwUyaQC9WW8/W70fdGCfP6h46ywG5XkSS0DY/5CxtJInAfAVUrPqB0jNCr+QLfaQu24hqfpovY6dB76eLJqbmciCeJDr2083SG3YQskfomMRU/tGsiCNVxQiyWw2JIp9/V8tUrBGDzq5H1eyjShFgHAf+WWB8Th+IQ+cyHC/pPyn4B4fhgF82PGebB8ovLLRKuakA37SHDDKPJi08fjr0GHuSQFbv5AKwaZnAHrfXOsCdmn9tpPpAiyarlp47OeYlR3pI8F6S1DH3GQQRxRSan9yajVjPa+oIKiBKr2IohWazPA+/rv6fiJjNdgytxIS/xTBbk+ve1QUx2jOMUoM91owqTxmpu81uozPTSR5xQfmsjQvWAuSzQKMORhWozCRb5wMnD4gAG6E0z+WcUstm05gLhpzRNsZRryHm14OurB61IxYlBdNSak3yibkTT7oR00Z4RvJBUa4TX35UKO2NruaYHsZECQNfBw+pK6amCXt+yDZi2wb7fQO9YfXx9eH2lCW1ZBV9UF8EBnoExWftaf4P/7Nlo+g==
+
+    Edit: Code was a bit too long for comment as per the rules, made a Topaz link.
+  :replies:
+  - :author: "[deleted]"
+    :url: https://www.reddit.com/r/adventofcode/comments/e5bz2w/2019_day_3_solutions/f9lc2po/
+    :body: This is really clean! Have definitely taken a few things away from your solution.
+    :replies: []
+- :author: judofyr
+  :url: https://www.reddit.com/r/adventofcode/comments/e5bz2w/2019_day_3_solutions/f9izjj2/
+  :body: |-
+    15/45. Ruby.
+
+    [paste](https://topaz.github.io/paste/#XQAAAQD6AgAAAAAAAAARiAiHwcJlXK8fjPChEJL1+xwkvfukGlOLvmbXfJqC//3EXi0ij0i8MFt788CFBTrOgUFI38vUQSdifWlfhk230CThMNuPdhYBX30gGW42TlTURcQRPg50VungEpgPISRkkR1jlnkIy8ojasAhIihGCU/iAnPcuo1dS8OHmiRDvm4x4Y94HfVqqjnkL8NPDsN+Z/7HmqPnUrj6OvoErg6+vi26mpkGrJ/kZjRCAEipz07Ywg/c9OPKd+8BRdHjJ0m8h9LNpun3v+jiw2+hK0HVYW5cjOIW9OAzMQ9ZTK6x5A56mMk/1xx55MMYVbjaF5e0ib73adf/moxkHnSI1Xae+5TnlD9dCtexSdTa2kDWO5zWUgtaEyw/4NDjqdK+8elMgqKRMC8BM39Bf6/Y1kx+bkKLu7RCYcxauUb3d3gU9tF4zuOtRgZy3/9xVrMA)
+  :replies:
+  - :author: ni3t
+    :url: https://www.reddit.com/r/adventofcode/comments/e5bz2w/2019_day_3_solutions/f9j09gx/
+    :body: |-
+      https://ruby-doc.org/core-2.5.1/IO.html#method-i-lines
+
+      `IO#lines` is being deprecated in favor of `IO#each_line`
+    :replies: []
+- :author: forlivesavingveggies
+  :url: https://www.reddit.com/r/adventofcode/comments/e5bz2w/2019_day_3_solutions/f9j8upm/
+  :body: |-
+    Who wants to talk about Ruby!!?
+
+    ```ruby
+    # example third_wire = Wire.new(steps: "R75,D30,R83,U83,L12,D49,R71,U7,L72".split(','))
+    class Wire
+      attr_accessor :x_axis, :y_axis, :store, :counter
+
+      ORIGIN = [0, 0].freeze
+
+      def initialize(steps:, existing_points: nil)
+        @steps = steps
+        @existing_points = existing_points
+        wire_reset
+      end
+
+      def wire_reset
+        @x_axis = 0
+        @y_axis = 0
+        @counter = 0
+        @store = {}
+      end
+
+      def closest
+        @store.delete(ORIGIN)
+        @store.min_by { |_k, v| v }
+      end
+
+      def process
+        @steps.each do |step|
+          record(step)
+        end
+      end
+
+      def input(point)
+        @counter += 1
+        p "counter: #{@counter}"
+        p "point #{point}"
+
+        return if @store[point]
+
+        @store[point] = @counter
+      end
+
+      def record(step)
+        p "x_axis #{@x_axis}"
+        p "y_axis #{@y_axis}"
+        direction = step.first
+        p "direction: #{direction}"
+
+        amount = step[1..-1].to_i
+        p "amount : #{amount}"
+
+        case direction
+        when 'L'
+          left_axis = @x_axis - amount
+
+          p "left_axis: #{left_axis}"
+
+          (@x_axis - 1).downto(left_axis) do |n|
+            point = [n, @y_axis]
+            input(point)
+          end
+
+          @x_axis = left_axis
+        when 'D'
+          down_axis = @y_axis - amount
+
+          p "down_axis #{down_axis}"
+
+          (@y_axis - 1).downto(down_axis) do |n|
+            point = [@x_axis, n]
+            input(point)
+          end
+
+          @y_axis = down_axis
+        when 'U'
+          up_axis = @y_axis + amount
+
+          p "up_axis: #{up_axis}"
+
+          (@y_axis + 1).upto(up_axis) do |n|
+            point = [@x_axis, n]
+            input(point)
+          end
+
+          @y_axis = up_axis
+        when 'R'
+          right_axis = @x_axis + amount
+          p "right_axis #{right_axis}"
+
+          (@x_axis + 1).upto(right_axis) do |n|
+            point = [n, @y_axis]
+            input(point)
+          end
+
+          @x_axis = right_axis
+        end
+      end
+    end
+
+    # example: fourth_wire = SecondWire.new(steps: "U62,R66,U55,R34,D71,R55,D58,R83".split(','), existing_points: third_wire.store)
+    class SecondWire < Wire
+      attr_accessor :existing_points
+
+      def input(point)
+        @counter += 1
+        return if @store[point]
+        return unless @existing_points[point]
+
+        @store[point] = @counter + @existing_points[point]
+      end
+    end
+    ```
+  :replies: []

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

@@ -0,0 +1,124 @@
+---
+- :author: Chibbot
+  :url: https://www.reddit.com/r/adventofcode/comments/e5u5fv/2019_day_4_solutions/fbxgvz7/
+  :body: |-
+    Ruby solution for [Part One](https://repl.it/@Xerillius/AOC-41)
+
+    Working on part two but it's giving me a lot more trouble than I thought it would.
+  :replies: []
+- :author: ni3t
+  :url: https://www.reddit.com/r/adventofcode/comments/e5u5fv/2019_day_4_solutions/f9m0ha4/
+  :body: |-
+    Ruby - leaderboard be damned!
+
+    Spent way too long fiddling with a regex when Enumerable could have solved it so much faster...
+
+    https://github.com/ni3t/advent-2019/blob/master/4_secure_container.rb
+  :replies:
+  - :author: bibstha
+    :url: https://www.reddit.com/r/adventofcode/comments/e5u5fv/2019_day_4_solutions/f9m1so2/
+    :body: |-
+      I had to go through the Enumerable api to find out `slice_when` which is very much similar to `chunk`. Took me way too long to find the method.
+
+      https://github.com/bibstha/advent2019/blob/master/day04/soln\_test.rb
+    :replies: []
+- :author: J-Swift
+  :url: https://www.reddit.com/r/adventofcode/comments/e5u5fv/2019_day_4_solutions/f9lzhlu/
+  :body: |-
+    Ruby
+
+    https://github.com/J-Swift/advent-of-code-2019/tree/master/day\_04
+  :replies: []
+- :author: Unihedron
+  :url: https://www.reddit.com/r/adventofcode/comments/e5u5fv/2019_day_4_solutions/f9m0da5/
+  :body: |-
+    Find rocket fuel requirements;
+
+    ​ ​ ​ ​ Drink a cup of coffee. ☕
+
+    Emulate and solve a machine;
+
+    ​ ​ ​ ​ Drink a cup of coffee. ☕
+
+    Develop and navigate a gridworld;
+
+    ​ ​ ​ ​ Drink a cup of coffee. ☕
+
+    Crack and find possible passwords;
+
+    ​ ​ ​ ​ Drink a cup of coffee. ☕
+
+    ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ - "On my laptop", a poem by Uni
+
+    [POEM] as above
+
+    `ruby 4.rb` 6/22
+
+    ```ruby
+    a=387638..919123
+    # part 1
+    p a.count{|x|x.to_s[/(\d)\1/]&&x.digits.reverse.each_cons(2).all?{|x,y|x<=y}}
+    # part 2
+    p a.count{|x|x.digits.reverse.chunk{|x|x}.to_a.any?{|x,y|y.size==2}&&x.digits.reverse.each_cons(2).all?{|x,y|x<=y}}
+    ```
+
+    * * *
+
+    Note for ruby learners: `digits` list of digits is backwards! When in doubt, always `reverse` it. (It doesn't need to be done for the first part of part 2, but I instinctively typed it anyways.
+
+    For part 1 I did a regex which can't work for part 2 (negative lookbehinds must be pure, where as [`(*FAIL)`](https://stackoverflow.com/a/20008790/3622940) which I want from PHP regex isn't here...) and required rewriting, so it costed some time finding the right function... :p (I used chunk\_by from memory, where as it should've been chunk so it took 2 seconds to debug)
+
+    Today's poem is a [chant](https://www.writersdigest.com/editor-blogs/poetic-asides/poetic-forms/chant-poems-poetic-forms). My poem sounded cooler in my head, but after having typed it I feel meh, didn't do it justice I think.
+  :replies:
+  - :author: nicereddy
+    :url: https://www.reddit.com/r/adventofcode/comments/e5u5fv/2019_day_4_solutions/f9m2sn3/
+    :body: |-
+      Interesting, your solution errors for me.
+
+      ```ruby
+      day4-2.rb:3:in `[]': no implicit conversion of Regexp into Integer (TypeError)
+      ```
+    :replies:
+    - :author: Unihedron
+      :url: https://www.reddit.com/r/adventofcode/comments/e5u5fv/2019_day_4_solutions/f9m2ur6/
+      :body: Thanks, there should be a `.to_s`. I recreated it from memory (since I changed the code between going into part 2, which is lost after saving), it's entirely my fault!
+      :replies: []
+  - :author: J-Swift
+    :url: https://www.reddit.com/r/adventofcode/comments/e5u5fv/2019_day_4_solutions/f9m4jl1/
+    :body: |-
+      Ahhhhhhh `each_cons`. Thats what I was trying to think of before I said screw it and just did a handrolled for-loop version.
+
+      Nice job
+    :replies: []
+- :author: shandley256
+  :url: https://www.reddit.com/r/adventofcode/comments/e5u5fv/2019_day_4_solutions/f9m8jm9/
+  :body: |-
+    Ruby
+
+    I discovered the [Enum#slice\_when](https://ruby-doc.org/core-2.6.5/Enumerable.html#method-i-slice_when) method and it made the code super simple.
+
+    ```ruby
+    # Ensure there are no sequences of decreasing digits
+    password.chars.slice_when { |a, b| a <= b }.count == password.length
+    # Ensure there is at least one contiguous repeating digit
+    password.chars.slice_when { |a, b| a != b }.count < password.length
+    # Ensure there is at least one digit that repeats no more than twice contiguously
+    password.chars.slice_when { |a, b| a != b }.any? { |run| run.count == 2 }
+    ```
+  :replies: []
+- :author: krazyito65
+  :url: https://www.reddit.com/r/adventofcode/comments/e5u5fv/2019_day_4_solutions/f9nl0xl/
+  :body: |-
+    # RUBY
+
+    https://github.com/krazyito65/Advent-Of-Code/blob/master/2019/4.rb
+
+    Here's my Ruby solution, I've updated it, and now provides both solutions at around 1s.
+  :replies: []
+- :author: Gck2702
+  :url: https://www.reddit.com/r/adventofcode/comments/e5u5fv/2019_day_4_solutions/f9mcb7u/
+  :body: |-
+    Short & sweet Ruby solution
+
+    [https://topaz.github.io/paste/#XQAAAQD9AQAAAAAAAAAFCYv/dcJTd8kzW33d5k8b/V8TyIe8jtqHLuWhRScQtarmPaMI9KavTBGf0dlg0GxXvxCqXGiz0k96c4FRzayJj2pK1a8yc90XEffTwNEyCtXk0Dx+4uQh/AeBbo+tbVJfVngKqU4MN4u9YvZUvNps7SHLQObw18znyHQLoTiZixGcGJn5tIFj6PINF1ttjEN7tFGSK5STF+O5WouppYM42yQFeP7036KMZiPqXa3JdCE3WemSbDjpgGRpSLy1YdJG3vx1hVASWejC/TJxQf4ysEvVwJimKNiducO/FW7lTtfvI6bEHs89RJbfhkbn6U1KruFBqYsOZvkOL3AjqjTQCORTQ3q6fzs3YRlYXKj+tTSu](https://topaz.github.io/paste/#XQAAAQD9AQAAAAAAAAAFCYv/dcJTd8kzW33d5k8b/V8TyIe8jtqHLuWhRScQtarmPaMI9KavTBGf0dlg0GxXvxCqXGiz0k96c4FRzayJj2pK1a8yc90XEffTwNEyCtXk0Dx+4uQh/AeBbo+tbVJfVngKqU4MN4u9YvZUvNps7SHLQObw18znyHQLoTiZixGcGJn5tIFj6PINF1ttjEN7tFGSK5STF+O5WouppYM42yQFeP7036KMZiPqXa3JdCE3WemSbDjpgGRpSLy1YdJG3vx1hVASWejC/TJxQf4ysEvVwJimKNiducO/FW7lTtfvI6bEHs89RJbfhkbn6U1KruFBqYsOZvkOL3AjqjTQCORTQ3q6fzs3YRlYXKj+tTSu)
+  :replies: []

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

@@ -0,0 +1,91 @@
+---
+- :author: J-Swift
+  :url: https://www.reddit.com/r/adventofcode/comments/e6carb/2019_day_5_solutions/f9uejgs/
+  :body: |-
+    Ruby
+
+    https://github.com/J-Swift/advent-of-code-2019/tree/master/day\_05
+  :replies:
+  - :author: maxverse
+    :url: https://www.reddit.com/r/adventofcode/comments/e6carb/2019_day_5_solutions/fa88hbm/
+    :body: |-
+      > had a real tough time with this one due to unclear requirements on how position modes would or would not be provided.
+
+      Man, I'm glad I'm not alone here! I'm working through this one now, also in Ruby, and this is the first day where the instructions left me totally puzzled
+    :replies:
+    - :author: J-Swift
+      :url: https://www.reddit.com/r/adventofcode/comments/e6carb/2019_day_5_solutions/fa90g2f/
+      :body: I actually just realized I still had a bug in this due to position modes in my OutputOp. Instructions definitely were not clear on this, but I think the rule is basically "Everything except Input might provide position modes"
+      :replies:
+      - :author: maxverse
+        :url: https://www.reddit.com/r/adventofcode/comments/e6carb/2019_day_5_solutions/fa90hm1/
+        :body: So, here's a simple question - is input the first number?
+        :replies:
+        - :author: J-Swift
+          :url: https://www.reddit.com/r/adventofcode/comments/e6carb/2019_day_5_solutions/fa90vlh/
+          :body: |-
+            Do you mean, what does 'Input' and 'Output' mean? I didn't understand that either. Input means ask the user for input (i.e. `gets`) and output means print it to the user (i.e. `puts`). So if the Input command looks like this:
+
+            `3 55`
+
+            That means ask the user for input and store the number they type in at position 55
+          :replies: []
+- :author: prophetjohn
+  :url: https://www.reddit.com/r/adventofcode/comments/e6carb/2019_day_5_solutions/f9qzu7a/
+  :body: |-
+    Went for a readable ruby version
+
+    [https://github.com/j-clark/adventofcode/blob/master/2019/aoc\_5\_2.rb](https://github.com/j-clark/adventofcode/blob/master/2019/aoc_5_2.rb)
+  :replies: []
+- :author: Unihedron
+  :url: https://www.reddit.com/r/adventofcode/comments/e6carb/2019_day_5_solutions/f9p9yxj/
+  :body: |-
+    Driving further into space
+
+    Fix the air conditioning just in case
+
+    Implement new diagnostics
+
+    Parameter mode breaks
+
+    My coding is such a disgrace.
+
+     ​
+
+    Debugging was brief,
+
+    Sigh of relief.
+
+    ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ - "Limerick for day 5", a poem by Uni
+
+    [POEM] included!
+
+    `ruby input 5.rb` 3/332
+
+    [5.rb](https://topaz.github.io/paste/#XQAAAQDOAwAAAAAAAAAwj0ACXuuJDKJHmXoqImEmhqMz3BmJRsPWRJMkgKv951oAANDMUdnIrHcGCLPWIMp7gwUA8RStqHffMhugLevy9Sb1MtdeRkeiICeFC06ko2mPiiS0X8QmD+YGkkQzVTHRBl39Dgyfs+JoniAFCrbLCneAlwstKVqdtxti/l1J5qYVwm0Bek5o2r5C4A/EeX6IoT31JPCze1PCfiYqxEZjtj8CUKDuDiOlhDaUO8mv3f6THPpdD+LeDa80ucyZMvRYuLITzgoBUqOzUe/3orJ+rrRO41Hicvh8ULlFHifyMBWhVlJ0isgeqTVYZeWb+T/ViWv7nxrnmf1Wu91DcrJZ/OY/vgpCH7BgFBI0vBLD5Pzw1GUqLdrww830taFVCutKRXoiAlq/0STg4EN0reKipG68/jys9jN5jW2vUKiqf+Wke0fZWLJbvY1Fm2td1xDTvcAez4LNnWLIpRQnFLU3/5kuJmA=)
+
+    and a link to my [2.rb](https://www.reddit.com/r/adventofcode/comments/e4u0rw/2019_day_2_solutions/f9fd7tb/) which I built most of this on.
+
+    * * *
+
+    Part 2 solved with help from discord user [Tim#5138](https://github.com/tslater2006); had bug where \>!I was treating "non-zero" as "larger than zero"!\<. Shame on me for not reading part 1! (But I'll happily take rank 3!) (accidental factorial: 3! = 6)
+  :replies:
+  - :author: 1vader
+    :url: https://www.reddit.com/r/adventofcode/comments/e6carb/2019_day_5_solutions/f9pfg42/
+    :body: Nice poem! Also congrats on rank 3.
+    :replies:
+    - :author: Unihedron
+      :url: https://www.reddit.com/r/adventofcode/comments/e6carb/2019_day_5_solutions/f9pfgi2/
+      :body: Thank you! I had a lot of high (sub-10) ranks in the past 2 years... competition is fierce this year around!
+      :replies: []
+- :author: krazyito65
+  :url: https://www.reddit.com/r/adventofcode/comments/e6carb/2019_day_5_solutions/f9pf56s/
+  :body: |-
+    # RUBY
+
+    Took me a while to realize that the 'input' was actually coming from `stdin` and not from the puzzle, but once i got that the rest came kinda easy.
+
+    Part 2 I just had to fiddle with until I got the instruction pointer correct.
+
+    [https://github.com/krazyito65/Advent-Of-Code/blob/cf72e6cbafc49b4ae146700db9a94d25683aaf13/2019/5.rb](https://github.com/krazyito65/Advent-Of-Code/blob/cf72e6cbafc49b4ae146700db9a94d25683aaf13/2019/5.rb)
+  :replies: []

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

@@ -0,0 +1,83 @@
+---
+- :author: MrMacintosh
+  :url: https://www.reddit.com/r/adventofcode/comments/e6tyva/2019_day_6_solutions/f9xvxfr/
+  :body: 'inefficient but simple solution in Ruby: [paste](https://topaz.github.io/paste/#XQAAAQCPAgAAAAAAAAA5GUqKNoFH6SMqoVC09YUYpbqMrEvvyYvRhwZlJkq0byGdgqaN1DyZ4BeAGQvLX9hzOpDc9HB3NyYDmpf5+sQnXSqva5cbWL/Syniop04NfK89duWTDepNy91/IgPAWkXJAKtjVFHubqZeqYYFY8OQ8jL7LbdZJiksxNg/J59FhxiGwWzSOTF4pCY4pdBpAki/bDUhK2aEZsYGDvO5BchM9buTidBtwF8h3Hs8VyaIIRn56vL1J8cZVCbIQ2cferiMT6zxsS9fZK+JNcoI0UMhsDHvWfFtR/VMyB/UZVjF23G0iHHm7CF1X7nHxRX5JwXey7k+BkQscdOICOscq2YwpCHk42HuyAP6UdjZMYKIytBrnLVM/AtsMGy1QXTtXiprby/08xQZqlvIfq9aiB7Lm0XLm/p+djIsehIY6y0wqsXkBcueIYdK4HGkgvRdfYGVOU5460ZxeyQmgLJFZq46l8imXV/hcUfSFOf7d9JHLaLUbLKoLbrylMafUACC3hmMYe7v1DJX5IkT/suY0g==)'
+  :replies: []
+- :author: petercooper
+  :url: https://www.reddit.com/r/adventofcode/comments/e6tyva/2019_day_6_solutions/f9vjndw/
+  :body: |-
+    **Ruby**
+
+    I did it "properly" but have also code golfed both parts. Part one (this is slow due to an inefficient algorithm):
+
+    ```ruby
+    o={}
+    $<.map{|q|r,s=q.scan(/\w+/)
+    o[s]||=[];(o[r]||=[])<<s}
+    p o.map{|y,z|((ns||=[])<<y=y[0] while y=o.find{|_,z|z.index(y)})||[*ns].size}.sum
+    ```
+
+    And part two (this is very fast):
+
+    ```ruby
+    p=$<.map{|o|o.scan(/\w+/).reverse}.to_h
+    i=%w{YOU SAN}.map{|i|((o||=[])<<i while i=p[i])||o}
+    p i.sum{|a|a.index(i.inject(:&)[0])}
+    ```
+  :replies: []
+- :author: J-Swift
+  :url: https://www.reddit.com/r/adventofcode/comments/e6tyva/2019_day_6_solutions/f9ueh2b/
+  :body: |-
+    Ruby
+
+    https://github.com/J-Swift/advent-of-code-2019/tree/master/day\_06
+  :replies: []
+- :author: Unihedron
+  :url: https://www.reddit.com/r/adventofcode/comments/e6tyva/2019_day_6_solutions/f9t7uhp/
+  :body: |-
+    I love graph problems,
+
+    ​ ​ ​ ​ They are so interesting
+
+    ​ ​ ​ ​ ​ ​ ​ ​ To model and solve.
+
+    But what's that, a bug?
+
+    ​ ​ ​ ​ Why have I made such mistake
+
+    ​ ​ ​ ​ ​ ​ ​ ​ It should've been easy.
+
+    ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ - "Buggy code", a poem by Uni
+
+    [POEM] a chouka (長歌)
+
+    `ruby 6.rb input` 567/351
+
+    [6-ver14:12:50.304961227.rb](https://topaz.github.io/paste/#XQAAAQDTAAAAAAAAAAA0D0toEGJhDJ64jJmHQTiEb5rJyl4bjiuiC93pZeyyJnnWr0/WUguWQCwkjUvzL0OQlipvH3avM+FGVAja6fi99/Pe+EoD+hS4+TEbfzpUoTE7rzSM0KE1zT9lbc2lY/RRsWIFJXXkGEod9MBjAOQHlssrh96qJCAW1kV2133HcRPnQ7UUSmEbRhU8fNdiHZpgfqMPL1yOELwmwsWyEnIPfBEyVEE6pXI0cDxfOkoOeL//tYvgAA==) | [6-ver14:18:53.388994599.rb](https://topaz.github.io/paste/#XQAAAQDnAAAAAAAAAAA0D0toEGJhDJ64jJmHQTiEb5rJyl4bjiuiC93pZeyyJnnWr0/WUguWQCwimEDKtRo8v54HhiUrljiteG/NddV3SPuzTf0y5wZEn+uf+DEgoDTXK0XPn0B+Qrt/mQmN1IQ9jTiGkfFC2L5v1vKkQD3aR7dCt81QQipqgw5YLqTTfz8pygzVLS+favNpXlP1tsZD5RwNnxMEx7TZrtmCkZsE2mnt/D57p9YU8D5supCHXilzR2ZQ7HAsItn850wHVw7oUZfz21///faXIA==)-|-
+
+    * * *
+
+    [Uni never learns](https://i.imgur.com/eaV9568.png); I'm very upset.
+  :replies: []
+- :author: mikal82
+  :url: https://www.reddit.com/r/adventofcode/comments/e6tyva/2019_day_6_solutions/f9tj2rq/
+  :body: |-
+    [Scala](https://topaz.github.io/paste/#XQAAAQBPAwAAAAAAAAA3mImUzseuUG6pDUraFQrRv+4PrJ9QFyDrTD3pCNT16gRfe9CQ1WQQIOrEQXqEE9sqsXCkpCCJmeMyYopz1gAR11gWZVnfGbZvWnyoYAiZWqKQiI0rFwCNDqCbsII0ZSUUfxsL8aj+vf/o0SB+WIwEkGDJyrZSbvAU4Wo/ldsE9wbR01Lq+zjuH3UDauM+w494GHxJLDWKY2ZYMNWJWwaDwegYoX48yvM8cnDSRsxrhzoOESfS9HJIAdxh/7Xs0GsHR4VFbaj4pOmimnAX3VPnbqPBcKsenxkVZMOZIxO9LcbfGj4RvvvWDw8D9YMfyawuehTooRPRvvs28XeVMgNmMkMNlOkfAGQzUVFFIAyePfgYRLAZYhQIJQ1qSvM0gyY4Xy7MPy9Zdi4OYxnXRWDHfXq5U0KlQK/Pc1VWBfkCTI/07na2ZQuOMd6hGHBpX6W8Nm4iJ7V15oasO6niOuOM2c77TIaesD1RWvdC1H/z66mCDaVXjCfyTRDF3aSUskZjltxXN2yb9Fzk/jP1k/hW/1i7NaBl9oQiV8Q1tJWQ2o93q6uTunFzVlc1E8yyKFEyxyn3qRZQrlhRWR5jlQZuVJr6wGI4+ryewXMt3gOEgAg///PAjZs=)
+
+    Here I used flatMap to advance to the next "level" in all directions at once. This approach simplifies step 1, but for step 2 I needed to remove visited nodes to avoid going back and forth.
+
+    Scala turns out to be surprisingly good for AoC (so far), although not as elegant as Clojure and not as simple as Python or Ruby.
+  :replies:
+  - :author: fidesachates
+    :url: https://www.reddit.com/r/adventofcode/comments/e6tyva/2019_day_6_solutions/f9u5qqa/
+    :body: Very impressed with how concise your solution is
+    :replies: []
+- :author: prophetjohn
+  :url: https://www.reddit.com/r/adventofcode/comments/e6tyva/2019_day_6_solutions/f9u1qfl/
+  :body: |-
+    **Ruby**
+
+    part 1: [https://github.com/j-clark/adventofcode/blob/master/2019/aoc\_6\_1.rb](https://github.com/j-clark/adventofcode/blob/master/2019/aoc_6_1.rb)
+
+    part 2: [https://github.com/j-clark/adventofcode/blob/master/2019/aoc\_6\_2.rb](https://github.com/j-clark/adventofcode/blob/master/2019/aoc_6_2.rb)
+  :replies: []

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

@@ -0,0 +1,123 @@
+---
+- :author: J-Swift
+  :url: https://www.reddit.com/r/adventofcode/comments/e7a4nj/2019_day_7_solutions/fa27oma/
+  :body: |-
+    Ruby
+
+    https://github.com/J-Swift/advent-of-code-2019/tree/master/day\_07
+  :replies: []
+- :author: Kache
+  :url: https://www.reddit.com/r/adventofcode/comments/e7a4nj/2019_day_7_solutions/fa0mffc/
+  :body: |-
+    Super fun! In Ruby, after refactoring and reusing `Intcode`:
+
+    ```ruby
+    def self.max_looped_signal(intcode = @@input)
+      (5..9).to_a.permutation.map do |phase_settings|
+        amps_buffs = phase_settings.map { |s| [Intcode.new(intcode), [s]] }
+
+        (0..).reduce(0) do |input, i|
+          amp, buff = amps_buffs[i % 5]
+          amp.run(buff << input) || (break input)
+        end
+      end.max
+    end
+    ```
+  :replies: []
+- :author: el_daniero
+  :url: https://www.reddit.com/r/adventofcode/comments/e7a4nj/2019_day_7_solutions/f9z55xo/
+  :body: |-
+    First time using a thread in Ruby!
+
+    I'm aiming to use the same intcode implementation for all challenges, and refator and expand each time there's a new requirement. I also keep it backwards compatible. Before part 1 today, I changed input/output from being an actual IO object to simply be an array that is `push`ed and `shift`ed, which is a lot simpler to handle.
+
+    Part 2 was simply begging for a multithreaded solution, and I was happy to discover that there is a thread safe class `Queue` with has the same push and shift operations as `Array`!
+
+    I'm also happy with how my "try all combination" function could easily be refactored, so that the two lines that print each solution simply read as follows:
+
+    ```ruby
+    p find_max_signal(program, 0..4, &method(:run_single))
+    p find_max_signal(program, 5..9, &method(:run_with_feedback))
+    ```
+
+    Setting up the threads and channels for part 2:
+
+    ```ruby
+    def run_with_feedback(program, sequence)
+      channels = sequence.map { |phase_setting| Queue.new.push(phase_setting) }
+
+      threads = sequence.map.with_index { |_,i|
+        Thread.new do
+          amp = IntcodeComputer.new(
+            program,
+            input: channels[i],
+            output: channels[(i+1)%channels.length]
+          )
+          amp.run
+        end
+      }
+
+      channels.first.push(0)
+      threads.each(&:join)
+      channels.first.pop
+    end
+    ```
+
+    The whole thing can be viewed here: [code-challenges/aoc2019/ruby/07.rb](https://github.com/daniero/code-challenges/blob/master/aoc2019/ruby/07.rb)
+
+    The current Intcode Computer is here: [code-challenges/aoc2019/ruby/intcode.rb](https://github.com/daniero/code-challenges/blob/master/aoc2019/ruby/intcode.rb)
+  :replies: []
+- :author: ShinobuLove
+  :url: https://www.reddit.com/r/adventofcode/comments/e7a4nj/2019_day_7_solutions/f9z31gy/
+  :body: |-
+    [Ruby](https://github.com/CodeGradox/advent-of-code-2019/blob/master/day07/main)
+
+    For part 1 it took me a minute to understand I had to use permutations for the phases.
+
+    I had to look up an explanation for part 2, but figured it out in the end.
+  :replies: []
+- :author: tckmn
+  :url: https://www.reddit.com/r/adventofcode/comments/e7a4nj/2019_day_7_solutions/f9wshfv/
+  :body: |-
+    ruby 3rd/28th
+
+    posting solely because i find it pretty amusing that my part 2 code reads the input file 600 times, which i only realized after the fact
+
+    (`intcode` procedure is just the interpreter modified so that it returns `[code_array, instruction_pointer, output]` immediately when output is produced)
+
+    ```ruby
+    p ([*5..9].permutation(5).map do |x|
+        thing = 0
+        a1, i1, op1 = intcode(read.split(',').map(&:to_i), 0, [x[0], 0])
+        a2, i2, op2 = intcode(read.split(',').map(&:to_i), 0, [x[1], op1])
+        a3, i3, op3 = intcode(read.split(',').map(&:to_i), 0, [x[2], op2])
+        a4, i4, op4 = intcode(read.split(',').map(&:to_i), 0, [x[3], op3])
+        a5, i5, op5 = intcode(read.split(',').map(&:to_i), 0, [x[4], op4])
+        loop{
+        a1, i1, op1 = intcode(a1, i1, [op5])
+        a2, i2, op2 = intcode(a2, i2, [op1])
+        a3, i3, op3 = intcode(a3, i3, [op2])
+        a4, i4, op4 = intcode(a4, i4, [op3])
+        a5, i5, op5 = intcode(a5, i5, [op4])
+        break unless a5
+        thing = op5
+        }
+        thing
+    end.max)
+    ```
+  :replies:
+  - :author: captainAwesomePants
+    :url: https://www.reddit.com/r/adventofcode/comments/e7a4nj/2019_day_7_solutions/f9wv4wk/
+    :body: I thought to myself "better bundle everything in a class if I need to save the IP and the data and the inputs and such." You just returned a tuple of the whole thing. Such a fast tweak, good job!
+    :replies:
+    - :author: mariotacke
+      :url: https://www.reddit.com/r/adventofcode/comments/e7a4nj/2019_day_7_solutions/f9wzh4m/
+      :body: Same here. This is actually a pretty brilliant solution. Keeps the intcode function stateless.
+      :replies: []
+  - :author: yxhuvud
+    :url: https://www.reddit.com/r/adventofcode/comments/e7a4nj/2019_day_7_solutions/f9x3st6/
+    :body: |-
+      Funnily enough, at least for me, the whole thing works using the exact same parsed entries, without even having to `dup` it. Which is quite cute considering it is self modifying code.
+
+      [https://github.com/yxhuvud/aoc19/blob/master/day7.cr#L59](https://github.com/yxhuvud/aoc19/blob/master/day7.cr#L59)
+    :replies: []