Rotate Array Java Solution - The Coding Shala
Home >> Interview Questions >> Rotate Array
Given an array, rotate the array to the right by k steps, where k is non-negative.
Input: [1,2,3,4,5,6,7] and k = 3
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]
Input: [-1,-100,3,99] and k = 2
rotate 1 steps to the right: [99,-1,-100,3]
rotate 2 steps to the right: [3,99,-1,-100]
Rotate Array Java Solution
We can use an extra array. Time complexity will be O(n) and Space Complexity will be O(n).
Using the reverse of an array.
Time Complexity O(n).
Space Complexity O(1).
Other Posts You May Like