The problem description is ambiguous

  • 0

    [1,2,3] is one of the test case, from my understanding it says the array is rotated.

  • 0

    it is rotated, imagine a linear feedback shift register (what you shift out on the right side, comes back in on the left), so if you rotate this array 3 (length) times, you will end up with the original array.

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.