This question was asked in OA of UBER on campus... Given a weighted undirected graph with q queries for finding the shortest distance between source to destination. Constraints: 1e5 for nodes and edges, Weight of edges 10e9
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
7 | SecondThread | 150 |
9 | orz | 146 |
10 | pajenegod | 145 |
How to solve this graph problem?
This question was asked in OA of UBER on campus... Given a weighted undirected graph with q queries for finding the shortest distance between source to destination. Constraints: 1e5 for nodes and edges, Weight of edges 10e9
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 | thatsme123 | 2021-09-21 12:00:32 | 64 | |||
en2 | thatsme123 | 2021-09-21 11:59:37 | 52 | Tiny change: 'Given a we' -> 'This question was asked in OA of UBER on campus...\nGiven a we' | ||
en1 | thatsme123 | 2021-09-21 11:09:20 | 219 | Initial revision (published) |
Name |
---|