How should I practice One-Nearest-Neighbor Classification?

Start by reading the full statement, solve the visible examples, then compare the pattern against related OpenAI phone screen problems in FastPrep.

Is One-Nearest-Neighbor Classification associated with OpenAI?

FastPrep tags this as a OpenAI phone screen coding practice problem when the problem catalog has that company and stage context.

Problem · Array

One-Nearest-Neighbor Classification

● Easy

OpenAINEW GRADPHONE SCREEN

Problem statement

You are given a nonempty set of labeled training samples and a set of query samples. Each sample is an integer feature vector.

For every query, find the single training sample with the smallest squared Euclidean distance:

distance(a, b) = sum((a[i] - b[i])^2)

The problem statement continues

Pro

Examples

Example 1

trainingFeatures = [[0,0],[2,2],[5,5]]trainingLabels = [10,20,30]queries = [[1,1],[4,4]]return = [10,30]

For [1,1], the first two training samples are tied at squared distance 2, so the earlier sample supplies label 10. For [4,4], the nearest sample is [5,5], which supplies label 30.

FastPrep Pro

Reported in 1 OpenAI interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
2 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$9/month

Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week