geeksforgeeks.org Problem Statement Given: books[i] = pages in ith book m students Allocate books such that: Every student gets at least one book. Books are allocated contiguously. Every book is assigned. Minimize: Maximum pages assigned to any student Return the minimum possible value. Brute Force Intuition In an interview, you can explain it like this: Try every possible maximum page limit and check whether it is possible to distribute books among students while respecting that limit. This wor