Left Rotate Array by K Positions

Code

#include <stdio.h>

int idxcalc(int index, int n, int k) {
    if (index < k) return n-k+index;
    else return index-k;
}

void rotate_left(int arr[], int n, int k) {
    // Your logic here
    if (k > n) k %= n;
    int index = 0;
    int temp = arr[index];
    
    for (int i = 0; i < n; i++) {
        int j = idxcalc(index, n, k);
        int temp2 = arr[j];
        arr[j] = temp;
        temp = temp2;
        index = j;
    }
}

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