Container with Maximum Water

You have been given an array/list ‘ARR‘ of length ‘N’ consisting of non-negative integers ARR1, ARR2, ..., ARRN. The i’th integer denotes a point with coordinates (i, ARR[i]). ‘N’ vertical lines are drawn such that the two endpoints of the i’th line are at (i, arr[i]) and (i,0).

Your task is to find two lines, which, together with the x-axis, form a container, such that the container contains the most water. Return the maximum area of the container.

Note:

1. Consider the container to be 2-dimensional for simplicity. 
2. For any pair of sides ignore all the lines that lie inside that pair of sides. 
3. You are not allowed to slant the container.

Example:

Consider 'ARR'= {1,8,6,2,5,4,8,3,7} then the vertical lines are represented by the above image. The blue section denotes the maximum water than a container can contain.

Input Format:

The first line contains a single integer ‘T’ denoting the number of test cases.

The first line of each test case contains a single integer ‘N’ denoting the number of elements in the array/list.

The second line of each test case contains ‘N’ single space-separated integers denoting the elements of the array/list.

Output Format:

For each test case, return a single integer which denotes the maximum area of the container.

Note:

You don’t need to print the output, It has already been taken care of. Just implement the given function.

Constraints:

1 <= T <= 100
2 <= N <= 5000
1 <= ARR[i] <= 10^5

Where 'ARR[i]' denotes the elements of the given array/list.

Time limit: 1 sec