Loading...

Leaderboard
Showing:
Handle Score
@Ibrahim Nash 5761
@blackshadows 5701
@akhayrutdinov 5111
@mb1973 4989
@Quandray 4944
@saiujwal13083 4506
@sanjay05 3762
@marius_valentin_dragoi 3516
@sushant_a 3459
@verma_ji 3341
@KshamaGupta 3318
Complete Leaderboard
Check if a string is repetition of its substring of k-length
Medium Accuracy: 31.79% Submissions: 173 Points: 4

Given a string S, check if it is possible to convert it into a string that is repetition of substring with K characters. To convert, we can replace one substring of length K with K characters.

Example 1:

Input:
N = 4, K = 2, S = "bdac"
Output: 1
Explanation: We can replace either
"bd" with "ac" or "ac" with "bd"

â€‹Example 2:

Input:
N = 5, K = 2, S = "abcde"
Output: 0
Explanation: Since N % K != 0, it's not
possible to convert S into a string which
is a concatanation of a substring with
length K.

Your Task:
You don't need to read input or print anything. Your task is to complete the function kSubstrConcat() which takes a string S, its length N and an integer K as inputs and return 1/0 accordingly.

Expected Time Complexity: O(N).
Expected Auxiliary Space: O(N).

Constraints:
2 <= K < N <= 100000

to report an issue on this page.

Editorial

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

My Submissions:

Login to access your submissions.

Check if a string is repetition of its substring of k-length