Valon·Software Engineer·Technical Phone Screen
May 2026
Valon SWE interview had me extending a toy in-memory database, which sounds straightforward until you're mid-explanation and realize you forgot to think about sort stability. Pretty focused technical round, one meaty coding design problem with a bunch of follow-up discussion baked in.
- You have a basic in-memory database that supports INSERT and a simple filtered SELECT. Extend it to support ORDER BY with a specified column and direction, where ties are broken by insertion order. How do you implement this, and what are the time complexity implications for the full query pipeline?
- How would you handle sort stability in this context, and what happens if the ORDER BY column contains mixed types or null values?
“I started with the obvious approach: run the filter, project columns, then sort.” The rest of the author's notes on Software Engineer interview at Valon, 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