You are given a string s and an integer k.

Determine if there exists a substring of s of length $k$ that satisfies all of the following conditions:

• The substring consists of exactly $1$ distinct character.

• If a character immediately precedes the substring, it must be different from the character inside the substring.

• If a character immediately succeeds the substring, it must be different from the character inside the substring.

Return true if such a substring exists, or false otherwise.

Constraints:

• $1 \leq k \leq$ s.length $\leq 100$

• s consists of lowercase English letters only.

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.