nice solution took me sometimes but finale got it done

Great code

good solution, but it doesn't check for alpha, now we can pass not only letters!

For example this call in this solution findMissingLetter(['<','>']) return us '=' which is not a letter actually

Have thought in this direction, but had this test error:
“expected: java.util.Arrays$ArrayList<[]> but was: java.util.ArrayList<[]>”
Wierd...

In the filter() you can use only the second condition as it covers the first one as well.

hey thx for help and sorry for late reply

btw is this final solution?

That'll be a different problem and what do you think should be returned there? It's missing "m", "n", "q" and "t"

what if we have array where 2char are missing continusly like this one ['k','l','o','p','r','s','u']
if anyone know how to solve this pls help

O(n * log n)...
We can do better!!))

Good point)
I like your solution. I think PriorityQueue fits very well into the purpose of this kata.

I suggest you to improve your solution by removing the nested class.
WordFreq object doesn't buy you anything, you just duplicate the data from map entries.
Add them to the entries to the queue directly instead.

It is mentioned in the question that sorting should not be used. I would prefer heap over it.

It sure was a clever way, Also the loop runs one time less than all general solutions

Very nice, compact solution. Can you please explain the first collect operation? I am not following the logic of the groupingsBy with the identity and counting.