← Back to Directory

Eightfold AI

Mid-sized

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

5 interview notes · updated Jul 2026

Eightfold AI·Software Engineer·Technical Phone Screen

Jun 2026
Interviewed for a software engineering role at Eightfold AI and got a parentheses removal problem. Pretty standard coding round but the follow-ups pushed it further than I expected.
  • Given a string with lowercase letters and parentheses, remove the minimum number of parentheses to make the string valid. A valid string means every closing paren has a matching opener before it and the total count is balanced. Return any valid result.
  • Follow-up: instead of returning the string, can you just return the count of minimum removals needed?
  • Follow-up: if there are multiple valid answers with the same minimum removals, how would you return the lexicographically smallest one?
  • Follow-up: can you reduce the extra space used in your solution?

“I knew the stack-based approach going in but fumbled explaining why it works.”

View Post

Eightfold AI·Software Engineer·Technical Phone Screen

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

“My first instinct was to just count unmatched brackets and strip them, which is roughly right but I fumbled explaining the traversal logic out loud.”

View Post

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.”

View Post

Eightfold AI·Software Engineer·Technical Phone Screen

May 2026
Interviewed for a software engineering role at Eightfold AI and got hit with a binary search problem that looks deceptively easy until you actually think about the O(log n) constraint.
  • Given an integer array, find the index of any peak element, where a peak is strictly greater than its immediate neighbors. Your solution must run in O(log n) time.

“My first instinct was a linear scan and I almost said it out loud before catching myself.”

View Post

Eightfold AI·Software Engineer·Technical Phone Screen

Apr 2026
Interviewed for a software engineer role at Eightfold AI and got a parentheses validation problem. Pretty standard algorithmic question but the details matter more than you'd think.
  • Given a string containing parentheses and lowercase letters, remove the minimum number of parentheses to make the string valid, and return any valid result.

“Stack-based approach is the right move here.”

View Post