Cut Ribbons of Same Length - Google Top Interview Questions
Problem Statement :
You are given a list of positive integers ribbons and an integer k. Given that you can cut the ribbons as many times as you want, return the largest r such that you can have k ribbons of length r. If there is no solution, return -1. Constraints 1 ≤ n ≤ 100,000 where n is the length of ribbons 1 ≤ k Example 1 Input ribbons = [1, 2, 3, 4, 9] k = 5 Output 3 Explanation We can cut the ribbon of size 9 into 3 pieces of size 3 each. Then cut the ribbon of size 4 into size 1 and 3. Then we can achieve 5 ribbons of size 3. Example 2 Input ribbons = [8] k = 4 Output 2 Explanation We can cut the ribbon into 4 pieces of size 2.
Solution :
Solution in C++ :
int solve(vector<int>& ribbons, int k) {
vector<int> nums = ribbons;
sort(nums.begin(), nums.end());
int n = nums.size();
int mv = nums[n - 1];
int sm = 0;
int l = 1;
int r = mv;
int ans = 0;
while (l <= r) {
int mid = floor((l + r) / 2);
sm = 0;
for (int j = 0; j < ribbons.size(); j++) {
sm += floor((ribbons[j] * 1.0) / mid);
// cout<<i << " " << sm<<endl;
}
if (sm >= k) {
ans = mid;
l = mid + 1;
} else {
r = mid - 1;
}
// sm = 0;
}
// print(ans)
cout << ans << endl;
if (ans > 0) return ans;
return -1;
}
Solution in Java :
import java.util.*;
class Solution {
public int solve(int[] A, int k) {
Arrays.sort(A);
int l = 1;
int r = A[A.length - 1];
int res = -1;
while (l <= r) {
int mid = l + (r - l) / 2;
if (check(A, mid, k)) {
res = mid;
l = mid + 1;
} else {
r = mid - 1;
}
}
return res;
}
public boolean check(int A[], int mid, int k) {
int sum = 0;
for (int i = 0; i < A.length; i++) {
int cnt = A[i] / mid;
sum += cnt;
}
return sum >= k;
}
}
Solution in Python :
class Solution:
def solve(self, a, k):
def is_possible(r):
res = 0
for x in a:
ans = x // r
if ans == 0:
break
else:
res += ans
return res >= k
a.sort(reverse=True)
lo, hi = 1, max(a)
n = len(a)
while lo <= hi:
mid = (lo + hi) // 2
if is_possible(mid):
lo = mid + 1
else:
hi = mid - 1
return hi if hi > 0 else -1
View More Similar Problems
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 →Cube Summation
You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor
View Solution →Direct Connections
Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do
View Solution →