Description

Some file managers sort filenames taking into account case of the letters, others compare strings as if all of the letters are of the same case. That may lead to different ways of filename ordering.

Call two filenames an unstable pair if their ordering depends on the case.

To compare two filenames a and b, find the first position i at which a[i] ≠ b[i]/. If a[i] < b[i], then a < b. Otherwise a > b. If such position doesn't exist, the shorter string goes first.

Given two filenames, check whether they form an unstable pair.

Example

• For filename1 = "aa" and filename2 = "AAB", the output should be isUnstablePair(filename1, filename2) = true.

Because "AAB" < "aa", but "AAB" > "AA".

• For filename1 = "A" and filename2 = "z", the output should be isUnstablePair(filename1, filename2) = false.

Both "A" < "z" and "a" < "z".

Input/Output

• [execution time limit] 4 seconds (js)

• [input] string filename1

  A non-empty string of English letters and digits.
  

  Guaranteed constraints:
  1 ≤ filename1.length ≤ 10.

• [input] string filename1

  A non-empty string of English letters and digits. It’s guaranteed that there is no ambiguity, i.e. even being considered in the same case strings are never equal.
  

  Guaranteed constraints:
  1 ≤ filename2.length ≤ 10.

• [output] boolean

  • true if filename1 and filename2 form an unstable pair, false otherwise.

[JavaScript (ES6)] Syntax Tips

1
2
3
4
5
6
// Prints help message to the console
// Returns a string
function helloWorld(name) {
console.log("This prints to the console when you Run Tests");
return "Hello, " + name;
}