// Left Rotate Array by K Positions #include <stdio.h> void left_rotate(int *arr, int k, int n){ int tmp = 0; for(int i = 0; i < k; i++){ tmp = arr[0]; for(int j = 0; j < n - 1; j++){ arr[j] = arr[j+1]; } arr[n-1] = tmp; } } int main(){ int n, k, arr[100]; scanf("%d %d",&n ,&k); for(int i = 0; i < n; i++){ scanf("%d",&arr[i]); } left_rotate(arr,k,n); for(int i = 0; i<n; i++){ printf("%d", arr[i]); if(i < (n-1)){ printf(" "); } } return 0; }
Test Cases
Test Results
Input
5 2 1 2 3 4 5
Expected Output
3 4 5 1 2