Geeksforgeeks

Error

Given an array of strings **arr[]** of size **n** and given s a string **str** and an integer **k**. The task is to find the count of strings in **arr[]** whose prefix of length **k** matches with the **k** length prefix of **str**.

**Example 1:**

Input: n = 6 arr[] = {“abba”, “abbb”, “abbc”, “abbd”, “abaa”, “abca”} str = “abbg” k = 3Output:4Explanation: “abba”, “abbb”, “abbc” and “abbd” are the matching strings.

**Example 2:**

**Input:
**n = 3
arr[] = {“geeks”, “geeksforgeeks”, “forgeeks”}
str = “geeks”
k = 2
**Output: **2

**Your Task: **

You don't need to read input or print anything. Your task is to complete the function **klengthpref()** which takes the array of strings arr[], its size **n **and an integer **k, **a string** str **as input parameters and returns the count of strings in **arr[]** whose prefix of length **k** matches with the **k** length prefix of **str**.

**Expected Time Complexity:** O(n*l) where l is the length of the longest word in arr[].

**Expected Auxiliary Space:** O(n*l) where l is the length of the longest word in arr[].

**Constraints:**

1 <= n <= 1000

1^{ }<= |arr[i]| , |str| <= 1000

1 <= k <= 1000

arr[i], str must contain only lowercase english alphabets

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Prefix match with other strings

...