advent_of_ruby 0.2.0 → 0.3.0

data/data/solutions/github/gchan/2021/18_1.yml

@@ -0,0 +1,153 @@
+---
+- :name: day-18-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-18
+  :solution: |-
+    SnailNumber = Struct.new(:pair, :level) do
+      def increment_level
+        self.level += 1
+      end
+
+      def left
+        pair.first
+      end
+
+      def right
+        pair.last
+      end
+    end
+
+    def explode(numbers)
+      numbers.each_with_index do |number, idx|
+        next if number.level < 4
+
+        merge = false
+
+        if idx > 0
+          left_num = numbers[idx - 1]
+
+          if left_num.pair.size == 2
+            left_num.pair[1] += number.left
+          else
+            left_num.pair[0] += number.left
+          end
+
+          if number.level - 1 == left_num.level && left_num.pair.count == 1
+            left_num.pair << 0
+            merge = true
+          end
+        end
+
+        if idx < numbers.size - 1
+          right_num = numbers[idx + 1]
+          right_num.pair[0] += number.right
+
+          if !merge && number.level - 1 == right_num.level && right_num.pair.count == 1
+            right_num.pair.unshift(0)
+            merge = true
+          end
+        end
+
+        if merge
+          numbers.delete_at(idx)
+        else
+          number.pair = [0]
+          number.level -= 1
+        end
+
+        return true
+      end
+
+      false
+    end
+
+    def split(numbers)
+      numbers.each_with_index do |number, idx|
+        next if number.pair.all? { |el| el < 10 }
+
+        if number.pair.count == 1
+          number.pair = [number.left / 2, (number.left / 2.0).ceil]
+          number.level += 1
+        else
+          if number.left > 9
+            el = number.pair.shift
+
+            pair = [el / 2, (el / 2.0).ceil]
+            numbers.insert(idx, SnailNumber.new(pair, number.level + 1))
+          else
+            el = number.pair.pop
+
+            pair = [el / 2, (el / 2.0).ceil]
+            numbers.insert(idx + 1, SnailNumber.new(pair, number.level + 1))
+          end
+        end
+
+        return true
+      end
+
+      false
+    end
+
+    # Create a flat array of SnailNumbers.
+    # 'level' attributes denotes the amount of nesting
+    #
+    def create_numbers(string)
+      # eval is lazy and potentially dangerous
+      queue = [[eval(string) , 0]]
+
+      nums = []
+
+      while queue.any?
+        node, level = queue.shift
+
+        if node.is_a?(Integer)
+          nums << SnailNumber.new([node], level - 1)
+        elsif node.all? { |node| node.is_a? Integer }
+          nums << SnailNumber.new(node, level)
+        else
+          node.reverse_each do |child_node|
+            queue.unshift([child_node, level + 1])
+          end
+        end
+      end
+
+      nums
+    end
+
+    numbers = []
+
+    input.lines.each do |string|
+      num = create_numbers(string)
+
+      num.each(&:increment_level) unless numbers.empty?
+
+      numbers.each(&:increment_level)
+      numbers.concat(num)
+
+      while explode(numbers); end
+
+      # Keep checking for explodes after a split
+      # Stop checking after no more splits
+      while split(numbers)
+        while explode(numbers); end
+      end
+    end
+
+    while numbers.count > 1
+      numbers.each do |num|
+        next if num.pair.count == 1
+
+        num.pair = [num.left * 3 + num.right * 2]
+        num.level -= 1
+      end
+
+      numbers.each_cons(2).with_index do |(num1, num2), idx|
+        next if num1.level != num2.level
+
+        num1.pair = [num1.left * 3 + num2.left * 2]
+        num1.level -= 1
+        numbers.delete_at(idx +1)
+        break
+      end
+    end
+
+    puts numbers.first.left

data/data/solutions/github/gchan/2021/18_2.yml

