Left Rotate Array by K Positions

Code

#include <stdio.h>
void reverseArray(int * arr,int n){
        int temp = 0;
        for(int i = 0;i<n/2;i++){
        temp = arr[i];
        arr[i]=arr[(n)-i-1];
        arr[(n)-i-1] = temp;
    }
}
void rotate_left(int arr[], int n, int k) {
    // Your logic here
    k = k%n;
    reverseArray(arr,k);
    reverseArray(arr+k,n-k);
    reverseArray(arr,n);

    
    
    
}

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