let str = "Guten Tag!" let alph = ["a", "b", "c", "d", "e", "f", "g", "h", "j", "k", "l", "m", "n", "o", "p", "q", "r", "x", "t", "u", "v", "w", "s", "y", "z"] var schtchik = 0 for index in str.characters.indices { for i in alph { if index = i { schtchik += 1 } } if schtchik > 26 { print("") } else { print("") } } Task with hackerrank.com You are given a string consisting of spaces and Latin letters. A string is called a pangram if it contains each of the 26 Latin letters at least once. Determine if a string is a pangram.
The question is how to solve it?