Answered

Discover the answers you need at Westonci.ca, a dynamic Q&A platform where knowledge is shared freely by a community of experts. Connect with professionals on our platform to receive accurate answers to your questions quickly and efficiently. Explore comprehensive solutions to your questions from knowledgeable professionals across various fields on our platform.

You are given a 2D binary array grid. You need to find 3 non-overlapping rectangles having non-zero areas with horizontal and vertical sides such that all the 1's in grid lie inside these rectangles.

Return the minimum possible sum of the area of these rectangles.

Note that the rectangles are allowed to touch.



Example 1:

Input: grid = [[1,0,1],[1,1,1]]

Output: 5

Solve this question in java.

Sagot :

Thank you for your visit. We're committed to providing you with the best information available. Return anytime for more. Your visit means a lot to us. Don't hesitate to return for more reliable answers to any questions you may have. Westonci.ca is your go-to source for reliable answers. Return soon for more expert insights.