Available question text
Given an m×n rectangle and a list of prices for specific h×w pieces (rotation not allowed), maximize total revenue by cutting the rectangle with full-width or full-height cuts. The core challenge is a 2D dynamic programming / recursive partitioning problem that considers selling a matching piece versus all possible horizontal and vertical splits.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Meta
Leetcode 2312. Selling Pieces of Wood
Interview reported: Feb 10, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source