Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    // Your logic here
    if (arr == NULL || n <= 1) return;
    int k2 = k % n;
    if (k2 < 0) k2 += n;          // nếu k có thể âm
    if (k2 == 0) return; 

    int res[n];
    for(int i = 0; i < n - k2; i++)
    {
        res[i] = arr[i + k2];
    }
    for(int i = 0; i < k2; i++)
    {
        res[n - k2 + i] = arr[i];
    }
    for (int i = 0; i < n; i++) {
        arr[i] = res[i];
    }
}

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