Given a string S of lowercase aplhabets, check if it is isogram or not. An Isogram is a string in which no letter occurs more than once.
The first line of input contains an integer T denoting the number of test cases. T testcases follow. Each test case consist of one string in 'lowercase' only, in a separate line.
For each testcase, in a new line, Print 1 if string is Isogram else print 0.
1 <= T <= 100
1 <= |S| <= 103
Testcase 2: geeks is not an isogram as 'e' appears twice. Hence we print 0.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.