@@ -0,0 +1,158 @@
+---
+- :name: day-18-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-18
+  :solution: |-
+    SnailNumber = Struct.new(:pair, :level) do
+      def increment_level
+        self.level += 1
+      end
+
+      def left
+        pair.first
+      end
+
+      def right
+        pair.last
+      end
+    end
+
+    def explode(numbers)
+      numbers.each_with_index do |number, idx|
+        next if number.level < 4
+
+        merge = false
+
+        if idx > 0
+          left_num = numbers[idx - 1]
+
+          if left_num.pair.size == 2
+            left_num.pair[1] += number.left
+          else
+            left_num.pair[0] += number.left
+          end
+
+          if number.level - 1 == left_num.level && left_num.pair.count == 1
+            left_num.pair << 0
+            merge = true
+          end
+        end
+
+        if idx < numbers.size - 1
+          right_num = numbers[idx + 1]
+          right_num.pair[0] += number.right
+
+          if !merge && number.level - 1 == right_num.level && right_num.pair.count == 1
+            right_num.pair.unshift(0)
+            merge = true
+          end
+        end
+
+        if merge
+          numbers.delete_at(idx)
+        else
+          number.pair = [0]
+          number.level -= 1
+        end
+
+        return true
+      end
+
+      false
+    end
+
+    def split(numbers)
+      numbers.each_with_index do |number, idx|
+        next if number.pair.all? { |el| el < 10 }
+
+        if number.pair.count == 1
+          number.pair = [number.left / 2, (number.left / 2.0).ceil]
+          number.level += 1
+        else
+          if number.left > 9
+            el = number.pair.shift
+
+            pair = [el / 2, (el / 2.0).ceil]
+            numbers.insert(idx, SnailNumber.new(pair, number.level + 1))
+          else
+            el = number.pair.pop
+
+            pair = [el / 2, (el / 2.0).ceil]
+            numbers.insert(idx + 1, SnailNumber.new(pair, number.level + 1))
+          end
+        end
+
+        return true
+      end
+
+      false
+    end
+
+    # Create a flat array of SnailNumbers.
+    # 'level' attributes denotes the amount of nesting
+    #
+    def create_numbers(string)
+      # eval is lazy and potentially dangerous
+      queue = [[eval(string) , 0]]
+
+      nums = []
+
+      while queue.any?
+        node, level = queue.shift
+
+        if node.is_a?(Integer)
+          nums << SnailNumber.new([node], level - 1)
+        elsif node.all? { |node| node.is_a? Integer }
+          nums << SnailNumber.new(node, level)
+        else
+          node.reverse_each do |child_node|
+            queue.unshift([child_node, level + 1])
+          end
+        end
+      end
+
+      nums
+    end
+
+    def sum(str1, str2)
+      num1 = create_numbers(str1)
+      num2 = create_numbers(str2)
+
+      num1.each(&:increment_level)
+      num2.each(&:increment_level)
+
+      numbers = num1.concat(num2)
+
+      while explode(numbers); end
+
+      # Keep checking for explodes after a split
+      # Stop checking after no more splits
+      while split(numbers)
+        while explode(numbers); end
+      end
+
+      # Magnitude calculation
+      #
+      while numbers.count > 1
+        numbers.each do |num|
+          next if num.pair.count == 1
+
+          num.pair = [num.left * 3 + num.right * 2]
+          num.level -= 1
+        end
+
+        numbers.each_cons(2).with_index do |(num1, num2), idx|
+          next if num1.level != num2.level
+
+          num1.pair = [num1.left * 3 + num2.left * 2]
+          num1.level -= 1
+          numbers.delete_at(idx +1)
+          break
+        end
+      end
+
+      numbers.first.left
+    end
+
+    puts input.lines.permutation(2)
+      .map { |str1, str2| sum(str1, str2) }
+      .max

data/data/solutions/github/gchan/2021/19_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/gchan/2021/19_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/gchan/2021/20_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/gchan/2021/20_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/gchan/2021/21_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/gchan/2021/21_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/gchan/2021/22_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/gchan/2021/22_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/gchan/2021/23_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/gchan/2021/23_2.yml

@@ -0,0 +1 @@
+--- []

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

@@ -0,0 +1 @@
+--- []

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

@@ -0,0 +1 @@
+--- []

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

@@ -0,0 +1 @@
+--- []

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

@@ -0,0 +1,7 @@
+---
+- :name: day-01-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2022/day-01
+  :solution: |-
+    puts input.split("\n\n")
+      .map{ |calories| calories.split.map(&:to_i).sum }
+      .max

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

