LeetCode Question

#787 Cheapest Flights Within K Stops

SWE coding Medium

Question Details

LeetCode #787: Cheapest Flights Within K Stops. Difficulty: Medium. Topics: Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path. Asked at Google in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Breadth-First Search Depth-First Search Graph Theory Heap (Priority Queue) Shortest Path Dynamic Programming Graph Heap Queue

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview

← All Google questions Google Software Engineer Questions → All Graph,Dfs,Bfs,Dynamic-Programming,Heap,Shortest-Path Questions →