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

For each index i from $0$ to words.length $- 1$, consider the list of strings remaining after removing words[i]. Find the maximum length of a common prefix shared by any k strings chosen from this remaining list. If it is impossible to choose k strings that share a common prefix of positive length, the maximum length is $0$.

Return an integer array ans of size words.length, where ans[i] is the maximum common prefix length among any k strings after removing words[i].

Constraints:

• $1 \le$ k $\le$ words.length $\le 10^5$

• $1 \le$ words[i].length $\le 10^4$

• words[i] consists of lowercase English letters.

• The sum of words[i].length is smaller than or equal to $10^5$.

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.