GeezerVison

The World Wide Web, restored to 800 pixels of glory.

GeezerVison is showing rulcode.com — Rotate Array In-Place Visualizer & Solution | Rulcode

Fetching algorithms...

Rotate Array In-Place Visualizer & Solution | Rulcode

Loading problem details...

8. Rotate Array In-Place

Medium

Topics

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

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

Output: [5, 6, 7, 1, 2, 3, 4]

Explanation: The array is rotated to the right by 3 positions.

Example 2:

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

Output: [3, 99, -1, -100]

Explanation: The array is rotated to the right by 2 positions.

Example 3:

Input: nums = [1, 2], k = 3

Output: [2, 1]

Explanation: The array is rotated to the right by 3 positions (effectively 1 position since 3 % 2 = 1).

Example 4:

Input: nums = [1, 2, 3], k = 0

Output: [1, 2, 3]

Explanation: No rotation is performed since k is 0.

Constraints:

Time Complexity

O(n)

Space Complexity

O(1)

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.