Left Rotate Array by K Positions

Code

#include <stdio.h>
void reverse(int arr[], int start, int end)
{
    int s = start;
    int e = end;
    while(s<e){
        int temp = arr[e];
        arr[e] = arr[s];
        arr[s] = temp;
        s++;
        e--;
    }
}
void rotate_left(int arr[], int n, int k) {
    // Your logic here
    reverse(arr,0,n-1);
    k = k%n;
    // reverse n-k elements from starting
    reverse(arr, 0, n-k-1);
    // reverse remaining k elements
    reverse(arr, n-k, 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