Leetcode 1655. Distribute Repeating Integers

Given nums (with at most 50 distinct values) and up to 10 customers each requiring quantity[i] identical items, determine whether you can assign to every customer exactly quantity[i] copies of a single value from nums (no mixing or reuse). The core challenge is deciding whether the multiset counts of identical numbers can cover all fixed-size same-value demands.