← Questions
Fastest trip when two travellers may meet and ride together
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Two people start at different nodes of a graph and both need to reach the same destination. They may travel separately, or meet at some node and take the bus together from there. Return the least total time (or steps). Represent the graph however you like; run searches from both starts and the destination and combine them.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding