**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. Constraints n ≤ 100,000 where n is the number of methods that will be called. Example 1 Input methods = ["constructor", "append", "append", "append", "peek", "max", "popmax", "max", "pop", "peek"] arguments = [[], [1], [3], [2], [], [], [], [], [], []]` Output [None, None, None, None, 2, 3, 3, 2, 2, 1] Explanation 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 {
public:
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();
v.pop_back();
s.erase(s.find({x, y}));
return x;
}
int popmax() {
auto [x, y] = *s.rbegin();
s.erase(prev(s.end()));
return x;
}
};
```

` ````
Solution in Java :
class MaximumStack {
public:
map<int, vector<list<int>::iterator>> m1;
list<int> L;
MaximumStack() {
}
void append(int val) {
L.push_back(val);
m1[val].push_back(prev(L.end()));
}
int peek() {
return *prev(L.end());
}
int max() {
return m1.rbegin()->first;
}
int pop() {
int val = peek();
erase(val);
return val;
}
void erase(int val) {
vector<list<int>::iterator> &v = m1[val];
auto it = v.back();
v.pop_back();
if (v.size() == 0) m1.erase(val);
L.erase(it);
}
int popmax() {
int val = m1.rbegin()->first;
erase(val);
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):
self.stk.pop()
while self.pq and (-self.pq[0][1] not in self.time_to_val):
heapq.heappop(self.pq)
def peek(self):
return self.stk[-1][0]
def max(self):
return -self.pq[0][0]
def pop(self):
entry = self.stk.pop()
self._pop_invalid_times(entry[1])
return entry[0]
def popmax(self):
entry = heapq.heappop(self.pq)
self._pop_invalid_times(-entry[1])
return -entry[0]
```

## View More Similar Problems

## Subsequence Weighting

A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =

View Solution →## Kindergarten Adventures

Meera teaches a class of n students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from 1 to n in the clockwise direction. This means that the students are numbered 1, 2, 3, . . . , n-1, n, and students 1 and n are sitting next to each other. After letting the students draw for a certain period of ti

View Solution →## Mr. X and His Shots

A cricket match is going to be held. The field is represented by a 1D plane. A cricketer, Mr. X has N favorite shots. Each shot has a particular range. The range of the ith shot is from Ai to Bi. That means his favorite shot can be anywhere in this range. Each player on the opposite team can field only in a particular range. Player i can field from Ci to Di. You are given the N favorite shots of M

View Solution →## Jim and the Skyscrapers

Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers have been built recently. Let us describe the problem in one dimensional space

View Solution →## Palindromic Subsets

Consider a lowercase English alphabetic letter character denoted by c. A shift operation on some c turns it into the next letter in the alphabet. For example, and ,shift(a) = b , shift(e) = f, shift(z) = a . Given a zero-indexed string, s, of n lowercase letters, perform q queries on s where each query takes one of the following two forms: 1 i j t: All letters in the inclusive range from i t

View Solution →## Counting On a Tree

Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n

View Solution →