I initially wrote a recursive function for this problem, and it worked for small numbers. However, the test cases included large numbers, which caused too many recursive calls, exceeding Python’s recursion depth limit and resulting in an error. To fix this, I switched to an iterative approach using a for loop, which avoids recursion limits and runs efficiently for large inputs.

can you explain me that how did you come up with this? what's the thought process behind it?

A solution that needs space proportional to the input numbers' values won't be able to handle the random tests.

Lol :-) Yeah, feeling more confident but haven't solved this kata. Didn't try and looking at it now I still have no clue what to do. Should I import something? Should I download it from somewhere? Just rethorical questions :-) Not going to spend much time on it...

How is your progress? Are you feeling now more confident? 3 years have passed

Fix: https://www.codewars.com/kumite/67a748fc21023fa4a16bc44f?sel=67a748fc21023fa4a16bc44f

As I said, it looks like the indices are wrong.

The tests expect:

n = 340 : DavidSampson
expected: [1, 287]

On the leaderboard I see:

#339	1 dan DavidSampson

... so I had to return n-2th warrior, 0-based, to complete this.

I don't get it, I'm suring beauty soup, and always retrieve the wrong user

Enabled in this fork

Approved

You need to return the final value, not print it.