Easy python solution
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:
        #index pairs: 1 & 3, 0 & 2
        if s1 == s2:
            return True
        s1 = list(s1)
        s2 = list(s2)
        if s1[0] == s2[0]:
            s2[1], s2[3] = s2[3], s2[1]
            return s1 == s2

        elif s1[1] == s2[1]:
            s2[0], s2[2] = s2[2], s2[0]
            return s1 == s2

        else:
            s2[1], s2[3] = s2[3], s2[1]
            s2[0], s2[2] = s2[2], s2[0]
            return s1 == s2
```
['Python3']