wrote the same thing word for word

Good

I went for counter object, so dont beat yourself up

better readability

I think it's codewars algorithm

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

man this is clever. Kudos to you

Smart, like it alot

it is clever indeed maybe not very efficient but clever indeed

why not use a simple list comprehension instead? I'm surprised I have to scroll so far down solutions to see anyone else doing this

O(n^2)... terrible idea as time goes on you will hate nested loops only when you want to do N-D array
such that N is [2, n)