@@ -0,0 +1,9 @@
+---
+- :name: day-01-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2022/day-01
+  :solution: |-
+    puts input.split("\n\n")
+      .map{ |calories| calories.split.map(&:to_i).sum }
+      .sort
+      .last(3)
+      .sum

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

@@ -0,0 +1,21 @@
+---
+- :name: day-02-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2022/day-02
+  :solution: |-
+    scores = input.each_line.map { |line|
+      opp, you = line.split
+
+      opp = %w(A B C).index(opp)
+      you = %w(X Y Z).index(you)
+
+      score = you + 1
+      if opp == you
+        score += 3 # draw
+      elsif (opp + 1) % 3 == you
+        score += 6 # win
+      end
+
+      score
+    }
+
+    puts scores.sum

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

@@ -0,0 +1,20 @@
+---
+- :name: day-02-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2022/day-02
+  :solution: |-
+    scores = input.each_line.map { |line|
+      opp, you = line.split
+
+      opp = %w(A B C).index(opp)
+
+      case you
+      when "X" # lose
+        score = 1 + (opp - 1) % 3
+      when "Y" # draw
+        score = 1 + opp + 3
+      when "Z" # win
+        score = 1 + (opp + 1) % 3 + 6
+      end
+    }
+
+    puts scores.sum

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

@@ -0,0 +1,13 @@
+---
+- :name: day-03-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2022/day-03
+  :solution: |-
+    priorities = input.each_line.map { |runsack|
+      compartments = runsack.strip.chars.each_slice(runsack.length / 2).to_a
+      error = (compartments[0] & compartments[1]).first
+
+      priority = error.downcase != error ? 26 : 0
+      priority += error.downcase.ord - 'a'.ord + 1
+    }
+
+    puts priorities.sum

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

@@ -0,0 +1,12 @@
+---
+- :name: day-03-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2022/day-03
+  :solution: |-
+    priorities = input.each_line.each_slice(3).map { |group|
+      error = group.map(&:strip).map(&:chars).inject(:&).first
+
+      priority = error.downcase != error ? 26 : 0
+      priority += error.downcase.ord - 'a'.ord + 1
+    }
+
+    puts priorities.sum

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

@@ -0,0 +1,11 @@
+---
+- :name: day-04-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2022/day-04
+  :solution: |-
+    puts input.each_line.count { |pair|
+      pair = pair.strip.split(',')
+        .map { |section| section.split('-').map(&:to_i) }
+        .map { |section| Range.new(*section) }
+
+      pair[0].cover?(pair[1]) || pair[1].cover?(pair[0])
+    }

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

@@ -0,0 +1,12 @@
+---
+- :name: day-04-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2022/day-04
+  :solution: |-
+    puts input.each_line.count { |pair|
+      pair = pair.strip.split(',')
+        .map { |section| section.split('-').map(&:to_i) }
+        .map { |section| Range.new(*section) }
+
+      pair[0].cover?(pair[1].begin) || pair[0].cover?(pair[1].end) ||
+        pair[1].cover?(pair[0].begin) || pair[1].cover?(pair[0].end)
+    }

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

@@ -0,0 +1,28 @@
+---
+- :name: day-05-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2022/day-05
+  :solution: |-
+    stacks, instructions = input.split("\n\n")
+
+    stacks = stacks.split("\n")
+    num_stacks = stacks.pop.split.last.to_i
+
+    rows = stacks.map { |row|
+      row = row.chars.each_slice(4).map { |col| col.join.scan(/\w/).first }
+
+      (num_stacks - row.length).times { row << nil }
+
+      row
+    }
+
+    stacks = rows.transpose.map(&:compact)
+
+    instructions.each_line do |instruction|
+      count, from, to = instruction.scan(/(\d+).*(\d+).*(\d+)/)[0].map(&:to_i)
+
+      stacks[to -1].unshift(
+        *stacks[from - 1].shift(count).reverse
+      )
+    end
+
+    puts stacks.map(&:first).join

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

