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=k-n;
    //printf("%d\n",k);
    }

    for(int i=k-1;i>=0;i--){
        arr[n+i]=arr[i];
        //printf("%d",arr[n+i]);
    }
    /*
    printf("\n");
    for(int i =0;i<n+k; i++){
        printf("%d",arr[i]);

    }
    printf("\n"); */

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

their approach  just groupf the elements int k and remaining n-k elements, reservre them individually anf then reverser them together

void rotate_left(int arr[], int n, int k) {
    k = k % n;  // Normalize k if it's greater than n

    // Step 1: Reverse first k elements
    reverse(arr, 0, k - 1);

    // Step 2: Reverse remaining n-k elements
    reverse(arr, k, n - 1);

    // Step 3: Reverse the whole array
    reverse(arr, 0, n - 1);
}