← Back to Directory

Reevo

Small

Screna has 2 Reevo interview write-ups. The most reported round is the technical phone screen (2).

2 interview notes · updated Jun 2026

Reevo·Software Engineer·Technical Phone Screen

Jun 2026
Interviewed for a software engineering role at reevo and got a graph traversal problem that looked straightforward until the lexicographic ordering requirement showed up. One coding round, algorithmic focus.
  • Given an undirected graph with nodes labeled 1 through n, return the lexicographically largest DFS traversal sequence. Start from node 1 for its connected component, then handle remaining components by visiting each from its largest node, ordering the components themselves by their max node value descending.

“I got the basic DFS part fine but the multi-component ordering tripped me up for a bit.”

View Post

Reevo·Software Engineer·Technical Phone Screen

Jun 2026
Interviewed for a software engineer role at reevo and got a string problem that looked easy until I actually had to think about the edge cases.
  • Given a string, count the total number of palindromic substrings it contains. Substrings at different positions count separately even if they look identical.

“I knew center expansion was the move but fumbled explaining why you need to handle even and odd length centers separately.”

View Post