• + 0 comments

    Time Complexity: O(n) <\br>

    Space Complexity: O(n)

    int* rotateLeft(int d, int arr_count, int* arr, int* result_count) {
        int* res_arr = (int* )malloc(arr_count*sizeof(int));
        *result_count = 0;
        for (int i = 0; i<arr_count; i++){
            res_arr[i] = arr[(i+d)%arr_count];
            (*result_count) ++;
        }
        return res_arr;
    }