Close
Topic list
String Mania
EASY
5 mins
Strings
Topics (Covered in this problem)
Problem solved
Skill meter
Strings
-
-
Other topics
Problem solved
Skill meter
Matrices (2D Arrays)
-
-
-
-
Sorting
-
-
Binary Search
-
-
Stacks & Queues
-
-
Trees
-
-
Graph
-
-
Dynamic Programming
-
-
Greedy
-
-
Tries
-
-
Arrays
-
-
SQL
-
-
Binary Search Trees
-
-
Heap
-
-
Bit Manipulation
-
-
Solve problems & track your progress
Checkout your overall progress in every topic here
Become
Sensei
in DSA topics
Open the topic and solve more problems associated with it to improve your skills
Check out the skill meter for every topic
See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

# String Mania

Contributed by
Jaypal Mudaliyar
Easy
0/40
Avg time to solve 5 mins
Success Rate 95 %
Share

## Problem Statement

#### But Rohit has so many strings, so he doesn’t have time to go through all strings, So being his friend can you help him automate this process?.

##### EXAMPLE :
``````Input: ‘N’ = 3, ‘M’ = 4, ‘STR1’ = xyz, ‘STR2’ = abcd

Output: 1
In this case, ‘STR1[0]>STR2[0]’ hence ‘STR1’ is better than ‘STR2’. Hence the output will be ‘1’.
``````
Detailed explanation ( Input/output format, Notes, Constraints, Images )
##### Sample Input 1 :
``````2
1 3
a
abc
3 3
abz
abc
``````
##### Sample Output 1 :
``````-1
1
``````
##### Explanation Of Sample Input 1 :
``````For the first test case, ‘STR2’ is better than ‘STR1’, as they are the same until the ‘0th’ index and then string ‘STR1’ ends and as explained in the statement for ‘M>N’, the answer is ‘-1’.

Hence, the output will be: -1

For the second test case, ‘STR1’ is better than ‘STR2’, as they are the same until the ‘1st’ index and then ‘STR1[2]>STR2[2]’.

Hence, the output will be: 1
``````
##### Sample Input 2 :
``````3
2 3
ez
ehz
5 5
acefi
acefi
3 5
ags
agtaa
``````
##### Sample Output 2 :
``````1
0
-1
``````
Auto
Console