0
How to find if a given sentence is a Pangram or not
2 Réponses
+ 1
make a array of 26 integers/boolean what u like.
initially set all to zero /false. let this array be x[26].
now check for each chqracter in sentemce.
suppose u store every character in a[i].
then u must check if its space.
if its space or special character then i++.//y consider them??😂😂
if its uppercase then make x[a[i]-'a']=true.
if its lowercase then make x[a[i]-'A']=true.
after accesing full sentence.
now in order to have pangram we must have all x true/1.
if any of them false then not pangram.
now.implement it
0
give a range of ANSI value