Leetcode Problem 839. Similar String Groups

Algorithm

1. Create an adjacency list to represent the graph.
2. For each pair of strings, check if they are similar and add an edge between them in the adjacency list.
3. Initialize a visited set to keep track of visited nodes.
4. Initialize a count variable to 0.
5. For each node (string index) in the graph, if it has not been visited, perform a DFS starting from that node and mark all reachable nodes as visited.
6. Each time a new DFS starts, increment the count.
7. After all nodes have been visited, return the count.