LeetCode #1465: Maximum Area of Cake After Cuts

LeetCode Question - 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts 🍰 About the Series Problem-solving is a key skill set for any tech-related stuff you might be working on. When it comes to developers it's one of the most crucial skills which is needed in almost any day-to-day code you might be writing. So, this series of blogs is all about practicing Daily LeetCode Challenges & Problem-solving. 🚀 Earlier in this series: LeetCode #1710: Maximum Units on a Truck . Problem Statement Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts 🍰 You are given a rectangular cake of size h x 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 and similarly, and verticalCuts[j] is the distance from the left of the rectangular cake to the jth vertical cut. Return the maximum area of a piece of cake after you cut at each horizontal and vertical positi