<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Union-Find on AI VOID</title><link>https://ai-blog.noorshomelab.dev/tags/union-find/</link><description>Recent content in Union-Find on AI VOID</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 16 Feb 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://ai-blog.noorshomelab.dev/tags/union-find/index.xml" rel="self" type="application/rss+xml"/><item><title>Chapter 21: Union-Find (Disjoint Set Union): Efficient Set Operations</title><link>https://ai-blog.noorshomelab.dev/dsa-typescript-mastery-2026/union-find-disjoint-set-union/</link><pubDate>Mon, 16 Feb 2026 00:00:00 +0000</pubDate><guid>https://ai-blog.noorshomelab.dev/dsa-typescript-mastery-2026/union-find-disjoint-set-union/</guid><description>&lt;h2 id="chapter-21-union-find-disjoint-set-union-efficient-set-operations"&gt;Chapter 21: Union-Find (Disjoint Set Union): Efficient Set Operations&lt;/h2&gt;
&lt;p&gt;Welcome back, future algorithm master! In our journey through the fascinating world of Data Structures and Algorithms, we&amp;rsquo;ve encountered many ways to organize and manipulate data. Today, we&amp;rsquo;re going to dive into a truly elegant and powerful data structure known as &lt;strong&gt;Union-Find&lt;/strong&gt;, also frequently called &lt;strong&gt;Disjoint Set Union (DSU)&lt;/strong&gt;.&lt;/p&gt;
&lt;p&gt;This chapter will equip you with the knowledge to efficiently manage collections of elements that are partitioned into a number of non-overlapping (disjoint) sets. You&amp;rsquo;ll learn the core operations, understand the subtle but critical optimizations that make it incredibly fast, implement it step-by-step in TypeScript, and explore its practical applications in areas like graph algorithms and network connectivity. Get ready to add another powerful tool to your algorithmic toolkit!&lt;/p&gt;</description></item></channel></rss>