advent_of_ruby 0.2.0 → 0.3.0

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

@@ -0,0 +1,27 @@
+---
+- :name: day-02-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-02
+  :solution: |-
+    cmds = input.split("\n")
+
+    depth = 0
+    horizontal = 0
+    aim = 0
+
+    cmds.each do |cmd|
+      dir, num = cmd.split
+
+      num = num.to_i
+
+      case dir
+      when "forward"
+        horizontal += num
+        depth += aim * num
+      when "up"
+        aim -= num
+      when "down"
+        aim += num
+      end
+    end
+
+    puts depth * horizontal

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

@@ -0,0 +1,20 @@
+---
+- :name: day-03-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-03
+  :solution: |-
+    numbers = input.split("\n")
+
+    gamma = numbers.map(&:chars).transpose.map do |bits|
+      count = bits.select.count { |bit| bit == "0" }
+
+      if count > bits.size / 2
+        "0"
+      else
+        "1"
+      end
+    end
+
+    gamma = gamma.join.to_i(2)
+    epsilon = gamma ^ (2**12 - 1)
+
+    puts gamma * epsilon

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

@@ -0,0 +1,44 @@
+---
+- :name: day-03-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-03
+  :solution: |-
+    numbers = input.split("\n")
+
+    o2 = numbers.map(&:chars)
+
+    o2[0].size.times do |idx|
+      max_bit = "1"
+
+      count = o2.count { |o| o[idx] == "0" }
+
+      if count > o2.size / 2.0
+        max_bit = "0"
+      end
+
+      o2.select! { |o| o[idx] == max_bit }
+
+      break if o2.count == 1
+    end
+
+    o2_rating = o2.join.to_i(2)
+
+
+    co2 = numbers.map(&:chars)
+
+    co2[0].size.times do |idx|
+      max_bit = "0"
+
+      count = co2.count { |co| co[idx] == "1" }
+
+      if count < co2.size / 2.0
+        max_bit = "1"
+      end
+
+      co2.select! { |co| co[idx] == max_bit }
+
+      break if co2.count == 1
+    end
+
+    co2_rating = co2.join.to_i(2)
+
+    puts co2_rating * o2_rating

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

@@ -0,0 +1,43 @@
+---
+- :name: day-04-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-04
+  :solution: |-
+    input     = File.read(file_path)
+
+    lines = input.split("\n")
+
+    lines_per_board = 6
+    line_offset = 2
+    num_boards = lines.count / lines_per_board
+
+    boards = num_boards.times.map do |idx|
+      idx *= lines_per_board
+      idx += line_offset
+
+      lines[idx, lines_per_board - 1].map(&:split).map { |row| row.map(&:to_i) }
+    end
+
+    board_map = Hash.new { |hash, key| hash[key] = Set.new }
+
+    boards.each_with_index do |board, idx|
+      board.each_with_index do |row, y|
+        row.each_with_index do |num, x|
+          board_map[num].add([idx, y, x])
+        end
+      end
+    end
+
+    numbers = lines.first.split(",").map(&:to_i)
+
+    numbers.each do |num|
+      board_map[num].each do |board_idx, row, col|
+        board = boards[board_idx]
+
+        board[row][col] = nil
+
+        if board[row].all?(&:nil?) || board.transpose[col].all?(&:nil?)
+          puts board.flatten.compact.sum * num
+          exit
+        end
+      end
+    end

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

@@ -0,0 +1,50 @@
+---
+- :name: day-04-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-04
+  :solution: |-
+    input     = File.read(file_path)
+
+    lines = input.split("\n")
+
+    lines_per_board = 6
+    line_offset = 2
+    num_boards = lines.count / lines_per_board
+
+    boards = num_boards.times.map do |idx|
+      idx *= lines_per_board
+      idx += line_offset
+
+      lines[idx, lines_per_board - 1].map(&:split).map { |row| row.map(&:to_i) }
+    end
+
+    board_map = Hash.new { |hash, key| hash[key] = Set.new }
+
+    boards.each_with_index do |board, idx|
+      board.each_with_index do |row, y|
+        row.each_with_index do |num, x|
+          board_map[num].add([idx, y, x])
+        end
+      end
+    end
+
+    numbers = lines.first.split(",").map(&:to_i)
+    winners = Set.new
+
+    numbers.each do |num|
+      board_map[num].each do |board_idx, row, col|
+        next if winners.include?(board_idx)
+
+        board = boards[board_idx]
+
+        board[row][col] = nil
+
+        if board[row].all?(&:nil?) || board.transpose[col].all?(&:nil?)
+          winners.add(board_idx)
+
+          if winners.count == num_boards
+            puts board.flatten.compact.sum * num
+            exit
+          end
+        end
+      end
+    end

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

