How should I practice Minimum Euclidean Plate Collection Time?

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

Is Minimum Euclidean Plate Collection Time associated with Uber?

FastPrep tags this as a Uber online assessment coding practice problem when the problem catalog has that company and stage context.

Problem

Minimum Euclidean Plate Collection Time

Learn this problem

UberFULLTIMEOA

See Uber hiring insights

Problem statement

You are given n plates placed on a 2D grid. Plate i is located at coordinate (x[i], y[i]). Each plate has the same magnetic attraction power d.

Two plates are directly connected if the Euclidean distance between them is less than or equal to d. Connectivity is transitive: if a plate is connected directly or indirectly to another plate, collecting one plate collects the entire connected component in the same second.

You may choose one uncollected plate per second. Return the minimum number of seconds required to collect all plates.

Function

getMinEuclideanTime(n: int, d: int, x: int[], y: int[]) → int

Examples

Example 1

n = 4d = 1x = [0, 0, 1, 2]y = [0, 1, 0, 2]return = 2

The first three plates form one connected component because adjacent distances are at most 1. The plate at (2,2) is separate, so two seconds are needed.

Example 2

n = 3d = 2x = [0, 3, 6]y = [0, 0, 0]return = 3

Each pair of neighboring plates is distance 3 apart, which is greater than d, so each plate is collected separately.

Constraints

Constraints:

1 <= n <= 1000
0 <= d <= 10000
0 <= x[i], y[i] <= 10000
x.length == y.length == n