<?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 Jesus Oseguera</title><link>https://r0tbyt3.dev/tags/union-find/</link><description>Recent content in Union-Find on Jesus Oseguera</description><generator>Hugo</generator><language>en-us</language><atom:link href="https://r0tbyt3.dev/tags/union-find/index.xml" rel="self" type="application/rss+xml"/><item><title>Union Find</title><link>https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/union-find/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/union-find/</guid><description>Union Find Union Find - disjoint set data structure with near O(1) union and find operations for grouping and connectivity problems.
Related Links: BFS Pattern Binary Search Pattern DFS Pattern Fast and Slow Pointers Merge Intervals Monotonic Stack Sliding Window Top K Elements Two Pointers</description></item></channel></rss>