← Back to Directory

Eightfold AI

Mid-sized

Screna has 4 Eightfold AI interview write-ups. The most reported round is the technical phone screen (4).

4 interview notes · updated Jun 2026

Eightfold AI·Software Engineer·Technical Phone Screen

Jun 2026
Interviewed for a software engineer role at Eightfold AI and got a string manipulation problem that looks straightforward until you actually sit down and think through the edge cases.
  • Given a string containing '(', ')', and lowercase letters, remove the minimum number of parentheses to make the string valid. Return any valid result.

“I knew the stack-based approach pretty quickly but fumbled explaining why it's minimum removals.”

View Post

Eightfold AI·Software Engineer·Technical Phone Screen

Jun 2026
Interviewed for a software engineering role at Eightfold AI and got a parentheses validation problem. Pretty standard coding round, nothing too wild, but the stack-based approach took me a minute to fully work through.
  • Given a string containing parentheses and lowercase letters, remove the minimum number of parentheses to make the string valid, and return any valid result.

“I knew right away it was a stack problem but fumbled explaining the removal step.”

View Post

Eightfold AI·Software Engineer·Technical Phone Screen

Apr 2026
Had a technical screen at Eightfold AI for a software engineer role. One coding problem, binary search flavor, nothing too exotic but it required knowing the pattern cold.
  • Given n piles of bananas and h hours before the guards return, find the minimum eating speed k such that Koko can finish all the bananas in time. Each hour she picks one pile and eats up to k bananas from it.

“Classic binary search on the answer problem.”

View Post

Eightfold AI·Software Engineer·Technical Phone Screen

Mar 2026
Interviewed for a software engineer role at Eightfold AI and got a binary search problem that looks deceptively simple until you actually have to justify the O(log n) constraint.
  • Given an integer array, find the index of a peak element, where a peak is strictly greater than its immediate neighbors. Elements outside the array boundaries are treated as negative infinity. Your solution must run in O(log n) time.

“My first instinct was a linear scan and I had to stop myself because the O(log n) requirement basically screams binary search.”

View Post