Left Rotate Array by K Positions

Code

#include <stdio.h>

void reverse(int * start, int * end){
    // a ^= b
    // b ^= a
    // a ^= b
    while(start < end){
        *start ^= *end;
        *end ^= *start;
        *start ^= *end;   

        start ++;
        end --;     
    }
}


void rotate_left(int arr[], int n, int k) {
    // Your logic here

    //rev 0->K
    // rev k+1 -> end
    // rev whole
    if( n == k){
        return;
    }

    reverse(arr, arr+((k-1)%n));
    reverse(arr+(k%n), arr+(n-1));
    reverse(arr, arr+(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