advent_of_ruby 0.2.0 → 0.3.0

data/data/solutions/github/gchan/2017/24_1.yml

@@ -0,0 +1,35 @@
+---
+- :name: day-24-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-24
+  :solution: |-
+    comps = input.split("\n")
+      .map { |comp| comp.split('/').map(&:to_i) }
+
+    max = 0
+
+    queue = comps.select { |comp| comp.include?(0) }
+      .map { |comp|
+        remaining = comps.reject { |c| c == comp }
+        target = comp[0]
+        target = comp[1] if target == 0
+        sum = comp.inject(:+)
+
+        [remaining, target, sum]
+      }
+
+    while queue.any?
+      comps, target, sum = queue.pop
+
+      max = [sum, max].max
+
+      comps.select { |comp| comp.include?(target) }.each do |comp|
+        remaining = comps.reject { |c| c == comp }
+        new_target = comp[0]
+        new_target = comp[1] if new_target == target
+        new_sum = sum + comp.inject(:+)
+
+        queue << [remaining, new_target, new_sum]
+      end
+    end
+
+    puts max

data/data/solutions/github/gchan/2017/24_2.yml

@@ -0,0 +1,41 @@
+---
+- :name: day-24-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-24
+  :solution: |-
+    comps = input.split("\n")
+      .map { |comp| comp.split('/').map(&:to_i) }
+
+    longest = []
+
+    queue = comps.select { |comp| comp.include?(0) }
+      .map { |comp|
+        remaining = comps.reject { |c| c == comp }
+        target = comp[0]
+        target = comp[1] if target == 0
+        sum = comp.inject(:+)
+        chain = [comp]
+
+        [remaining, target, sum, chain]
+      }
+
+    while queue.any?
+      comps, target, sum, chain = queue.pop
+
+      if longest.empty? || chain.size > longest.first.size
+        longest = [chain]
+      elsif chain.size == longest.first.size
+        longest << chain
+      end
+
+      comps.select { |comp| comp.include?(target) }.each do |comp|
+        remaining = comps.reject { |c| c == comp }
+        new_target = comp[0]
+        new_target = comp[1] if new_target == target
+        new_sum = sum + comp.inject(:+)
+        new_chain = chain + [comp]
+
+        queue << [remaining, new_target, new_sum, new_chain]
+      end
+    end
+
+    puts longest.map { |chain| chain.flatten.inject(:+) }.max

data/data/solutions/github/gchan/2017/25_1.yml

@@ -0,0 +1,51 @@
+---
+- :name: day-25-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-25
+  :solution: |-
+    lines = input.split("\n")
+
+    instructions = {}
+
+    ((lines.length - 2) / 10).times do |i|
+      state_lines = lines[3 + 10 * i, 9]
+
+      instr = [state_lines[2, 3], state_lines[6, 3]].map do |lines|
+        {
+          write: lines[0][/\d+/].to_i,
+          dir:   lines[1][/(left|right)/],
+          state: lines[2][/(\w)\./][0]
+        }
+      end
+
+      state = state_lines[0][/(\w):/][0]
+
+      instructions[state] = [0, 1].zip(instr).to_h
+    end
+
+    tape = [0]
+    idx = 0
+    state = lines[0][/(\w)\./][0]
+    steps = lines[1][/\d+/].to_i
+
+    steps.times do
+      instr = instructions[state][tape[idx]]
+
+      tape[idx] = instr[:write]
+
+      if instr[:dir] == "right"
+        idx += 1
+      else
+        idx -= 1
+      end
+
+      if idx < 0
+        tape.unshift 0
+        idx += 1
+      elsif idx == tape.size
+        tape.push 0
+      end
+
+      state = instr[:state]
+    end
+
+    puts tape.count { |b| b == 1 }

data/data/solutions/github/gchan/2018/01_1.yml

@@ -0,0 +1,4 @@
+---
+- :name: day-01-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-01
+  :solution: puts input.split("\n").map(&:to_i).inject(:+)

data/data/solutions/github/gchan/2018/01_2.yml

@@ -0,0 +1,23 @@
+---
+- :name: day-01-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-01
+  :solution: |-
+    input     = File.read(file_path)
+
+    changes = input.split("\n")
+
+    sum = 0
+    sums = Set.new
+
+    while true
+      changes.each do |change|
+        sum += change.to_i
+
+        if sums.include?(sum)
+          puts sum
+          exit
+        end
+
+        sums.add(sum)
+      end
+    end

