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.
s1.length == ns2.length == n1 <= n <= 10^5s1 = "abc", s2 = "xya"trues1 = "abe", s2 = "acd"falses1 = "leetcodee", s2 = "interview"true