https://practice.geeksforgeeks.org/problems/longest-k-unique-characters-substring/0
@phantom Bhaiya I haven’t understand the Statement of this Question?
https://practice.geeksforgeeks.org/problems/longest-k-unique-characters-substring/0
@phantom Bhaiya I haven’t understand the Statement of this Question?
u have to find a substring from a given string
having ““k UNIQUE CHARACTER”” (like abcbc have 3 unique character )
and print the longest of them
like in if k=3
abbcdgcdgc
so abbc have 3 unique character abc and have length=4
also dgcdgc have 3 unique character and have length=6
so u have to print 6
Thank you Bhaiya…