Leetcode 1433. Check If a String Can Break Another String

Given two equal-length lowercase strings, determine whether some permutation of one can have every character >= the corresponding character of some permutation of the other (or vice versa). This is equivalent to checking if the two strings' sorted character sequences result in one sequence that dominates the other at every index.