Rotate List Left by K - Amazon Top Interview Questions


Problem Statement :


Write a function that rotates a list of numbers to the left by k elements. Numbers should wrap around.

Note: The list is guaranteed to have at least one element, and k is guaranteed to be less than or equal to the length of the list.

Bonus: Do this without creating a copy of the list. How many swap or move operations do you need?

Constraints

n ≤ 100,000 where n is the length of nums


Example 1

Input

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

Output

[3, 4, 5, 6, 1, 2]



Example 2

Input

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


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



Example 3

Input

nums = [1]
k = 0


Output
[1]


Solution :



title-img 




                        Solution in C++ :

vector<int> solve(vector<int>& nums, int k) {
    int n = nums.size();
    int start = 0, end = k - 1;
    while (start < end) {
        swap(nums[start], nums[end]);
        start++;
        end--;
    }
    start = k, end = n - 1;
    while (start < end) {
        swap(nums[start], nums[end]);
        start++;
        end--;
    }
    start = 0, end = n - 1;
    while (start < end) {
        swap(nums[start], nums[end]);
        start++;
        end--;
    }
    return nums;
}
                    


                        Solution in Java :

import java.util.*;

class Solution {
    public int[] solve(int[] nums, int k) {
        if (nums == null || nums.length < 2) {
            return new int[] {nums[0]};
        }

        k %= nums.length;

        reverse(nums, 0, k - 1);
        reverse(nums, k, nums.length - 1);
        reverse(nums, 0, nums.length - 1);

        return nums;
    }

    private void reverse(int[] nums, int i, int j) {
        while (i < j) {
            swap(nums, i++, j--);
        }
    }

    private void swap(int[] nums, int i, int j) {
        int temp = nums[i];
        nums[i] = nums[j];
        nums[j] = temp;
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def reverse(self, nums, i, j):
        for idx in range((j - i + 1) // 2):
            nums[idx + i], nums[j - idx] = nums[j - idx], nums[idx + i]

    def solve(self, nums, k):
        self.reverse(nums, 0, len(nums) - 1)
        self.reverse(nums, 0, len(nums) - k - 1)
        self.reverse(nums, len(nums) - k, len(nums) - 1)
        return nums


View More Similar Problems

Dynamic Array

Create a list, seqList, of n empty sequences, where each sequence is indexed from 0 to n-1. The elements within each of the n sequences also use 0-indexing. Create an integer, lastAnswer, and initialize it to 0. There are 2 types of queries that can be performed on the list of sequences: 1. Query: 1 x y a. Find the sequence, seq, at index ((x xor lastAnswer)%n) in seqList.

View Solution →

Left Rotation

A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d

View Solution →

Sparse Arrays

There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun

View Solution →

Array Manipulation

Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu

View Solution →

Print the Elements of a Linked List

This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode

View Solution →

Insert a Node at the Tail of a Linked List

You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Input Format: You have to complete the SinglyLink

View Solution →