Reading time: 30 minutes | Coding time: 20 minutes

Given a set of n types of 3D rectangular boxes, find the maximum height that can be reached stacking instances of these boxes. Some observations:

This is a companion discussion topic for the original entry at http://iq.opengenus.org/box-stacking-problem/