Hack! Just for fun
Just a hackCode
Just a hack

# Code
```python3 []
class Solution:
    def hasSameDigits(self, s: str) -> bool:
        n = len(s) - 2
        first, second = 0, 0
        c = [1]
        coeff = 1 

        for k in range(n + 1):
            mod_coeff = coeff % 10
            first = (first + mod_coeff * (ord(s[k]) - ord('0'))) % 10
            second = (second + mod_coeff * (ord(s[k + 1]) - ord('0'))) % 10

            if k < n//2 :
                if coeff % 10000000 == 0:
                    coeff = 0
                else:
                    coeff = coeff * (n - k) // (k + 1) if k < n else 1 
                c.append(coeff)
            else:
                coeff = c[n - 1 - k]
                c.append(coeff)


        # print(c[:15])
        # print(c[-15:])
        return first == second
```
['Python3']