Union Find is a data structure that tracks elements partitioned into disjoint sets. It provides near-constant time operations for union (merging sets) and find (determining which set an element belongs to). Essential for detecting cycles, finding connected components, and Kruskal's MST algorithm.