← Back to Directory

Navan interview notes, page 2 of 2

Mid-sized

Screna has 13 Navan interview write-ups. The most reported round is the technical phone screen (8).

13 interview notes · updated Jul 2026

Navan·Frontend Engineer·Technical Phone Screen

Jun 2026
Navan frontend screen, pretty much a deep dive into your engineering background. One main question that branches out into a few different directions depending on what you say.
  • Walk us through your frontend engineering background: what frameworks and stacks you've shipped with, the biggest UI or feature you owned end-to-end, and the engineering challenges that were most specific to frontend work like performance, cross-browser issues, accessibility, or state management.

“This is one of those questions that sounds like a warmup but isn't.”

View Post

Navan·Software Engineer·Technical Phone Screen

Jun 2026
Async video screen for a frontend role at Navan, about 15 minutes total. You record your answers and the team reviews them later, which is a weird format to prepare for but not as bad as I expected once I got going.
  • Give a brief overview of your career so far.
  • Walk us through your experience as a frontend engineer.
  • What project are you most proud of, and what were the main challenges you ran into?
  • How do you approach debugging when something breaks?
  • How do you work with a PM and designer to make sure a feature actually gets shipped end to end?
  • Describe your experience with Angular and how you've used it to build scalable SaaS applications.
  • Are you able to commute to the Palo Alto office four days a week, including two Fridays per month, on an ongoing basis?

“Standard opener.”

View Post

Navan·Software Engineer·Technical Phone Screen

Jul 2026
Did a technical phone screen for a software engineer role at Navan. The whole session was basically one problem that looked simple on the surface but had a real constraint twist that forced you to think carefully about space complexity and update order.
  • Implement a Pascal's Triangle-style DP problem where dp[i][j] = dp[i-1][j-1] + dp[i-1][j], but the 2D array causes an out-of-memory error. Solve it using O(N) space with a 1D rolling array, and explain why you must update right-to-left instead of left-to-right.

“I started with the 2D approach out of habit and the interviewer stopped me pretty quickly to say it would OOM.”

View Post