gagaception

class LinkedListNode
  attr_accessor :value, :next_node
 
  def initialize(value, next_node=nil)
    @value = value
    @next_node = next_node
  end
end

def print_values(list_node)

gagaception

class Image
  attr_accessor :data
  def initialize (data)
     @data = data  
   end

  def image_blur
    all_done = false
    @data.each_with_index do |row, row_index|
      row.each_with_index do |value, column_index|

gagaception

class Image
  attr_accessor :data
    def initialize (data)
      @data = data  
    end

    def output
      @data.each do |sub|
        sub.each do |cell|
          print cell

gagaception

class BinaryTree

	attr_accessor :value, :left, :right

	def initialize (value)
		@value = value
	end
end

class SortBinaryTree

gagaception

class Tree
    attr_accessor :value, :children
    def initialize(value, children = [])
        @value = value
        @children = children
    end
end

	def BFS(data, target) 
		queue = [data]

gagaception

class LinkedListNode
  attr_accessor :value, :next_node
 
  def initialize(value, next_node=nil)
    @value = value
    @next_node = next_node
  end
end
 
def print_values(list_node)

gagaception

def recursive_fib(n)
	if n <= 1 
		return n
	else
		result = recursive_fib(n-2) + recursive_fib(n-1)
	end
end

def itterative_fib(n)
	fib = [0, 1]

gagaception

require 'minitest/autorun'
require_relative 'binary_tree'

class BinaryTreeTest < Minitest::Test
	def test_data_is_saved
		assert_equal 7, BinaryTree.new(7).value
	end

	def test_inserting_left
		seven = SortBinaryTree.new(7)  

gagaception

module LongestSubstring

	def self.find(first, second)
		return nil if first.nil? || second.nil?
		return nil if first != second
  		x, xs, y, ys = first[0..0], first[1..-1], second[0..0], second[1..-1]
  		if x == y
    		x + self.find(xs, ys)
  		else
    		[self.find(first, ys), self.find(xs, second)].max_by {|x| x.size}

gagaception

def lcs(first, second)
  return nil if first.nil? || second.nil?
 
  x, xs, y, ys = first[0..0], first[1..-1], second[0..0], second[1..-1]
  if x == y
    x + lcs(xs, ys)
  else
    [lcs(first, ys), lcs(xs, second)].max_by {|x| x.size}
  end
end