advent_of_ruby 0.2.0 → 0.3.0

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

@@ -0,0 +1,46 @@
+---
+- :name: day-21-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-21
+  :solution: |-
+    lines = input.split("\n")
+
+    string = "abcdefgh"
+
+    lines.each do |line|
+      if line.include?("swap position")
+        i, j = line.match(/(\d+).*(\d+)/)[1..2].map(&:to_i)
+        string[i], string[j] = string[j], string[i]
+
+      elsif line.include?("swap letter")
+        m, n = line.match(/(\w) with letter (\w)/)[1..2]
+        string.tr!(m + n, n + m)
+
+      elsif line.include?("reverse positions")
+        i, j = line.match(/(\d*) through (\d*)/)[1..2].map(&:to_i)
+        string[i..j] = string[i..j].reverse
+
+      elsif line =~ /rotate (left|right)/
+        direction, steps = line.match(/(left|right) (\d*) step/)[1..2]
+
+        steps = steps.to_i
+        steps *= -1 if direction == "right"
+        string = string.chars.rotate(steps).join
+
+      elsif line.include?("rotate based on position of letter")
+        letter = line.match(/letter (\w)/)[1]
+
+        steps = string.chars.index(letter)
+        steps += 1 if steps >= 4
+        steps += 1
+        string = string.chars.rotate(-steps).join
+
+      elsif line.include?("move position ")
+        i, j = line.match(/(\d*) to position (\d*)/)[1..2].map(&:to_i)
+
+        chars = string.chars
+        chars.insert(j, chars.delete_at(i))
+        string = chars.join
+      end
+    end
+
+    puts string

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

@@ -0,0 +1,51 @@
+---
+- :name: day-21-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-21
+  :solution: |-
+    lines = input.split("\n")
+
+    string = "fbgdceah"
+
+    lines.reverse.each do |line|
+      if line.include?("swap position")
+        i, j = line.match(/(\d+).*(\d+)/)[1..2].map(&:to_i)
+        string[i], string[j] = string[j], string[i]
+
+      elsif line.include?("swap letter")
+        m, n = line.match(/(\w) with letter (\w)/)[1..2]
+        string.tr!(m + n, n + m)
+
+      elsif line.include?("reverse positions")
+        i, j = line.match(/(\d*) through (\d*)/)[1..2].map(&:to_i)
+        string[i..j] = string[i..j].reverse
+
+      elsif line =~ /rotate (left|right)/
+        direction, steps = line.match(/(left|right) (\d*) step/)[1..2]
+
+        steps = steps.to_i
+        steps *= -1 if direction == "right"
+        string = string.chars.rotate(-steps).join
+
+      elsif line.include?("rotate based on position of letter")
+        letter = line.match(/letter (\w)/)[1]
+        idx = string.chars.index(letter)
+
+        steps = idx / 2
+        if idx % 2 == 1 || idx == 0
+          steps += 1
+        else
+          steps += 5
+        end
+
+        string = string.chars.rotate(steps).join
+
+      elsif line.include?("move position ")
+        i, j = line.match(/(\d*) to position (\d*)/)[1..2].map(&:to_i)
+
+        chars = string.chars
+        chars.insert(i, chars.delete_at(j))
+        string = chars.join
+      end
+    end
+
+    puts string

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

@@ -0,0 +1,26 @@
+---
+- :name: day-22-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-22
+  :solution: |-
+    input     = File.read(file_path)
+
+    lines = input.split("\n")[2..-1]
+
+    Node = Struct.new(:x, :y, :size, :used, :avail)
+
+    nodes = lines.map do |line|
+      x, y, size, used, avail = line.match(/x(\d+)-y(\d+)\s*(\d+)T\s*(\d+)T\s*(\d+)T/)[1..-1].map(&:to_i)
+
+      Node.new(x, y, size, used, avail)
+    end
+
+    pairs = []
+
+    nodes.select { |node| node.used > 0 }.each do |node_one|
+      nodes.
+        reject { |node| node_one == node }.
+        select { |node| node_one.used <= node.avail }.
+        each { |node_two| pairs << [node_one, node_two] }
+    end
+
+    puts pairs.count

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

