Eat Bananas in K Hours - Facebook Top Interview Questions


Problem Statement :


You are given a list of integers piles and an integer k.

piles[i] represents the number of bananas on pile i. On each hour, you can choose any pile and eat r number of bananas in that pile. 

If you pick a pile with fewer than r bananas, it still takes an hour to eat the pile.

Return the minimum r required such that you can eat all the bananas in less than or equal to k hours.

Constraints

n ≤ 100,000 where n is the length of piles

n ≤ k

Example 1

Input

piles = [6, 4, 3]

k = 5

Output

3

Explanation

At r = 3 bananas per hour, we can eat the first pile in 2 hours, eat the second in 2 hours, and eat the last 
pile in 1 hour.


Solution :



title-img 




                        Solution in C++ :

int solve(vector<int>& piles, int k) {
    int s = 1, e = *max_element(piles.begin(), piles.end());
    auto check = [&piles, &k](int r) {
        int count = 0;
        for (int p : piles) {
            count += (p + r - 1) / r;
        }
        return count <= k;
    };

    while (s <= e) {
        int m = s + (e - s) / 2;
        if (check(m)) {
            e = m - 1;
        } else {
            s = m + 1;
        }
    }
    return s;
}
                    


                        Solution in Java :

import java.util.*;

class Solution {
    public int solve(int[] A, int k) {
        int lo = 1;
        int hi = Integer.MAX_VALUE;
        int r = -1;

        while (lo <= hi) {
            int mid = lo + (hi - lo) / 2; // speed

            if (timeToEat(A, mid) <= k) { // valid, try to eat slower, go left.
                hi = mid - 1;
                r = mid;
            } else { // couldn't eat, need to eat faster, go right.
                lo = mid + 1;
            }
        }

        return r;
    }

    public int timeToEat(int[] A, int speed) {
        int r = 0;

        for (int x : A) {
            r += x / speed;
            if (x % speed != 0)
                r++;
        }

        return r;
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def solve(self, piles, k):
        lo = 1
        hi = max(piles)

        while lo <= hi:
            r = (lo + hi) // 2

            if self.bananas_hour(piles, r) <= k:
                hi = r - 1
            else:
                lo = r + 1
        return lo

    def bananas_hour(self, piles, max_bananas_hour):
        count_hours = 0

        for pile in piles:
            count_hours += pile // max_bananas_hour

            if pile % max_bananas_hour != 0:
                count_hours += 1

        return count_hours


View More Similar Problems

Lazy White Falcon

White Falcon just solved the data structure problem below using heavy-light decomposition. Can you help her find a new solution that doesn't require implementing any fancy techniques? There are 2 types of query operations that can be performed on a tree: 1 u x: Assign x as the value of node u. 2 u v: Print the sum of the node values in the unique path from node u to node v. Given a tree wi

View Solution →

Ticket to Ride

Simon received the board game Ticket to Ride as a birthday present. After playing it with his friends, he decides to come up with a strategy for the game. There are n cities on the map and n - 1 road plans. Each road plan consists of the following: Two cities which can be directly connected by a road. The length of the proposed road. The entire road plan is designed in such a way that if o

View Solution →

Heavy Light White Falcon

Our lazy white falcon finally decided to learn heavy-light decomposition. Her teacher gave an assignment for her to practice this new technique. Please help her by solving this problem. You are given a tree with N nodes and each node's value is initially 0. The problem asks you to operate the following two types of queries: "1 u x" assign x to the value of the node . "2 u v" print the maxim

View Solution →

Number Game on a Tree

Andy and Lily love playing games with numbers and trees. Today they have a tree consisting of n nodes and n -1 edges. Each edge i has an integer weight, wi. Before the game starts, Andy chooses an unordered pair of distinct nodes, ( u , v ), and uses all the edge weights present on the unique path from node u to node v to construct a list of numbers. For example, in the diagram below, Andy

View Solution →

Heavy Light 2 White Falcon

White Falcon was amazed by what she can do with heavy-light decomposition on trees. As a resut, she wants to improve her expertise on heavy-light decomposition. Her teacher gave her an another assignment which requires path updates. As always, White Falcon needs your help with the assignment. You are given a tree with N nodes and each node's value Vi is initially 0. Let's denote the path fr

View Solution →

Library Query

A giant library has just been inaugurated this week. It can be modeled as a sequence of N consecutive shelves with each shelf having some number of books. Now, being the geek that you are, you thought of the following two queries which can be performed on these shelves. Change the number of books in one of the shelves. Obtain the number of books on the shelf having the kth rank within the ra

View Solution →