nikasulo

def empty_into(container)
  current = @first
  while current do
    container << current.value unless current.value == nil
    self.popFront
    current = current.next_node
  end
end

nikasulo

 while string.include?('gn')
  string.gsub!("gn", 'ng')
end
puts string

nikasulo

if string[i] == '}' || ')' || ']'
  case string[i]
  when "]"
      if s.topFront == "["
          s.popFront
      else
          return false
      end
  when ")"
      if s.topFront == "("

nikasulo

s.pushFront(string[i]) if string[i] == '{' || string[i] == '[' || string[i] == '('

nikasulo

if s.is_empty?
  s.pushFront(string[i]) if string[i] == '{' || string[i] == '[' || string[i] == '('
end

nikasulo

def balanced_brackets?(string)
    #Initialize Stack
    s = Stack.new

    for i in 0...string.length do
        #Rest of the code in here
    end
    
    #When we come out of the loop, if our stack is not empty, then we have a problem
    return false if s.first.next_node

nikasulo

def print_stack
  while @first.next_node
    print @first.value
    @first = @first.next_node
  end
end

nikasulo

def is_empty?
  @first.nil?
end

nikasulo

def topFront
  @first.value if unless is_empty?
end

nikasulo

def popFront
  raise "Stack is empty" if is_empty?
  @first = @first.next_node
end