Java Code:

import java.io.; import java.math.; import java.security.; import java.text.; import java.util.; import java.util.concurrent.; import java.util.function.; import java.util.regex.; import java.util.stream.*; import static java.util.stream.Collectors.joining; import static java.util.stream.Collectors.toList;

class Result {

/*
 * Complete the 'reverseArray' function below.
 *
 * The function is expected to return an INTEGER_ARRAY.
 * The function accepts INTEGER_ARRAY a as parameter.
 */

public static List<Integer> reverseArray(List<Integer> a) {
    // Write your code here
    int start = 0;
    int end = a.size() - 1;

    while (start < end) {
        // Swap elements at positions start and end
        Collections.swap(a, start, end);
        start++;
        end--;
    }

    return a;
}

}

public class Solution { public static void main(String[] args) throws IOException { BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

    int arrCount = Integer.parseInt(bufferedReader.readLine().trim());

    List<Integer> arr = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
        .map(Integer::parseInt)
        .collect(toList());

    List<Integer> res = Result.reverseArray(arr);

    bufferedWriter.write(
        res.stream()
            .map(Object::toString)
            .collect(joining(" "))
        + "\n"
    );

    bufferedReader.close();
    bufferedWriter.close();
}

}

Haskell

module Main where

main :: IO ()
main = interact $ unwords . reverse . words . ( !! 1) . lines

js solutions

`function reverseArray(a) {
    // Write your code here
    let r = [];
    for(let i=0; i< a.length; i++){
        r.unshift(a[i]);
    }
    return r;
}

Here is my c++ solution, you can watch video explanation here : https://youtu.be/Z_CYzW_sQAE

Solution 1

vector<int> reverseArray(vector<int> a) {
  reverse(a.begin(), a.end());
  return a;
}

Solution 2

vector<int> reverseArray(vector<int> a) {
   vector<int> result; 
    for(int i = a.size() - 1; i >= 0; i--){
        result.push_back(a[i]);
    }
    return result;
}

Simple solution

vector<int> reverseArray(vector<int> a) {
    int start = 0;
    int end = a.size() - 1;
    
    while(start < end) {
        swap(a[start], a[end]);
        start++;
        end--;
    }
    
    return a;
}