Hi guys, my brother came up with an interesting question. I tried to come up with a solution but I reduce its complexity. The question goes as such: Given N rectangles of size(hi, wi)(rectangle i has height hi and weight wi), find the rectangle with the smallest area that can fit all the other rectangles without them overlapping. You can rotate the rectangles. N, wi, hi <=10^4 I'm open to any kind of discussion.