Write a program that rotates the elements of a list so that the element at the first index

Given a list, right rotate the list by n position.

Examples :

Input : n = 2 List_1 = [1, 2, 3, 4, 5, 6] Output : List_1 = [5, 6, 1, 2, 3, 4] We get output list after right rotating (clockwise) given list by 2. Input : n = 3 List_1 = [3, 0, 1, 4, 2, 3] Output : List_1 = [4, 2, 3, 3, 0, 1]

Approach #1 : Traverse the first list one by one and then put the elements at required places in a second list.

Output :

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

Time complexity : O(n)

Approach #2 : Another approach to solve this problem by using slicing technique. One way of slicing list is by using len() method.

Output:

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

Approach #3 : In the above method, last n elements of list_1 was taken and then remaining elements of list_1. Another way is without using len() method.

Output :

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

Time complexity : O(n)

Note : list_1[:] will return the whole list as the blank space on left of slicing operator refers to start of list i.e 0 and blank space on right refers to ending position of list.