Solving Largest Triangle Area in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

You have a list of points in the plane. Return the area of the largest triangle that can be formed by any 3 of the points.

Example:
Input: points = [[0,0],[0,1],[1,0],[0,2],[2,0]]
Output: 2
Explanation: 
The five points are show in the figure below. The red triangle is the largest.

Notes:

  • 3 <= points.length <= 50.
  • No points will be duplicated.
  • -50 <= points[i][j] <= 50.

See the full details of the problem Largest Triangle Area at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go