@Discidee this won't work for this common case "qwertyuiopasdfghjklzxcvbnm" where it's should be True but it's not existed in kata's tests

you are just verify if the length of string is more than 27 and that's not what this kata wants you to do however it's working properly because all True cases have length higher than 27 that's why your code is working

@sztssp

Maybe perhaps it won't be for a larger data! (like an entire paragraph)!!! Would be a good experiment to test it!

nah, in set u have to add more conditions like removing non alphanumerical characters like question marks etc

Actually, I'm rather lazy than dedicated :D

i would hire him, at least he is dedicated

using set will fix that

Totally agree. It's also possible to use set(arr) too. The complexity will eventually be O(n) compared to quadradic O(n^2) in this solution.

could u pls explain how your code exactly works , i tried it in vs code and returned an error