189. Rotate Array | LeetCode | Top Interview 150 | Coding Questions

Problem Link

https://leetcode.com/problems/rotate-array/

---

Detailed Step-by-Step Explanation

https://leetcode.com/problems/rotate-array/solutions/7416285/easiest-approach-beats-500-on-o1-beginne-tkva

---

---

Solution

class Solution {
    public void rotate(int[] nums, int k) {
        int n = nums.length;
        k = k % n;
        reverse(nums, 0, n-1);
        reverse(nums, 0, k-1);
        reverse(nums, k, n-1);
    }

    public static void reverse(int[] arr, int start, int end) {
        while(start < end) {
            int temp = arr[start];
            arr[start] = arr[end];
            arr[end] = temp;
            start++;
            end--;
        }
    }
}