# Left Rotation | Data structures

## Left Rotation

left rotation operation on an array of size  shifts each of the array’s elements  unit to the left. For example, if  left rotations are performed on array , then the array would become .
Given an array of  integers and a number, , perform  left rotations on the array. Then print the updated array as a single line of space-separated integers.
Input Format
The first line contains two space-separated integers denoting the respective values of  (the number of integers) and  (the number of left rotations you must perform).
The second line contains  space-separated integers describing the respective elements of the array’s initial state.
Constraints
Output Format
Print a single line of  space-separated integers denoting the final state of the array after performing  left rotations.
Sample Input
Sample Output
Explanation
When we perform  left rotations, the array undergoes the following sequence of changes:
Thus, we print the array’s final state as a single line of space-separated values, which is 5 1 2 3 4.
Code:
##### Solution

Keep in mind a left rotation of x is equal to (len-x) of righ rotations. Hence, it would be more efficient to the rotation with least amount of “moves”.