Two strings are similar if we can swap two letters (in different positions) of a string, so that it equals another sting.
Also two strings are similar if they are equal.
For example, "tars" and "rats" are similar (swapping at positions 0 and 2), and "rats" and "arts" are similar, but "star"
is not similarto "tars", "rats", or "arts".
Together, these form two connected groups by similarity: {"tars", "rats", "arts"} and {"star"}. Notice that
"tars" and "arts" are in the same group even though they are not similar. Formally, each group is such that a
word is in the group if and only if it is similar to at least one other word in the group.
We are given a list strs of strings where every string in strs is an anagram of every other string in strs.
How many groups are there?
Example 1:
Input: strs = ["tars","rats","arts","star"]
Output: 2
Example 2:
Input: strs = ["omv","ovm"]
Output: 1Input Format
Input/output is handled for you. You just need to complete the function.
Output Format
Input/output is handled for you. You just need to complete the function.
Constraints
1. 1 <= strs.length <= 300 2. 1 <= strs[i].length <= 300 3. strs[i] consists of lowercase letters only. 4. All words in strs have the same length and are anagrams of each other.
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
4 tars rats arts star
Output
2