InterviewDB
Question
Bloomberg SWE Phone Screen - Flight Routes (Graph Shortest Path)
phone
Question Details
Problem Likely involves finding shortest or cheapest flight routes between airports using BFS, Dijkstra, or Bellman-Ford. Tags Coding, graph, BFS, shortest path, phone
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Coding
Onsite
Phone