Skip to content

Instantly share code, notes, and snippets.

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)
if list_node
@framallo
framallo / card.rb
Last active October 14, 2015 23:37 — forked from arightious/card.rb
Firehose Card Challenge
class Card
attr_accessor :rank, :suit
def initialize(rank, suit)
self.rank = rank
self.suit = suit
end
def output_card
puts "#{self.rank} of #{self.suit}"
@framallo
framallo / dfs.rb
Created September 17, 2015 19:16 — forked from vincentchin/dfs.rb
# In the above example it will check to see if the payload is 11 in the following order: 2, 7, 6, 5 when
# it gets to 5 and 5 has no children, it will return to the 6 and go to any children 6 has. 6 has a
# remaining child, which is 11 so that node is checked and since that value is the correct value it
# will be returned and searching will stop.
class Tree
attr_accessor :payload, :children
def initialize(payload, children)
@payload = payload
@framallo
framallo / linked_list_mutation.rb
Created September 4, 2015 16:37 — forked from vincentchin/linked_list_mutation.rb
Reverse a linked list using mutation
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)
class Image
attr_accessor :array
def initialize(array)
@array = array
@new_array = @array.map {|e| Array.new(e.size) }
end
def blur
@array.each_with_index do |row,x|