Left Rotate Array by K Positions

Code

#include <stdio.h>

void reverse(int arr[], int start, int end)
{
        int temp;
        while(start <= end)
        {
            temp = arr[start];
            arr[start] = arr[end];
            arr[end] = temp;
            start++;
            end--;
        }
}

void rotate_left(int arr[], int n, int k) {
    // Your logic here
     if (n <= 1) return;

    // Normalize k to [0, n-1]
    k %= n;
    if (k < 0) k += n;    // only needed if negatives are possible
    if (k == 0) return;   // no rotation needed

    reverse(arr, 0, n-1);
    reverse(arr, 0, (n-k-1));
    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