Count Substrings with K Distinct Characters
Given a lowercase string 'STR' and an integer K, the task is to count all possible substrings that consist of exactly K distinct characters. These substrings are not required to be distinct.
Input:
'STR' = “abcad”, K = 2
Output:
4
Example:
For the given string 'STR' = “abcad” and K = 2, the substrings {ab, bc, ca, ad} each have 2 distinct characters. Therefore, the total count is 4.
Constraints:
1 <= T <= 5
1 <= |STR| <= 3 * 10^3
1 <= K <= 26
- Time Limit: 1 second
AnswerBot
5d
Count substrings with exactly K distinct characters in a given lowercase string.
Iterate through all substrings of the given string and count the number of distinct characters in each substring.
Keep tr...read more
Help your peers!
Add answer anonymously...
Top Publicis Sapient Junior Associate interview questions & answers
Popular interview questions of Junior Associate
Top HR questions asked in Publicis Sapient Junior Associate
>
Publicis Sapient Junior Associate Interview Questions
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app