You are given a string s of length n and an integer k.

A cyclic rotation of s is obtained by shifting the characters of s cyclically by some number of positions.

The score of a string is defined as the number of indices i where $0 \le i < n - 1$ such that the character at index i is equal to the character at index $i + 1$.

Return the number of cyclic rotations of s that have a score strictly equal to k.

Constraints:

• $2 \le n ==$ s.length $\le 100$

• s only consists of lowercase English letters.

• $0 \le k \le n - 1$

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.