Swim in Rising Water | Leetcode 778 | Using Union Find Approach | Problem on MST

[@JRK_RIDES]

I solved this problem using Dijkstra's fist and then also found a simple DFS/Binary Search solution as well. Both were much more straight forward. However, it was really interesting to see this third approach as well. I always try to find multiple approaches to the same problem. Great video.

[@viber1430]

provided when we have Unique nodes across the matrix, Union find is possible I guess. The first two approaches are more robust

[@arghya_0802]

Awesome video with yet another very important question. Riddhi sir is on fire right now🔥🔥. Despite working full-time and giving live seminars, he is doing so much for us for *Free* is very commendable. Also #Day5 is done!!!

[@rite2riddhi]

Thank you arghya for the kind words

[@KishankumarPatel]

It would be great if you try to solve using a smaller grid size, it would have been more faster and more easy for audience as well.

[@jyotirmoyroy4323]

Explanation +++ ❤️🙌

[@rite2riddhi]

thank you

[@KishankumarPatel]

A simple solution is just use binary search and dfs

[@VishalSingh-gm3qj]

Sir ki videos flower ni fire 🔥 hai 😎

[@ganeshkamath89]

I am not able to figure out how to convert that Collections.sort line to C++. Need help. Explanation was awesome :). Thank you.

[@rite2riddhi]

Thanks. Lets connect on insta. Need some more context. For now search c++ custom sort or c++ sorting using custom function

[@ganeshkamath89]

@@rite2riddhi Thanks.

[@sayansadhukhan9692]

There is nothing like (0,5) there, for 5 the coordinate will be (1,4)

[@mdhaidarparwez968]

Everyone cannot have explanation skills like striver and love Babbar.

[@we_crood]

it would be great if you can give better audio quality.

[@aman-hs2ht]

bhai hindi me hi smja deta