The worst solution is to mutate the original data.

Wow. This never crossed my mind lol

So good!

After comparing the speed between my solution and yours,
it seems that they are both approximately similar.

Can anyone please help me understand how to know weather my/their code falls under O(1), O(n), O(n * n)?

Thanks

wow, very niceee!

Fair Enough chief

Felt stupid when I realised how it was working 😂😂

WOW, this is so simple and I love it. Gonna have to write this one down.

Good question.

Omg I'm such an idiot, why didn't I think of this. Well done.

The question is, how much coding practice do I need to be able to think like this?

When i see solution like this, i realize how i am stupid =) This is realy smart dude.

I love how simple this solution is!

Thanks, I was lost on that [0] now it make sense

Sir, so smart !!!