Daily Coding Problem: Problem #746 [Easy]

Good morning! Here's your coding interview problem for today.

This problem was asked by Amazon.

Implement a stack that has the following methods:

• push(val), which pushes an element onto the stack
• pop(), which pops off and returns the topmost element of the stack. If there are no elements in the stack, then it should throw an error or return null.
• max(), which returns the maximum value in the stack currently. If there are no elements in the stack, then it should throw an error or return null.

Each method should run in constant time.

Upgrade to premium and get in-depth solutions to every problem, including this one. Since you were referred by one of our affiliates, you'll get a 10% discount on checkout!

If you liked this problem, feel free to forward it along so they can subscribe here! As always, shoot us an email if there's anything we can help with!

Master algorithms together on Binary Search. Create a room, invite your friends, and race to finish the problem!

No more? Snooze or unsubscribe.