Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    // Your logic here
    for (int r = 0; r < k; r++) 
    {
        // Store the first element
        int temp = arr[0];

        // Shift all elements to the left by one position
        for (int i = 0; i < n - 1; i++) {
            arr[i] = arr[i + 1];
        }

        // Place the first element at the end
        arr[n - 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

for (int r = 0; r < k; r++) 

    {

        // Store the first element

        int temp = arr[0];

        // Shift all elements to the left by one position

        for (int i = 0; i < n - 1; i++) {

            arr[i] = arr[i + 1];

        }

        // Place the first element at the end

        arr[n - 1] = temp;

    }