Quick Overview

Find a directed flight route that leaves a starting airport and returns in the fewest hops, using a canonical tie-break among equal routes. The problem examines graph reachability, shortest-cycle reasoning, lexicographic ordering, duplicate edges, self-loops, impossible cases, and adjacency-processing cost.

Find a Canonical Shortest Round Trip Through Flights

Company: Expedia

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: Find a directed flight route that leaves a starting airport and returns in the fewest hops, using a canonical tie-break among equal routes. The problem examines graph reachability, shortest-cycle reasoning, lexicographic ordering, duplicate edges, self-loops, impossible cases, and adjacency-processing cost.

Loading…