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.” The rest of the author's notes on Software Engineer interview at Numeric, Technical Phone Screen round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post