DSA Level 2 Data Structures Hashmap and Heaps Count Of Substrings With Exactly K Unique Characters

Count Of Substrings With Exactly K Unique Characters

medium

Hashmap and Heaps

Question Solve Solutions

1. You are given a string(str) and a number K.
2. You have to find the count of valid substrings of the given string.
3. Valid substring is defined as a substring that has exactly K unique characters.

Input Format

A string

Output Format

A number representing count of substrings with exactly K unique characters.

Constraints

1 <= length of string <= 10^5
1 <= k <= 26

Example

Input

aabcbcdbca
2

Output

Longest Substring With Exactly K Unique Characters

Equivalent Subarrays

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String