Painter's Partition Problem
Problem: Minimize maximum time any painter spends, given K painters and N boards.
Binary Search on Answer: Search range is [max(boards), sum(boards)]
Feasibility: Given max time T, greedily assign boards. If painters needed ≤ K, T is feasible.
Time: O(N × log(sum))