FastPrep
Problem · Array

Minimum Buckets 🐰

Learn this problem
● MediumTiktokINTERNOA
See Tiktok hiring insights

Problem statement

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

minimumBuckets(arr: int[]) → int

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

Examples

Example 1

arr = [1, 2, 2, 3, 4]return = 3
At least 3 buckets are required. One possible distribution is [2, 2, 3], [1], [4].

Constraints

  • 1 ≤ n ≤ 105
  • 1 ≤ arr[i] ≤ n

More Tiktok problems

drafts saved locally
public int minimumBuckets(int[] arr) {
  // write your code here
}
arr[1, 2, 2, 3, 4]
expected3
checking account