data/data/solutions/github/gchan/2018/02_1.yml

@@ -0,0 +1,21 @@
+---
+- :name: day-02-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-02
+  :solution: |-
+    twos = 0
+    threes = 0
+
+    input.split("\n").each do |row|
+      counts = Hash.new(0)
+
+      row.chars.each do |char|
+        counts[char] += 1
+      end
+
+      counts = counts.invert
+
+      twos += 1 if counts[2]
+      threes += 1 if counts[3]
+    end
+
+    puts twos * threes

data/data/solutions/github/gchan/2018/02_2.yml

@@ -0,0 +1,21 @@
+---
+- :name: day-02-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-02
+  :solution: |-
+    boxes = input.split("\n")
+
+    boxes.first.length.times do |column|
+      counts = Hash.new(0)
+
+      boxes.map do |box|
+        id = box[0...column] + box[(column + 1)..-1]
+        counts[id] += 1
+      end
+
+      counts = counts.invert
+
+      if counts[2]
+        puts counts[2]
+        break
+      end
+    end

data/data/solutions/github/gchan/2018/03_1.yml

@@ -0,0 +1,21 @@
+---
+- :name: day-03-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-03
+  :solution: |-
+    grid = Array.new(1000) { Array.new(1000, 0) }
+
+    claims = input.split("\n")
+
+    claims.each do |claim|
+      ord, dim = claim.split("@").last.split(":")
+      x, y = ord.split(",").map(&:to_i)
+      w, h = dim.split("x").map(&:to_i)
+
+      w.times do |x1|
+        h.times do |y1|
+          grid[x + x1][y + y1] += 1
+        end
+      end
+    end
+
+    puts grid.flatten.select { |cell| cell > 1 }.count

data/data/solutions/github/gchan/2018/03_2.yml

@@ -0,0 +1,38 @@
+---
+- :name: day-03-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-03
+  :solution: |-
+    input     = File.read(file_path)
+
+    grid = Array.new(1000) { Array.new(1000) { Set.new } }
+    candidates = Set.new
+
+    claims = input.split("\n")
+
+    claims.each do |claim|
+      id, claim = claim.split("@")
+      ord, dim = claim.split(":")
+      x, y = ord.split(",").map(&:to_i)
+      w, h = dim.split("x").map(&:to_i)
+      id = id[1..-1].to_i
+
+      candidates.add id
+
+      w.times do |x1|
+        h.times do |y1|
+          cell = grid[x+x1][y+y1]
+
+          if cell.any?
+            candidates.delete id
+
+            cell.each do |c|
+              candidates.delete c
+            end
+          end
+
+          cell.add id
+        end
+      end
+    end
+
+    puts candidates.to_a

data/data/solutions/github/gchan/2018/04_1.yml

