Longest K unique characters substring

this problem is done using the sliding window technique.. In this, we will first make a map that will store characters and their count until the size of the map is less than k and increment j by one every time until the map size is less than k. once ...