Coding (Algo)

Find the Closest Coordinate Pair

Algorithm: Sorting Difficulty: Hard Time: 50 minutes

Goal

Return the minimum squared Euclidean distance between two different input indexes or null if fewer than two records exist.

What this task practices

Find the Closest Coordinate Pair is a coding (algo) interview exercise that trains prompt interpretation, explicit assumptions, a concrete response, and a clear explanation of tradeoffs. The catalog marks it as hard difficulty. It focuses on Technical Reasoning, Testing, Validation. The signed-in workspace provides the tools for the round and evaluates the attempt against task-specific criteria. Reference solutions, hidden checks, evaluator instructions, and candidate work remain private.