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 want to be able to access the largest element in a stack.
You've already implemented this Stackclass:
# Initializes an empty stack.
@items = 
# Pushes a new item onto the stack.
@items << item
# Removes and returns the last item.
# If the stack is empty, returns nil. (It would also be
# reasonable to throw an exception.)
# Returns the last item without removing it.
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
Actually, we don't support password-based login. Never have. Just the OAuth methods above. Why?
It's easy and quick. No "reset password" flow. No password to forget.
It lets us avoid storing passwords that hackers could access and use to try to log into our users' email or bank accounts.
It makes it harder for one person to share a paid Interview Cake account with multiple people.
“I'd like to thank you for this program. Interview Cake is a really awesome tool for validating and reviewing concepts. It's also very efficient in the sense that it covers a wide variety of topics with a very elegant and consistent approach.