Longest Substring With Exactly K Unique Characters

easy
Question Solve Solutions 
1. You are given a string(str) and a number K.
2. You have to find length of the longest substring that has exactly k unique characters.
3. If no such substring exists, print "-1".

Input Format

A string

Output Format

A number representing length of the longest K unique characters substring.

Constraints

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

Example

Input
aabcbcdbca
2
Output
4
Previous
Count Of Substrings Having All Unique Characters
Next
Count Of Substrings With Exactly K Unique Characters

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