Scanner in = new Scanner(System.in); String S = in.next(); StringBuilder abcStr = new StringBuilder(); char letter; for (int i=0; i<S.length(); i++){ letter = S.toLowerCase().charAt(i); if (S.toLowerCase().contains(letter)==false) //letter does not exist in the S string abcStr.append(letter); }

String str = "abababababa"; char letter = 'a'; int index = str.indexOf(letter); if(index >= 0 ) { System.out.println("true"); }

import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class SolutionPangrams { public static void main(String args) { Scanner in = new Scanner(System.in); String S = in.nextLine(); StringBuilder abcStr = new StringBuilder(); Character letter; for (int i=0; i<S.length(); i++){ letter = S.toLowerCase().charAt(i); if (Character.isAlphabetic((int)letter)==false) continue; //skip spaces. if (abcStr.toString().indexOf(letter)==-1) //letter does not exist in the abcStr string abcStr.append(letter); } if (abcStr.length()==26) System.out.println("pangram"); else System.out.println("not pangram"); } }