When you love recursion too much
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
```python3 []
class Solution:
    def canBeEqual(self, s1: str, s2: str) -> bool:        
        if s1==s2:
            return True 
        t = 0
        def recur(s1,s2,t):
            if t==2:
                return s1==s2
            if s1[t] != s2[t]:
                s1[t],s1[t+2]=s1[t+2],s1[t]
            return recur(s1,s2,t+1)
        s1 = list(s1)
        s2 = list(s2)
        return recur(s1,s2,0)
```
['Recursion', 'Python3']