Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    // Your logic here
    int sum = 0,  sum1 = 0, sum2 =0;
    k= k%n;
    for(int i=0; i<(k/2); i++){
        sum = arr[i];
        arr[i] = arr[k-1-i];
        arr[k-1-i] = sum;
    }
    for(int i=0; i<((n-k)/2); i++){
        sum1 = arr[k+i];
        arr[k+i] = arr[n-1-i];
        arr[n-1-i] = sum1; 
    }
    for(int i=0; i<n/2; i++){
        sum2 = arr[i];
        arr[i] = arr[n-1-i];
        arr[n-1-i] = sum2;
    }

}

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