Simple and Easy User Friendly Code 
IntuitionThe problem asks to repeatedly sum adjacent digits modulo 10 until a two-digit number is obtained. Then, check if both digits are the same. A straightf
# Intuition
The problem asks to repeatedly sum adjacent digits modulo 10 until a two-digit number is obtained. Then, check if both digits are the same. A straightforward iterative approach seems suitable.

# Approach
1.  Iterate while the length of the input string `s` (or `num` in the code) is not 2.
2.  In each iteration, create a new string `num_str` by summing adjacent digits of the current string `num`, taking the result modulo 10, and appending it to `num_str`.
3.  Update `num` with `num_str`.
4.  After the loop terminates (when `num` has length 2), check if the first and second digits of `num` are equal.
5.  Return `True` if they are equal, `False` otherwise.

# Complexity
- Time complexity:
$$O(n^2)$$ where n is the length of the input string. In the worst case, each iteration reduces the length of the string by 1, and each iteration performs a linear scan of the string.

- Space complexity:
$$O(n)$$ where n is the length of the input string, due to the creation of the `num_str` in each iteration.
# Code
```python3
class Solution:
    def hasSameDigits(self, s: str) -> bool:
        num = s

        while len(num) != 2:
            num_str = ""
            for i in range(len(num) - 1):
                digit_sum = int(num[i]) + int(num[i+1])
                num_str += str(digit_sum % 10)
            num = num_str

        return num[0] == num[1]
['Python3']