Pangram Check

Asked in:
Cognizant
IBM

Problem Description

Given a sentence represented as an array A of strings that contains all lowercase alphabets.
Chech if it is a pangram or not.
A pangram is a unique sentence in which every letter of the lowercase alphabet is used at least once.

Problem Constraints

1 <= |A| <= 10⁵
1 <= |A_i|<= 5

Input Format

Given an array of strings A.

Output Format

Return an integer.

Example Input

Input 1:

A = ["the", "quick", "brown", "fox", "jumps", "over", "the", "lazy", "dog"]

Input 2:

A = ["bit", "scale"]

Example Output

Output 1:

Output 2:

Example Explanation

Explanation 1:

We can check that all english alphabets are present in given sentence.

Explanation 2:

Not all english alphabets are present.

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.

Start solving Pangram Check on Interview Code Editor

Hints

Hint 1
Solution Approach
Complete Solution

Asked In:

Pangram Check

Discussion