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
Merging Communities
People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w
View Solution →Components in a graph
There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu
View Solution →Kundu and Tree
Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that
View Solution →Super Maximum Cost Queries
Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and
View Solution →Contacts
We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co
View Solution →No Prefix Set
There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio
View Solution →