LeetCode
Question
·
Mar 2022
·
USA
Microsoft OA | Graph Question
3 upvotes
749 views
5 replies
Question Details
Problem There are n locations ( vertices ) in a city, which are connected through streets of length 1 ( edge length = 1 ). Some of the locations have petrol...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Graph
Queue