Convert Min Heap to Max Heap Problem Statement

Given an array representation of a min-heap of size 'n', your task is to convert this array into a max-heap.

Input:

The first line of input contains an integer ‘T’ denoting the number of test cases.
The next 2*T lines represent test cases.
The first line contains a single integer ‘n’ denoting the size of the array.
The next line contains ‘n’ space-separated integers denoting the min-heap.

Output:

Return any possible max-heap for the given input min-heap.
Output for each query is printed in a separate line.

Example:

Input:

min-heap = [1,2,3,6,7,8]

Output:

max-heap = [8,7,3,6,2,1]

Constraints:

• 1 <= T <= 10
• 1 <= n <= 5000
• 1 <= arr[i] <= 10⁵
• Time Limit: 1 sec

Note:

The output max-heap will be checked from the given function: if the output array is a max-heap, it will return true; otherwise, it will return false.