logoNEURAL COOK
SearchAll PostsTagsNotesAuthor
logoNEURAL COOK

A posts created with Next.js and Tailwind.css

Explore

  • All posts
  • Notes
  • Snippets
  • Tags
  • RSS feed

Connect

instagramtwitterfacebookyoutubelinkedinmailgithub

© 2026 VIKI. All rights reserved.

Built with
Contents
Table Of Contents
2. Add Two Numbers3. Longest Substring Without Repeating Characters5. Longest Palindromic Substring8. String to Integer (atoi)11. Container With Most Water15. 3Sum17. Letter Combinations of a Phone Number19. Remove Nth Node From End of List22. Generate Parentheses33. Search in Rotated Sorted Array34. Find First and Last Position of Element in Sorted Array48. Rotate Image49. Group Anagrams50. Pow(x, n)53. Maximum Subarray54. Spiral Matrix56. Merge Intervals61. Rotate List73. Set Matrix Zeroes74. Search a 2D Matrix75. Sort Colors78. Subsets137. Single Number II138. Copy List with Random Pointer150. Evaluate Reverse Polish Notation151. Reverse Words in a String153. Find Minimum in Rotated Sorted Array155. Min Stack162. Find Peak Element169. Majority Element198. House Robber207. Course Schedule215. Kth Largest Element in an Array227. Basic Calculator II236. Lowest Common Ancestor of a Binary Tree237. Delete Node in a Linked List238. Product of Array Except Self451. Sort Characters By Frequency540. Single Element in a Sorted Array560. Subarray Sum Equals K636. Exclusive Time of Functions875. Koko Eating Bananas1011. Capacity To Ship Packages Within D Days1101. The Earliest Moment When Everyone Become Friends1283. Find the Smallest Divisor Given a Threshold2140. Solving Questions With Brainpower3169. Count Days Without Meetings3481. Apply Substitutions
189. Rotate Array (Approach 2 )189. Rotate Array (Approach 1 )
Code Scratch/leetcode/medium/rotate array approach 1

189. Rotate Array (Approach 2 )

1 min read
On this pageIntuition
IntuitionComplexityCode

# Intuition

This approach is based on the fact that when we rotate the array k times, kkk elements from the back end of the array come to the front and the rest of the elements from the front shift backwards.

In this approach, we firstly reverse all the elements of the array. Then, reversing the first k elements followed by reversing the rest n−kn−kn−k elements gives us the required result.

# Complexity

Space ComplexityTime Complexity
O(1)\text{O}(1)O(1)O(n)\text{O}(n)O(n)

# Code

void reverse(int[] nums, int left, int right) {
    while(left < right) {
        int temp = nums[left];
        nums[left++] = nums[right];
        nums[right--] = temp;
    }
}
 
public void rotate(int[] nums, int k) {
    k = k % nums.length; // Handle cases where k >= nums.length
 
    if(k == 0) return; // No rotation needed
 
    // Convert right rotation into left rotation of (n - k)
    k = nums.length - k;
 
    // Step 1: Reverse the first part (0 to k-1)
    reverse(nums, 0, k - 1);
 
    // Step 2: Reverse the second part (k to end)
    reverse(nums, k, nums.length - 1);
 
    // Step 3: Reverse the whole array
    reverse(nums, 0, nums.length - 1);
}
←Previous3481. Apply SubstitutionsNext→189. Rotate Array (Approach 1 )

On this page

IntuitionComplexityCode