Super easy solution -> 0 ms Beats 100.00%
IntuitionApproachComplexity

Time complexity:
O(1)


Space complexity:
O(1)

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

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

# Complexity
- Time complexity:
O(1)

- Space complexity:
O(1)

# Code
```java []
class Solution {
    public boolean canBeEqual(String s1, String s2) {

        if (s1.equals(s2)) return true;

        return ((s1.charAt(0) == s2.charAt(0) && s1.charAt(2) == s2.charAt(2)) || (s1.charAt(2) == s2.charAt(0) && s1.charAt(0) == s2.charAt(2)))
                && ((s1.charAt(1) == s2.charAt(1) && s1.charAt(3) == s2.charAt(3)) || (s1.charAt(1) == s2.charAt(3) && s1.charAt(3) == s2.charAt(1)));
    }
}
```
['Java']