Left Rotate Array by K Positions

Code

#include <stdio.h>
void reverse_array(int arr[], int m, int n) {
    // Your logic here
    int temp;
    int left =m; int right = n-1;
    while(left<right)
    {
        temp = arr[left];
        arr[left]=arr[right];
        arr[right]=temp;
        left++;
        right--;
    }
}
void rotate_left(int arr[], int n, int k) {
    // Your logic here
    if(k>n) k=k-n;
    reverse_array(arr, 0, n);
    reverse_array(arr,0,n-k);
    reverse_array(arr, n-k, 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