Misunderstood circle. Thought it could go two ways.
Wrong if statement. Should be (n < 0 || (n & 1) == 0)
This comment is hidden because it contains spoiler information about the solution
The sumbit test case for n=150 is timing out when I used recursive. Might be a bit high.
You have no safeguard for the case n == 2; This would result endless calling of nth() with n < 0.
Loading collection data...
Misunderstood circle. Thought it could go two ways.
Wrong if statement. Should be (n < 0 || (n & 1) == 0)
This comment is hidden because it contains spoiler information about the solution
The sumbit test case for n=150 is timing out when I used recursive. Might be a bit high.
You have no safeguard for the case n == 2; This would result endless calling of nth() with n < 0.
This comment is hidden because it contains spoiler information about the solution