Leetcode 1691. Maximum Height by Stacking Cuboids

Given cuboids whose dimensions can be permuted, pick and stack a subset so each cuboid above has all three dimensions <= the one below, maximizing the sum of heights. After normalizing each cuboid's dimensions this reduces to a DP/weighted-LIS on a partial order of up to 100 items.