@@ -0,0 +1,82 @@
+---
+- :name: day-22-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-22
+  :solution: |-
+    input     = File.read(file_path)
+
+    lines = input.split("\n")[2..-1]
+
+    cols, rows = lines.last.match(/x(\d+)-y(\d+)/)[1..-1].map(&:to_i)
+    cols += 1
+    rows += 1
+
+    Node = Struct.new(:x, :y, :size, :used, :avail)
+
+    nodes = Array.new(rows) { Array.new(cols) }
+
+    empty_node = nil
+
+    lines.each do |line|
+      x, y, size, used, avail = line.match(/x(\d+)-y(\d+)\s*(\d+)T\s*(\d+)T\s*(\d+)T/)[1..-1].map(&:to_i)
+
+      node = Node.new(x, y, size, used, avail)
+      empty_node = node if node.used == 0
+      nodes[y][x] = node
+    end
+
+    nodes.length.times do |y|
+      nodes[y].length.times do |x|
+        node = nodes[y][x]
+
+        if x == cols - 1 && y == 0
+          print "G"
+        elsif node.used > 100
+          print "#"
+        elsif node.used == 0
+          print '_'
+        else
+          print '.'
+        end
+      end
+      puts
+    end
+
+    # Move to the top (y=0)
+    visited = Set.new
+    queue = [[empty_node, 0]]
+
+    visited.add(queue.first[0..1])
+    reached_goal = false
+
+    while !reached_goal
+      current, step = queue.shift
+
+      if current.y == 0
+        reached_goal = true
+        next
+      end
+
+      x = current.x
+      y = current.y
+
+      [[x+1, y], [x-1, y], [x, y+1], [x, y-1]].each do |x, y|
+        next if x < 0 || y < 0 || x >= nodes[0].size || y >= nodes.size
+        next if nodes[y][x].used > current.size
+        next if visited.include?([x, y])
+
+        visited.add([x, y])
+        new_location = [nodes[y][x], step + 1]
+        queue << new_location
+      end
+    end
+
+    total_steps = step
+    current_x = current.x
+
+    # Move to the right of goal node
+    total_steps += cols - current_x - 1
+
+    # Down, 3 Left, Up, Right (5 Moves)
+    total_steps += 5 * (cols - 2)
+
+    puts total_steps

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

@@ -0,0 +1,53 @@
+---
+- :name: day-23-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-23
+  :solution: |-
+    instructions = input.split("\n")
+
+    reg = { "a" => 7 }
+
+    i = 0
+
+    def argToVal(arg, reg)
+      if arg =~ /\d/
+        arg.to_i
+      else
+        reg[arg]
+      end
+    end
+
+    while i < instructions.length
+      cmd, arg1, arg2 = instructions[i].split(" ")
+
+      arg1Val = argToVal(arg1, reg)
+      arg2Val = argToVal(arg2, reg)
+
+      case cmd
+      when 'cpy'
+        reg[arg2] = arg1Val
+      when 'jnz'
+        i += arg2Val - 1 if arg1Val != 0
+      when 'inc'
+        reg[arg1] += 1
+      when 'dec'
+        reg[arg1] -= 1
+      when 'tgl'
+        idx = i + reg[arg1]
+
+        if instructions[idx]
+          cmd, arg1, arg2 = instructions[idx].split(" ")
+
+          if arg2
+            replacement = cmd == "jnz" ? "cpy" : "jnz"
+          else
+            replacement = cmd == "inc" ? "dec" : "inc"
+          end
+
+          instructions[idx][0..2] = replacement
+        end
+      end
+
+      i += 1
+    end
+
+    puts reg['a']

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

@@ -0,0 +1,55 @@
+---
+- :name: day-23-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-23
+  :solution: |-
+    instructions = input.split("\n")
+
+    reg = { "a" => 12 }
+
+    i = 0
+
+    def argToVal(arg, reg)
+      if arg =~ /\d/
+        arg.to_i
+      else
+        reg[arg]
+      end
+    end
+
+    while i < instructions.length
+      cmd, arg1, arg2, arg3 = instructions[i].split(" ")
+
+      arg1Val = argToVal(arg1, reg)
+      arg2Val = argToVal(arg2, reg)
+
+      case cmd
+      when 'mul'
+        reg[arg3] = arg1Val * arg2Val
+      when 'cpy'
+        reg[arg2] = arg1Val
+      when 'jnz'
+        i += arg2Val - 1 if arg1Val != 0
+      when 'inc'
+        reg[arg1] += 1
+      when 'dec'
+        reg[arg1] -= 1
+      when 'tgl'
+        idx = i + reg[arg1]
+
+        if instructions[idx]
+          cmd, arg1, arg2 = instructions[idx].split(" ")
+
+          if arg2
+            replacement = cmd == "jnz" ? "cpy" : "jnz"
+          else
+            replacement = cmd == "inc" ? "dec" : "inc"
+          end
+
+          instructions[idx][0..2] = replacement
+        end
+      end
+
+      i += 1
+    end
+
+    puts reg['a']

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

