2516. Take K of Each Character From Left and Right

You are given a string s consisting of the characters ‘a’, ‘b’, and ‘c’ and a non-negative integer k. Each minute, you may take either the leftmost character of s, or the rightmost character of s.

Return the minimum number of minutes needed for you to take at least k of each character, or return -1 if it is not possible to take k of each character.

class Solution {
public:
    int takeCharacters(string s, int k) {
        if(k == 0) return 0;
        int res = INT_MAX;
        int a = 0, b = 0, c = 0, p = 0;
        while(p < s.length()) {
            if(s[p] == 'a') a += 1;
            if(s[p] == 'b') b += 1;
            if(s[p] == 'c') c += 1;
            if(a >= k and b >= k and c >= k) break;
            p += 1;
        }
        if(a < k or b < k or c < k) return -1;
        res = min(res, p + 1);
        int r = s.length() - 1;
        while(p >= 0) {
            if(s[p] == 'a') a -= 1;
            if(s[p] == 'b') b -= 1;
            if(s[p] == 'c') c -= 1;
            while(a < k or b < k or c < k) {
                if(s[r] == 'a') a += 1;
                if(s[r] == 'b') b += 1;
                if(s[r] == 'c') c += 1;
                r -= 1;
            }
            if(a >= k and b >= k and c >= k) {
                res = min(res,p + (int)s.length() - r - 1);
            }
            p -= 1;
        }
        return res;
    }
};