Leetcode Problem 2157. Groups of Strings

2157. Groups of Strings

Leetcode Solutions

Initialize a Union Find data structure with the size equal to the number of words.
Create a bitmask for each word and store the mapping from bitmask to index in a hashmap.
For each word, generate all possible connected words by manipulating the bitmask:
- For adding a letter, set the corresponding bit to 1.
- For deleting a letter, set the corresponding bit to 0.
- For replacing a letter, flip the corresponding bit.
If the generated bitmask exists in the hashmap, union the current word with the word represented by the existing bitmask.
After processing all words, iterate through the Union Find to count the number of disjoint sets and find the size of the largest set.
Return the count of disjoint sets and the size of the largest set as the result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen