Please Login in order to post a comment
import math import os import random import re import sys
#
def pangrams(s): l=len(s) l1=[] for i in range (0,l): if(s[i]!=' ' and s[i] not in l1): l1.append(s[i]) l1.sort() l2=['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'] print(l1,"\n",l2) if (l1==l2): return "pangram" else: return "not pangram"
if name == 'main': fptr = open(os.environ['OUTPUT_PATH'], 'w')
s = input().upper() result = pangrams(s) this might help.... fptr.write(result + '\n') fptr.close()
My C# solution, if you think this could be improve even better, just let me know!
public static string pangrams(stirng s) { string isPangram = string.Join(string.Empty, s.ToUpper().Replace(" ", "").Distinct()); return isPangram.Length == 26 ? "paragram" : "not paragram"; }
my JavaScript solution
function pangrams(s) { const isPangram = s => new Set(s.toLowerCase().match(/[a-z]/g)).size === 26 ? "pangram" : "not pangram"; return isPangram(s); }
Python 3 solutions:
import string import typing ALPHABET: set[str] = {*string.ascii_uppercase} def pangrams(s: str) -> typing.Literal["pangram", "not pangram"]: return "pangram" if {*s.upper()} >= ALPHABET else "not pangram" def pangrams(s: str) -> typing.Literal["pangram", "not pangram"]: return "not pangram"[4 * (len({*s.upper().replace(" ", "")}) == 26) :] pangrams=lambda s:(len({*s.upper()}-{" "})<26)*"not "+"pangram" # 63
def pangrams(s): # Write your code here if not (set(string.ascii_lowercase) - set(s.lower())): return "pangram" return "not pangram"
Seems like cookies are disabled on this browser, please enable them to open this website
An unexpected error occurred. Please try reloading the page. If problem persists, please contact support@hackerrank.com
!/bin/python3
import math import os import random import re import sys
#
Complete the 'pangrams' function below.
#
The function is expected to return a STRING.
The function accepts STRING s as parameter.
#
def pangrams(s): l=len(s) l1=[] for i in range (0,l): if(s[i]!=' ' and s[i] not in l1): l1.append(s[i]) l1.sort() l2=['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'] print(l1,"\n",l2) if (l1==l2): return "pangram" else: return "not pangram"
if name == 'main': fptr = open(os.environ['OUTPUT_PATH'], 'w')
My C# solution, if you think this could be improve even better, just let me know!
my JavaScript solution
Python 3 solutions: