Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int arr[], int n, int k)
{
    int temp[100];

    k = k % n;   // handle k > n

    // Store rotated values in temp
    for (int i = 0; i < n; i++)
    {
        temp[i] = arr[(i + k) % n];
    }

    // Copy back to original array
    for (int i = 0; i < n; i++)
    {
        arr[i] = temp[i];
    }
}

int main()
{
    int n, k;
    scanf("%d %d", &n, &k);

    int arr[100];

    for (int i = 0; i < n; i++)
    {
        scanf("%d", &arr[i]);
    }

    rotate_left(arr, n, k);

    for (int i = 0; i < n; i++)
    {
        printf("%d", arr[i]);
        if (i < n - 1)
            printf(" ");
    }

    return 0;
}

Solving Approach