You are given a string s consisting of the characters 'a', 'b', and 'c', and an integer k.

In each minute, you can choose to take either the leftmost character or the rightmost character of s.

Return the minimum number of minutes needed to take at least k of each character 'a', 'b', and 'c', or return $-1$ if it is not possible to obtain at least k of each character.

Constraints:

• $1 \leq$ s.length $\leq 10^5$

• s consists of only the letters 'a', 'b', and 'c'.

• $0 \leq$ k $\leq$ s.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.