Grokking the Google Forward Deployed Engineer Interview
0% completed
Graphs and Search Under Time Pressure
Eight depots are joined by two-way roads, and each road has a travel time in minutes. Write three functions. The first returns the fewest roads from one depot to another. The second returns the shortest travel time. The third lists the depots that no route can reach. Each function must answer in one pass over the network.
Graph search is a common topic in data structures and algorithms interviews, and the hard part under time pressure is choosing the algorithm in the first minutes
.....
.....
.....
Like the course? Get enrolled and start learning!
Reading Progress
0%