Python3 || 4 lines,  pairwise and map     ||  T/S: 98% / 95%
Here's the plan:

We map the string of digits to a list of single digit integers.


We use pairwise to determine the pair sums, and we use iteration to continue
Here's the plan:
1. We map the string of digits to a list of single digit integers.

2. We use `pairwise` to determine the pair sums, and we use iteration to continue the process until the length of the list is exactly two.
3. We check whether the two list elements are equal.
```python3 []
class Solution:
    def hasSameDigits(self, s: str) -> bool:

        digits = map(int,s)                             # <-- 1
        
        for _ in range(len(s) - 2):                     # <-- 2
            digits = [(x+y)%10 for x, y in pairwise(digits)]
            
        return digits[0] == digits[1]                   # <-- 3
```
[https://leetcode.com/problems/check-if-digits-are-equal-in-string-after-operations-i/submissions/1552481786/](https://leetcode.com/problems/check-if-digits-are-equal-in-string-after-operations-i/submissions/1552481786/)


I could be wrong, but I think that time complexity is *O*(*N*) and space complexity is *O*(*N*), in which *N* ~ `len(s)`.
['Python3']