Most easy approach using char->int approach
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) {
        while(s.length()>2){
            StringBuilder str = new StringBuilder();
            for(int i = 0 ; i<s.length()-1 ; i++){
                int a = Character.getNumericValue(s.charAt(i));
                int b = Character.getNumericValue(s.charAt(i+1));
                int c = (a+b)%10;
                str.append(c);
            }
            s = str.toString();
        }
        if(s.charAt(0) == s.charAt(1)) return true;
        return false;
    }
}
```
['Java']