Leetcode 638. Shopping Offers
Given unit prices, unlimited-use special bundle offers, and a target quantity for each of up to 6 items, compute the minimum cost to buy exactly those quantities without exceeding them. The core challenge is a small-dimensional combinatorial optimization over the needs vector that’s typically solved by state-space search with pruning/memoization (DFS/DP) to try combinations of offers.
Asked at:
Airbnb
Uber
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Late April, 2026
Airbnb
Senior
A different wording of Leetcode 638. Shopping Offers. Given menu items, some menu entries can be combos, try to fulfill an order. Order is just a list of items, assuming one quantity each item in the order. Try to minimize cost. return minimum cost. Max 3 items in the order.
Mid November, 2025
Uber
Mid-level
Hello Interview Premium
Your account is free and you can post anonymously if you choose.