# Given an array, rotate the array to the right by k steps, where k is non-negative.


# Example 1:

# Input: nums = [1,2,3,4,5,6,7], k = 3
# Output: [5,6,7,1,2,3,4]
# Explanation:
# rotate 1 steps to the right: [7,1,2,3,4,5,6]
# rotate 2 steps to the right: [6,7,1,2,3,4,5]
# rotate 3 steps to the right: [5,6,7,1,2,3,4]

# Example 2:

# Input: nums = [-1,-100,3,99], k = 2
# Output: [3,99,-1,-100]
# Explanation:
# rotate 1 steps to the right: [99,-1,-100,3]
# rotate 2 steps to the right: [3,99,-1,-100]
class Solution:
    def rotate(self, nums: List[int], k: int) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        # If its odd, it will just be 1 pass
        # If its even, you need to move and start from index 2.
        # so, that's why we need to keep a counter of a start too
        # to see if you return back to its original position yet
        # We also need a temp, to swap and store your value, else it will keep swapping
        count = 0
        index = 0
        start = 0
        while count < len(nums):
            index = start
            temp = nums[index]
            while True:
                newPosition = (k + index) % len(nums)
                nums[newPosition], temp = temp, nums[newPosition]
                index = newPosition
                count += 1

                if index == start:
                    break
            start += 1
