InterviewDB Question

Flexport SWE Phone - Flights

Question Details

Problem Find shortest or cheapest flight routes between airports, likely using BFS or Dijkstra on a weighted graph. Likely LeetCode equivalent Related to LC 787 Cheapest Flights Within K Stops. Tags graph, BFS, phone-screen

Full Details

🔒

Unlock all Flexport questions

Full insider details, leaked discussions, and candidate experiences.

Get full access — $100 a year, unlimited access

About This Question

This is a reported interview question from a flexport interview during the phone round.

It covers the following topics: Coding, Graph, Phone, Onsite .