Stacks - Google Top Interview Questions
Problem Statement :
Given a list of list of positive integers stacks, you can take any stack(s) in stacks and pop any number of elements.
Return the maximum sum that can be achieved such that all stacks have the same sum.
Constraints
n * m ≤ 500,000 where n and m are the number of rows and columns in stacks
Example 1
Input
stacks = [
[2, 3, 4, 5],
[4, 5, 2, 3, 3],
[9, 1, 1, 1]
]
Output
9
Explanation
Here are the operations we can take
Pop [5] from the first stack to get [2, 3, 4] for a sum of 9.
Pop [2, 3, 3] from the second stack to get [4, 5] for a sum of 9.
Pop [1, 1, 1] from the first stack to get [9] for a sum of 9.
Example 2
Input
stacks = [
[5, 13],
[7, 2],
[50]
]
Output
0
Explanation
We have to pop all elements from every stack since there's no way to make the three stacks have equal
sum otherwise.
Solution :
Solution in C++ :
int solve(vector<vector<int>>& stacks) {
int res = 0;
unordered_map<int, int> f;
for (vector<int>& A : stacks) {
int sum = 0;
for (int i : A) {
sum += i;
if (i == 0) continue;
f[sum]++;
if (f[sum] == stacks.size()) {
res = max(res, sum);
}
}
}
return res;
}
Solution in Java :
import java.util.*;
import java.util.stream.Collectors;
class Solution {
public class Node {
int sum;
int row;
int idx;
public Node(int s, int r, int i) {
this.sum = s;
this.row = r;
this.idx = i;
}
}
public int solve(int[][] stacks) {
if (stacks == null || stacks.length == 0)
return 0;
PriorityQueue<Node> pq = new PriorityQueue<>((n1, n2) -> n2.sum - n1.sum);
Map<Integer, Integer> map = new HashMap();
int sum = 0;
for (int i = 0; i < stacks.length; i++) {
int[] arr = stacks[i];
sum = 0;
for (int j = 0; j < arr.length; j++) sum += arr[j];
pq.offer(new Node(sum, i, arr.length - 1));
map.put(sum, map.getOrDefault(sum, 0) + 1);
}
if (map.size() == 1)
return sum;
while (map.size() > 1) {
Node node = pq.poll();
sum = node.sum;
int row = node.row;
int idx = node.idx;
if (map.containsKey(sum)) {
if (map.get(sum) == 1)
map.remove(sum);
else
map.put(sum, map.get(sum) - 1);
}
sum -= stacks[row][idx];
map.put(sum, map.getOrDefault(sum, 0) + 1);
if (idx == 0)
return 0;
pq.offer(new Node(sum, row, idx - 1));
}
for (int key : map.keySet()) return key;
return 0;
}
}
Solution in Python :
class Solution:
def solve(self, stacks):
if not stacks:
return 0
seen = set(accumulate(stacks[0]))
for s in stacks[1:]:
seen2 = set(accumulate(s))
seen &= seen2
return max(seen, default=0)
View More Similar Problems
Reverse a linked list
Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio
View Solution →Compare two linked lists
You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. If all data attributes are equal and the lists are the same length, return 1. Otherwise, return 0. Example: list1=1->2->3->Null list2=1->2->3->4->Null The two lists have equal data attributes for the first 3 nodes. list2 is longer, though, so the lis
View Solution →Merge two sorted linked lists
This challenge is part of a tutorial track by MyCodeSchool Given pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. Example headA refers to 1 -> 3 -> 7 -> NULL headB refers to 1 -> 2 -> NULL The new list is 1 -> 1 -> 2 -> 3 -> 7 -> NULL. Function Description C
View Solution →Get Node Value
This challenge is part of a tutorial track by MyCodeSchool Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. Example head refers to 3 -> 2 -> 1 -> 0 -> NULL positionFromTail = 2 Each of the data values matches its distance from the t
View Solution →Delete duplicate-value nodes from a sorted linked list
This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty. Example head refers to the first node in the list 1 -> 2 -
View Solution →Cycle Detection
A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example head refers 1 -> 2 -> 3 -> NUL The numbers shown are the node numbers, not their data values. There is no cycle in this list so return 0. head refer
View Solution →