Every "k" number. (Be aware, it is not index, by itself! At the end of line, somehow you must move it back to right place at left side - I know dumbly described, but I do not know if I can here give more than small hints. If not marked as spoiler - what you will not see, if not completed :D ...)

e.g. n7 k3 (first sample test) = you have 1,2,3,4,5,6,7. First you remove third position, what is number 3. Then again 3rd position from their, so skip number 4,5 and remove the 3rd in row what is 6. Then again third - you skip 6, move back to begin, skip 1 and remove number 2 ... and some magic and you have it algorithmized :D

Your task is to divide n into some different integers

different

The kata is named Maximum Product, and the description neatly states you need to maximize the product of these integers. Isn't 3*5 > 2*6?

a pointer which you should set as the length of your return array

Read the instructions again, the second argument is the steps value you should use.

5 kye I think