Minimized Maximum of Products Distributed to Any Store - Leetcode 2064 - Python

[@NeetCodeIO]

Maybe i should change my shirt color based on the difficulty of the problem. Thoughts?

[@bzrkr444]

Start wearing different coloured flannels like Anthony Fantano

[@Tejesh-t1t]

genuis

[@adityamanitripathi478]

So cool

[@yassinmohamed7240]

Cool

[@leeroymlg4692]

hard problems = shirtless

[@ankitpratap2496]

For C++, you need to ensure floating point division: double real = static_cast(quantities[i]) / a; int val = std::ceil(real); stores += val;

[@finemechanic]

Or you can avoid floating point arithmetic altogether. stores += quantities[i] / a + (quantities[i] % a ? 1 : 0); You may google for even more sophisticated, but less explicit solutions.

[@RakimMiddya]

you can just stores += (quantities[i]+a-1)/a; learnt it from larry's vid

[@Farkhod-i7n]

bro be scheming up in O(1) in that thumbnail

[@unlucky-777]

9:52 I think our left can be = ceil(sum(quentities)/n) because we know that we must to deliver item to every store and instead of starting 1 (may or may not deliver the items) we can start at the lowest possible left that we know we will deliver items to each store but we don't know if it is the optimal one

[@jody4210]

I didnt major in CS so I only took some introduction courses on programming and wasn't familiar with algorithms. But learning how to do leetcode with your videos have been so helpful. Like you suggested I went to watch the koko video you made and managed to solve this problem without having to get into the coding explanation part! I can't really say I solved it all on my own bc the koko video helped a lot due to how similar these two problems are, but I really feel that I am learning and improving. Thank you so much

[@anonanon6596]

You could stop at five or six stores or, just one.

[@satyajit_2003]

@NeetCodeIO, I think instead of initializing another variable 'res' we can return r+1, I tried and it works

[@greedyfishbones]

u look so happy!! its so cute

[@IK-xk7ex]

I solved it because yesterday's problem was binary search :)

[@MP-ny3ep]

Beautifully explained. Thank you

[@chetanshrivastava3762]

God bless you brother.Nice explanation.

[@nicolasrodriguez623]

Did well on my Google interview but didn’t pass. Back to the grind I guess.

[@pastori2672]

bro actually did it again 😂

[@programming_with_shashank]

Hey, in the helper function why not just divide the n value by the summation of the quantities array? Why do we have to go one by one for each quantity?

[@Reck1025]

Each store can only receive one type of product. You might get false positives if you just sum up the quantities

[@programming_with_shashank]

@@Reck1025 Tried and testing for myself, makes sense now 🥲

[@mohamedsayed8697]

I do not mean anything about you, but I am starting to miss the old thumbnail, it was like a NeetCode trademark kind of thing, at least for me. It nice seeing you on these thumbnails tho.

[@JamesBond-mq7pd]

can someone explain why whenever we find a valid x, it’s smaller than any previously found x???

[@JamesBond-mq7pd]

i think i got it. In binary search, we always move towards a certain point, and when we set left = mid + 1, it will never be equal to or greater than the previous right = mid - 1.

[@dekumidoriya-qi2is]

@@JamesBond-mq7pd yeah that's pretty much the reason :)

[@web-unlocked]

I had no clue how to solve this problem😇 then I watch 30 seconds of the video and re did koko eating bananas 🥵then I was able to solve this problem in under 5 min🤣

[@LNGAMING135]

C++😢

[@kanhaiwadekar6615]

tf unc in the thumbnail for ☠

[@whiteasian2777]

bro thinks he is an indian dsa teacher in the thbumnail

[@jalalhamzah4938]

First😅

[@deathxunnat4693]

first

[@xiaoshen194]

Bro u solved the ques and made a video and uploaded it within 25 min of the daily ques!! 🫡