Union Find on Jeanphilo Bloghttps://shio-chan-dev.github.io/jeanblog/tags/union-find/Recent content in Union Find on Jeanphilo BlogHugo -- 0.163.3en-usThu, 02 Jul 2026 00:00:00 +0800LeetCode 200: Number of Islands With Union-Findhttps://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/union-find/200-number-of-islands/Thu, 02 Jul 2026 00:00:00 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/union-find/200-number-of-islands/Solve LeetCode 200 Number of Islands in Python by deriving land-only count, 2D-to-1D ids, Union-Find merges, and exactly when count decreases.LeetCode 684: Redundant Connection With Union-Findhttps://shio-chan-dev.github.io/jeanblog/alg/leetcode/union-find/684-redundant-connection/Thu, 02 Jul 2026 00:00:00 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/union-find/684-redundant-connection/Solve LeetCode 684 Redundant Connection in Python by deriving the already-connected edge pressure, 1-indexed parent array, bool-returning union, and ordered edge scan.Union-Find Template: Derive find / union / counthttps://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/union-find/union-find-template/Tue, 30 Jun 2026 00:00:00 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/union-find/union-find-template/Derive the Python Union-Find template from a small set-merging task: parent, find, union, count, connected, and path compression.LeetCode 547: Number of Provinces, Turn an Adjacency Matrix into Connected Componentshttps://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/547-number-of-provinces/Fri, 29 May 2026 00:00:00 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/547-number-of-provinces/Turn LeetCode 547 Number of Provinces from direct connections in an adjacency matrix into connected component counting, then derive DFS, BFS, and Union Find solutions step by step.