@@ -0,0 +1,30 @@
+---
+- :name: day-05-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-05
+  :solution: |-
+    lines = []
+
+    input.split("\n").each do |line|
+      lines << line.split(/,| -> /).map(&:to_i)
+    end
+
+    size = lines.flatten.max + 1
+
+    grid = Array.new(size) { Array.new(size, 0) }
+
+    lines.each do |(x1, y1, x2, y2)|
+      y2, y1 = y1, y2 if y2 < y1
+      x2, x1 = x1, x2 if x2 < x1
+
+      if x1 == x2
+        (y1..y2).each do |y|
+          grid[y][x1] += 1
+        end
+      elsif y1 == y2
+        (x1..x2).each do |x|
+          grid[y1][x] += 1
+        end
+      end
+    end
+
+    puts grid.flatten.count { |x| x >= 2 }

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

@@ -0,0 +1,32 @@
+---
+- :name: day-05-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-05
+  :solution: |-
+    lines = []
+
+    input.split("\n").each do |line|
+      lines << line.split(/,| -> /).map(&:to_i)
+    end
+
+    size = lines.flatten.max + 1
+
+    grid = Array.new(size) { Array.new(size, 0) }
+
+    lines.each do |(x1, y1, x2, y2)|
+      xd = 1
+      yd = 1
+
+      xd = -1 if x1 > x2
+      yd = -1 if y1 > y2
+
+      xd = 0 if x1 == x2
+      yd = 0 if y1 == y2
+
+      length = [(x1 - x2).abs, (y1 - y2).abs].max + 1
+
+      length.times do |idx|
+        grid[y1 + idx * yd][x1 + idx * xd] += 1
+      end
+    end
+
+    puts grid.flatten.count { |x| x >= 2 }

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

@@ -0,0 +1,18 @@
+---
+- :name: day-06-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-06
+  :solution: |-
+    fishes = input.split(",").map(&:to_i).sort.tally
+
+    fishes.default = 0
+
+    80.times do
+      fishes.transform_keys! { |k| k - 1 }
+
+      fishes[6] += fishes[-1]
+      fishes[8] = fishes[-1]
+
+      fishes[-1] = 0
+    end
+
+    puts fishes.values.inject(&:+)

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

@@ -0,0 +1,18 @@
+---
+- :name: day-06-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-06
+  :solution: |-
+    fishes = input.split(",").map(&:to_i).sort.tally
+
+    fishes.default = 0
+
+    256.times do
+      fishes.transform_keys! { |k| k - 1 }
+
+      fishes[6] += fishes[-1]
+      fishes[8] = fishes[-1]
+
+      fishes[-1] = 0
+    end
+
+    puts fishes.values.inject(&:+)

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

@@ -0,0 +1,17 @@
+---
+- :name: day-07-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-07
+  :solution: |-
+    positions = input.split(",").map(&:to_i)
+
+    min, max = positions.minmax
+
+    fuel_totals = Array.new(max + 1, 0)
+
+    positions.each do |pos|
+      (min..max).each do |x|
+        fuel_totals[x] += (pos - x).abs
+      end
+    end
+
+    puts fuel_totals.min

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

@@ -0,0 +1,27 @@
+---
+- :name: day-07-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-07
+  :solution: |-
+    positions = input.split(",").map(&:to_i)
+
+    min, max = positions.minmax
+
+    fuel_totals = Array.new(max + 1, 0)
+
+    positions.each do |pos|
+      fuel = 0
+
+      (pos..max).each_with_index do |x, idx|
+        fuel += idx
+        fuel_totals[x] += fuel
+      end
+
+      fuel = 0
+
+      (min..pos).each_with_index do |x, idx|
+        fuel += idx
+        fuel_totals[pos-x] += fuel
+      end
+    end
+
+    puts fuel_totals.min

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

