Description
Solutions
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:

  1. 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:
    • 1 ≤ n ≤ 105
    • 1 ≤ arr[i] ≤ n
Thumbnail 0
Testcase
Result
Case 1

input:

output: