Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts LeetCode solution in Python

1
class Solution:
2
    def maxArea(
3
        self, h: int, w: int, horizontalCuts: List[int], verticalCuts: List[int]
4
    ) -> int:
5
        horizontalCuts.sort()
6
        verticalCuts.sort()
7

8
        mxHr = 0
9
        prev = 0
10
        for i in horizontalCuts:
11
            mxHr = max(mxHr, i - prev)
12
            prev = i
13
        mxHr = max(mxHr, h - horizontalCuts[-1])
14

15
        mxVr = 0
16
        prev = 0
17
        for i in verticalCuts:
18
            mxVr = max(mxVr, i - prev)
19
            prev = i
20
        mxVr = max(mxVr, w - verticalCuts[-1])
21

22
        return (mxHr * mxVr) % ((10**9) + 7)