Circle·Software Engineer·Technical Phone Screen
Jun 2026
Coding round at Circle for a software engineer role. One meaty graph/shortest-path problem that also required me to explain the algorithm, complexity, and a few tricky constraints out loud. Left feeling like I handled the core logic okay but stumbled a bit on the cycle-avoidance explanation.
- Given a list of flights (each with an ID, source, destination, departure time, arrival time, and price), implement a function that finds the cheapest itinerary from an origin to a destination. Only consider itineraries where the first flight departs within a given date range. Return the minimum total price and the ordered list of flight IDs, or -1 if no valid itinerary exists. You also need to explain your algorithm, its time and space complexity, and how you handle connection ordering and cycle prevention.
“The core pathfinding part I got to pretty quickly.” The rest of the author's notes on Software Engineer interview at Circle, 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