D. J.:

- Added the leetcode problem and solution for 812

Author: nobodyPerfecZ

README.md

@@ -270,6 +270,7 @@
 - [740 Delete and Earn](https://leetcode.com/problems/delete-and-earn/description/)
 - [746 Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/description/)
 - [790 Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling/description/)
+- [812 Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area/description/)
 - [909 Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders/description/)
 - [918 Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray/description/)
 - [931 Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/description/)

awesome_python_leetcode/_812_largest_triangle_area.py

@@ -0,0 +1,26 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def largestTriangleArea(self, points: List[List[int]]) -> float:
+        """
+        Given an array of points on the X-Y plane points where points[i] = [xi, yi],
+        return the area of the largest triangle that can be formed by any three
+        different points. Answers within 10-5 of the actual answer will be accepted.
+        """
+        # [x1, y1] [x2, y2] [x3, y3]
+        # Area = 0.5 * |x1 * (y2 - y3) + x2 * (y3 - y1) + x3 * (y1 - y2)|
+        max_area = 0
+        for i in range(len(points) - 2):
+            for j in range(i + 1, len(points) - 1):
+                for k in range(j + 1, len(points)):
+                    x1, y1 = points[i]
+                    x2, y2 = points[j]
+                    x3, y3 = points[k]
+                    new_area = 0.5 * abs(
+                        x1 * (y2 - y3) + x2 * (y3 - y1) + x3 * (y1 - y2)
+                    )
+                    max_area = max(max_area, new_area)
+        return max_area

tests/test_812_largest_triangle_area.py

@@ -0,0 +1,18 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._812_largest_triangle_area import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["points", "expected"],
+    argvalues=[
+        ([[0, 0], [0, 1], [1, 0], [0, 2], [2, 0]], 2.0),
+        ([[1, 0], [0, 0], [0, 1]], 0.5),
+    ],
+)
+def test_func(points: List[List[int]], expected: List[int]):
+    """Tests the solution of a LeetCode problem."""
+    triangle_area = Solution().largestTriangleArea(points)
+    assert triangle_area == expected