# 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 :

```                            ```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;
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;
int main()
{
gets(s);
int f={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")```
```

## Merge two sorted linked lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. Example headA refers to 1 -> 3 -> 7 -> NULL headB refers to 1 -> 2 -> NULL The new list is 1 -> 1 -> 2 -> 3 -> 7 -> NULL. Function Description C

## Get Node Value

This challenge is part of a tutorial track by MyCodeSchool Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. Example head refers to 3 -> 2 -> 1 -> 0 -> NULL positionFromTail = 2 Each of the data values matches its distance from the t

## Delete duplicate-value nodes from a sorted linked list

This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty. Example head refers to the first node in the list 1 -> 2 -

## Cycle Detection

A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example head refers 1 -> 2 -> 3 -> NUL The numbers shown are the node numbers, not their data values. There is no cycle in this list so return 0. head refer

## Find Merge Point of Two Lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the head nodes of 2 linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share

## Inserting a Node Into a Sorted Doubly Linked List

Given a reference to the head of a doubly-linked list and an integer ,data , create a new DoublyLinkedListNode object having data value data and insert it at the proper location to maintain the sort. Example head refers to the list 1 <-> 2 <-> 4 - > NULL. data = 3 Return a reference to the new list: 1 <-> 2 <-> 4 - > NULL , Function Description Complete the sortedInsert function