Left Rotate Array by K Positions

Code

#include <stdio.h>

void Reverse(int arr[], int start, int stop)
{
    int temp = 0;
    while(start < stop)
    {
        temp = arr[start];
        arr[start] = arr[stop];
        arr[stop] = temp;
        start++;
        stop--;
    }
}

void rotate_left(int arr[], int n, int k) {
    if (n <= 0) return;
    k %= n;                 // quan trọng
    if (k < 0) k += n;      // nếu k âm
    
    Reverse(arr,0,k-1);
    Reverse(arr,k,n-1);
    Reverse(arr, 0, 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