New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Count with K different characters

Contributed by

Dhruv Sharma

Easy

0/40

Avg time to solve 15 mins

Success Rate 85 %

6 upvotes

Problem Statement

You are given a string ‘STR’ of lowercase alphabets and an integer K. Your task is to count all the possible substrings that are not necessarily distinct but should have exactly K distinct characters.

For example:

'STR' = “abcad” and K = 2. 
We can see that the substrings {ab, bc, ca, ad} are the only substrings with 2 distinct characters. Therefore, the answer will be 4.

Detailed explanation ( Input/output format, Notes, Constraints, Images )

Input format :

The first line of input contains an integer T’ denoting the number of test cases.

The first and the only line of each test case contains a string ‘STR’.

The second line of each test case contains a single integer K.

Output format :

For each test case, in a separate line, return a single integer which is the count of all possible substrings having exactly K distinct characters.

Note:

You don’t have to print anything; it has already been taken care of. Just implement the given function.

Constraints:

1 <= T <= 5
1 <= |STR| <= 3*10^3
1 <= K <= 26

Time Limit: 1 second

Sample Input 1 :

2
cdc
2
aacfssa    
3

Sample Output 1 :

3
5

Explanation of The Sample Input 1:

For the first test case:
Given STR = "cdc”, we can see that the substrings with only 2 distinct characters are {cd, dc, cdc}. Therefore, the answer will be 3.

For the second test case:
Given STR = “aacfssa”. We can see that the substrings with only 3 distinct characters are {acf, cfs, aacf, cfss, fssa}. Therefore, the answer will be 5.

Sample Input 2 :

3
aakash
2
bbbb
1
qffds
5

Sample Output 2 :

7
10
0

Auto

Console