Left Rotate Array by K Positions

Code

#include <stdio.h>
void reverse(int arr[], int left, int right){
    int *left_ptr = arr + left;
    int *right_ptr = arr + right;
    int t;
    while(left_ptr < right_ptr){
        t = *left_ptr;
        *left_ptr = *right_ptr;
        *right_ptr = t;
        left_ptr++;
        right_ptr--;
    }
}
void rotate_left(int arr[], int n, int k) {
    k %= n;
    reverse(arr, 0, k-1);
    reverse(arr, k, n-1);
    reverse(arr, 0, n-1);
}

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