Better Solution w/ Time Complexity O(N), Space complexity O(1)

Task lacks constraints or is incorrect

Cycle in a Circular Array, An Alternate Approach :O(N) fails for [2, 2, -3, -1]

Better solution

I think I might have a solution with O(N) time complexity and O(1) space time complexity

In C++ alternative solution, negative index calculation should be corrected.

Alternate Solution Wrong. Here the counterexample:

the official solution is buggy please see why with my solution

Wrong Example

There may be a bug in the final soln

why are we checking for direction again when calculating nextIndex?

use a hash

It would be really helpful if code for Alternate Approach that improves algorith...

The test Java code runs, but when I do a walk through of the second array the fi...