whats wrong.. my output is good

yes, its worth good but i find the problem few seconds ago. HashMap was the problem. when i used this:

for (int i = 0; i < alfabet.size(); i++) {
        result.put(alfabet.get(i), Collections.frequency(tempCharArray, alfabet.get(i)));
    }

then i dont have alphabetically output. i dont know why but alfabet.get(i) put wrong letters -.^ my solution if somebody will need in future:

ArrayList<Character> tempCharArray = new ArrayList<>();

    for (int i = 0; i < lista.size(); i++) {
       char[] chars = lista.get(i).toCharArray();
        for (char c : chars) {
            tempCharArray.add(c);
        }
    }

    for (int i = 0; i < alfabet.size(); i++) {
        System.out.println(alfabet.get(i) + " " + Collections.frequency(tempCharArray, alfabet.get(i)));
        }
}

i thinked HashMap dont know polish letters like ł ą ę etc thats why HashMap put ł as first letter not "a". but its still strange because when i print "alfabet" then the first letter is "a" not "ł" so i dont know why alfabet.get(i) put "ł" when i start from 0 index -.^

HashMaps don't store things in the order you put objects into them. This is because they create a hash code for every object entered and then use that to determine the slot to put it in. Maps and Sets don't store data in a straight line either, such as Lists. If you imagine that each index in a list is a slot, a List would just have slot 0 through the items in the list. Maps and Sets have these slots, but also sub slots. The data can be stored in any one of the slots depending on the hash code, and then each slot can have more than 1 object in its sub slots. So: A List would look like this (where each number here would represent any random object): [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] Where Maps and Sets the data would look more like this: [1, 4, 5, 9] 10 3 6 2 7 8 Just like in my example, the data isn't stored equally in sets and maps, it all depends on the hash code. This means that when looping through the values the data will be pulled out depending on its place in the Set/Map, and not on the order that it is put in. The upside is that you get far better performance using maps and sets over lists. Imagine if you wanted to find the object 6 in the two examples above. - In the list (from above) you would have to check each index in turn. So first (index 0)1 is checks, it isn't 6 so then check 2, it isn't 6, so then do the same for 3, 4, 5, and finally find six. - in the map/set you would get the hashcode for 6, determine the object is in the 3rd slot (index 2), check 5, find out it isn't 6, move down one and find 6. When we are talking about millions of objects being stored, the time saved accessing/finding an object is quite considerable using Maps/Sets.