Hard · Graphs

Similar String Groups

Given a list of equal-length strings that are all anagrams of one another, return the number of groups they form. Two strings are directly linked when they are equal or swapping two letters in one gives the other, and a group is every string connected through a chain of such links.

{
  "strs": ["tars", "rats", "arts", "star"]
}

{
  "strs": ["abcd", "abdc", "bacd", "badc", "cdab", "cdab"]
}