Check if a string is Isogram or not
Submissions: 3553   Accuracy:

43.87%

  Difficulty: Basic   Marks: 1
       

Given a word or phrase, check if it is isogram or not. An Isogram is a word in which no letter occurs more than once.

Input:

The first line of input contains an integer T denoting the number of test cases. Each test case consist of one strings in 'lowercase' only, in a separate line.
Output:

Print 1 if string is Isogram else print 0.
Constraints:

1 <= T <= 100

1 <= |S| <= 100
Example:

Input:

2

machine

geeks

Output:

1

0

Explanation:
For testcase 2: geeks is not an isogram as 'e' appears twice. Hence we print 0.

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Anuj Chauhan
Author: anuj0503


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

to report an issue on this page.