Distribute Repeating Integers

arrayhash tabledynamic programming

Problem Statement

You are given an array of n integers, nums , where there are at most 50 unique values in the array. You are also given an array of m customer order quantities, quantity , where quantity[i] is the amount of integers the i ^th customer ordered. Determine if it is possible to distribute nums such that:

The i ^th customer gets exactly quantity[i] integers,

The integers the i ^th customer gets are all equal , and

Every customer is satisfied.

Return true if it is possible to distribute nums according to the above conditions .

Examples

Example 1

Input: nums = [1,2,3,4], quantity = [2]
Output: false
The 0 ^th customer cannot be given two different integers.

Example 2

Input: nums = [1,2,3,3], quantity = [2]
Output: true
The 0 ^th customer is given [3,3]. The integers [1,2] are not used.

Example 3

Input: nums = [1,1,2,2], quantity = [2,2]
Output: true
The 0 ^th customer is given [1,1], and the 1st customer is given [2,2].

Constraints

n == nums.length

1 <= n <= 10 ^5

1 <= nums[i] <= 1000

m == quantity.length

1 <= m <= 10

1 <= quantity[i] <= 10 ^5

There are at most 50 unique values in nums .

😤

Hard

Difficulty

Topic Info

ModuleDSA

CategoryArray

Sub-topicHash Table