You only have free questions left (including this one).
But it doesn't have to end here! Sign up for the 7-day coding interview crash course and you'll get a free Interview Cake problem every week.
You're in!
You want to be able to access the largest element in a stack.
You've already implemented this Stackclass:
class Stack
# Initializes an empty stack.
def initialize
@items = []
end
# Pushes a new item onto the stack.
def push(item)
@items << item
end
# Removes and returns the last item.
#
# If the stack is empty, returns nil. (It would also be
# reasonable to throw an exception.)
def pop
if @items.empty?
nil
else
@items.pop
end
end
# Returns the last item without removing it.
def peek
if @items.empty?
nil
else
@items[-1]
end
end
end
Use yourStackclass to implement a newclassMaxStack with a methodget_max that returns the largest element in the stack.get_max should not remove the item.
Your stacks will contain only integers.
What if we push several items in increasing numeric order (like 1, 2, 3, 4...), so that there is a new max after each push? What if we then pop each of these items off, so that there is a new max after each pop? Your algorithm shouldn't pay a steep cost in these edge cases.
You should be able to get a runtime of for push, pop, and get_max.
Start your free trial!
Log in or sign up with one click to get immediate access to free mock interview questions