Here you are guaranteed to get the unique numbers only in the array.

Not a fan of recursivity, as if you get a really big number, the stack will be hugely used.

this is still wrong
consecutive([1, 3, 3, 5, 7], 3, 3)

OP solved it, closing

'alr approved some time ago'

Maybe you're right.
But as for Java kata, it doesn't worth even 9 kyu :-)

I'm relatively new to C++ katas. I dont have a negative opinion on the point values. it's all good practice in my book

it is okay to use external header files for solving these katas correct? I haven't programmed in C++ in some time.

Please be more specific. If you think the description is inadequste, suggest a better one. If you can't pass the tests, post your code, properly marked up and spoilered, post a failing test, input, actual and expected output, and mark it Question. ( Mention the language. You did that right. )

Closing.

Not a kata issue then. Closing.

You are both wrong.

A wants most gold, B wants most gold, both play optimally, A starts.

In first example, A can take 958. Why would he settle for 937?

Is there even anything like java.regex?

well what I understood is you want A to have most of gold in every possible situation. In your case it would A takes 569, B takes 809, A takes 389 and finally B takes 128 which results in [958, 937] so A has more gold than B condition is filled. I might be wrong so everyone can correct me.

PS: Not in every case you have to take highest number from golds list by A programmer.