BETA

Submissions : 838 Accuracy :

19.33

Longest Common Prefix in an Array
       

Given a array of n strings, find the longest common prefix among all strings present in the array.

Input:
The first line of the input contains an integer T which denotes the number of test cases to follow. Each test case contains an integer n. Next line has space separated n strings. 

Output:
Print the longest common prefix as a string in the given array. If no such prefix exists print "-1"(without quotes).

Constraints:
1<=T<=100
1<=n<=100
1<=|S|<=100

Example:
Input:

2
4
geeksforgeeks geeks geek geezer
3
apple ape april

Output:
gee
ap

**For More Examples Use Expected Output**


Contributor: Shashwat Jain

Set Default Code

					   
Result:
It is recommended to test your code before clicking 'Submit' button!



                   



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.