Search

Updated: Nov 4

Rotate Array | Array | Data Structure | Array in Data Structure | Data Structure operations

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

• Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.

• Could you do it in-place with O(1) extra space?

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]

```

Constraints:

• 1 <= nums.length <= 2 * 104

• -231 <= nums[i] <= 231 - 1

• 0 <= k <= 105

## CODE SOLUTION :

```class Solution {
public:
void rotate(vector<int>& nums, int k) {
int ans[nums.size()];

for(int i=0; i<nums.size(); i++) {
ans[(i+k)%nums.size()] = nums[i];
}
for(int i=0; i<nums.size(); i++) {
nums[i] = ans[i];
}
}
};```
13 views

### Recent Posts

See All

#### Write a C++ Program to count frequency of elements in an array| AskTheCode

Write a program in C++ using an if statement to count how many consecutive times each distinct value appears in the input

#### Write a C++ Program to count distinct value in an array| AskTheCode

Asked by: Umar Khan | Category: C++ ( c plus plus ) | Program to count distinct elements in an array in C++ #include <iostream> using namespace std; int distinctValueCounter(int a[], int size){ int i,

#### Write a C++ Program to Check Whether a Number is Prime or Not | AskTheCode

c plus plus program to check whether a number is Prime or not | AskTheCode