CheckIfAStringCanBreakAnotherString.cpp

/*
Given two strings: s1 and s2 with the same size, check if some permutation of string s1 can break some permutation of string s2 or vice-versa. In other words s2 can break s1 or vice-versa.
A string x can break string y (both of size n) if x[i] >= y[i] (in alphabetical order) for all i between 0 and n-1.

Example 1:
Input: s1 = "abc", s2 = "xya"
Output: true
Explanation: "ayx" is a permutation of s2="xya" which can break to string "abc" which is a permutation of s1="abc".

Example 2:
Input: s1 = "abe", s2 = "acd"
Output: false
Explanation: All permutations for s1="abe" are: "abe", "aeb", "bae", "bea", "eab" and "eba" and all permutation for s2="acd" are: "acd", "adc", "cad", "cda", "dac" and "dca". However, there is not any permutation from s1 which can break some permutation from s2 and vice-versa.

Example 3:
Input: s1 = "leetcodee", s2 = "interview"
Output: true
*/

class Solution {
public:
    bool checkIfCanBreak(string s1, string s2) {
        int n=s1.size(), m=s2.size();
        if(n!=m) return false;
        sort(s1.begin(),s1.end());
        sort(s2.begin(),s2.end());
        if(s1==s2) return true;
        bool counter1=true, counter2=true;
        for(int i=0;i<n;i++){
            if(s1[i]-s2[i]>0) counter1=false;
            else if(s2[i]-s1[i]>0) counter2=false;
        }
    return (counter1 or counter2);
    }
};