Answered

Welcome to Westonci.ca, where curiosity meets expertise. Ask any question and receive fast, accurate answers from our knowledgeable community. Our Q&A platform offers a seamless experience for finding reliable answers from experts in various disciplines. Get immediate and reliable solutions to your questions from a community of experienced professionals 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 :

We appreciate your time on our site. Don't hesitate to return whenever you have more questions or need further clarification. Thanks for using our platform. We aim to provide accurate and up-to-date answers to all your queries. Come back soon. Thank you for visiting Westonci.ca, your go-to source for reliable answers. Come back soon for more expert insights.