Leetcode 1627 (Hard) Graph Connectivity With Threshold: Simple C++ Solution with [Union Find].

In this video, I provide a simple solution with an explanation to the Leetcode Leetcode 1627: Graph Connectivity With Threshold: in the hard category. The problem is a graph construction followed by connectedness querying question. I have implemented union-find from scratch in C++ and explained in detail every step of how complexity could be brought down to O(Nlog(N) + Q).