What is problem??

Another way to solve this would be creating a private static method that returns the number of occurrences of a given character in a given word. Then you can loop through the alphabet...and for each word in the list of 10 words, call the private static method. For each iteration, you can print the alphabet the corresponding cumulative count.

Here is my Solution:- import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.HashMap; import java.util.Map; /* Number of letters */ public class Solution { public static void main(String[] args) throws Exception { BufferedReader reader = new BufferedReader(new InputStreamReader(System.in)); // Alphabet String abc = "abcdefghijklmnopqrstuvwxyz"; char[] abcArray = abc.toCharArray(); // Read in strings ArrayList<String> list = new ArrayList<>(); for (int i = 0; i < 10; i++) { String s = reader.readLine(); list.add(s.toLowerCase()); } String resultString=list.get(0); for (int i = 1; i <list.size() ; i++) { resultString=resultString.concat(list.get(i)); } HashMap<Character,Integer>map=new HashMap<>(); int count=0; char[]charArray=resultString.toCharArray(); for (int i = 0; i <abcArray.length ; i++) { for (int j = 0; j <charArray.length ;) { if (abcArray[i]==charArray[j]) { count++; j++; } else { j++; } } map.put(abcArray[i],count); count=0; } for (Map.Entry<Character,Integer>entry:map.entrySet()) { System.out.println(entry.getKey()+" "+entry.getValue()); } } }

for (Character c : alphabet ) { int count = 0; for (String i : list ) { for (int j = 0; j < i.length(); j++) { if (i.charAt(j) == c) { count++; } } } System.out.println(c+" "+count); }

import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.HashMap; /* Number of letters */ public class Solution { public static void main(String[] args) throws Exception { BufferedReader reader = new BufferedReader(new InputStreamReader(System.in)); HashMap<Short,Integer> counts = new HashMap<>(); // read 10 words for(int i = 0; i < 10; i++){ String word = reader.readLine().toLowerCase(); // convert word to lowercase countLetters(counts, word); // sends to method for count } // iterates through each lowercase letter according to ascii value for(int i = 97; i < 123;i++){ System.out.println((char)i + " " + (counts.containsKey((short)i) ? counts.get((short)i) : 0)); } } // counts each character and adds to hashmap for storage private static void countLetters(HashMap<Short, Integer> counts, String word) { char[] temp = word.toCharArray(); for (char x : temp){ if(counts.containsKey((short)x)) counts.replace((short)x,counts.get((short)x)+ 1); else counts.put((short)x,1); } } // write your code here }

Try this: create a new array that stores numbers. Then loop through the list that contains the words get each word from the list loop through the word, checking each character if it is contained in the alphabet list if yes, then get the index of that character from the alphabet list and use that index to increment the number array element by 1 that corresponds to that index. for clarity, see the code: int numbering[] = new int[26]; for (int i = 0; i < list.size(); i++) { String string = list.get(i); for (int j = 0; j < string.length() ; j++) if (alphabet.contains(string.charAt(j))) ++numbering[alphabet.indexOf(string.charAt(j))]; }

counts are wrong. I entered the strings: Enter, strings, from, the, keyboard, and, count, the, number, of and it output: a 2 - b 2 - c 1 - d 1 - e 1 - f 0 - g 1 - h 0 - i 0 - j 1 - k 0 l 3 - m 2 - n 2 - o 3 - p 2 - q 1 - r 3 - s 2 - t 2 - u 1 v 2 - w 1 - x 0 - y 2 - z 1 Some incorrect are z-1 (there are no z), y 2 (only 1 y) , t 2 ( there are 5 t's) I would recommend using a map<Short, Integer> instead of the two separate ArrayLists, as well as using the ascii table (#97-122 are a-z) instead of a char[].