Use yourStackstructure to implement a newstructureMaxStack with a functiongetMax 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
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.
“Interview Cake was a great help in preparing for my interview. The hints and detailed explanations allow you to figure problems out for yourself and learn the thought process needed for interviews. Plus, you get a refund if you don't get the job.