Available question text
Partition the ordered list of books into contiguous shelves so each shelf's total thickness ≤ shelfWidth and the shelf height equals the maximum book height on it; minimize the sum of shelf heights. The core challenge is deciding how far to extend each shelf (a prefix-partitioning problem) solvable with dynamic programming over book indices.
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
No company association
Leetcode 1105. Filling Bookcase Shelves
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source