For every group of k consecutive candies, count the number of unique flavors not inside that group. Return the largest number of unique flavors.
When calculating an adjacent group of k consecutive candies, can you use some of your previous calculations?
Use a sliding window where the window is the group of k consecutive candies you are sharing. Use a hash map to store the number of candies of each type you can keep.