Eightfold AI·Software Engineer·Technical Phone Screen
May 2026
Coding round at Eightfold AI for a software engineer position. One algorithmic problem, binary search on the answer type, the kind that looks approachable until you're mid-implementation and second-guessing your bounds.
- Given n piles of bananas and h hours before the guards return, find the minimum eating speed k (bananas per hour) such that all piles are finished in time. Each hour you pick one pile and eat up to k bananas from it. Solve it using binary search.
“Classic binary search on the answer problem.” The rest of the author's notes on Software Engineer interview at Eightfold AI, 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