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;
    
    while(k--){
        int f = *arr;
        int *p = arr;
        for(int i=0 ; i<n; i++){
            *(p+i) = *(p+i+1);
        }
        *(p+n-1) = f;
    }
}

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