Left Rotate Array by K Positions

Code

#include <stdio.h>
void reverse (int a,int b,int n,int arr[]){
     int c=0;
     for (int i=0;i<n/2;i++){
        c=arr[a];
        arr[a]=arr[b];
        arr[b]=c;
        a++;
        b--;
    }
}

void rotate_left(int arr[], int n, int k) {
    // Your logic here
    int b=n-(k+1);
    if(n<k) k-=n;
    reverse(0,n-1,n,arr);
    reverse(n-k,n-1,k,arr);
    reverse(0,n-(k+1),b,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