Applied Intuition·Machine Learning Engineer·Technical Phone Screen
Jun 2026
Interviewed for an ML Engineer role at Applied and got a data structures implementation question, which surprised me a bit. Not what I expected going in, but it was a fair problem if you've thought about circular buffers before.
- Design and implement a fixed-capacity double-ended queue (deque) from scratch. It should support insertions and deletions from both ends, plus peek and status checks, all in O(1) time. Handle the case where the deque is full or empty gracefully, and make sure wraparound works correctly.
“My first instinct was to use a plain array with two pointers, which is the right call, but I fumbled the wraparound logic for a bit.” The rest of the author's notes on Machine Learning Engineer interview at Applied Intuition, Technical Phone Screen round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post