Input: An integer N which represents the polygon's vertices and a list of their x and y coordinates.
Expected output: The smallest difference possible between the area of the(not necessarily convex) polygon and the triangle containing it. The triangle also has to share at least 2 vertices with the polygon. If there is no such triangle print -1.
4 0,0 2,0 1,1 0,2
Output: 0, because the polygon matches up perfectly with the triangle.
This is code-golf so answers will be scored in bytes with less bytes being better.