Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.*;
- public class Solution{
- public static void main(String[] args){
- Scanner sc = new Scanner(System.in);
- int t = sc.nextInt();
- StringBuilder ans = new StringBuilder("");
- while (t-- > 0) {
- int n = sc.nextInt(),k=sc.nextInt();
- char[] arr = sc.next().toCharArray();
- HashMap<Character,Integer> hm = new HashMap<>();
- int l=0,r=0,maxLen = Integer.MIN_VALUE;
- for(;r<n;r++){
- hm.put(arr[r], hm.getOrDefault(arr[r],0)+1);
- if(hm.size()<=k){
- maxLen = Math.max(maxLen,r-l+1);
- }else{
- while(hm.size()>k){
- hm.put(arr[l],hm.get(arr[l])-1);
- if(hm.get(arr[l])==0) hm.remove(arr[l]);
- l++;
- }
- maxLen = Math.max(maxLen,r-l+1);
- }
- }
- ans.append(maxLen+"\n");
- }
- System.out.println(ans);
- sc.close();
- }
- }
Add Comment
Please, Sign In to add comment