search

Ayush7614 / Daily-Coding-DS-ALGO-Practice

A open source project🚀 for bringing all interview💥💥 and competative📘 programming💥💥 question under one repo📐📐
https://daily-ds-algo.github.io/DS-Algo-Website/
MIT License
322 stars 474 forks source link

Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts #718

Open sardonicankita opened 3 years ago

sardonicankita commented 3 years ago

Aim

To solve the Leetcode medium problem "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts" in C++.

Details

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 position provided in the arrays horizontalCuts and verticalCuts. Since the answer can be a large number, return this modulo 109 + 7.

Programming language

sardonicankita commented 3 years ago

Admins, Please assign me this issue

sardonicankita commented 3 years ago

@Ayush7614 @Amit366 Kindly merge the pr #1242 .

sardonicankita commented 3 years ago

@admins please look at the pr #1242