You are given a digit string s.

A string is called semi repetitive if there is at most one adjacent pair of identical digits within it.

Return the length of the longest semi repetitive substring found in s.

Constraints:

• $1 \leq$ s.length $\leq 50$

• '0' $\leq$ s[i] $\leq$ '9'

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.