Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    // Your logic here
    int x, y;
    for (int x = 0; x < k; x++)
    {
        //save first array to be rotated
        int temp = arr[0];
        for (y = 0; y < n; y++)
        {
            //replace array with preceeding elements
            arr[y] = arr[y + 1];
            
        }
        // put temp into the farthest element
        arr[y - 1] = temp;
    }
}

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