0189.Rotate Array

Link:
Track: NeetCode150

Question

Restate the problem

---

Method 1 - slice
Method 2

Method

Approach

(discussed at lease two approach?)

Complexity

• Time Complexity: O(n)
• Space Complexity: O(n)

Edge Case

Code

class Solution:
    def rotate(self, nums: List[int], k: int) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """        
        n = len(nums)
        k = k % n
        if k == 0:
            return
            
        rotate_part = nums[-k:] 
        remain = nums[:-k]
        
        nums[:k] = rotate_part 
        nums[k:] = remain
        return nums

---

History

Jan-24-2026 Solved with O(n) space

• slice not clear
• splice array by len k, arr[:k] + arr[k:]
• Slicing