Thx! Good old days of fun programming.

I'm digging your check4uniqueness helper fxn!

You can start looking at this pages to learn about Big O notation and measure it on your code:

https://www.freecodecamp.org/news/big-o-notation-why-it-matters-and-why-it-doesnt-1674cfa8a23c/

https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation

https://www.khanacademy.org/computing/computer-science/algorithms#asymptotic-notation

https://craigndave.org/wp-content/uploads/2020/09/big-o-notation-cheat-sheet.pdf

How can I measure the O( ) of my code?

Love this solution.

This solution also has O(n^2) complexity, which is very significant for longer strings.

I had a similar solution but I used #every instead of #filter.

Thank you sir.

Thank you :)

thx !

Hi, I've translated that interesting kata to Ruby. Cheers!

Using a blacklist is not good practice, but I simply wanted to showcase it.

I have to say I like this. I tried to use filter, but couldn't think of a way to use filter for this. Great job!