Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    // Your logic here
    int prev_temp = 0, next_temp = 0;
    for(int i=0; i<k; i++)
    {
        for(int j=0; j<n; j++)
        {
            if(j==0)
            {
                next_temp = *(arr+n-1); 
                *(arr+n-1) = *arr;
            }
            else
            {
                prev_temp = next_temp;
                next_temp = *(arr+(n-1)-j);
                *(arr+(n-1)-j) = prev_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