Left Rotate Array by K Positions

Code

#include <stdio.h>
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) {
    //we can use modulus for wrapping logic.
    k%=n; //Normalize k, if k > arr.length;
    reverse(arr, 0 ,k-1);
    reverse(arr ,k,n-1);
    reverse(arr, 0, n-1);
}



//2 1, 5 4 3
// 3 4 5 1 2
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