✔️ C++ solution
Here\'s the solution:\n\nC++ []\nclass Solution {\npublic:\n    bool areAlmostEqual(string s1, string s2) {\n        if (s1==s2) return true;\n        vector<in
Here\'s the solution:\n\n``` C++ []\nclass Solution {\npublic:\n    bool areAlmostEqual(string s1, string s2) {\n        if (s1==s2) return true;\n        vector<int> places;\n\n        for (int i=0; i<s1.length(); ++i) {\n            if (s1[i] != s2[i]) places.push_back(i);\n        }\n\n        if (places.size() == 2) {\n            char s = s1[places[0]];\n            s1[places[0]] = s1[places[1]];\n            s1[places[1]] = s;\n        }\n\n        if (s1==s2) return true;\n\n        return false;\n    }\n};\n```\n\n*Upvote solution if you like it*\n\n## My GitHub: https://github.com/crimsonKn1ght
['C++']