Check if a string is repetition of its substring of k-length
Medium Accuracy: 41.05% Submissions: 648 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.


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

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