We use the disjoint-set structure to detect a winner in Hex game

Source code: gist.github.co...
🔴 Learn graph theory algorithms: inscod.com/gra...
⚙ Learn dynamic programming: inscod.com/dp_...
💡 Learn to solve popular coding interview problems: inscod.com/50p...
⌛ Learn time and space complexity analysis: inscod.com/com...
🔁 Learn recursion: inscod.com/rec...
NB: This video is ad-free, you can choose to support Inside code by purchasing one of the courses above or dropping a super thanks!
NB2: Discounts of courses above are permanent
I also post content on LinkedIn (inscod.com/lin...) and Instagram (inscod.com/ins...)

[@insidecode]

If you enjoyed this video, you might also enjoy our courses: ⚙ Learn dynamic programming: inscod.com/dp_course 💡 Learn to solve popular coding interview problems: inscod.com/50problems_course ⌛ Learn time and space complexity analysis: inscod.com/complexity_course 🔁 Learn recursion: inscod.com/recursion_course

[@filmbotreviews]

Never stop making videos. Your channel will blow up like crazy any day now.

[@insidecode]

Thank you!

[@ucanhmac9721]

38 / 5.000 It is easy to understand ! Thank you teacher! I love you 😍🤗

[@fabiopimentel6981]

Hi, this is very similar to what is done in the percolation theory. What about using the hoshen kopelman algorithm?

[@ishanpathak4938]

Will this always work? Not all cells on the hex board have 6 adjacent vertices. The content is awesome, but it would have helped to show more dry-run/compilations of your code in addition to the narrative.

[@frederiklenk7756]

Love this game. Looking forward to this video

[@NoNameAtAll2]

is disjoint set the one with inverse ackerman function complexity somewhere?

[@insidecode]

Yes, by the way it's covered in the last video

[@vinay9477]

As always great video.

[@insidecode]

Thanks!