1579. Remove Max Number of Edges to Keep Graph Fully Traversable | Graph | Union Find | LeetCode 

HI, in this video I have explained LeetCode problem 1579. Remove Max Number of Edges to Keep Graph Fully Traversable
1. Explained the problem statement with examples.
2. Shared brute force approach.
3. Shared optimal approach by using union-find and C++ code.