@@ -0,0 +1,8 @@
+---
+- :name: day-08-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-08
+  :solution: |-
+    puts input.split("\n")
+      .map { |line| line.split("|").last }
+      .flat_map(&:split)
+      .count { |x| [2, 3, 4, 7].include?(x.length) }

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

@@ -0,0 +1,83 @@
+---
+- :name: day-08-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-08
+  :solution: |-
+    sum = 0
+
+    input.split("\n").each do |line|
+      config, digits = line.split("|").map(&:split)
+
+      config = config.map(&:chars)
+        .map(&:sort)
+        .map(&:join)
+        .sort_by(&:length)
+
+      digits = digits.map(&:chars)
+        .map(&:sort)
+        .map(&:join)
+
+      digit_map = []
+
+      digit_map[1] = config[0] # len 2 => 1
+      digit_map[7] = config[1] # len 3 => 7
+      digit_map[4] = config[2] # len 4 => 4
+      digit_map[8] = config[9] # len 7 => 8
+
+      # Digit 4 is contained in digit 9
+      #
+      four = digit_map[4].chars
+
+      nine = config.select { |digit| digit.length == 6 }
+        .map(&:chars)
+        .find { |digit| digit & four == four }
+
+      digit_map[9] = nine.join
+
+      # Digit 1 is contained in digit 3
+      #
+      one = digit_map[1].chars
+
+      three = config.select { |digit| digit.length == 5 }
+        .map(&:chars)
+        .find { |digit| digit & one == one }
+
+      digit_map[3] = three.join
+
+      # Digit 5 and 1 makes digit 9
+      #
+      five = config.select { |digit| digit.length == 5 }
+        .map(&:chars)
+        .find { |digit| (digit | one).sort == nine}
+
+      digit_map[5] = five.join
+
+      # Digit 2 is the only remaining unidentified 5 segment piece
+      #
+      two = config.select { |digit| digit.length == 5 }
+        .find { |digit| !digit_map.include?(digit) }
+
+      digit_map[2] = two
+
+      # Digit 6 and 1 makes digit 8
+      #
+      eight = digit_map[8].chars
+
+      six = config.select { |digit| digit.length == 6 }
+        .map(&:chars)
+        .find { |digit| (digit | one).sort == eight}
+
+      digit_map[6] = six.join
+
+      # Digit 0 is is the last unidentified digit
+      #
+      zero = config
+        .find { |digit| !digit_map.include?(digit) }
+
+      digit_map[0] = zero
+
+      config_map = Hash[*digit_map.each_with_index.to_a.flatten]
+
+      sum += digits.map { |digit| config_map[digit] }.join.to_i
+    end
+
+    puts sum

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

@@ -0,0 +1,32 @@
+---
+- :name: day-09-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-09
+  :solution: |-
+    grid = input.split("\n").map { |line| line.split("").map(&:to_i) }
+
+    width = grid[0].length
+    height = grid.length
+
+    risk = 0
+
+    grid.each_with_index do |row, y|
+      row.each_with_index do |cell, x|
+        neighbours = [
+          [x - 1, y],
+          [x + 1, y],
+          [x, y + 1],
+          [x, y - 1]
+        ]
+
+        neighbours.select! do |x1, y1|
+          x1 >= 0 && x1 < width &&
+          y1 >= 0 && y1 < height
+        end
+
+        if neighbours.all? { |x1, y1| grid[y1][x1] > cell }
+          risk += cell + 1
+        end
+      end
+    end
+
+    puts risk

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

