1p3a Question · Nov 2025

Meta E6 ML-SWE Onsite Interview Experience (Downlevel to E5)

SWE Onsite Senior

Question Details

Role: E6 ML-SWE Coding Round 1 Problem: Find the K points closest to the origin. Solution: Compute Euclidean distances and use a Max Heap of size K or the QuickSelect algorithm to

Full Details

🔒

Unlock all Meta questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a meta interview for a swe role (senior level) during the onsite round reported in 2025.

It covers the following topics: Hash Table, Arrays, System Design, Behavioral, Heap, Ml .