Left Rotate Array by K Positions

Code

#include <stdio.h>

void reverse(int  l , int r , int a[]){
    while(l <r){
        int tmp = a[l] ; 
        a[l] =a[r] ; 
        a[r] = tmp ; 
        ++l ; 
        --r ; 
    }
}


void rotate_left(int arr[], int n, int k) {
    k%=n ; 
    reverse(0 , k-1 , arr) ;  
    reverse (k , n-1, arr) ; 
    reverse (0 , n-1 , arr)  ;

}

int main() {
    int n, k;
    scanf("%d %d", &n, &k);

    int arr[100];

    // Read array elements
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    // Rotate the array
    rotate_left(arr, n, k);

    // Print the rotated array
    for (int i = 0; i < n; i++) {
        printf("%d", arr[i]);
        if(i < n-1){
        	printf(" ");
        }
    }

    return 0;
}

Solving Approach