Huru Interview Experience

A monkey is given ‘n’ piles of bananas, where the 'ith' pile has ‘a[i]’ bananas. An integer ‘h’ is also given, which denotes the time (in hours) in which all the bananas should be eaten. Each hour, the monkey chooses a non-empty pile of bananas and eats ‘m’ bananas. If the pile contains less than ‘m’ bananas, then the monkey consumes all the bananas and won’t eat any more bananas in that hour. Find the minimum number of bananas ‘m’ to eat per hour so that the monkey can eat all the bananas within ‘h’ hours. Example: Input: ‘n’ = 4, ‘a’ = [3, 6, 2, 8] , ‘h’ = 7 Output: 3 Explanation: If ‘m’ = 3, then The time taken to empty the 1st pile is 1 hour. The time taken to empty the 2nd pile is 2 hour. The time taken to empty the 3rd pile is 1 hour. The time taken to empty the 4th pile is 3 hour. Therefore a total of 7 hours is taken. It can be shown that if the rate of eating bananas is reduced, they can’t be eaten in 7 hours. Input Format The first line contains one integer, ‘n’, denoting the number of piles of bananas. The second line contains ‘n’ integers denoting the number of bananas on the ith pile. The third line contains one integer, ‘h’, denoting the time (in hours) in which all bananas should be eaten. Output format: Return the minimum number of bananas (‘m’) to eat per hour so the monkey can eat all the bananas within ‘h’ hours. Note: You don't need to print anything. Just implement the given function.

You are an operations manager for a company with n specialty retail stores. There are m different product types, and you are given a 0-indexed integer array quantities, where quantities[i] represents the number of products available for the i-th product type. Your task is to distribute all products to the n retail stores, adhering to the following rules: A single store can only be stocked with products of at most one type. It can, however, be given any amount of that product type. After the distribution, you want to ensure the workload is balanced. Let x be the maximum number of products given to any single store. Your goal is to make x as small as possible. Return the minimum possible value of x. Input Format: The first line of input contains an integer n, the number of stores. The second line contains an integer m, the number of product types. The third line contains m space-separated integers, representing the quantities array. Output Format: The output should be a single integer representing the minimum possible value for x (the minimized maximum number of products in any store). Note: The problem asks to "minimize the maximum" value, which is a classic indicator for a Binary Search on the Answer approach. We can binary search for a potential value of x. For a given x, we can check if it's possible to distribute all products without any store holding more than x items. To check if an x is valid, for each product type q in quantities, we can calculate how many stores are needed: ceil(q / x). If the sum of stores needed for all product types is less than or equal to n, then x is a possible maximum.

I did not show up for the next round because I got the offer letter from somewhere else, so ideally, I dropped this job.

Key Preparation Tips

Prepare DSA thoroughly.

Practice aptitude and puzzle-based questions.

Have at least two good projects on your resume.

Be prepared to explain your projects clearly.

Practice coding problems involving Arrays, Binary Search, DP and Recursion.

Prepare common HR questions such as Tell me about yourself and Who is your role model?