HACKER RANK Algorithm Strings Challenges - Pangrams Solution.'C'

Algorithm Strings Challenges - Pangrams Solution

Problem Statement

Roy wanted to increase his typing speed for programming contests. So, his friend advised him to type the sentence "The quick brown fox jumps over the lazy dog" repeatedly, because it is apangram. (Pangrams are sentences constructed by using every letter of the alphabet at least once.)

After typing the sentence several times, Roy became bored with it. So he started to look for other pangrams.

Given a sentence s, tell Roy if it is a pangram or not.

Input Format Input consists of a line containing s.

Constraints
Length of s can be at most 103 (1≤|s|≤103) and it may contain spaces, lower case and upper case letters. Lower case and upper case instances of a letter are considered the same.

Output Format Output a line containing pangram if s is a pangram, otherwise output not pangram.

Sample Input #1

We promptly judged antique ivory buckles for the next prize    

Sample Output #1

pangram

Sample Input #2

We promptly judged antique ivory buckles for the prize    

Sample Output #2

not pangram

Explanation
In the first test case, the answer is pangram because the sentence contains all the letters of the English alphabet.

Solution:

#include <stdio.h>
#include <string.h>
#include <ctype.h>

int main(){
 int array[26] = {0};
 char c = 0;
 while ((c = getchar()) != EOF){
  if(c >= 'A' && c <= 'Z') {
   c = c - 'A'+ 'a';
   array[c-97]++;
  }
  else if (c >= 'a' && c <= 'z'){
   array[c-97]++;
  }
 }
 int i;
 for (i=0;i<26;i++){
  if(array[i] == 0){
   printf("%s", "not pangram");
   return 0;
  }
 }
 printf("%s", "pangram");
    return 0;
}

Thanks for Visiting, Hope this helps you....

Copyright © 2015 HackerRank.
All Rights Reserved