Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    int arr2[100];
    if (k>n)
    {
        k = k%n;
    }
    for(int i=0; i<100; i++)
    {
        if(i>=n-k)
        {
            arr2[i]=arr[-(n-k)+i];
        }
        else
        {
            arr2[i]=arr[i+k];
        }
    }
    for(int i=0;i<n;i++)
    {
        arr[i]=arr2[i];
    }
}

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