3243 & 3244. Shortest Distance After Road Addition Queries I & II | Graph | BFS | Ordered Set

[@rajrajesh1669]

Bro is the real gangster!

[@vancedutube7620]

Solved this yesterday, came today to look for other approach to solve, Learned about TreeSet subSet and removeAll functions usecase

[@rsKayiira]

Thats great you're using Java now.

[@Engineering.Wallah]

0:36 unidirectional*

[@amardeep7714]

very nicee observation and solution . Thank you Aryan

[@rajdippal51]

8:22 because it's unidirectional, directed edges

[@fasilv843]

It is not un-directional, it is uni-directional

[@dewanshpatle9056]

why have you shifted to Java???

[@rajrajesh1669]

For development java is more likely to be used (Spring framework), I think for this reason but I'm not so sure.

[@Rajdweep]

bro nhi mili spicy content twitter pe

[@sanketbhagat1222]

it's not undirectional.. its -> unidirectional (single direction)

[@naturesrevolution]

it didn't pass test case n =5 queries =[[1,3],[2,4]] Use Testcase Output [3,2] Expected. [3,3]

[@naturesrevolution]

it didn't pass test case n =5 queries =[[1,3],[2,4]] Use Testcase Output [3,2] Expected. [3,3]

[@kushagrajain9493]

Shortest Distance After Road Addition Queries II, for this problem it is mentioned that there will be no overlapping b/w edges, but for Shortest Distance After Road Addition Queries I there may be overlapping, thus you have to use BFS