Ambulance Service — Longest Driving Time - Deutsche Bank Online Assessment IIT BHU

In the city there are N districts (numbered from 0 to N-1) connected with M streets. The connections are described by two arrays, A and B, both of length M.

…

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

Ending preview

…

every street goes between two different districts;
there are no multiple streets between two districts.

solution.cpp

Run code to see test results

00:00 / 69:42

Ambulance Service — Longest Driving Time - Deutsche Bank Online Assessment IIT BHU

MediumMed•534 views

In the city there are N districts (numbered from 0 to N-1) connected with M streets. The connections are described by two arrays, A and B, both of length M.

…

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

Ending preview

…

every street goes between two different districts;
there are no multiple streets between two districts.

MediumMed•534 views

Asked at

Deutsche Bank