Minimum Buckets
INTERN
Given an array of n integers, arr , distribute its elements into the minimum possible buckets. Buckets can hold any number of elements, but a bucket of x elements must have more than floor(x/2) elements of the same value. Determine the minimum number of buckets required.
Function Description
Complete the function minimumBuckets in the editor.
minimumBuckets has the following parameters:
- int arr[n] : the array
Returns
int : the minimum number of buckets required
Example 1 :
Input: arr = [1, 2, 2, 3, 4]
Output: 3
Explanation:
At least 3 buckets are required. One possible distribution is [2, 2, 3],
[1], [4].
Constraints:
Get one-to-one training from Google Facebook engineers
Top-notch Professionals
Learn from Facebook and Google senior engineers interviewed 100+ candidates.
Most recent interview questions and system design topics gathered from aonecode alumnus.
One-to-one online classes. Get feedbacks from real interviewers.
Customized Private Class
Already a coding expert? - Advance straight to hard interview topics of your interest.
New to the ground? - Develop basic coding skills with your own designated mentor.
Days before interview? - Focus on most important problems in target company question bank.