Available question text
Given arrays of box heights and warehouse room heights, maximize how many boxes can be placed knowing a box can only reach a room if its height is ≤ the minimum height along the path to that room (so each room's effective capacity is its prefix minimum). The core challenge is a greedy matching problem using prefix minima on warehouse heights and sorting/two-pointer placement of boxes.
Related questions
Continue with questions that share topics or the same question type.
- Put Marbles in Bags
Coding · Array · Greedy · Heap (Priority Queue)
- Advantage Shuffle
Coding · Array · Greedy · Sorting
- Maximum Bitwise AND After Increment Operations
Coding · Array · Bit Manipulation · Greedy
- Maximum Coins From K Consecutive Bags
Coding · Array · Binary Search · Greedy
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Pinterest
Leetcode 1564. Put Boxes Into the Warehouse I
Reported Oct 1, 2026 · 2 source reports
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Pinterest
Put Boxes Into the Warehouse I
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 57.9. This is not an interview probability.
View source