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<Item> {
// initialize an empty array to hold our stack items
private var items: [Item] = []
// push a new item onto the stack
func push(_ item: Item) {
items.append(item)
}
// remove and return the last item
func pop() -> Item? {
// if the stack is empty, return nil
// (it would also be reasonable to throw an exception)
if items.count == 0 {
return nil
}
return items.removeLast()
}
// return the last item without removing it
func peek() -> Item? {
return items.last
}
}
Use yourStackclass to implement a newclassMaxStack with a methodgetMax that returns the largest element in the stack.getMax 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 getMax.
Start your free trial!
Log in or sign up with one click to get immediate access to free mock interview questions