Nio·Software Engineer·Technical Phone Screen
May 2026
Nio SWE interview that came down to a classic selection problem. One meaty algorithm question with some follow-up pressure on complexity tradeoffs. Not a bad experience but the follow-ups caught me a bit flat-footed.
- Given an unsorted array of integers and a number k, find the k-th smallest element in expected O(n) time without sorting the whole array. Follow-ups included pivot selection strategy, average vs worst-case complexity, and a deterministic alternative.
“I knew quickselect going in so the core answer came out fine.”