Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate(int arr[], int f, int e){
    while (f < e){
        int temp = arr[f] ;
        arr[f] = arr[e] ;
        arr[e] = temp ;
        f++ ;
        e-- ;
    }
}

void rotate_left(int arr[], int n, int k) {
    // Your logic here
    k = k % n ;

    rotate(arr, 0, k-1) ;
    rotate(arr, k, n-1) ;
    rotate(arr, 0, n-1) ;
}

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