Easy JAVA Solution || Beats 100%
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public boolean hasSameDigits(String s) {
        int n = s.length();
        int[] d = new int[n];
        for (int i = 0; i < n; i++) d[i] = s.charAt(i) - '0';
        while (n > 2) {
            for (int i = 0; i < n - 1; i++) d[i] = (d[i] + d[i + 1]) % 10;
            n--;
        }
        return d[0] == d[1];
    }
}
```
['Java']