Left Rotate Array by K Positions

Code

#include <stdio.h>
// Helper function to reverse a part of the array
void reverse(int arr[], int start, int end) {
    while (start < end) {
        int temp = arr[start];
        arr[start] = arr[end];
        arr[end] = temp;
        start++;
        end--;
    }
}
void rotate_left(int arr[], int n, int k) {
    if (n == 0) return;
    k = k % n;  // handle k > n
    // Algorithm: Reverse method
    reverse(arr, 0, k - 1);      // Reverse first k elements
    reverse(arr, k, n - 1);      // Reverse remaining n-k elements
    reverse(arr, 0, n - 1);      // Reverse the whole array
}
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