How should I practice Optimizing TikTok Collectible Packs?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Tiktok online assessment problems in FastPrep.

Is Optimizing TikTok Collectible Packs associated with Tiktok?

FastPrep tags this as a Tiktok coding interview or online assessment practice problem when the problem catalog has that company context.

Problem · Array

Optimizing TikTok Collectible Packs

Learn this problem

● MediumTiktokINTERNNEW GRADOA

See Tiktok hiring insights

Problem statement

ByteDance has launched a new feature on TikTok called "TikTok Collectibles," where users can collect and trade digital cards featuring popular TikTok creators. Each creator has different categories of cards, such as rare cards for the most followed creators, special edition cards with unique designs, and interactive cards that come with exclusive video content.

ByteDance wants to create a number of collectible packs, each containing equal numbers of each type of card. To achieve this, they need to add more cards to ensure each type can be evenly distributed across the packs.

Given the current inventory of each category of cards as an integer array cardTypes of size n, determine the minimum number of additional cards needed so that they can create more than one pack with an equal type distribution.

Function

cardPackets(cardTypes: int[]) → int

Complete the function cardPackets in the editor.

cardPackets has the following parameter(s):

int cardTypes[n]: the quantity available of card type

Returns

int: the minimum number of additional cards to add

Examples

Example 1

cardTypes = [4, 7, 5, 11, 15]return = 4

tomtom's note: '4' is an educated guess. If it is wrong, pls do lmk! You da best! 🧡🧡 In order to make 2 matching packets, the following numbers of additional cards of each type must be added: [0, 1, 1, 1, 1]. This sums to 4 additional cards. The numbers of cards are [4, 8, 6, 12, 16] and they can be divided evenly among 2 packets. If 3 packets are created, an additional [2, 2, 1, 1, 0] cards are needed, sum = 6 items. This yields quantities [6, 9, 6, 12, 15]. Any number of packets ≥ 2 can be created, but creating 2 packets requires the minimum number of additional cards.

Example 2

cardTypes = [3, 8, 7, 6, 4]return = 2

For 2 packets add: [1, 0, 1, 0, 0] (2 cards) to get [4, 8, 8, 6, 4]. For 3 add [0, 1, 2, 0, 2] (5 cards) to get [3, 9, 9, 6, 6]. Any number of packets ≥ 2 can be created, but making 2 packets requires the minimum number of additional cards.

Example 3

cardTypes = [3, 9, 7, 6, 5, 2]return = 4

To make 2 packets, add [1, 1, 1, 0, 1, 0] (4 additional cards) to get [4, 10, 8, 6, 6, 4]. For 3 packets, add [0, 0, 2, 0, 1, 1] (4 additional cards) to get [3, 9, 9, 6, 6, 3].

Constraints

1 ≤ n ≤ 10^5
1 ≤ cardTypes[i] ≤ 500