



The first line of input contains an integer ‘T’ denoting the number of test cases to run. Then the test case follows.
The first line of each test case contains a single integer ‘N’ denoting the number of points given.
The next 'N' lines contain two single space-separated integers denoting the points in the 2D coordinate system.
For each test case, return the maximum area of the triangle possible.
You don’t need to print anything or take input. This already has been taken care of. Just implement the function.
1 <= T <= 10
3 <= N <= 100
-50 <= POINTS[i][0], POINTS[i][1] <= 50
Time limit: 1 sec
We will calculate the area of each possible triangle and then just take the maximum between them.
The formula for finding the area of a triangle formed by the points (x1, y1), (x2, y2),(x3, y3) is given below:
Pair Product Div by K
Pair Product Div by K
Merge Two Sorted Arrays Without Extra Space
Merge Two Sorted Arrays Without Extra Space
Co-Prime
First Digit One
Special Digit Numbers