Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    // Your logic here
    k = (k > n)? (k - n) : k;
    if (k == 0) return;

    int temp_arr[n] = {0}; 
    
    for (int i = 0; i < n; i++) {
        int index = ((i - k) < 0)? (i - k + n) : (i - k);
        temp_arr[index] = arr[i];
    }
    for (int i = 0; i < n; i++) {
        arr[i] = temp_arr[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