reevo

Small

Reevo is an AI-powered customer relationship management (CRM) and sales platform designed to help sales teams automate workflows, manage pipelines, and improve productivity. It is known for integrating artificial intelligence to streamline sales operations and data management for growing businesses.

8 interview notes · updated Jul 2026

reevo·Software Engineer·Technical Phone Screen

Jul 2026

SQL round at Reevo for a software engineer role. Just one question but it had enough moving parts to trip you up if you weren't careful with the grouping logic.

Given a table with columns for date, team name, and sport name, write a SQL query that returns the count of rows per sport, broken down by year and calendar quarter. Output should include year, quarter, sport name, and count, ordered by year, quarter, count descending, then sport name ascending.

“The grouping part is straightforward but I kept second-guessing the quarter extraction.”

View Post

reevo·Software Engineer·Technical Phone Screen

Jun 2026

Did a coding round for a Software Engineer role at Reevo. One question, palindrome substrings, pretty classic stuff but I fumbled around more than I expected before landing on a clean approach.

Given a string, count the total number of substrings that are palindromes, including duplicates at different positions.

“I knew the brute force immediately but sat there second-guessing whether O(n^2) was good enough.”

View Post

reevo·Software Engineer·Technical Phone Screen

May 2026

Interviewed for a software engineering role at Reevo and got hit with a data structures question that was more layered than it looked on the surface. The problem started simple but kept growing as they added constraints around memory, query volume, and normalization edge cases.

You have a large dictionary of up to a million unique words and a list of up to 100,000 query strings. For each query, determine whether the word exists in the dictionary. How do you design this system, what data structure do you use, and how do you handle case sensitivity, Unicode normalization, and duplicate queries?

“My first instinct was hash set, which is correct, but I said it too fast and then fumbled when they asked me to justify the memory tradeoff versus a trie.”

View Post

reevo·Software Engineer·Technical Phone Screen

May 2026

Reevo had me work through a paginated API aggregation problem that looked straightforward on the surface but kept revealing more layers. The error handling and sorting edge cases were where they really wanted to see your thinking.

Implement a function that fetches all pages from a paginated HTTP API returning team objects with name and wins, merges the results, sorts by wins descending and name ascending, and returns the top N team names. You also need to handle transient network errors with retries and backoff, rate limiting, and malformed records.

“I started with the pagination loop and got that working pretty quickly, stopping when a page comes back empty.”

View Post

reevo·Software Engineer·Technical Phone Screen

May 2026

Did a coding round for a Software Engineer role at reevo, pretty much just one algorithmic problem the whole time. Nothing fancy, but it required you to actually know what you were doing.

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 the center-expansion trick going in, which saved me.”

View Post

reevo·Software Engineer·Technical Phone Screen

May 2026

Interviewed for a software engineer role at reevo and got hit with a graph traversal problem that was trickier than it looked on the surface. The DFS angle was expected but the lexicographic ordering twist plus the multi-component handling caught me a bit off guard.

Given an undirected graph with nodes labeled 1 through n, return the lexicographically largest DFS traversal sequence. Start DFS 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 quickly but the multi-component ordering tripped me up for a bit.”

View Post

reevo·Software Engineer·Online Assessment (OA)

May 2026

Reevo OA for a Software Engineer role, one algorithmic problem that looks deceptively clean until you sit with it for a few minutes. Not a lot of context given about the process beyond this.

You have an integer array of length n. The weighted sum S is defined as the sum of arr[i] * (i+1) for all i. You can perform adjacent swaps, but each position can be involved in at most one swap (swaps must be non-overlapping). Return the maximum possible value of S.

“This one took me a while to even parse correctly.”

View Post

reevo·Software Engineer·Technical Phone Screen

May 2026

Got a graph problem at Reevo for a software engineer role, pretty much just the one algorithmic question from what I can tell. The problem had enough edge cases to trip you up if you weren't careful about the greedy choices.

Given an undirected graph with n nodes and m edges, output the lexicographically largest node visitation sequence that a depth-first search could produce, where you can freely choose the starting node, the order of neighbor exploration, and where to restart DFS after finishing a connected component.

“The greedy logic is straightforward once you see it: always pick the largest unvisited neighbor at each step, and start each new component from the largest unvisited node.”

View Post