CT808

Quartermaster and the Lex Order

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

The harbor bell rings at the indigo vats of Bluehollow; Quartermaster weighs the day's labels manifests and starts the calculations. Task: Compare s and t lexicographically: print -1 if s<t, 0 if s==t, 1 if s>t. Input format: Two lines: string s, then string t. Output format: Print -1, 0, or 1. Constraints: 1 <= |s|,|t| <= 53.

Example 1:

Input: tzmnwrtrsrbmzhtjaulcatxzqderdmhumeabfjpowh sncjmnrplsksoeekvsqwhjjpjtdjzzruzxjuox
Output: 1

Example 2:

Input: tjsbzcdscxkysnhyfxepxvlyazaicclxonjofifpzgaasyi xyzrkcwpindijdjvsqgtlhgnr
Output: -1

Example 3:

Input: wpvlvjrmziwtctmkylllrlarkdmqazkdshnkyywngnhmrcbtrgdig rbhksocqcsthjsdkztudzviqmihwjelgaqjwswgctamobwvnors
Output: 1

Constraints:

1 <= |s|,|t| <= 53.

Loading...
Test Cases:No test cases
No test cases available.
Quartermaster and the Lex Order - EASY Coding Problem | CodeTikki