Hello coders, Today I am going to solve the problem ” **Rotate Array Leetcode Solution** “. I have found a solution for it in Java but its time efficiency is not good and it beat only 6% of the submissions. As of now, I will post that solution and I will post later with improved time efficiency. If you find a better solution, please comment below.

Let’s see the problem statement.

## Problem statement:

Given an array, rotate the array to the right by `k`

steps, where `k`

is non-negative.

**Example 1:**

Input:nums = [1,2,3,4,5,6,7], k = 3Output:[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 = 2Output:[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]

## Rotate Array Leetcode Solution in Java

**Disclaimer:** This problem(**Rotate Array Leetcode solution**) is originally created by Leetcode. Codesagar only provides a solution for it. This solution is only for Educational and learning purposes.