Sir I tried this approach. You told that low should be min element from the array. but when I submit my code its not pass all the test cases. but if I get low value is max element from the array then it pass all the test cases.
You are correct bro because The minimum possible answer could be when number of student is equal to the number of book (i.e, M == N) , In this case all the students will get at most one book. So, the result would be the maximum number of pages among them (i.e, maximum(pages[])).
You are a gem literally the way you taught the intuition is just wow Thankyou so much.
I think most underrated education channel with such a high quality content ❤.
Sir i have no words to appreciate your efforts
Thanks a ton
Very well explained it. Thank You. Pls upload more DSA videos
Sir I tried this approach. You told that low should be min element from the array. but when I submit my code its not pass all the test cases. but if I get low value is max element from the array then it pass all the test cases.
You are correct bro because The minimum possible answer could be when number of student is equal to the number of book (i.e, M == N) , In this case all the students will get at most one book. So, the result would be the maximum number of pages among them (i.e, maximum(pages[])).
Awesomely explained 😃👍🏻
Nice explanation 😇😇.
awesome work
shouldn't it be students >= b bc you can't do 2 > 2
bhaiya sch mein mja aa gya
Sir take low as maximum in arrays
Sir plz take aggressive cow problem also
if u believe be or not one of best explaination i have ever seen in youtube 🫂