@@ -0,0 +1,28 @@
+---
+- :name: day-05-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2022/day-05
+  :solution: |-
+    stacks, instructions = input.split("\n\n")
+
+    stacks = stacks.split("\n")
+    num_stacks = stacks.pop.split.last.to_i
+
+    rows = stacks.map { |row|
+      row = row.chars.each_slice(4).map { |col| col.join.scan(/\w/).first }
+
+      (num_stacks - row.length).times { row << nil }
+
+      row
+    }
+
+    stacks = rows.transpose.map(&:compact)
+
+    instructions.each_line do |instruction|
+      count, from, to = instruction.scan(/(\d+).*(\d+).*(\d+)/)[0].map(&:to_i)
+
+      stacks[to -1].unshift(
+        *stacks[from - 1].shift(count)
+      )
+    end
+
+    puts stacks.map(&:first).join

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

@@ -0,0 +1,9 @@
+---
+- :name: day-06-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2022/day-06
+  :solution: |-
+    _, idx = input.chars.each_cons(4).with_index.find { |seq, idx|
+      seq.uniq.count == 4
+    }
+
+    puts idx + 4

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

@@ -0,0 +1,9 @@
+---
+- :name: day-06-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2022/day-06
+  :solution: |-
+    _, idx = input.chars.each_cons(14).with_index.find { |seq, idx|
+      seq.uniq.count == 14
+    }
+
+    puts idx + 14

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

@@ -0,0 +1,26 @@
+---
+- :name: day-07-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2022/day-07
+  :solution: |-
+    directories = Hash.new { |h, k| h[k] = [] }
+
+    current_dir = []
+
+    input.each_line do |line|
+      case line.split
+      in [/\d+/ => size, _file]
+        directories[current_dir.clone] << size.to_i
+      in ["dir", /\w+/ => dir]
+        new_dir = current_dir.clone.append(dir)
+        directories[current_dir.clone] << directories[new_dir]
+      in ["$", "cd", ".."]
+        current_dir.pop
+      in ["$", "cd", /.+/ => dir]
+        current_dir << dir
+      else # ls
+      end
+    end
+
+    puts directories.map { |_k, v| v.flatten.sum }
+      .select { |size| size <= 100_000 }
+      .sum

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

@@ -0,0 +1,31 @@
+---
+- :name: day-07-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2022/day-07
+  :solution: |-
+    directories = Hash.new { |h, k| h[k] = [] }
+
+    current_dir = []
+
+    input.each_line do |line|
+      case line.split
+      in [/\d+/ => size, _file]
+        directories[current_dir.clone] << size.to_i
+      in ["dir", /\w+/ => dir]
+        new_dir = current_dir.clone.append(dir)
+        directories[current_dir.clone] << directories[new_dir]
+      in ["$", "cd", ".."]
+        current_dir.pop
+      in ["$", "cd", /.+/ => dir]
+        current_dir << dir
+      else # ls
+      end
+    end
+
+    total_space = 70_000_000
+    target_free_space = 30_000_000
+    used_space = directories[["/"]].flatten.sum
+    minimum_to_delete = target_free_space - (total_space - used_space)
+
+    puts directories.map { |_k, v| v.flatten.sum }
+      .select { |size| size >= minimum_to_delete }
+      .min

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

@@ -0,0 +1,42 @@
+---
+- :name: day-08-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2022/day-08
+  :solution: |-
+    input     = File.read(file_path)
+
+    grid = input.each_line.map { |line| line.strip.chars.map(&:to_i) }
+
+    trees = Set.new
+
+    max = -1
+    proc = Proc.new do |height, x, y|
+      next if height <= max
+      trees << [y, x]
+      max = height
+    end
+
+    grid.each_with_index do |row, y|
+      max = -1
+      row.each_with_index do |height, x|
+        proc.call(height, x, y)
+      end
+
+      max = -1
+      row.each_with_index.reverse_each do |height, x|
+        proc.call(height, x, y)
+      end
+    end
+
+    grid.transpose.each_with_index do |col, x|
+      max = -1
+      col.each_with_index do |height, y|
+        proc.call(height, x, y)
+      end
+
+      max = -1
+      col.each_with_index.reverse_each do |height, y|
+        proc.call(height, x, y)
+      end
+    end
+
+    puts trees.count