C++ || 0ms || Faster Than 100% || O(1) Space || Easiest Solution
\nclass Solution {\npublic:\n    bool areAlmostEqual(string s1, string s2) {\n        \n        if(s1 == s2)\n            return true;\n        int count = 0;\n
\nclass Solution {\npublic:\n    bool areAlmostEqual(string s1, string s2) {\n        \n        if(s1 == s2)\n            return true;\n        int count = 0;\n        int pos1 = -1 , pos2 = -1; \n        \n        for(int i = 0 ; i< s1.length() ; i++)\n        {\n            if(s1[i] != s2[i])\n            {   \n                count++;\n                if(count == 1)\n                pos1 = i;\n                else if(count == 2)\n                pos2 = i;\n               else if(count >= 3)\n               return false;\n            }\n            \n        }\n        if(count == 1)\n            return false;\n        \n        cout<<pos1<<" "<<pos2<<endl;\n        \n        swap(s1[pos1] , s1[pos2]);\n         if(s1 == s2)\n            return true;\n        return false;\n        \n        \n    }\n};\n\n\n//Pls Upvote is you like it \n\n\n![image](https://assets.leetcode.com/users/images/09d69608-3f50-4e3f-8b4f-497d54ff95e6_1659680034.7031748.png)\n
['C']