Replace the strings

You are given two strings $S$ and $T$ that consist of lower case Latin letters and both strings contain single '?'. You need to replace '?' with some lower case Latin letter in both strings not necessarily the same.

After that, you can apply the following operation on $S$ any number of times:

• Swap any two adjacent characters.

Your task is to determine if it is possible to make $S$ equal to $T$ if you replace '?' with a lower case Latin letter and apply the mentioned operation on $S$ any number of times.

Example:

Input:  str1="abc?", str2="abc?",n=4
Output: YES

Approach

Java

public class ReplaceStrings {
    public static void main(String args[])
    {
   
        String str1="abc?";
        String str2="abc?";
        int n=4;
            char a[]=str1.toCharArray();
            char b[]=str2.toCharArray();
            int i,c[][]=new int[2][26];
            for(i=0;i<n;i++)
            {
                if(a[i]!='?') c[0][a[i]-'a']++;
                if(b[i]!='?') c[1][b[i]-'a']++;
            }
 
            int d=0;
            for(i=0;i<26;i++)
            d+=Math.abs(c[0][i]-c[1][i]);
            if(d<3) System.out.println("YES");
            else System.out.println("NO");;
        
    }
}