jonathanpike

require 'minitest/autorun'

class Tree
    attr_accessor :payload, :children, :searcher

    def initialize(payload, children, search_class=DepthSearcher)
        self.payload = payload
        self.children = children
        self.searcher = search_class.new
    end

jonathanpike

require 'benchmark'
require 'minitest/autorun'

def collatz_sequence(num)
    # My Solution
    
    # count = 1 
    
    # while num != 1
    #     if num % 2 == 0

jonathanpike

require 'benchmark'
require 'minitest/autorun'


def recursive_fib(num)
    # My Solution
    
    # if num <= 1
    #     return num
    # else

jonathanpike

require 'minitest/autorun'

class Numeric
  def is_divisible_by?(amt: 10)
    (self % amt).zero?
  end
end

module Luhn
  def self.is_valid?(number)

jonathanpike

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)

jonathanpike

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)

jonathanpike

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

class Stack

jonathanpike

def sieve(num)
  arr = (2..num).to_a
  prime = []
  count = 0
  while arr.length > 0
    prime << arr.shift
    arr.each do |i|
      if i % prime[count] == 0
        arr.delete(i)
      end

jonathanpike

require 'minitest/autorun'

class Image
    attr_accessor :array

    def initialize(array)
        @array = array
    end
    
    def output_image(array=@array)

jonathanpike

class Image
    attr_accessor :array

    def initialize(array)
        @array = array
    end
    
    def output_image(array=@array)
        array.each do |column|
            puts column.join("")