You are given a string s consisting of numerical digits.

You perform the following operation repeatedly until the length of s becomes $2$:

• Create a new string of length s.length $- 1$, where the digit at index i is calculated as (s[i] + s[i + 1]) modulo $10$.

• Replace s with this newly created string.

Return true if the two remaining digits in s are identical, or false otherwise.

Constraints:

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

• s consists of only digits.

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.