You are given a string s consisting of numerical digits.

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

For each index i from $0$ to s.length $- 2$, calculate the sum of the digit at index i and the digit at index i + 1 modulo $10$. Then, create a new string formed by these calculated digits in order, and replace s with this new string.

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

Constraints:

• $3 \leq$ s.length $\leq 100$

• 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.