← Amazon questions

Box stacking problem for k dimensions

Filed under Amazon

Given a set of n boxes where each box has k dimensions, find the maximum possible height (or another dimension) of a stack of boxes such that each box on top is strictly smaller than the box below it…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.