Question bank › Greedy
Dsa Greedy Easy

Food Package Delivery

A delivery service wants to minimize the number of trips while delivering food packages. Each package has a weight, and there is a maximum weight limit for each trip. You'll receive an integer indicating the maximum weight limit followed by a list of integers representing the weights of the packages. Print the minimum number of trips needed to deliver all packages. Example input: 10 1 2 3 8 7 4 Output: 4

Key concepts

greedydeliveryminimization

Practise this out loud — free

Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.

🎙 Practise this question now
Part of InterviewLab's verified interview question bank. We show the prompt and concepts to practise with — never a copy-paste solution.