Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    // Your logic here
    if(k>n) k=k-(k/n)*n;
    int a[n];
    int j=0;
    for(int i=k-1;i>=0;i--)
    {
        a[n-1-j]=arr[i];
        j++;
    }
    for(int i=k;i<n;i++) 
    {
        a[i-k]=arr[i];
    }
    for(int i=0;i<n;i++) arr[i] = a[i];
}
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