Solution 1: for (int i = n - 1; i >= 0; i--) { System.out.print(arr.get(i)); if (i > 0) System.out.print(" "); }

` Solution 2:

ArrayList<Integer> newArray = new ArrayList<>();
            newArray.addAll(arr);
            for (int i = 0; i < n; i++) {
                int val = newArray.remove(newArray.size()-1);
                arr.set(i, val);
            }
            for (Integer a : arr) {
                System.out.print(a +" ");
            }

Printing reverse iteration in c++:

void invertOrder(vector<int> array){
    copy(array.rbegin(), array.rend(), ostream_iterator<int>(cout, " "));
}

**My code in C.

int main(){

int n;

scanf("%d",&n);

int arr[n];

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

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

}

int arr2[n];

int count=0;

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

    arr2[count]=arr[i];

    count++;

}

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

    printf("%d ",arr2[i]);
}
return 0;

}**

Here is problem solution in Python, Java, C++, C and javascript - https://programmingoneonone.com/hackerrank-day-7-arrays-30-days-of-code-problem-solution.html

C# Solution

arr.Reverse();
        
Console.WriteLine(string.Join(" ", arr));