Python | O(nlogn) | Simple Solution
\tclass Solution:\n\t\tdef maxArea(self, h: int, w: int, horizontalCuts: List[int], verticalCuts: List[int]) -> int:\n\n\t\t\thorizontalCuts = [0] + horizontalC
\tclass Solution:\n\t\tdef maxArea(self, h: int, w: int, horizontalCuts: List[int], verticalCuts: List[int]) -> int:\n\n\t\t\thorizontalCuts = [0] + horizontalCuts + [h]\n\t\t\tverticalCuts = [0] + verticalCuts + [w]\n\n\t\t\thorizontalCuts.sort()\n\t\t\tverticalCuts.sort()\n\n\t\t\thorizontal_max = -1\n\t\t\tvertical_max = -1\n\n\t\t\tfor index in range(1, len(horizontalCuts)):\n\t\t\t\thorizontal_max = max(horizontal_max, horizontalCuts[index]-horizontalCuts[index-1])\n\n\t\t\tfor index in range(1, len(verticalCuts)):\n\t\t\t\tvertical_max = max(vertical_max, verticalCuts[index]-verticalCuts[index-1])\n\n\t\t\treturn (horizontal_max * vertical_max) % ((10**9)+7)\n\n**If You Like The Solution Upvote.**
['Python', 'Python3']