Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int *arr, int *n, int *k) {
    // Your logic here

     *k = *k%*n;

    if(*k == 0) {
        return;
    }

    int temp[*k];
    for(int i=0;i<*k;i++) {
        temp[i] = *(arr+i);
    }

    for(int i=*k; i<*n;i++) {
        *(arr+i-*k) = *(arr+i);
    }

    for(int i=0;i<*n;i++) {
        *(arr+*n-*k+i) = temp[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