2nd day

//Problem 1 - Reverse the array 3
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n, t, i, j, temp;
    cin >> t;
    while (t--)
    {
        cin >> n;
        int *arr = new int[n];
        for (i = 0; i < n; i++)
        {
            cin >> arr[i];
        }
        i = 0;
        j = n - 1;
        while (i < j)
        {
            temp = arr[i];
            arr[i++] = arr[j];
            arr[j--] = temp;
        }
        for (i = 0; i < n; i++)
        {
            cout << arr[i] << " ";
        }
        cout << endl;
    }
    return 0;
}

Problem 2 - Maximum and Minimum element of the array
#include <stdio.h>

struct pair
{
    long long int min;
    long long int max;
};

struct pair getMinMax(long long int arr[], long long int n);

int main()
{
    long long int t, n, a[100002], i;
    struct pair minmax;

    scanf("%lld", &t);
    while (t--)
    {
        scanf("%lld", &n);

        for (i = 0; i < n; i++)
            scanf("%lld", &a[i]);
        minmax = getMinMax(a, n);
        printf("%lld %lld\n", minmax.min, minmax.max);
    }
    return 0;
}

struct pair getMinMax(long long int arr[], long long int n)
{
    struct pair minmax;
    minmax.min = arr[0];
    minmax.max = arr[0];
    for (int i = 1; i < n; i++)
    {
        if (arr[i] > minmax.max)
        {
            minmax.max = arr[i];
        }
        if (arr[i] < minmax.min)
        {
            minmax.min = arr[i];
        }
    }
    return minmax;
}