How should I practice Count Player Teams by Shared Letters?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Count Player Teams by Shared Letters associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Count Player Teams by Shared Letters

Google● MediumINTERNONSITE INTERVIEW

Learn

Problem statement

You are given an array players, where each string is the lowercase English name of one player.

Two players are directly connected when their names contain at least one common letter. A team is a connected component under this rule: players connected through other players belong to the same team even if their own names share no letter.

Return the number of teams.

Function

countPlayerTeams(players: String[]) → int

Examples

Example 1

players = ["ab","bc","de","ef"]return = 2

The first two names form one team through b. The last two form another through e.

Example 2

players = ["abc","cde","efg"]return = 1

The first and second names share c, and the second and third share e. Transitivity puts all three players on one team.

Example 3

players = ["amy","bob","cyd"]return = 2

Amy and Cyd share y. Bob has no letter in common with either of them.

Constraints

0 <= players.length <= 200000.
Every name has length between 1 and 100.
Names contain only lowercase English letters.
The sum of all name lengths is at most 2000000.