Reverse Array

Medium Pointers

Solve in Playground →

Problem Statement

Write a C++ program that reverses an array in-place using pointer traversal.

Input Format

First line: N. Second line: N space-separated integers.

Output Format

Print reversed array elements separated by a space.

Constraints

1 <= N <= 1000

Sample Input

5
1 2 3 4 5

Sample Output

5 4 3 2 1

Explanation

Uses start and end pointers moving towards each other to swap elements.

Starter Code

#include <iostream>
#include <vector>
#include <algorithm>

void reverseArray(int *arr, int n) {
    // Write your code here
}

int main() {
    int n;
    if (std::cin >> n) {
        std::vector<int> arr(n);
        for (int i = 0; i < n; i++) std::cin >> arr[i];
        reverseArray(arr.data(), n);
        for (int i = 0; i < n; i++) {
            std::cout << arr[i];
            if (i < n - 1) std::cout << " ";
        }
        std::cout << "n";
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →