GO TO A SECTION

↑ ↓ to navigate · Enter to openExplore all sections →
FDEInterviews logo
← Coding & DSA / 68
medium★ EssentialMetaGoogleAmazon

Implement k-means clustering from scratch.

The assign-then-update loop is ten lines; the signal is whether you handle the three things that bite in production: initialization, an empty cluster, and a real convergence test instead of a fixed iteration count.

Updated Aug 2026 · Grounded in real Forward Deployed Engineer interview loops and written to a senior-engineer editorial bar.

The assign-then-update loop is ten lines; the signal is whether you handle the three things that bite in production: initialization, an empty cluster, and a real convergence test instead of a fixed iteration count.

20 answers per topic instead of 10, plus saved progress and bookmarks · no cardor unlock all 559 remaining answers · ₹2,000 / $25

Every answer, concept and course, every paper breakdown, all published video lessons, hands-on FDE Lab missions, Premium PDF guides and companion files, the full practice-test bank and work-sample downloads. Referral Premium excludes guide PDFs and their companion files.

6 months · One payment · No auto-renewal

Study alongside free video lessons.

Keep practising

Next in this trackImplement a k-nearest-neighbors classifier from scratch.PremiumNext in this trackImplement scaled dot-product attention (the forward pass).PremiumNext in this trackCompute the dot product of two sparse vectors.Premium
FEDITOR'S NOTE

Interviewers are not checking whether you remember the formula. They are checking whether you know k-means minimizes within-cluster squared distance, that random init gives you a bad local optimum often enough that k-means++ is the default, and that an empty cluster will crash a naive mean. A candidate who hardcodes 100 iterations and never mentions convergence has written a demo, not an algorithm.

DISCUSSION · 0

No comments yet — be the first to share your approach.