2157. Groups of Strings

[czm23333]

Description

Certain rules are given to check whether two strings are connected, then you need to divide given strings into some groups, making every pair of connected strings be in the same group.

For each string we can enumerate every possible connected string and check if it's present , if so, we union the collections they belong to.

Put check marks:

Have you made changes in README file ?

• [x] Added problem & solution under correct topic.
• [x] Specified Space & Time complexity.
• [x] Specified difficulty level, tag & Note(if any).

How Has This Been Tested?

Please describe the tests that you ran to verify your changes. Please also note any relevant details for your test configuration.

• [ ] Test A
• [ ] Test B

Make sure all below guidelines are followed else PR will get Reject:

• [x] My code follows the style guidelines of this project
• [x] I have performed a self-review of my own code
• [x] I have commented my code so that it is easy to understand
• [x] I have made corresponding changes to the documentation
• [x] My changes generate no new warnings
• [x] Any dependent changes have been merged and published in downstream modules

[welcome[bot]]

I can tell this is your first pull request! Thank you I'm so honored. :tada::tada::tada: I'll take a look at it ASAP!