Smart :D

man I used math.floor() to get the answer just to realise that could've done this just divided it and type casted into int

it also gives true for 0,0,2

Im in love with this line <3
Nice work :D

actually, that's a pretty good insight.

wat hahahahahah

Hi-End solution, at least Hi-Fi++. :)

hi guy! could you codding Minecraft in one line too? :P

nice

I agree, my first thought was to include non-english characters.

clever

unreadble for me

I like this solution. However the alphabet count > 1. So Character::isAlphabetic is not reliable way to filter distinct alphabet characters. Let say sentence has one or more letters from Greece of French. This solution gives wrong result in such case.

It'll be more efficient to use static methods of() and ofEntries() instead of anonymous class to initialize the map.

And avoid using stack, it's a legacy class.

this solution made me realize that i'm a f idiot haha

Beautiful I guess is not the best solution in complexity terms but I love it! Thanks for inspiring.