2064. Minimized Maximum of Products Distributed to Any Store | Binary Search | Greedy | 2 Approaches

[@coderunner743]

understand greedy solution very clearly

[@ITACH1688]

Bhaiya peakkk video... Thanks for actually coming back♥

[@Jazzimus]

minimum for the binary search approach should be 1 because input array is non empty and has non zero values. hence we will have to give atleast 1 item to any store

[@alekhpand]

Welcome Back.

[@godFather-123-b8g]

bro thanks ur back
i used to always watch daily ques video

[@dewanandkumar8589]

Understood

[@anonymoushindustanti]

Bhai lagta hai pura Leetocde a solution Yt pe daal dega, btw nice approach and thank you

[@Its_Shubham_Negi]

I like this week's theme-Binary Search ❤

[@nabyendusaha892]

After so many days ❤ bhaiya is back

[@Anonymous____________A721]

Welcome back 👑 king

[@Abhay14]

maine ye approach bnai thi but galat nikli
class Solution {
public:
bool valid(int m, int t, int n){
for(int i=1; i

[@VinayKumar-xs6el]

thanks for java code instead c++. java code readabilty is good compare to c++

[@nikhil_squats]

clown

[@Engineering.Wallah]

Java 😭kaha se kru