🎨 Painter's Curse

📚 Painter's Partition Problem

Given walls with lengths and K painters, minimize the maximum time any painter works.

• Binary search on answer: search range is [max_wall, sum_all_walls]
• mid = possible maximum time limit
• Greedily assign walls: if a painter would exceed mid, assign to next painter
• If painters needed ≤ K: mid is feasible, try smaller (go left)
• If painters needed > K: mid is too small (go right)