Books Allocation Problem | Technical Interview Questions | Ep 7 | CodeChef

In this week's Technical Interview Questions, Saptarishi Mukherjee, an incoming SDE at Google, will be solving the very challenging problem - Books Allocation Problem: Given an array A of n positive integers, where A[i] denotes the number of pages in ith book, and B being the number of students. Every book must be allocated to exactly one student, and every student shall be associated with a contiguous allocation of books. Distribute the books such that the maximum number of pages allocated to a student is minimum. 00:00 Introduction 11:44 Briefing Binary Search 04:30 Problem Statement with Example 15:40 Discussion about approach 23:40 Approaching Binary Search 27:50 Binary Search on Answer Technique (Main Solution) 47:15 C++ Implementation 57:45 Conclusion Learn problem solving using this roadmap https://www.codechef.com/roadmap/cpp-dsa?utm_source=youtube&utm_medium=video&utm_campaign=youtube_previous Master DSA following this roadmap: https://www.codechef.com/roadmap/data-structures-and-algorithms?utm_source=youtube&utm_medium=video&utm_campaign=youtube_previous ▶️Do Like 👍, comment & share the the Video with your friends & subscribe our CodeChef YouTube Channel and press the 🔔 bell icon to get notifications for all new video editorials of all your favourite CodeChef problems.. 🔵Reach out to us on any of our social media handles: 🔸Instagram: https://www.instagram.com/codechef 🔸LinkedIn: https://www.linkedin.com/company/codechef #Coding #Competitive_Programming #Codechef