Incrementable Stack - Microsoft Top Interview Questions
Problem Statement :
Implement a stack with the following methods:
IncrementableStack() constructs a new instance of an incrementable stack
append(int val) appends val to the stack
pop() pops and returns the last element in the stack
increment(int inc, inc count) increments the value of bottom count elements by inc
Each method should be done in \mathcal{O}(1)O(1) time. You can assume that for pop, the stack is
non-empty when it is called.
Constraints
n ≤ 100,000 where n is the number of calls to append, pop, and increment`.
Example 1
Input
methods = ["constructor", "append", "append", "increment", "pop", "pop"]
arguments = [[], [1], [2], [5, 1], [], []]`
Output
[None, None, None, None, 2, 6]
Solution :
Solution in C++ :
class IncrementableStack {
public:
// {value, increment}
// all the elements below this element will get affected by the increment value
vector<pair<int, int>> s;
IncrementableStack() {
}
void append(int val) {
s.push_back({val, 0});
}
int pop() {
int val = s.back().first;
int inc = s.back().second;
int ret = val + inc;
if (s.size() > 1) s[s.size() - 2].second += inc;
s.pop_back();
return ret;
}
void increment(int inc, int count) {
if (s.size() && count) {
int index = min(count - 1, (int)s.size() - 1);
s[index].second += inc;
}
}
};
Solution in Java :
import java.util.*;
class IncrementableStack {
// first num is val, second is increment
LinkedList<int[]> stack = new LinkedList<>();
public void append(int val) {
stack.add(new int[] {val, 0});
}
public int pop() {
// Get top of stack
int[] pair = stack.getLast();
int val = pair[0], incr = pair[1];
// Update next pair in stack
int len = stack.size();
if (len > 1) {
stack.get(len - 2)[1] += incr;
}
// Remove top of stack
stack.removeLast();
return val + incr;
}
public void increment(int inc, int count) {
// Increase increment of desired position count
if (!stack.isEmpty() && count > 0) {
int index = Math.min(stack.size() - 1, count - 1);
stack.get(index)[1] += inc;
}
}
}
Solution in Python :
class IncrementableStack:
def __init__(self):
self.stack = []
self.incs = []
def append(self, val):
self.stack.append(val)
self.incs.append(0)
def pop(self):
inc = self.incs.pop()
if self.incs:
self.incs[-1] += inc
return self.stack.pop() + inc
def increment(self, inc, count):
if self.incs and count > 0:
if count <= len(self.incs):
self.incs[count - 1] += inc
else:
self.incs[-1] += inc
View More Similar Problems
Swap Nodes [Algo]
A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from
View Solution →Kitty's Calculations on a Tree
Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a
View Solution →Is This a Binary Search Tree?
For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a
View Solution →Square-Ten Tree
The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the
View Solution →Balanced Forest
Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a
View Solution →Jenny's Subtrees
Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .
View Solution →