Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    // Your logic here
    k = k%n;
    int count = 0;
    int pos = n-k;
    int temp = arr[0];

    while(count < n){
        arr[pos] = arr[pos] ^ temp;
        temp = arr[pos] ^ temp;
        arr[pos]= arr[pos] ^ temp;
        pos = pos-k;
        if(pos < 0){
            pos = pos+n;
        } 
        count++;
    }
     
}

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