You are given an array of strings words and an integer k.

Two words belong to the same prefix connected group if each word has a length of at least k and both share the exact same prefix of length k.

Return the total number of connected groups that contain at least $2$ words.

Constraints:

• $1 \leq$ words.length $\leq 5000$

• $1 \leq$ words[i].length $\leq 100$

• $1 \leq$ k $\leq 100$

• All strings in words consist of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.