c++

[Erasyl2rez]

You are given a set of sequences of characters without spaces (You are not allowed to use string).

The program should remove all non-letters, convert each letter to lowercase and check if it is isogram or not. An Isogram is a word in which no letter occurs more than once.



Each sequence is not longer than 40 characters.

(You must use dynamic arrays, functions, pointers)



Sample input:

4

*&8A0b!!]ba!.

9879fhifhw9!&H

7!r_Ace)CaR

0#hv8



Sample output:

abba - not isogram

fhifhwh - not isogram

racecar - not isogram

hv - isogram