**Every Sublist Min Sum- Google Top Interview Questions**

### Problem Statement :

You are given a list of integers nums. Return the sum of min(x) for every sublist x in nums. Mod the result by 10 ** 9 + 7. Constraints n ≤ 100,000 where n is the length of nums Example 1 Input nums = [1, 2, 4, 3] Output 20 Explanation We have the following sublists and their mins: min([1]) = 1 min([1, 2]) = 1 min([1, 2, 4]) = 1 min([1, 2, 4, 3]) = 1 min([2]) = 2 min([2, 4]) = 2 min([2, 4, 3]) = 2 min([4]) = 4 min([4, 3]) = 3 min([3]) = 3

### Solution :

` ````
Solution in C++ :
int solve(vector<int>& nums) {
int n = nums.size();
int pref[n + 1] = {};
stack<int> s; // Initialising prefix array and stack
int ans = 0, j = 0, mod = 1e9 + 7;
for (int i = 0; i < n; i++) {
while (!s.empty() && nums[s.top()] >= nums[i])
s.pop(); // iterating back till we find an index where the minimum of the list if we go
// any further left will change
if (s.empty())
j = -1; // we are calculating j just for calculating the count for which nums[i] will
// appear as minimum in the sublist we have created by going left
else
j = s.top();
s.push(i);
pref[i + 1] = (pref[j + 1] + (i - j) * nums[i]) %
mod; // here maintaining prefix array--Read the implementation part
ans = (ans + pref[i + 1]) % mod;
}
return ans;
}
```

` ````
Solution in Java :
import java.util.*;
class Solution {
public int solve(int[] nums) {
int n = nums.length;
int[] next_smaller = new int[n];
int[] prev_smaller = new int[n];
Arrays.fill(next_smaller, n);
Arrays.fill(prev_smaller, -1);
// compute and fill in the next_smaller
Stack<Integer> stack = new Stack();
for (int i = 0; i < n; i++) {
int cur = nums[i];
while (stack.size() > 0 && cur < nums[stack.peek()]) {
next_smaller[stack.pop()] = i;
}
stack.push(i);
}
// compute and fill in the prev_smaller
stack = new Stack();
for (int i = 0; i < n; i++) {
int cur = nums[i];
while (stack.size() > 0 && nums[stack.peek()] > cur) {
stack.pop();
}
if (stack.size() > 0)
prev_smaller[i] = stack.peek();
stack.push(i);
}
// compute the answer
long res = 0;
long mod = (long) 1e9 + 7;
for (int i = 0; i < n; i++) {
int subarray_min = nums[i];
int left_count = i - prev_smaller[i]; // number of greater elements on the left
int right_count =
next_smaller[i] - i; // number of greater than or equal to elements on right
res = res + (subarray_min * (left_count * right_count)) % mod;
res = res % mod;
}
return (int) res;
}
}
```

` ````
Solution in Python :
class Solution:
def solve(self, nums):
ans = 0
s = [] # stack of (index, value, sum)
currentSum = 0
for index, value in enumerate(nums):
while s and value <= s[-1][1]:
currentSum -= s[-1][2]
s.pop()
if not s:
s.append([index, value, (index + 1) * value])
else:
s.append([index, value, (index - s[-1][0]) * value])
currentSum += s[-1][2]
ans += currentSum
return ans % (10 ** 9 + 7)
```

## View More Similar Problems

## 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 →## Tree Coordinates

We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For

View Solution →