Have you even read the question carefully?
the kitchen initially so that the session would be successful regardless of how the junior chefs pick up the jars.
MINIMUM jars such that all chefs complete cooking REGARDLESS of how they pick jars, which is equal to the least upper bound.
This problem was a test of english understanding skills rather than coding
Please confirm my understanding :
The distribution of jars is random, like, we can’t guarantee that who will get how much, so we choose a minimum number such that whatsoever the distribution, the session ends successfully.
The max logic is faulty as it will only work if chefs cooperate among themselves, or the maxm demanding chef can obtain all those jars for himself which is not guaranteed.
Yes… Perfect.