Given two strings s1 and s2 of the same length, return true if some permutation of s1 can break some permutation of s2, or if some permutation of s2 can break some permutation of s1. Otherwise, return false.

A string x can break a string y (both of length n) if x[i] >= y[i] in alphabetical order for every index i where $0 \leq i < n$.

Constraints:

• s1.length $== n$

• s2.length $== n$

• $1 \leq n \leq 10^5$

• s1 and s2 consist only of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.