Pangrams


Problem Statement :


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

s =  "The quick brown fox jumps over a lazy dog"

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

0   <=  length of s  <=  10^3


Sample Input

Sample Input 0

We promptly judged antique ivory buckles for the next prize


Sample Output 0

pangram



Solution :



title-img


                            Solution in C :

In  C++  :







#include <bits/stdc++.h>
using namespace std;
int main()
{
    string a; getline(cin, a);map <char,int> he;
    for (int g=0;g<a.length(); g++)
    {
        if (a[g]>='A' && a[g]<='Z')
        {
            a[g]=char(a[g]-'A'+'a');
            he[a[g]]++; 
        }
        if (a[g]>='a' && a[g]<='z')
        {
            he[a[g]]++; 
        }
    }
    for (int g=0; g<26; g++)
    {
        if (!he[char('a'+g)])
        {
            cout << "not pangram"; return 0; 
        }
    }cout << "pangram"; 
    return 0; 
    
}








In  Java  :





import java.io.*;
import java.util.*;

public class Solution {
    public static boolean isPangram(String s) {
        boolean[] isInside = new boolean[26];
        for (char c : s.toCharArray()) {
            if (Character.isLetter(c)) {
                isInside[Character.toLowerCase(c)-'a'] = true;
            }
        }
        for (boolean b : isInside) {
            if (!b) return false;
        }
        return true;
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        if (isPangram(s)) System.out.println("pangram");
        else System.out.println("not pangram");
    }
}








In  C :





#include <stdio.h>
char s[10000];
int main()
    {
    gets(s);
    int f[300]={0},ans=0,i;
    int l=strlen(s);
    for(i=0;i<l;i++)
        {
        if(s[i]==' ')
            continue;
        if(s[i]>='a')
            s[i]=s[i]-('a'-'A');
        if(!(f[s[i]]++))
            ans++;
      
    }
     if(ans!=26)
         printf("not ");
         printf("pangram\n");
    return 0;
}








In   Python3 :





s = input()
alpha_set = set(char for char in s.lower() if char.isalpha())
print("pangram" if len(alpha_set) == 26 else "not pangram")
                        








View More Similar Problems

Poisonous Plants

There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plan

View Solution →

AND xor OR

Given an array of distinct elements. Let and be the smallest and the next smallest element in the interval where . . where , are the bitwise operators , and respectively. Your task is to find the maximum possible value of . Input Format First line contains integer N. Second line contains N integers, representing elements of the array A[] . Output Format Print the value

View Solution →

Waiter

You are a waiter at a party. There is a pile of numbered plates. Create an empty answers array. At each iteration, i, remove each plate from the top of the stack in order. Determine if the number on the plate is evenly divisible ith the prime number. If it is, stack it in pile Bi. Otherwise, stack it in stack Ai. Store the values Bi in from top to bottom in answers. In the next iteration, do the

View Solution →

Queue using Two Stacks

A queue is an abstract data type that maintains the order in which elements were added to it, allowing the oldest elements to be removed from the front and new elements to be added to the rear. This is called a First-In-First-Out (FIFO) data structure because the first element added to the queue (i.e., the one that has been waiting the longest) is always the first one to be removed. A basic que

View Solution →

Castle on the Grid

You are given a square grid with some cells open (.) and some blocked (X). Your playing piece can move along any row or column until it reaches the edge of the grid or a blocked cell. Given a grid, a start and a goal, determine the minmum number of moves to get to the goal. Function Description Complete the minimumMoves function in the editor. minimumMoves has the following parameter(s):

View Solution →

Down to Zero II

You are given Q queries. Each query consists of a single number N. You can perform any of the 2 operations N on in each move: 1: If we take 2 integers a and b where , N = a * b , then we can change N = max( a, b ) 2: Decrease the value of N by 1. Determine the minimum number of moves required to reduce the value of N to 0. Input Format The first line contains the integer Q.

View Solution →