Left Rotate Array by K Positions

Code

#include <stdio.h>

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

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