30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

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:

Uber

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid November, 2025

Uber

Mid-level

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 638. Shopping Offers

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact