# LeetCode 0189 - Rotate Array

## Contents

# Rotate Array

## Desicription

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

**Example** 1:

1 | Input: [1,2,3,4,5,6,7] and k = 3 |

**Example** 2:

1 | Input: [-1,-100,3,99] and k = 2 |

**Note**:

- 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?

## Solution

1 | class Solution { |