Python nlogn Solution
\nclass Solution:\n    def maxArea(self, h: int, w: int, horizontalCuts: List[int], verticalCuts: List[int]) -> int:\n        horizontalCuts += [0,h]\n        v
```\nclass Solution:\n    def maxArea(self, h: int, w: int, horizontalCuts: List[int], verticalCuts: List[int]) -> int:\n        horizontalCuts += [0,h]\n        verticalCuts += [0,w]\n        \n        horizontalCuts.sort()\n        verticalCuts.sort()\n        \n        hor_diff = -1\n        ver_diff = -1\n        \n        for i in range(1,len(horizontalCuts)):\n            hor_diff = max(hor_diff,horizontalCuts[i] - horizontalCuts[i-1])\n        \n        for i in range(1,len(verticalCuts)):\n            ver_diff = max(ver_diff,verticalCuts[i] - verticalCuts[i-1])\n        \n        return (hor_diff * ver_diff) % (10**9 + 7)\n```
['Sorting', 'Python']