Construct a string of length L such that each substring of length X has exactly Y distinct letters
Given the length of the string l, the length of the substring x and the number of distinct characters that a substring of length x must have are y, the task is to find a string of length l in which every substring of length x has y distinct characters.
Input: l = 6, x = 5, y = 3
If we take a substring of the first five characters then the substring will be “abcab”.
There are exactly three distinct characters (a, b, c) in the substring.
Similarly, if we take any substring from the string of length 5 then it will have
exactly 3 distinct characters.
Input: l = 3, x = 1, y = 1
If we take the substring of length 1 then it will have exactly 1 distinct character in it.
To solve the problem mentioned above we follow the steps given below:
- Initialize a variable p as 97 which marks the ASCII value of lower case letter ‘a’.
- Keep incrementing the value of p till y characters.
- Then repeat the character from the first character till it’s length become equal to length of given string and return the final string.
Below is the implementation of the above approach:
Time Complexity: O(l)
Auxiliary Space: O(1)