**5-Star Review Percentage - Google Top Interview Questions**

### Problem Statement :

You are given a two-dimensional list of integers reviews and a positive integer threshold. Each element reviews[i] contains [x, y] meaning product i had x number of 5-star reviews and a total of y reviews. All reviews are for one store. Return the minimum number of additional 5-star reviews we need such that the percentage of 5-star reviews in the store is at least threshold. You can assume that it's possible to reach threshold% of 5-star reviews. Constraints 1 ≤ n ≤ 100,000 where n is the length of reviews 0 ≤ threshold ≤ 100 Example 1 Input reviews = [ [4, 4], [1, 2], [3, 6] ] threshold = 77 Output 6 Explanation So in total there were 8 5-star reviews and a total of 12 reviews. To reach 77% 5-star reviews, we need 6 more 5-star reviews. Example 2 Input reviews = [ [10, 20] ] threshold = 50 Output 0 Explanation We're already at 50% 5-star reviews. Example 3 Input reviews = [ [1, 1] ] threshold = 100 Output 0 Explanation We're already at 100% 5-star reviews.

### Solution :

` ````
Solution in C++ :
int solve(vector<vector<int>>& reviews, int threshold) {
double fi = 0, xi = 0;
for (int i = 0; i < reviews.size(); i++) {
fi += reviews[i][1];
xi += reviews[i][0];
}
return max((double)0,
ceil((threshold * fi - 100 * xi) / max((double)1, (100 - (double)threshold))));
}
```

` ````
Solution in Java :
import java.util.*;
class Solution {
public int solve(int[][] reviews, int threshold) {
if (threshold == 0)
return 0;
int totalReview = 0;
int total5Star = 0;
for (int i = 0; i < reviews.length; i++) {
totalReview += reviews[i][1];
total5Star += reviews[i][0];
}
// (totalReview + x) * threshold / 100 = (total5Star + x)
int res = (int) Math.ceil(
(double) ((totalReview * threshold) - (100 * total5Star)) / (100 - threshold));
return res;
}
}
```

` ````
Solution in Python :
class Solution:
def solve(self, reviews, threshold):
a = 0
b = 0
for c, d in reviews:
a += c
b += d
if a * 100 >= threshold * b:
return 0
delta = threshold * b - 100 * a
return (delta + (99 - threshold)) // (100 - threshold)
```

## View More Similar Problems

## Array and simple queries

Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty

View Solution →## Median Updates

The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o

View Solution →## Maximum Element

You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each

View Solution →## Balanced Brackets

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra

View Solution →## Equal Stacks

ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of

View Solution →## Game of Two Stacks

Alexa has two stacks of non-negative integers, stack A = [a0, a1, . . . , an-1 ] and stack B = [b0, b1, . . . , b m-1] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack A or stack B. Nick keeps a running sum of the integers he removes from the two stacks. Nick is disqualified f

View Solution →