HackerRank Array Reversal Solution in C

Given an array, of size , reverse it.

Example: If array, , after reversing it, the array should be, .

Input Format

The first line contains an integer, , denoting the size of the array. The next line contains  space-separated integers denoting the elements of the array.

Constraints

, where  is the  element of the array.

Output Format

The output is handled by the code given in the editor, which would print the array.

Sample Input 0

6

16 13 7 2 1 12 

Sample Output 0

12 1 2 7 13 16 

Explanation 0

Given array,  = . After reversing the array,  = 

Sample Input 1

7

1 13 15 20 12 13 2 

Sample Output 1

2 13 12 20 15 13 1 

Sample Input 2

8

15 5 16 15 17 11 5 11 

Sample Output 2

11 5 11 17 15 16 5 15 

HackerRank Array Reversal Solution in C (Sample-1)

#include <stdio.h>

int main() {

    int n;

    scanf("%d", &n);  // Read the size of the array

    int arr[n];

    

    // Read array elements

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

        scanf("%d", &arr[i]);

    }

    // Print in reverse order

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

        printf("%d ", arr[i]);

    }

    return 0;

}

HackerRank Array Reversal Solution in C (Sample-2)

#include <stdio.h>

void reverseArray(int arr[], int n) {

    int temp;

    for (int i = 0; i < n / 2; i++) {

        temp = arr[i];

        arr[i] = arr[n - 1 - i];

        arr[n - 1 - i] = temp;

    }

}

int main() {

    int n;

    scanf("%d", &n);

    int arr[n];

    for (int i = 0; i < n; i++)

        scanf("%d", &arr[i]);

    reverseArray(arr, n);

    for (int i = 0; i < n; i++)

        printf("%d ", arr[i]);

    return 0;

}

HackerRank Array Reversal Solution in C (Sample-3)

#include <stdio.h>

int main() {

    int n;

    scanf("%d", &n);

    int arr[n];

    for (int i = 0; i < n; i++)

        scanf("%d", &arr[i]);

    int i = 0, j = n - 1, temp;

    while (i < j) {

        while (i < j && arr[i] % 2 != 0) i++;

        while (i < j && arr[j] % 2 != 0) j--;

        if (i < j) {

            temp = arr[i];

            arr[i] = arr[j];

            arr[j] = temp;

            i++;

            j--;

        }

    }

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

        printf("%d ", arr[k]);

    return 0;

}