You are given a $0$ indexed string hamsters where each character represents a position in a line:

• 'H' represents a hamster.

• '.' represents an empty space.

You may place food buckets on empty positions. A hamster situated at index i is fed if there is a food bucket placed at index $i - 1$ or index $i + 1$. A single food bucket placed at an empty space can feed hamsters on both its adjacent sides.

Return the minimum number of food buckets needed to feed all the hamsters, or $-1$ if it is impossible to feed every hamster.

Constraints:

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

• hamsters[i] is either 'H' or '.'.

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.