Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.