How would you build an airline system to recommend all possible routes from city 1 to city 2, including direct routes and routes with connecting cities, given only data on whether two cities are connected?

Question

Accepted Answer

Build an airline system to recommend routes from city 1 to city 2 with direct and connecting flights.

Create a graph with cities as nodes and connections as edges
Use Dijkstra's algorithm to find shortest path between city 1 and city 2
For connecting flights, find all possible paths with one or more stops
Sort and recommend routes based on total distance and number of stops

How would you build an airline system to recommend all possible routes from city 1 to city 2, including direct routes and routes with connecting cities, given only data on whether two cities are connected?

Popular interview questions of RND Engineer