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.
Use the built-in Stack class to implement a new class MaxStack with a method GetMax 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.
Log in or sign up with one click to get immediate access to free mock interview questions
We'll never post on your wall or message your friends.
Actually, we don't support password-based login. Never have. Just the OAuth methods above. Why?
Log in or sign up with one click to get immediate access to free mock interview questions
We'll never post on your wall or message your friends.
Actually, we don't support password-based login. Never have. Just the OAuth methods above. Why?
time for Push, Pop, and GetMax. additional space, where m is the number of operations performed on the stack.
Our solution requires additional space for the second stack. But do we really need it?
Can you come up with a solution that requires additional space? (It's tricky!)
Log in or sign up with one click to get immediate access to free mock interview questions
We'll never post on your wall or message your friends.
Actually, we don't support password-based login. Never have. Just the OAuth methods above. Why?
Reset editor
Powered by qualified.io