<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Union-Find on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/union-find/</link><description>Recent content in Union-Find on Jeanphilo Blog</description><generator>Hugo -- 0.163.3</generator><language>en-us</language><lastBuildDate>Thu, 02 Jul 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/union-find/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 200: Number of Islands With Union-Find</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/union-find/200-number-of-islands/</link><pubDate>Thu, 02 Jul 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/union-find/200-number-of-islands/</guid><description>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.</description></item><item><title>Union-Find Template: Derive find / union / count</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/union-find/union-find-template/</link><pubDate>Tue, 30 Jun 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/union-find/union-find-template/</guid><description>Derive the Python Union-Find template from a small set-merging task: parent, find, union, count, connected, and path compression.</description></item></channel></rss>