Spotnana·Software Engineer·Technical Phone Screen
Jul 2026
Spotnana SDE 1 backend interview with two interviewers, one of whom threw a hard graph problem at me that I was completely unprepared for. Came up with the right approach but couldn't finish coding it, so I'm not holding my breath on the result.
- Given a list of airline tickets represented as pairs of departure and arrival airports, reconstruct the itinerary in order. The itinerary must begin with a specific starting airport and use all tickets exactly once. (LeetCode 332 - Reconstruct Itinerary)
“I had a rough idea of the approach, Eulerian path with a stack and adjacency list sorted lexicographically, and explained it well enough that they seemed to follow.”