3195. Find the Minimum Area to Cover All Ones I

LeetCodeArrayMatrixOpen on judge ↗

You are given a 2D binary array grid. Find a rectangle with horizontal and vertical sides with the smallest area, such that all the 1's in grid lie inside this rectangle. Return the minimum possible area of the rectangle. Example 1: Input: grid = [[0,1,0],[1,0,1]] Output: 6 Explanation: The smallest rectangle has a height of 2 and a width of 3, so it has an area of 2 * 3 = 6. Example 2:

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI