FilesExpand file tree

 master

/

rotate_array.py

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

58 lines (45 loc) · 1.44 KB

 master

/

rotate_array.py

Top

File metadata and controls

• Code
• Blame

58 lines (45 loc) · 1.44 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

"""

Given an unsorted array arr[] of size N, rotate it by D elements in the counter-clockwise direction.

Input:

The first line of the input contains T denoting the number of test cases. The first line of each test case contains two space-separated elements, N denoting the size of the array and an integer D denoting the number size of the rotation. The subsequent line will contain N space-separated array elements.

Output:

For each test case, in a new line, print the rotated array.

Your Task:

Complete the function rotateArr() which takes the array, D and N as input parameters and rotates the array by D elements.

Expected Time Complexity: O(N)

Expected Auxiliary Space: O(1)

Constraints:

1 <= T <= 200

1 <= N <= 107

1 <= D <= N

0 <= arr[i] <= 105

Example:

Sample Input:

2

5 2

1 2 3 4 5

10 3

2 4 6 8 10 12 14 16 18 20

Sample Output:

3 4 5 1 2

8 10 12 14 16 18 20 2 4 6

Explanation :

Testcase 1: 1 2 3 4 5 when rotated by 2 elements, it becomes 3 4 5 1 2.

Testcase 2: 2 4 6 8 10 12 14 16 18 20 when rotated by 3 elements, it becomes 8 10 12 14 16 18 20 2 4 6.

"""

def rotateArr(A, D, N):

# Your code here

A[D:] = A[D:] + A[:D]

del A[:D]

if __name__ == '__main__':

T = int(input())

while T > 0:

nd = [int(x) for x in input().strip().split()]

N = nd[0]

D = nd[1]

A = [int(e) for e in input().split()]

rotateArr(A, D, N)

for i in A:

print(i, end=" ")

print()

T -= 1