C# simple solution | 1ms beats 100%
Intuition\nSince s1 and s2 both have same length 4, i=j-2 means we can only swap (s[0], s[2]) and (s[1], s[3]). So things get simple if we compare if string "s1
# Intuition\nSince s1 and s2 both have same length 4, i=j-2 means we can only swap (s[0], s[2]) and (s[1], s[3]). So things get simple if we compare if string "s1[0]s[2]" equal "s2[0]s2[2]" or "s2[2]s2[0]"\n\n![image.png](https://assets.leetcode.com/users/images/c77a05a9-0a82-46dd-8ab6-331172fae867_1729326541.5396566.png)\n\n\n# Code\n```csharp []\npublic class Solution {\n    public bool CanBeEqual(string s1, string s2) {\n        if($"{s1[0]}{s1[2]}"!=$"{s2[0]}{s2[2]}" && $"{s1[0]}{s1[2]}"!=$"{s2[2]}{s2[0]}")\n            return false;\n        if($"{s1[1]}{s1[3]}"!=$"{s2[1]}{s2[3]}" && $"{s1[1]}{s1[3]}"!=$"{s2[3]}{s2[1]}")    \n            return false;\n        return true;\n    }\n}\n```
['C#']