Books Allocation - Google Interview Question | Binary Search, Part 4 | DSA-One Course #25

Hey guys, In this video we're going to solve an important problem on Binary search. It's called Books Allocation - Minimise the maximum number of Pages read by a student.

🥳 Join our Telegram Community:

🚀 Follow me on:

💸 Use coupon code ANUJBHAIYA on GeeksforGeeks to avail discounts on courses!

Hashtags:
#anujbhaiya #dsaone

Ignore these tags:

book allocation problem
min allocation of books
allocate books
asset allocation
allocate books algorithm
warren buffett asset allocation
allocation
binary search problem example
binary search interview problem
memory allocation
problems
static memory allocation
dynamic memory allocation
asset allocation portfolio
asset allocation model
dynamic memory allocation lecture
example of static memory allocation
dynamic memory allocation in c
binary search
binary search algorithm
binary search problem example
binary search tree
binary search competitive programming
competitive programming binary search
upper bound binary search
first occurrence binary search
binary search competitive coding
aggressive cows binary search
book allocation problem
optimisation problem binary search
exponentiation using binary search
binary search in c
binary search interview questions
lower bound binary search
binary search
coding interview
binary search tree
google coding interview
google interview
google
google interview questions
binary search tree interview questions
interview
binary tree
google interview question
binary search algorithm
google coding interview questions
validate binary search tree
programming interview
google technical interview
binary search interview problem
binary search interview questions
google coding interview question and answer

[romirajput]

This is really the best DSA course, because you discuss the problem and solve it on board with which we r familiar

[trialaccount]

Bhaiya TBH, out of all your lectures ye thoda smjh nhi aaya from ques explanation till last, 😓 code waala Part clear tha bt intuition was not clear

[Krishna-levz]

Bhaiya aap ki bjah se DSA krne me interest aur bd jata h😍

[siddharthkeshri]

That T'Shirt Its still day one !! 🔥❤️

[abhishekverma]

Bhai aise questions laya karo na yaar, chahe ispe views kam aaye, pr aane wale time pe, sab aayenge tumhari channel pe hi, kyunki normal questions to hr koi la raha h ye questions hi show krta h ji aap apne channel ke liye kitna effort dal rahe ho. And long term pe aise hi questions company m punche jayenge jo sabne na sune ho.

[sumitkevlani]

Isme ham kadane's algorithm laga sakte h na
Cumulative sum1 nikalkar usko total sum me se har case me minus krenge aur sum1, sum2 ka max lekar har iteration me minimum update krte jayenge
Time complexity O(n) aur space O(1)

[theJS_developer]

Anuj bhaiyya 🔥🔥❤️
Please Upload videos fast😀

[comedyhub]

Thanks bhai.... Continue krne k liye
Ese hi daily question upload krdena bhai🙏

[premranjan]

How the naive appoach is giving complexity of 2^n?

[justcoderks]

your video is shorter than others which is the best thing and it clears the concept 🙌❤

[prabhatkeshari]

Java ke frameworks pai video bano na 🙏plz

[anujpandit]

Bhai u are great mai apki vedio lag bhag sari dekh dali hai aur ek doubt hai ki agar mai bsc comp sci me hu aur mujhe ms it karni hai to vo kaise Can u guide me

[ssharma_saurabh-xgib]

wow such a nice question bhaiyaa...mtlb mjaa aa gyaa isme..

[__shivamverma]

use this as a base condition
if (key > array.length)
return -1;

[agyaani]

Best series on Youtube is here❤....Thankss a lot anuj bhaiya🙂✨

[suryaprakashchaudhary]

Awsome course ever. Please cover all topics related to DSA

[prashantsaini]

Anuj bahiya, please make a video on java aplet.. it's a request please 🙏

[manansheth]

Isn't 2 pointers a better way to solve this? That will give time complexity of O(n).

[hetshah]

Thank you so much Bhaiya for this amazing DSA series!!...
🙏

[Ase]

Awesome!!
But can you please incresae the frequency?