Problem description: Visit and Support LeetCode Search via Difficulty: Medium Tags: LeetCode, Depth-First Search, O(n^2), O(n), Medium, Union Find ProblemSolutionCodeProblem