@@ -0,0 +1,38 @@
+---
+- :name: day-04-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-04
+  :solution: |-
+    guard_logs = input.split("\n").sort.
+      slice_before { |l| l.include?("begin") }
+
+    guards = Hash.new { |h, k| h[k] = [] }
+
+    guard_logs.each do |logs|
+      id = logs.shift.scan(/#(\d*)/)[0][0].to_i
+
+      logs.each_slice(2) do |asleep, wake|
+        h, m = asleep.scan(/(\d*):(\d*)/)[0]
+        start = h.to_i * 60 + m.to_i
+
+        h, m = wake.scan(/(\d*):(\d*)/)[0]
+        stop = h.to_i * 60 + m.to_i
+
+        guards[id] << (start..stop)
+      end
+    end
+
+    id, _ = guards.max_by do |id, sleeps|
+      sleeps.map(&:size).inject(:+)
+    end
+
+    minute_counts = Hash.new(0)
+
+    guards[id].each do |range|
+      range.min...range.max do |i|
+        minute_counts[i] += 1
+      end
+    end
+
+    minute, _ = minute_counts.max_by { |_minute, count| count }
+
+    puts id * (minute - 1)

data/data/solutions/github/gchan/2018/04_2.yml

@@ -0,0 +1,42 @@
+---
+- :name: day-04-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-04
+  :solution: |-
+    guard_logs = input.split("\n").sort.
+      slice_before { |l| l.include?("begin") }
+
+    guards = Hash.new { |h, k| h[k] = [] }
+
+    guard_logs.each do |logs|
+      id = logs.shift.scan(/#(\d*)/)[0][0].to_i
+
+      logs.each_slice(2) do |asleep, wake|
+        h, m = asleep.scan(/(\d*):(\d*)/)[0]
+        start = h.to_i * 60 + m.to_i
+
+        h, m = wake.scan(/(\d*):(\d*)/)[0]
+        stop = h.to_i * 60 + m.to_i
+
+        guards[id] << (start..stop)
+      end
+    end
+
+    max_minutes = guards.map do |id, ranges|
+      minute_count = Hash.new(0)
+
+      ranges.each do |range|
+        range.min...range.max do |i|
+         minute_count[i] += 1
+        end
+      end
+
+      minute, count = minute_count.max_by { |k, v| v }
+
+      [id, count, minute - 1]
+    end
+
+    id, _, minute = max_minutes.max_by do |_id, count, _minute|
+      count
+    end
+
+    puts id * minute

data/data/solutions/github/gchan/2018/05_1.yml

@@ -0,0 +1,20 @@
+---
+- :name: day-05-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-05
+  :solution: |-
+    loop do
+      prev_length = input.length
+
+      input.gsub!(/([A-z])\1+/i) do |match|
+        chr = match[0]
+        pattern = chr.downcase + chr.upcase
+
+        match
+          .gsub(pattern, "")
+          .gsub(pattern.reverse, "")
+      end
+
+      break if input.length == prev_length
+    end
+
+    puts input.length

data/data/solutions/github/gchan/2018/05_2.yml

@@ -0,0 +1,31 @@
+---
+- :name: day-05-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-05
+  :solution: |-
+    shortest = nil
+
+    ('a'..'z').each do |char|
+      test = input.gsub(/#{char}/i, "")
+
+      loop do
+        prev_length = test.length
+
+        test.gsub!(/([A-z])\1+/i) do |match|
+          chr = match[0]
+          pattern = chr.downcase + chr.upcase
+
+          match
+            .gsub(pattern, "")
+            .gsub(pattern.reverse, "")
+        end
+
+        break if test.length == prev_length
+      end
+
+
+      if shortest.nil? || test.length < shortest
+        shortest = test.length
+        puts char
+        puts shortest
+      end
+    end

data/data/solutions/github/gchan/2018/06_1.yml

@@ -0,0 +1,44 @@
+---
+- :name: day-06-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-06
+  :solution: |-
+    input     = File.read(file_path)
+
+    ords = input.split("\n").map do |ord|
+      x, y = ord.split(",").map(&:to_i)
+    end
+
+    rows = ords.map(&:first).max + 1
+    cols = ords.map(&:last).max + 1
+
+    counts = Array.new(ords.size, 0)
+    infinite = Set.new
+
+    (rows + 2).times do |x|
+      (cols + 2).times do |y|
+        distances = {}
+
+        ords.map.with_index do |(x1, y1), idx|
+          distances[idx] = (x - x1 + 1).abs + (y - y1 + 1).abs
+        end
+
+        min = distances.values.min
+
+        min_ords = distances.select { |idx, dist| dist == min }
+        ord_idx = min_ords.keys.first
+
+        if min_ords.size == 1
+          counts[ord_idx] += 1
+
+          if x == 0 || y == 0 || x == rows + 1 || y == cols + 1
+            infinite.add(ord_idx)
+          end
+        end
+      end
+    end
+
+    infinite.each do |ig|
+      counts[ig] = 0
+    end
+
+    puts counts.max

data/data/solutions/github/gchan/2018/06_2.yml

@@ -0,0 +1,24 @@
+---
+- :name: day-06-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-06
+  :solution: |-
+    ords = input.split("\n").map do |ord|
+      x, y = ord.split(",").map(&:to_i)
+    end
+
+    rows = ords.map(&:first).max + 1
+    cols = ords.map(&:last).max + 1
+
+    count = 0
+
+    rows.times do |x|
+      cols.times do |y|
+        sum = ords.map.inject(0) do |sum, (x1, y1)|
+          sum + (x - x1).abs + (y - y1).abs
+        end
+
+        count += 1 if sum < 10000
+      end
+    end
+
+    puts count

data/data/solutions/github/gchan/2018/07_1.yml

@@ -0,0 +1,34 @@
+---
+- :name: day-07-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-07
+  :solution: |-
+    rules = input.split("\n")
+
+    steps = Hash.new { |h, k| h[k] = Array.new }
+
+    rules.each do |rule|
+      req, step = rule.scan(/\s(\w)\s/).map(&:first)
+
+      steps[step] << req
+    end
+
+    todo = ("A"..(steps.keys.max)).to_a
+
+    done = []
+
+    while todo.any?
+      todo.each do |step|
+        next if steps[step].any?
+
+        todo.delete(step)
+        done << step
+
+        steps.each do |_, reqs|
+          reqs.delete(step)
+        end
+
+        break
+      end
+    end
+
+    puts done.join

data/data/solutions/github/gchan/2018/07_2.yml

@@ -0,0 +1,53 @@
+---
+- :name: day-07-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-07
+  :solution: |-
+    input     = File.read(file_path)
+
+    rules = input.split("\n")
+
+    steps = Hash.new { |h, k| h[k] = Array.new }
+
+    rules.each do |rule|
+      req, step = rule.scan(/\s(\w)\s/).map(&:first)
+
+      steps[step] << req
+    end
+
+    todo = ("A"..(steps.keys.max)).to_a
+
+    num_workers = 5
+    workers = {}
+
+    tick = -1
+
+    while todo.any? || workers.any?
+      tick += 1
+
+      workers.keys.each do |step|
+        workers[step] -= 1
+
+        next if workers[step] > 0
+
+        # Mark job as complete
+        steps.each do |key, value|
+          value.delete(step)
+        end
+
+        workers.delete(step)
+      end
+
+      # Assign available jobs to available workesr
+      if workers.count < num_workers
+        todo.each do |step|
+          next if steps[step].any?
+
+          todo.delete(step)
+
+          job_length = step.ord - "A".ord + 1 + 60
+          workers[step] = job_length
+        end
+      end
+    end
+
+    puts tick

data/data/solutions/github/gchan/2018/08_1.yml

@@ -0,0 +1,24 @@
+---
+- :name: day-08-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-08
+  :solution: |-
+    numbers = input.split.map(&:to_i)
+
+    def sum(numbers)
+      child_nodes = numbers.shift
+      meta_entries = numbers.shift
+
+      sum = 0
+
+      child_nodes.times do
+        sum += sum(numbers)
+      end
+
+      meta_entries.times do
+        sum += numbers.shift
+      end
+
+      sum
+    end
+
+    puts sum(numbers)

data/data/solutions/github/gchan/2018/08_2.yml

@@ -0,0 +1,27 @@
+---
+- :name: day-08-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-08
+  :solution: |-
+    numbers = input.split.map(&:to_i)
+
+    def sum(numbers)
+      child_nodes = numbers.shift
+      meta_entries = numbers.shift
+
+      child_sums = child_nodes.times.map do
+        sum(numbers)
+      end
+
+      entries = meta_entries.times.map do
+        numbers.shift
+      end
+
+      if child_nodes == 0
+        entries.inject(:+)
+      else
+        entries.map { |idx| child_sums[idx-1] }
+          .compact.inject(:+)
+      end
+    end
+
+    puts sum(numbers)

data/data/solutions/github/gchan/2018/09_1.yml

@@ -0,0 +1,65 @@
+---
+- :name: day-09-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2018/day-09
+  :solution: |-
+    attr_accessor :left, :right, :value
+
+      def initialize(value, left = nil, right = nil)
+        @left = left || self
+        @right = right || self
+        @value = value
+      end
+
+      def remove
+        left = self.left
+        right = self.right
+
+        left.right = right
+        right.left = left
+      end
+
+      def insert_right(value)
+        right = self.right
+
+        marble = Marble.new(value, self, right)
+
+        self.right = marble
+        right.left = marble
+      end
+    end
+
+    def scores(players, max)
+      scores = Array.new(players, 0)
+      value = 0
+
+      current = Marble.new(value)
+
+      max.times do |value|
+        value += 1
+        player = value % players
+
+        if value % 23 == 0
+          7.times { current = current.left }
+
+          scores[player] += current.value
+          scores[player] += value
+
+          current.remove
+          current = current.right
+        else
+          current.right.insert_right(value)
+
+          current = current.right.right
+        end
+      end
+
+      scores
+    end
+
+    # puts scores(9, 25).max
+    # puts scores(10, 1618).max
+    # puts scores(13, 7999).max
+    # puts scores(17, 1104).max
+    # puts scores(21, 6111).max
+    # puts scores(30, 5807).max
+    puts scores(455, 71223).max