Apple Redistribution into Boxes Problem

Apple Redistribution into Boxes Problem — ExecCode Easy DSA Practice

Solve the Apple Redistribution into Boxes problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Description You are given an array apple of size n and an array capacity of size m. There are n packs where the i^th pack contains apple[i] apples. There are m boxes as well, and the i^th box has a capacity of capacity[i] apples. Return the minimum number of boxes you need to se…

Practice Apple Redistribution into Boxes free on ExecCode. Browse more ExecCode DSA problems.