Left Rotate Array by K Positions

Code

#include <stdio.h>

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

    k %= n;
    k = n - k;

    while(count < n)
    {
        int current = start;
        int prev    = arr[start];
        do
        {
            int next = ((current + k) % n);
            int temp = arr[next];
            arr[next] = prev;
            prev = temp;
            current = next;
            count++;
        }while(start != current);
        start++;
    }

}

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