O(1) Simple Beats 95% runtime, 65% memory
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```java []\nclass Solution {\n    public boolean canBeEqual(String s1, String s2) {\n        char c11 = s1.charAt(0), c12 = s2.charAt(0);\n        char c21 = s1.charAt(1), c22 = s2.charAt(1);\n        char c31 = s1.charAt(2), c32 = s2.charAt(2);\n        char c41 = s1.charAt(3), c42 = s2.charAt(3);\n\n        if (c11 != c12 && c11 != c32) return false;\n        if (c21 != c22 && c21 != c42) return false;\n        if (c31 != c12 && c31 != c32) return false;\n        if (c41 != c22 && c41 != c42) return false;\n\n        return true;\n    }\n}\n```
['Java']