Got a question which gave three values \n```int[] quantity, int num, int k ```\n\nA truck could only fit a capacity of ```num``` and one truck cannot have the same product more than ```k``` times. Each value in ```quantity``` represents and individual product. We were asked to return the minimum number of trucks needed in a scenario. Is there a leetcode/hackerrank problem like this already? I was unable to find something just cause I wanted to practice it on my own\n\nExample \n```\nquantity = [2, 4]\nnum = 3\nk = 2\nWe would need two trucks total. Each truck would have one of the first product and two of the second product.

Got a question which gave three values \nint[] quantity, int num, int k\n\nA truck could only fit a capacity of num and one truck cannot have the same product m