Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    // Your logic here
    if(k>n){k=n%k -1;}
    int curr_idx = 0;
    int next_idx;
    int saved_val = arr[0];
    for(int i=0; i<n; i++){
        // decide next position
        if(curr_idx<k){
            next_idx = n-k+curr_idx;
        }
        else{
            next_idx = curr_idx-k;
        }

        // swap
        int temp_val = arr[next_idx];
        arr[next_idx] = saved_val;
        saved_val = temp_val;
        curr_idx = next_idx;
    }
 
}

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