Practice Expedia Coding Question | Real Coding Interviews

Quick Summary

Find the minimum cards to add so all inventory counts become divisible by some integer p ≥ 2.
The value p represents the number of identical packets each card type will form.
Evaluate feasible values of p within a bounded range and compute the rounding cost per type.

What This Tests

Modular arithmetic and divisibility checks
Constraint-driven search space reduction
Early termination and greedy cost accumulation
Time complexity analysis under bounded input ranges

Common Patterns

Greedy

Math

A trading card company packages sports cards by type into identical packets.

Given an integer array cardTypes where cardTypes[i] represents the current inventory count of card type i, determine the minimum total number of additional cards required so that there exists an integer p >= 2 satisfying the following condition:

For every card type, the final count is divisible by p.

Equivalently, after adding cards, each card type can be split evenly into exactly p packets with no leftover cards.

Test Cases

Input

Output

Expected