Given an integer array `nums` of size `n`, find the maximum and minimum elements in the array and return them as a pair.\n\nWrite a function `findMinMax` that takes in an integer array `nums` and returns a pair of integers containing the maximum and minimum elements.\n\nYou can assume that `nums` will always have at least one element.\n\n**Input:**\n- An integer array `nums` of size `n` (1 \u2264 n \u2264 10^4) where each element is an integer (-10^9 \u2264 nums[i] \u2264 10^9).\n\n**Output:**\n- Return an integer array containing two elements: the maximum element followed by the minimum element from `nums`.\n\n**Example 1:**\n```java\nInput: nums = [4, 2, 5, 1, 6, 3]\nOutput: [6, 1]\nExplanation: The maximum element is 6, and the minimum element is 1.\n```\n\n**Example 2:**\n```java\nInput: nums = [1, 5, 7, 2, 9, 3]\nOutput: [9, 1]\nExplanation: The maximum element is 9, and the minimum element is 1.\n```\n\nNow Join with us on [https://codeharborhub.github.io/](https://codeharborhub.github.io/) and give us star on [GitHub](https://github.com/codeharborhub/codeharborhub.github.io) and contribute to solved all dsa problems with us.\n\n

Given an integer array nums of size n, find the maximum and minimum elements in the array and return them as a pair.\n\nWrite a function findMinMax that takes i