We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. Pangrams
  5. Discussions

Pangrams

  • codertoaster
     + 6 comments

    That's way more complex than it needs to be. Try this. This can be optimized even more but I'm a lazy man. Lazy men dont optimize once we pass all test cases.

    Scanner in=new Scanner(System.in);
String s=in.nextLine();
int letters[]=new int[26];
boolean flag=true;
s=s.toLowerCase();
for(int i=0;i<s.length();i++)
{
    if(s.charAt(i)!=' ')
        letters[s.charAt(i)-'a']++;
}
for(int i=0;i<26;i++)
{
    if(letters[i]<1)
    {
        flag=false;
        System.out.print("not pangram");
        break;
    }
}
if(flag)
{
    System.out.print("pangram");
}