Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    k = k % n;
    int temp=0;
    int start = 0;
    int stop = (k-1);
    while(start<stop){
        temp = arr[start];
        arr[start]= arr[stop];
        arr[stop] = temp;
        start++;
        stop--;
    }
    start = k;
    stop = n-1;
    while(start<stop){
        temp = arr[start];
        arr[start] = arr[stop];
        arr[stop] = temp;
        start++;
        stop--;
    }
    start = 0;
    stop = n-1;
    while(start<stop){
        temp = arr[start];
        arr[start] = arr[stop];
        arr[stop] = temp;
        start++;
        stop--;
    }
}

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