Monday 16 February 2015

Hackerrank 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 a pangram. ( 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.

Source Code:

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    char arr[10000];
    int a[150]={0};
    for(int i =0;arr[i]!='\0';i++){
        char t;
        t = tolower(arr[i]);
        int n = t;
    int flag = 1;
    for(int i = 97;i<123;i++){
            flag = 0;
    if(flag == 1)
        cout<<"not pangram"<<endl;
    return 0;

** The above solution is my own code and it may not be the optimal solution or optimal way to approach the problem but it passes all the testcases in Hackerrank. So if you have any optimal approaches feel free to paste the code as the comment below..... :) :) :)


Post a Comment