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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1433. Check If a String Can Break Another String

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact