Pangrams

A pangram is a string that contains every letter of the alphabet. Given a sentence determine whether it is a pangram in the English alphabet. Ignore case. Return either pangram or not pangram as appropriate.

Example

The string contains all letters in the English alphabet, so return pangram.

Function Description

Complete the function pangrams in the editor below. It should return the string pangram if the input string is a pangram. Otherwise, it should return not pangram.

pangrams has the following parameter(s):

string s: a string to test

Returns

string: either pangram or not pangram

Input Format

A single line with string .

Constraints

Each character of ,

Sample Input

Sample Input 0

We promptly judged antique ivory buckles for the next prize

Sample Output 0

pangram

Sample Explanation 0

All of the letters of the alphabet are present in the string.

Sample Input 1

We promptly judged antique ivory buckles for the prize

Sample Output 1

not pangram

Sample Explanation 0

The string lacks an x.

Solution

#include <bits/stdc++.h>

using namespace std;

* Complete the 'pangrams' function below.

* The function is expected to return a STRING.

* The function accepts STRING s as parameter.

string pangrams(string s) {

int arr[26] = { 0 };

for (char& c : s) {

if (c >= 97 && c <= 122) arr[c - 97] = 1;

else if (c >= 65 && c <= 90) arr[c - 65] = 1;

}

for (int i = 0; i < 26; i++)

if (arr[i] == 0) return "not pangram";

return "pangram";

}

int main()

{

ofstream fout(getenv("OUTPUT_PATH"));

string s;

getline(cin, s);

string result = pangrams(s);

fout << result << "\n";

fout.close();

return 0;

}

Comments