probably not the best solution, but this is how my logic worked...

Thanks for answering @Hobovsky, I appreciate it :D

I think that I understood bad the Output, because I was thinking that I should return a list, but it was not that.

I realize that I have to return the count of odd numbers, so I think that my function is wrong, and it should be one number who gives me that error.

However, I cannot build a function who works D:

I know it's a hard way, and hope to reach your level, bro
I'll don't give up and I'll keep trying

But if you could tell me how I should start my function, I'll receive it grateful

I hope that my English it'll understandable ;D

Really cheeky kata...

I admit - I had to look up the answer, can't boast that I solved it myself.

Yet, I did notice one commet which said "look at the outputs in the example". This is a really good hint!

And also, I learned that THAT (the solution) can significantly speed up performance.

that's an abomination :D

it's very simple you need to verifier if the index of the number is a multipule of the number or not if it's true add the number to the new array

It is not difficult but can be difficult if you are not familiar with regexps

what do I need to do? the description is so vague

based

finished it somehow

Yet another 8 kyu (the smiplest) task which is not that simple actually.
But it is good practice, I liekd it.

Clever task. At first I could not understand why it was not working, but as soon as I copied it in the IDE it highlighted that the code is unreachable :D