G-13 BFS+DFS Problems II Shortest Bridge II Leetcode 934 II C++/Java

[@DIVYANSHMNIT]

Amazing sir, the way you approach any problem is just the ideal way to approach in any interview. Great effort sir. Hats off!🤯

[@VishvajeetSinghNayalBCE]

as we are doing step ++ after each level how does it ensure to get the shortest number of 0's required ?

[@sharan7504]

Great Explanation, liked your energy the whole time.

[@kenadave]

Is it? this much is not required

[@bgmihighlights6378]

What an amazing explanation , thank youu

[@ARYANMITTAL]

Glad it helped you ❤️🫂

[@sanchitagarwal9651]

great way of building intuition

[@sahilanand30]

Superb explanation

[@KunalJaiswal-og7nf]

That was some content I wanted to watch - this was preety cool concept that how cna u use multi source bfs along with dfs. Damn i watched it before my internship interviews!!!

[@prathamrajbhattnit-allahab4108]

great explanation

[@MrKB_SSJ2]

🔥

[@lonen3rd]

How do we calculate shortest bridge if grid has >2 islands?

[@sundarbsr4275]

Nice Explanation Bro😊

[@VijayTamada]

Cool !!!

[@kunalkheeva]

thanks

[@tanishkumar6682]

Can we conclude that the shortest bridge will always be from the cell which lies on the boundary of the island not from the inside cell(i.e the cell which does not lie on the boundary).

[@adityamishra9496]

why we not use dfs instead of bfs.

[@princepranav9021]

you have to find the island in min steps..but when you apply dfs it might not give you the min no of steps..but multisource bfs gurantees shortest min steps

[@AmarjeetKumar-en1gk]

Put ur face as channel logo. Thanks me later...