1616

class Solution {
public:

    bool ispal(string& s, int i, int j){
        while(i<j && s[i] == s[j])
            i++, j--;
        return i>=j;
    }

    bool check(string& a, string& b){
        int i=0, j=a.length()-1;
        while(i<j && a[i] == b[j])
            i++, j--;
        return ispal(a, i, j) || ispal(b, i, j);
    }

    bool checkPalindromeFormation(string a, string b) {
        return check(a, b) || check(b, a);
    }
};