- 0of 0 votes
Aisles contain products. Product is only going to be in one Aisle.
Given Array<Product>, find the N highest price combinations. Combination is 1 product from each aisle. You can choose only one instance of each product.
So if you had two aisles
And they asked for the 2 highest combos you would give $6,$5 and $6,$4