Leetcode 839. Similar String Groups

Given equal-length anagram strings, group them into connected components where an edge connects two strings if they are identical or can be made equal by swapping two letters (i.e., they differ in at most two positions). Return the number of such similarity groups — typically found by building this graph with pairwise O(L) checks and counting components (DFS/union-find).