@@ -0,0 +1,66 @@
+---
+- :name: day-24-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-24
+  :solution: |-
+    input     = File.read(file_path)
+
+    maze = input.split("\n").map { |line| line.chars }
+
+    targets = {}
+
+    maze.each_with_index do |row, y|
+      row.each_with_index do |cell, x|
+        targets[cell] = [x, y] if cell =~ /\d/
+      end
+    end
+
+    distances = Hash.new { |h, k| h[k] = {} }
+
+    (targets.to_a).product(targets.to_a).each do |(s, (sx, sy)), (g, (gx, gy))|
+      next if s == g || distances[s][g]
+
+      visited = Set.new
+      queue = [[sx, sy, 0]]
+
+      visited.add(queue.first[0..1])
+      reached_goal = false
+
+      while !reached_goal
+        current = queue.shift
+
+        if current[0..1] == [gx, gy]
+          distances[s][g] = current[2]
+          distances[g][s] = current[2]
+
+          reached_goal = true
+        end
+
+        x = current[0]
+        y = current[1]
+        step = current[2]
+
+        [[x+1, y], [x-1, y], [x, y+1], [x, y-1]].each do |x, y|
+          next if x < 0 || y < 0
+          next if maze[y][x] == "#"
+          next if visited.include?([x, y])
+
+          visited.add([x, y])
+          new_location = [x, y, step + 1]
+          queue << new_location
+        end
+      end
+    end
+
+    lowest = 1_000
+
+    (1..7).map(&:to_s).permutation.each do |sequence|
+      sequence.unshift("0")
+
+      sum = sequence.each_cons(2).
+        map { |start, goal| distances[start][goal] }.
+        inject(:+)
+
+      lowest = [lowest, sum].min
+    end
+
+    puts lowest

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

@@ -0,0 +1,67 @@
+---
+- :name: day-24-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-24
+  :solution: |-
+    input     = File.read(file_path)
+
+    maze = input.split("\n").map { |line| line.chars }
+
+    targets = {}
+
+    maze.each_with_index do |row, y|
+      row.each_with_index do |cell, x|
+        targets[cell] = [x, y] if cell =~ /\d/
+      end
+    end
+
+    distances = Hash.new { |h, k| h[k] = {} }
+
+    (targets.to_a).product(targets.to_a).each do |(s, (sx, sy)), (g, (gx, gy))|
+      next if s == g || distances[s][g]
+
+      visited = Set.new
+      queue = [[sx, sy, 0]]
+
+      visited.add(queue.first[0..1])
+      reached_goal = false
+
+      while !reached_goal
+        current = queue.shift
+
+        if current[0..1] == [gx, gy]
+          distances[s][g] = current[2]
+          distances[g][s] = current[2]
+
+          reached_goal = true
+        end
+
+        x = current[0]
+        y = current[1]
+        step = current[2]
+
+        [[x+1, y], [x-1, y], [x, y+1], [x, y-1]].each do |x, y|
+          next if x < 0 || y < 0
+          next if maze[y][x] == "#"
+          next if visited.include?([x, y])
+
+          visited.add([x, y])
+          new_location = [x, y, step + 1]
+          queue << new_location
+        end
+      end
+    end
+
+    lowest = 1_000
+
+    (1..7).map(&:to_s).permutation.each do |sequence|
+      sequence.unshift("0")
+      sequence << "0"
+
+      sum = sequence.each_cons(2).
+        map { |start, goal| distances[start][goal] }.
+        inject(:+)
+
+      lowest = [lowest, sum].min
+    end
+
+    puts lowest

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

@@ -0,0 +1,65 @@
+---
+- :name: day-25-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-25
+  :solution: |-
+    def argToVal(arg, reg)
+      if arg =~ /\d/
+        arg.to_i
+      else
+        reg[arg]
+      end
+    end
+
+    def solve(val, input)
+      reg = { "a" => val }
+      out = []
+      i = 0
+
+      instructions = input.split("\n")
+
+      while i < instructions.length
+        cmd, arg1, arg2 = instructions[i].split(" ")
+
+        arg1Val = argToVal(arg1, reg)
+        arg2Val = argToVal(arg2, reg)
+
+        case cmd
+        when 'out'
+          return false if arg1Val == out.last
+          return true if out.size > 50
+
+          out << arg1Val
+        when 'cpy'
+          reg[arg2] = arg1Val
+        when 'jnz'
+          i += arg2Val - 1 if arg1Val != 0
+        when 'inc'
+          reg[arg1] += 1
+        when 'dec'
+          reg[arg1] -= 1
+        when 'tgl'
+          idx = i + reg[arg1]
+
+          if instructions[idx]
+            cmd, arg1, arg2 = instructions[idx].split(" ")
+
+            if arg2
+              replacement = cmd == "jnz" ? "cpy" : "jnz"
+            else
+              replacement = cmd == "inc" ? "dec" : "inc"
+            end
+
+            instructions[idx][0..2] = replacement
+          end
+        end
+
+        i += 1
+      end
+    end
+
+    (1..1_000).each do |i|
+      if solve(i, input)
+        puts i
+        exit
+      end
+    end

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

