Maximum Stack - Microsoft Top Interview Questions

Problem Statement :

Implement a maximum stack with the following methods:

MaximumStack() constructs a new instance of a maximum stack

append(int val) appends val to the stack

peek() retrieves the last element in the stack
max() retrieves the maximum value in the stack

pop() pops and returns the last element in the stack

popmax() pops and returns the last occurrence of the maximum value in the stack

You can assume that for peek, max, pop and popmax, the stack is non-empty when they are called.


n ≤ 100,000 where n is the number of methods that will be called.

Example 1


methods = ["constructor", "append", "append", "append", "peek", "max", "popmax", "max", "pop", "peek"]

arguments = [[], [1], [3], [2], [], [], [], [], [], []]`


[None, None, None, None, 2, 3, 3, 2, 2, 1]


We create a MaximumStack

Append 1 to the stack

Append 3 to the stack

Append 2 to the stack

Peek the top element which is 2

Max value of the stack so far is max(1, 3, 2) == 3

We pop the max value of 3

Max value of the stack is now max(1, 2) == 2

We pop the top element which is 2

Peek the top element which is now 1

Solution :


                        Solution in C++ :

class MaximumStack {
    int idx = 0;
    set<pair<int, int>> s;
    vector<pair<int, int>> v;

    void append(int val) {
        v.emplace_back(val, ++idx);
        s.emplace(val, idx);

    int peek() {
        while (s.find(v.back()) == s.end()) v.pop_back();
        return v.back().first;

    int max() {
        return s.rbegin()->first;

    int pop() {
        while (s.find(v.back()) == s.end()) v.pop_back();
        auto [x, y] = v.back();
        s.erase(s.find({x, y}));
        return x;

    int popmax() {
        auto [x, y] = *s.rbegin();
        return x;

                        Solution in Java :

class MaximumStack {
    map<int, vector<list<int>::iterator>> m1;
    list<int> L;
    MaximumStack() {
    void append(int val) {

    int peek() {
        return *prev(L.end());
    int max() {
        return m1.rbegin()->first;
    int pop() {
        int val = peek();
        return val;
    void erase(int val) {
        vector<list<int>::iterator> &v = m1[val];
        auto it = v.back();
        if (v.size() == 0) m1.erase(val);
    int popmax() {
        int val = m1.rbegin()->first;
        return val;

                        Solution in Python : 
class MaximumStack:
    def __init__(self):
        # `time` is increased when an element is appended. So each `time`
        # corresponds to a unique element, as recorded in `time_to_val`.
        # When an element has been popped, its corresponding time, thus
        # becoming invalid, will be deleted from `time_to_val`.
        self.time = 0
        self.time_to_val = {}

        # a LIFO stack of uniq pairs `(element, time)`
        self.stk = []

        # a priority queue of uniq pairs `(-element, -time)` for max-related stuff
        self.pq = []

    def append(self, val):
        self.time += 1
        self.time_to_val[self.time] = val
        self.stk.append((val, self.time))
        heapq.heappush(self.pq, (-val, -self.time))

    # After this operation, the top elements of `stk` and `pq` are valid.
    def _pop_invalid_times(self, invalid_time):
        del self.time_to_val[invalid_time]
        while self.stk and (self.stk[-1][1] not in self.time_to_val):
        while self.pq and (-self.pq[0][1] not in self.time_to_val):

    def peek(self):
        return self.stk[-1][0]

    def max(self):
        return -self.pq[0][0]

    def pop(self):
        entry = self.stk.pop()
        return entry[0]

    def popmax(self):
        entry = heapq.heappop(self.pq)
        return -entry[0]

View More Similar Problems

Castle on the Grid

You are given a square grid with some cells open (.) and some blocked (X). Your playing piece can move along any row or column until it reaches the edge of the grid or a blocked cell. Given a grid, a start and a goal, determine the minmum number of moves to get to the goal. Function Description Complete the minimumMoves function in the editor. minimumMoves has the following parameter(s):

View Solution →

Down to Zero II

You are given Q queries. Each query consists of a single number N. You can perform any of the 2 operations N on in each move: 1: If we take 2 integers a and b where , N = a * b , then we can change N = max( a, b ) 2: Decrease the value of N by 1. Determine the minimum number of moves required to reduce the value of N to 0. Input Format The first line contains the integer Q.

View Solution →

Truck Tour

Suppose there is a circle. There are N petrol pumps on that circle. Petrol pumps are numbered 0 to (N-1) (both inclusive). You have two pieces of information corresponding to each of the petrol pump: (1) the amount of petrol that particular petrol pump will give, and (2) the distance from that petrol pump to the next petrol pump. Initially, you have a tank of infinite capacity carrying no petr

View Solution →

Queries with Fixed Length

Consider an -integer sequence, . We perform a query on by using an integer, , to calculate the result of the following expression: In other words, if we let , then you need to calculate . Given and queries, return a list of answers to each query. Example The first query uses all of the subarrays of length : . The maxima of the subarrays are . The minimum of these is . The secon

View Solution →


This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element

View Solution →

Jesse and Cookies

Jesse loves cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Jesse repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with: sweetness Least sweet cookie 2nd least sweet cookie). He repeats this procedure until all the cookies in his collection have a sweetness > = K. You are given Jesse's cookies. Print t

View Solution →