Python 3   ||   1 line,  sets  ||   T/S:  98%  /  94%
\nclass Solution:\n    def canBeEqual(self, s1: str, s2: str) -> bool:\n\n        return ({s1[0], s1[2]} == {s2[0], s2[2]} and\n                {s1[1], s1[3]} =
```\nclass Solution:\n    def canBeEqual(self, s1: str, s2: str) -> bool:\n\n        return ({s1[0], s1[2]} == {s2[0], s2[2]} and\n                {s1[1], s1[3]} == {s2[1], s2[3]})\n```\n[https://leetcode.com/problems/check-if-strings-can-be-made-equal-with-operations-i/submissions/](http://)l\n\nI could be wrong, but I think that time complexity is *O*(1) and space complexity is *O*(1).
['Python3']