How does fractional knapsack differ from 0/1 knapsack?
PICTURE THIS: HOW TO EXPLAIN IT
Simple meaning
Sort items by value/weight and take whole items then a fraction of the next, which is optimal for the fractional version.
WHY — Greedy instead of guessing?
Why interviewers care about Greedy:
question about Greedy.
trade-offs, and what you would actually do on a DSA project - not buzzwords.
Name the idea, why it exists, then one short example.
End with when you use it and one common pitfall.
STEPS — What happens step by step?
Before you speak the answer, walk the interviewer through these steps:
- 1Sort items by value/weight
and take whole items then a fraction of the next, which is optimal for the fractional version.
- 2Time is O(n log
n) to sort.
- 30/1 forbids fractions so
greedy by ratio can fail and you need DP instead.
- 4Give an example
One tiny concrete case you can say aloud.
- 5Common mistake
What juniors usually get wrong.
- 6Close
When you pick this over the alternative.
EXAMPLE — See it in action
Here's a short line you can speak, broken into clear beats:
Note: Adapt this scaffold to your own project — keep it under 60–90 seconds.
Key takeaway
Sort items by value/weight and take whole items then a fraction of the next, which is optimal for the fractional version. Time is O(n log n) to sort.