Left Rotate Array by K Positions

Code

#include <stdio.h>

void reverse_subarray(int arr[], int start, int end){
    int len = end - start +1;
    for (int i =0; i < len/2; i ++){
        int tmp = arr[end - i];
        arr[end-i] = arr[start+i];
        arr[start+i] = tmp;
    }
}

void rotate_left(int arr[], int n, int k) {
    // handle k overflow
    k = k%n;
    // reverse [0. k-1]
    reverse_subarray(arr, 0, k-1);

    // reverse [k, n-1]
    reverse_subarray(arr, k, n-1);

    // reverse start to end
    reverse_subarray(arr, 0, n-1);
}

/*
1 2 3 4 5 | 5 4 3 2 1 k = 0
2 3 4 5 1 | 1 5 4 3 2
3 4 5 1 2 | 2 1 5 4 3
4 5 1 2 3 | 3 2 1 5 4
5 1 2 3 4 | 4 3 2 1 5
*/

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