Check if a number is a Pangram or not

Check if a number is a Pangram or not

Given an integer N, the task is to check whether the given number is a pangram or not. 
Note: A Pangram Number contains every digit [0- 9] at least once.

Examples:

Input : N = 10239876540022
Output : Yes
Explanation: N contains all the digits from 0 to 9. Therefore, it is a pangram.

Input : N = 234567890
Output : No
Explanation: N doesn’t contain the digit 1. Therefore, it is not a pangram.

Set-based Approach: The idea is to use Sets to store the count of distinct digits present in N. Follow the steps below to solve the problem:

Below is the implementation of the above approach:

Python3

def numberPangram(N):                    num = str(N)                 setnum = set(num)                 if(len(setnum) == 10):                             return True     else:         return False          N = 10239876540022 print(numberPangram(N))

Output:

True

Time Complexity: O(log₁₀N * log(log₁₀N))
Auxiliary Space: O(1)

Hashing-based Approach: Follow the steps to solve the problem:

Below is the implementation of the above approach:

Python3

from collections import Counter    def numberPangram(N):                    num = str(N)                      frequency = Counter(num)                      if(len(frequency) == 10):                             return True     else:         return False          N =10239876540022 print(numberPangram(N))

Output:

True

Time Complexity: O(log₁₀N * log(log₁₀N))
Auxiliary Space: O(1)

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

Let's block ads! (Why?)

Original page link

Best Cool Tech Gadgets

Top favorite technology gadgets