@@ -0,0 +1,65 @@
+---
+- :name: day-09-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-09
+  :solution: |-
+    input     = File.read(file_path)
+
+    grid = input.split("\n").map { |line| line.split("").map(&:to_i) }
+
+    def find_neighbours(grid, x ,y)
+      width = grid[0].length
+      height = grid.length
+
+      neighbours = [
+        [x - 1, y],
+        [x + 1, y],
+        [x, y + 1],
+        [x, y - 1]
+      ]
+
+      neighbours.select do |x1, y1|
+        x1 >= 0 && x1 < width &&
+        y1 >= 0 && y1 < height
+      end
+    end
+
+    def find_equal_or_higher_neighbours(grid, x, y)
+      cell = grid[y][x]
+
+      find_neighbours(grid, x, y).select do |x1, y1|
+        grid[y1][x1] < 9 && grid[y1][x1] >= cell
+      end
+    end
+
+    basin_sizes = []
+
+    grid.each_with_index do |row, y|
+      row.each_with_index do |cell, x|
+        next if cell == 9
+
+        queue = find_neighbours(grid, x, y)
+
+        if queue.all? { |x1, y1| grid[y1][x1] > cell }
+          visited = Set.new
+          visited.add([x,y])
+
+          basin_size = 1
+
+          while queue.any? do
+            x1, y1 = queue.shift
+            next if visited.include?([x1, y1])
+            visited.add([x1, y1])
+
+            basin_size += 1
+
+            queue.concat(
+              find_equal_or_higher_neighbours(grid, x1, y1)
+            )
+          end
+
+          basin_sizes << basin_size
+        end
+      end
+    end
+
+    puts basin_sizes.sort.reverse[0, 3].inject(&:*)

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

@@ -0,0 +1,36 @@
+---
+- :name: day-10-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-10
+  :solution: |-
+    CHARS = {
+      '(' => ')',
+      '{' => '}',
+      '[' => ']',
+      '<' => '>'
+    }
+
+    POINTS = {
+      ')' => 3,
+      ']' => 57,
+      '}' => 1197,
+      '>' => 25137
+    }
+
+    points = 0
+
+    input.split("\n").map do |line|
+      expectations = []
+
+      line.chars.each do |char|
+        if CHARS.include?(char)
+          expectations << CHARS[char]
+        elsif expectations.last == char
+          expectations.pop
+        else
+          points += POINTS[char]
+          break
+        end
+      end
+    end
+
+    puts points

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

@@ -0,0 +1,47 @@
+---
+- :name: day-10-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-10
+  :solution: |-
+    CHARS = {
+      '(' => ')',
+      '{' => '}',
+      '[' => ']',
+      '<' => '>'
+    }
+
+    POINTS = {
+      ')' => 1,
+      ']' => 2,
+      '}' => 3,
+      '>' => 4
+    }
+
+    points = []
+
+    input.split("\n").map do |line|
+      expectations = []
+
+      line.chars.each do |char|
+        if CHARS.include?(char)
+          expectations << CHARS[char]
+        elsif expectations.last == char
+          expectations.pop
+        else
+          expectations.clear
+          break
+        end
+      end
+
+      # Skip if corrupt
+      next if expectations.empty?
+
+      score = 0
+      expectations.reverse.each do |char|
+        score *= 5
+        score += POINTS[char]
+      end
+
+      points << score
+    end
+
+    puts points.sort[points.size / 2]

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

@@ -0,0 +1,63 @@
+---
+- :name: day-11-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2021/day-11
+  :solution: |-
+    input     = File.read(file_path)
+
+    def find_neighbours(grid, x ,y)
+      width = grid[0].length
+      height = grid.length
+
+      neighbours = [x - 1, x, x + 1].product([y - 1, y, y + 1])
+
+      neighbours.select do |x1, y1|
+        x1 >= 0 && x1 < width &&
+        y1 >= 0 && y1 < height &&
+        (x1 != x || y1 != y)
+      end
+    end
+
+    grid = input.split("\n").map(&:chars).map { |row| row.map(&:to_i) }
+
+    flash_count = 0
+
+    100.times do
+      grid.each_with_index do |row, y|
+        row.each_with_index do |cell, x|
+          grid[y][x] += 1
+        end
+      end
+
+      flashed = Set.new
+
+      queue = []
+
+      queue.concat(
+        (0..grid[0].length - 1).to_a.product((0..grid.length - 1).to_a)
+      )
+
+      while queue.any? do
+        x, y = queue.shift
+
+        next if flashed.include?([x, y])
+
+        cell = grid[y][x]
+
+        if cell > 9
+          flashed.add([x, y])
+
+          find_neighbours(grid, x, y).each do |x1, y1|
+            grid[y1][x1] += 1
+            queue << [x1, y1]
+          end
+        end
+      end
+
+      flashed.each do |x, y|
+        grid[y][x] = 0
+      end
+
+      flash_count += flashed.size
+    end
+
+    puts flash_count