But it doesn't have to end here! Sign up for the 7-day coding interview crash course and you'll get a free Interview Cake problem every week.
You're in!
You are a renowned thief who has recently switched from stealing precious metals to stealing cakes because of the insane profit margins. You end up hitting the jackpot, breaking into the world's largest privately owned stock of cakes—the vault of the Queen of England.
While Queen Elizabeth has a limited number of types of cake, she has an unlimited supply of each type.
Each type of cake has a weight and a value, stored in objects of a CakeType class:
For example:
You brought a duffel bag that can hold limited weight, and you want to make off with the most valuable haul possible.
Write a method maxDuffelBagValue that takes an array of cake type objects and a weight capacity, and returns the maximum monetary value the duffel bag can hold.
For example:
Weights and values may be any non-negative integer. Yes, it's weird to think about cakes that weigh nothing or duffel bags that can't hold anything. But we're not just super mastermind criminals—we're also meticulous about keeping our algorithms flexible and comprehensive.
Does your method work if the duffel bag's weight capacity is 0 kg?
Does your method work if any of the cakes weigh 0 kg? Think about a cake whose weight and value are both 0.
We can do this in time and space, where n is the number of types of cakes and k is the duffel bag's capacity!
The brute force approach is to try every combination of cakes, but that would take a really long time—you'd surely be captured.
What if we just look at the cake with the highest value?
We could keep putting the cake with the highest value into our duffel bag until adding one more would go over our weight capacity. Then we could look at the cake with the second highest value, and so on until we find a cake that’s not too heavy to add.
Will this work?
Nope. Let's say our capacity is 100 kg and these are our two cakes:
With our approach, we’ll put in two of the second type of cake for a total value of 400 shillings. But we could have put in a hundred of the first type of cake, for a total value of 3000 shillings!
Just looking at the cake's values won’t work. Can we improve our approach?
Well, why didn’t it work?
We didn’t think about the weight! How can we factor that in?
What if instead of looking at the value of the cakes, we looked at their value/weight ratio? Here are our example cakes again:
The second cake has a higher value, but look at the value per kilogram.
The second type of cake is worth 4 shillings/kg (200/50), but the first type of cake is worth 30 shillings/kg (30/1)!
Ok, can we just change our algorithm to use the highest value/weight ratio instead of the highest value? We know it would work in our example above, but try some more tests to be safe.
We might run into problems if the weight of the cake with the highest value/weight ratio doesn’t fit evenly into the capacity. Say we have these two cakes:
If our capacity is 8 kg, no problem. Our algorithm chooses one of each cake, giving us a haul worth 110 shillings, which is optimal.
But if the capacity is 9 kg, we're in trouble. Our algorithm will again choose one of each cake, for a total value of 110 shillings. But the actual optimal value is 120 shillings—three of the first type of cake!
So even looking at the value/weight ratios doesn’t always give us the optimal answer!
Let’s step back. How can we ensure we get the optimal value we can carry?
Try thinking small. How can we calculate the maximum value for a duffel bag with a weight capacity of 1 kg? (Remember, all our weights and values are integers.)
If the capacity is 1 kg, we’ll only care about cakes that weigh 1 kg (for simplicity, let's ignore zeroes for now). And we'd just want the one with the highest value.
We could go through every cake, using a greedy approach to keep track of the max value we’ve seen so far.
Here’s an example solution:
(We're using long because we're looking for a max value.)
Ok, now what if the capacity is 2 kg? We’ll need to be a bit more clever.
It’s pretty similar. Again we’ll track a max value, let’s say with a variable maxValueAtCapacity2. But now we care about cakes that weigh 1 or 2 kg. What do we do with each cake? And keep in mind, we can lean on the code we used to get the max value at weight capacity 1 kg.
Does this apply more generally? If we can use the max value at capacity 1 to get the max value at capacity 2, can we use the max values at capacity 1 and 2 to get the max value at capacity 3?
Looks like this problem might have overlapping subproblems!
Let's see if we can build up to the given weight capacity, one capacity at a time, using the max values from previous capacities. How can we do this?
Well, let’s try one more weight capacity by hand—3 kg. So we already know the max values at capacities 1 and 2. And just like we did with maxValueAtCapacity1 and maxValueAtCapacity2, now we’ll track maxValueAtCapacity3 and loop through every cake:
What do we do for each cake?
If the current cake weighs 3 kg, easy—we see if it’s more valuable than our current maxValueAtCapacity3.
What if the current cake weighs 2 kg?
Well, let's see what our max value would be if we used the cake. How can we calculate that?
If we include the current cake, we can only carry 1 more kilogram. What would be the max value we can carry?
We already know the maxValueAtCapacity1! We can just add that to the current cake’s value!
Now we can see which is higher—our current maxValueAtCapacity3, or the new max value if we use the cake:
Finally, what if the current cake weighs 1 kg?
Basically the same as if it weighs 2 kg:
There’s gotta be a pattern here. We can keep building up to higher and higher capacities until we reach our input capacity. Because the max value we can carry at each capacity is calculated using the max values at previous capacities, we'll need to solve the max value for every capacity from 0 up to our duffel bag's actual weight capacity.
Can we write a method to handle all the capacities?
To start, we'll need a way to store and update all the max monetary values for each capacity.
We could use a hash map, where the keys represent capacities and the values represent the max possible monetary values at those capacities. Hash maps are built on arrays, so we can save some overhead by just using an array.
What do we do next?
We’ll need to work with every capacity up to the input weight capacity. That’s an easy loop:
What will we do inside this loop? This is where it gets a little tricky.
We care about any cakes that weigh the current capacity or less. Let's try putting each cake in the bag and seeing how valuable of a haul we could fit from there.
So we'll write a loop through all the cakes (ignoring cakes that are too heavy to fit):
And put it in our method body so far:
How do we compute maxValueUsingCake?
Remember when we were calculating the max value at capacity 3kg and we "hard-coded" the maxValueUsingCake for cakes that weigh 3 kg, 2kg, and 1kg?
How can we generalize this? With our new method body, look at the variables we have in scope:
Can we use these to get maxValueUsingCake for any cake?
Well, let's figure out how much space would be left in the duffel bag after putting the cake in:
So maxValueUsingCake is:
We can squish this into one line:
Since remainingCapacityAfterTakingCake is a lower capacity, we'll have always already computed its max value and stored it in our maxValuesAtCapacities!
Now that we know the max value if we include the cake, should we include it? How do we know?
Let's allocate a variable currentMaxValue that holds the highest value we can carry at the current capacity. We can start it at zero, and as we go through all the cakes, any time the value using a cake is higher than currentMaxValue, we'll update currentMaxValue!
What do we do with each value for currentMaxValue? What do we need to do for each capacity when we finish looping through all the cakes?
We save each currentMaxValue in the maxValuesAtCapacities array. We'll also need to make sure we set currentMaxValue to zero in the right place in our loops—we want it to reset every time we start a new capacity.
So here's our method so far:
Looking good! But what's our final answer?
Our final answer is maxValuesAtCapacities[weightCapacity]!
Okay, this seems complete. What about edge cases?
Remember, weights and values can be any non-negative integer. What about zeroes? How can we handle duffel bags that can’t hold anything and cakes that weigh nothing?
Well, if our duffel bag can’t hold anything, we can just return 0. And if a cake weighs 0 kg, we return infinity. Right?
Not that simple!
What if our duffel bag holds 0 kg, and we have a cake that weighs 0 kg. What do we return?
And what if we have a cake that weighs 0 kg, but its value is also 0. If we have other cakes with positive weights and values, what do we return?
If a cake’s weight and value are both 0, it’s reasonable to not have that cake affect what we return at all.
If we have a cake that weighs 0 kg and has a positive value, it’s reasonable to return infinity, even if the capacity is 0.
For returning infinity, we have a couple choices. We could return:
What are the advantages and disadvantages of each option?
For the first option the advantage is the highest possible Long will behave like infinity in a few ways. For example, it'll be greater than any other integer. But it's a still a specific number, which can be an advantage or disadvantage—we might want our result to always be the same type, but representing infinity as a specific number is "lossy"—it won't be clear if we're talking about an actual value or the special case of infinity.
The second option is a good choice if we decide infinity is usually an "unacceptable" answer. For example, we might decide an infinite answer means we've probably entered our inputs wrong. Then, if we really wanted to "accept" an infinite answer, we could always "catch" this exception when we call our method.
Either option could be reasonable. We'll go with the second one here.
This is a classic computer science puzzle called "the unbounded knapsack problem."
We use a bottom-up approach to find the max value at our duffel bag's weightCapacity by finding the max value at every capacity from 0 to weightCapacity.
We allocate an array maxValuesAtCapacities where the indices are capacities and each value is the max value at that capacity.
For each capacity, we want to know the max monetary value we can carry. To figure that out, we go through each cake, checking to see if we should take that cake.
The best monetary value we can get if we take a given cake is simply:
To handle weights and values of zero, we throw an infinity error only if a cake weighs nothing and has a positive value.
time, and space, where n is number of types of cake and k is the capacity of the duffel bag. We loop through each cake (n cakes) for every capacity (k capacities), so our runtime is , and maintaining the array of k+1 capacities gives us the space.
Congratulations! Because of dynamic programming, you have successfully stolen the Queen's cakes and made it big.
Keep in mind: in some cases, it might not be worth using our optimal dynamic programming solution. It's a pretty slow algorithm—without any context (not knowing how many cake types we have, what our weight capacity is, or just how they compare) it's easy to see growing out of control quickly if n or k is large.
If we cared about time, like if there was an alarm in the vault and we had to move quickly, it might be worth using a faster algorithm that gives us a good answer, even if it's not always the optimal answer. Some of our first ideas in the breakdown were to look at cake values or value/weight ratios. Those algorithms would probably be faster, taking time (we'd have to start by sorting the input).
Sometimes an efficient, good answer might be more practical than an inefficient, optimal answer.
This question is our spin on the famous "unbounded knapsack problem"—a classic dynamic programming question.
If you're struggling with dynamic programming, we have reference pages for the two main dynamic programming strategies: memoization and going bottom-up.
Reset editor
Powered by qualified.io