3485 - Longest Common Prefix of K Strings After Removal.

Hard

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

For each index i in the range [0, words.length - 1], find the length of the longest common prefix among any k strings (selected at distinct indices ) from the remaining array after removing the <code>i^th</code> element.

Return an array answer, where answer[i] is the answer for <code>i^th</code> element. If removing the <code>i^th</code> element leaves the array with fewer than k strings, answer[i] is 0.

Example 1:

Input: words = "jump","run","run","jump","run", k = 2

Output: 3,4,4,3,4

Explanation:

• Removing index 0 ("jump"):

• Removing index 1 ("run"):

• Removing index 2 ("run"):

• Removing index 3 ("jump"):

• Removing index 4 ("run"):

Example 2:

Input: words = "dog","racer","car", k = 2

Output: 0,0,0

Explanation:

• Removing any index results in an answer of 0.

Constraints:

• <code>1 <= k <= words.length <= 10⁵</code>

• <code>1 <= wordsi.length <= 10⁴</code>

• words[i] consists of lowercase English letters.

• The sum of words[i].length is smaller than or equal <code>10⁵</code>.