2 DEC 02 December Check if it is possible to convert one string into another with given constraints

class Solution
{
public:
    int isItPossible(string S, string T, int M, int N)
    {
        // code here
        if (count(S.begin(), S.end(), '#') != count(T.begin(), T.end(), '#'))
            return false;
        int i = 0, j = 0;
        while (i < M and j < N)
        {
            while (i < M and S[i] == '#')
                i++;

            while (j < N and T[j] == '#')
                j++;

            if ((i < M and j < N) and ((S[i] != T[j]) or (S[i] == 'A' and i < j) or (S[i] == 'B' and i > j)))
                return false;
            i++;
            j++;
        }
        return 1;
    }
};