LeetCode Question

#787 Cheapest Flights Within K Stops

SWE coding Medium
Sign in to bookmark Original →

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 Microsoft 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 Microsoft

Reddit I analyzed 11k available dev jobs to find out what skills employers are looking for right now Reddit Best Resources/Materials For FAANG Companies Reddit Is it positive sign ? Reddit Premera’s Software Development Summer Internship Interview Reddit Tips Needed
← All Microsoft questions Microsoft Software Engineer Questions → All Dynamic Programming, Graph, Heap, Bfs, Dfs, Shortest Path Questions →