Maximum rectangle Fit

CodeChefOpen on judge ↗

Yogesh has a whiteboard of dimension $NxM$. Also, he has an unlimited number of blackboards of dimension $2x1$. He is allowed to rotate the blackboard. He is asked to place as many as blackboards on $top$ of the whiteboard to meet the following conditions: 1. Each blackboard can completely cover the 2x1 part of the whiteboard. 2. No two blackboards overlap. 3. Each blackboard can only be pla

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