LeetCode 1202 Smallest String With Swaps - Problem Statement

Problem: Smallest String With Swaps Task: Given string $s$ and swap pairs, find the lexicographically smallest string achievable. Within each connected component of indices, you can arrange characters in any order.

Group indices by DSU, sort characters within each group, and place them back in sorted order. The insight: if you can swap index $i$ with $j$, and $j$ with $k$, then transitivity lets you swap $i$ with $k$ too. Connected components capture this transitive closure.