Luma AI·Machine Learning Engineer·Technical Phone Screen
- Given up to 20,000 points on a 2D plane, find the minimum Euclidean distance between any pair of points.
“I knew the brute force immediately, two nested loops, done.”
Small
Screna has 12 Luma AI interview write-ups. The most reported round is the technical phone screen (12).
12 interview notes · updated Jul 2026
“I knew the brute force immediately, two nested loops, done.”
“This one had three distinct failure modes packed into a single scenario and they wanted you to walk through all of them.”
“Not what I was expecting from an ML interview.”
“The triangle inequality part is straightforward once you remember you need all three checks, not just one.”
“I've done the LeetCode transpose before so my first instinct was to just write that solution.”
“Brute force is O(n^2) and I knew that wasn't the answer they wanted.”
“I knew the formula but fumbled the normalization part at first.”
“My first pass just exponentiated everything directly and called it done.”
“The imputation part is fine, masking zeros and computing column means is a few lines.”
“They handed over the formula so it wasn't a recall test, more about whether you could translate math into clean code.”