Books Allocation Problem Using Binary Search | FREE DSA Course in JAVA | Lecture 59

We are going to solve an advanced binary search question asked by companies like Google.
The question is popularly known as the book allocation problem.
In this question, you are given an array of books where each element denotes the number of pages in a book.
Now you are given a value b which is the number of students between whom you have to allocate the book such that the student who gets the maximum pages should be the minimum of all maximum possible cases.
There are some other conditions associated with the program:-
1. One book can be allocated to one student only
2. Each student should get at least one book
4. Books should be allocated in a continuous manner
4. All books should be allocated
Let's see how this program can be solved using the binary search algorithm and wheat make this book allocation program is special program that it is being asked in companies like Google.
For more information, fill out this form: forms.gle/8eiUmM92Fx563Aen9
or call us at 8884881203
Facebook: / thetapacademy
Instagram: / tapacademy_online
Linkedin: / 73820805
Website: www.thetapacademy.com​

[@saurabhdwivedi7699]

I think most underrated education channel with such a high quality content ❤.

[@prudhvirajmacherla9854]

Sir i have no words to appreciate your efforts

[@TAPACADEMY]

Thanks a ton

[@ADK00787]

Very well explained it. Thank You. Pls upload more DSA videos

[@Er_IT_prashantjha]

Awesomely explained 😃👍🏻

[@thellaidhinesh8646]

awesome work

[@ArunKumar-vd8zt]

if u believe be or not one of best explaination i have ever seen in youtube 🫂

[@negativdomain1370]

Nice explanation 😇😇.

[@Engineering_Unlocked]

bhaiya sch mein mja aa gya

[@abhishekjain8809]

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.

[@saiakshagn3553]

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[])).

[@kunalmane-pl8vx]

Sir plz take aggressive cow problem also

[@venuvardhan8322]

Sir take low as maximum in arrays

[@ritvikindupuri2388]

shouldn't it be students >= b bc you can't do 2 > 2