Hemant Mohane

include

using namespace std;

string ltrim(const string &); string rtrim(const string &); vector split(const string &);

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

vector reverseArray(vector a) { int left = 0, right = a.size() - 1;

while (left < right) {
    swap(a[left], a[right]);
    left++;
    right--;
}

return a;

}

int main() { ofstream fout(getenv("OUTPUT_PATH"));

string arr_count_temp;
getline(cin, arr_count_temp);

int arr_count = stoi(ltrim(rtrim(arr_count_temp)));

string arr_temp_temp;
getline(cin, arr_temp_temp);

vector<string> arr_temp = split(rtrim(arr_temp_temp));

vector<int> arr(arr_count);

for (int i = 0; i < arr_count; i++) {
    int arr_item = stoi(arr_temp[i]);

    arr[i] = arr_item;
}

vector<int> res = reverseArray(arr);

for (size_t i = 0; i < res.size(); i++) {
    fout << res[i];

    if (i != res.size() - 1) {
        fout << " ";
    }
}

fout << "\n";

fout.close();

return 0;

}

string ltrim(const string &str) { string s(str);

s.erase(
    s.begin(),
    find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);

return s;

}

string rtrim(const string &str) { string s(str);

s.erase(
    find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
    s.end()
);

return s;

}

vector split(const string &str) { vector tokens;

string::size_type start = 0;
string::size_type end = 0;

while ((end = str.find(" ", start)) != string::npos) {
    tokens.push_back(str.substr(start, end - start));

    start = end + 1;
}

tokens.push_back(str.substr(start));

return tokens;

}

Nol Card Balance Check is a simple and user-friendly platform that helps you quickly check your Nol card balance online without any hassle. Just enter your card details and get instant results anytime, anywhere. It’s designed to save your time and make managing your travel balance easy, fast, and convenient.

Here is Arrays - DS solution in python, java, c++ and c programming - https://programmingoneonone.com/hackerrank-arrays-ds-problem-solution.html

c++ 20

include

using namespace std;

void reverse_array(int arr[], int n) { for(int i = n - 1; i >= 0; i--) { cout << arr[i] << " "; } cout << endl; }

int main() { int n; cin >> n; int arr[n];

for(int i = 0; i < n; i++) {
    cin >> arr[i];
}


reverse_array(arr, n);

return 0;

}

C#

public static List<int> reverseArray(List<int> a)
{
    List<int> arr = new();

    for(int i = 0; i < a.Count; i++)
        arr.Add(a[a.Count - 1 - i]);

    return arr;
}