@@ -0,0 +1,13 @@
+---
+- :name: day-01-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-01
+  :solution: |-
+    digits = input.chars
+
+    digits << digits.first
+
+    puts digits.each_cons(2).to_a
+      .select { |a, b| a == b }
+      .map(&:first)
+      .map(&:to_i)
+      .inject(:+)

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

@@ -0,0 +1,12 @@
+---
+- :name: day-01-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-01
+  :solution: |-
+    digits = input.chars
+
+    length = digits.length
+
+    puts digits.select
+      .with_index { |d, idx| digits[(idx + length / 2) % length] == d }
+      .map(&:to_i)
+      .inject(:+)

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

@@ -0,0 +1,8 @@
+---
+- :name: day-02-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-02
+  :solution: |-
+    puts input.split("\n")
+      .map { |row| row.split(" ") .map(&:to_i).sort }
+      .map { |row| row.last - row.first }
+      .inject(:+)

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

@@ -0,0 +1,10 @@
+---
+- :name: day-02-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-02
+  :solution: |-
+    puts input.split("\n")
+      .map { |row| row.split(" ").map(&:to_i).sort }
+      .map { |row| row.combination(2) }
+      .map { |row| row.find { |a, b| b % a == 0 } }
+      .map { |a, b| b / a }
+      .inject(:+)

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

@@ -0,0 +1,40 @@
+---
+- :name: day-03-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-03
+  :solution: |-
+    target = input.to_i
+    dimension = Math.sqrt(target).ceil
+
+    grid = Array.new(dimension) { Array.new(dimension) }
+    start = dimension / 2
+    x = y = start
+
+    dirs = [:right, :up, :left, :down]
+    dir = dirs[0]
+
+    def move(x, y, dir)
+      case dir
+      when :right
+        x += 1
+      when :up
+        y -= 1
+      when :left
+        x -= 1
+      when :down
+        y += 1
+      end
+
+      [x, y]
+    end
+
+    (target - 1).times do |i|
+      grid[y][x] = i + 1
+
+      next_dir = dirs[(dirs.index(dir) + 1) % dirs.length]
+      x1, y1 = move(x, y, next_dir)
+      dir = next_dir if grid[y1][x1].nil?
+
+      x, y = move(x, y, dir)
+    end
+
+    puts (x - start).abs + (y - start).abs

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

@@ -0,0 +1,49 @@
+---
+- :name: day-03-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-03
+  :solution: |-
+    target = input.to_i
+    dimension = Math.sqrt(target).ceil
+
+    grid = Array.new(dimension) { Array.new(dimension) }
+    start = dimension / 2
+    x = y = start
+
+    dirs = [:right, :up, :left, :down]
+    dir = dirs[0]
+
+    def move(x, y, dir)
+      case dir
+      when :right
+        x += 1
+      when :up
+        y -= 1
+      when :left
+        x -= 1
+      when :down
+        y += 1
+      end
+
+      [x, y]
+    end
+
+    target.times do |i|
+      value = [x - 1, x, x + 1]
+        .product([y - 1, y, y+1])
+        .map { |x, y| grid[y][x] }
+        .compact
+        .inject(:+)
+
+      value ||= 1
+      grid[y][x] = value
+
+      break if value > target
+
+      next_dir = dirs[(dirs.index(dir) + 1) % dirs.length]
+      x1, y1 = move(x, y, next_dir)
+      dir = next_dir if grid[y1][x1].nil?
+
+      x, y = move(x, y, dir)
+    end
+
+    puts grid[y][x]

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

@@ -0,0 +1,7 @@
+---
+- :name: day-04-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-04
+  :solution: |-
+    puts input.split("\n").count { |pw|
+      pw.split(" ").uniq.length == pw.split(" ").length
+    }

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

@@ -0,0 +1,9 @@
+---
+- :name: day-04-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-04
+  :solution: |-
+    puts input.split("\n").count { |pw|
+      words = pw.split(" ").map { |word| word.chars.sort.join }
+
+      words.uniq.length == words.length
+    }

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

@@ -0,0 +1,18 @@
+---
+- :name: day-05-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-05
+  :solution: |-
+    offsets = input.split("\n").map(&:to_i)
+
+    position = 0
+    jumps = 0
+
+    while position < offsets.length
+      move = offsets[position]
+      offsets[position] += 1
+      position += move
+
+      jumps += 1
+    end
+
+    puts jumps