Left Rotate Array by K Positions

Code

#include <stdio.h>

void reverse(int arr[],int S,int E){
    while(S<E){
        int temp = arr[S];
        arr[S] = arr[E];
        arr[E] = temp;
        S+=1;
        E-=1;
    }
    return;
}

void rotate_left(int arr[], int n, int k) {
    // Your logic here
   if(n == k) return;
   k=k%n;
   reverse(arr,0,k-1);
   reverse(arr,k,n-1);
   reverse(arr,0,n-1);
   return;
}

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