I applied for an iOS Engineer role. Interviewer asked basic Swift questions first then I was asked to solve the following question ONLY in Swift
A pangram contains every letter of the English alphabet. For example: pack my box with five dozen liquor jugs contains all the letters ‘a’ through ‘z’. Given a list of strings made of lowercase English letters and whitespace, determine whether each is a pangram. Create an answer string where each position contains a 1 if the tested string is a pangram, or 0 if it is not. If strings = [‘pack my box with five dozen liquor jugs’, ‘this is not a pangram’], then the response string is ‘10’. The first string is a pangram, and the second is not.
Function Description
Complete the function checkPangram in the editor below. The function must return a string where each position represents the results of a test. Use ‘1’ for true and ‘0’ for false.
checkPangram has the following parameter(s):
strings[strings[0],…strings[n-1]]: an array of strings
Constraints
- 1 ≤ n ≤ 100
- Each string strings[i] (where 0 ≤ i < n) is composed of lowercase letters and spaces.
- 1 ≤ |strings[i]| ≤ 105