Left Rotate Array by K Positions

Code

#include <stdio.h>

void reverse_array(int arr[], int start, int end){
  
    while (start < end)
    {
        arr[start] = arr[start] ^ arr[end];
        arr[end] = arr[start] ^ arr[end];
        arr[start] = arr[start] ^ arr[end];
        start++;
        end--;
    }
    
}

void rotate_left(int arr[], int n, int k)
{
    k = k % n;
    reverse_array( arr,  0,  k-1);
    reverse_array( arr,  k,  n-1);
    reverse_array( arr,  0,  n-1);
}

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