Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    // Your logic herei
    int a=0,b=n-1,c,i;
    if(n<k) k-=n;
    for ( i=0;i<n/2;i++){
        c=arr[a];
        arr[a]=arr[b];
        arr[b]=c;
        a++;
        b--;
    }
    a=n-k;
    b=n-1;
    c=0;
    for(i=0;i<k/2;i++){
        c=arr[a];
        arr[a]=arr[b];
        arr[b]=c;
        a++;
        b--;
    }
    a=0;
    b=n-(k+1);
    c=0;
     for(i=0;i<b/2;i++){
        c=arr[a];
        arr[a]=arr[b];
        arr[b]=c;
        a++;
        b--;
    }
    
}

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