## Swift Solution for Leetcode 1465

You can read the full story on The Swift Nerd blog with the link above.

# Problem Statement

Given a rectangular cake with height `h`

and width `w`

, and two arrays of integers `horizontalCuts`

and `verticalCuts`

where `horizontalCuts[i]`

is the distance from the top of the rectangular cake to the `ith`

horizontal cut…