Skip to content

Practice Longest Common Prefix of K Strings After Removal

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#3485
LeetCode Problem

Longest Common Prefix of K Strings After Removal

Problem Statement

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 ith element. Return an array answer, where answer[i] is the answer for ith element. If removing the ith element leaves the array with fewer than k strings, answer[i] is 0.

Source: Longest Common Prefix of K Strings After Removal on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
words = ["jump","run","run","jump","run"], k = 2
Output
[3,4,4,3,4]

# Example 2

Input
words = ["dog","racer","car"], k = 2
Output
[0,0,0]

Constraints

1 <= k <= words.length <= 10^5
1 <= words[i].length <= 10^4
words[i] consists of lowercase English letters.
The sum of words[i].length is smaller than or equal 10^5.

Related LeetCode Problems

Practice more problems similar to Longest Common Prefix of K Strings After Removal.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.