← Back to Directory

Numeric

Small

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

3 interview notes · updated Jun 2026

Numeric·Software Engineer·Technical Phone Screen

Jun 2026
Interviewed for a software engineering role at Numeric, and the main focus was a pretty involved pagination and data aggregation problem that also pulled in reliability concerns. Not a pure coding screen, more of a systems-thinking conversation.
  • Given a paginated server endpoint that returns records and a continuation token, how would you consume all pages and group the results by a 'planet' field? Also discuss how you'd handle rate limits, transient failures with retry logic, and partial state if something fails mid-way.

“This felt like three questions duct-taped together.”

View Post

Numeric·Software Engineer·Technical Phone Screen

Apr 2026
Got a coding round at Numeric for a Software Engineer role. One problem, graph-based, involved chaining translation APIs together to convert text between languages. Felt manageable once I recognized the BFS angle, but the setup took a minute to fully parse.
  • You're given a list of translators, each capable of translating between two specific languages (think directed edges in a graph). You also have access to a translate(from, to, text) API for each valid pair. Given a source language and a target language, find the shortest translation chain and apply each translation in sequence to convert the input text. Return the result, or indicate no path exists.

“Took me longer than I'd like to admit to stop thinking about it as a string problem and see it as a graph problem.”

View Post

Numeric·Software Engineer·Technical Phone Screen

Apr 2026
Numeric had me work through a greedy algorithm problem for a software engineer screen. Pretty standard coding round, one question, nothing behavioral.
  • A spaceship travels along a line with a starting fuel amount toward a target. There are refueling stations along the way, each with a position and a fuel amount. What is the minimum number of stops needed to reach the target, or -1 if it's impossible?

“I knew this was a greedy problem pretty quickly but fumbled on the heap part for a few minutes.”

View Post