woow !! So Beautiful. Nice idea. so hard to understand but salute you for figuring out something like this. Really awesome !!

Awesome bro. How is it that every single time I see some code that's miles better than what I wrote ? LMAO LOL

woow ! nice idea. but, is it computationally faster ?

this is a genius solution. very nice

Just Fantastic

Very clever code. thaks for explaining everything. learned

i have been wondering how the this code works for some time. thank you for a great explanation

clever

it was this simple 😅 I used RegX for it 😂

Thank you

it is smart. but the time complexity is O(n^2).using count function in every turn is not efficient.

Nice solution 👏👏👏

👏👏👏

I really liked this code. but when i tried it i got an error saying, the translate function take only one argument bu 2 given !!
is this code possible? can u tell me how ?

That's a nice solution