Maximum Candies Allocated to K Children

Given piles you can split but not merge, find the largest integer x such that you can form at least k piles of size x (i.e., sum floor(candies[i]/x) >= k). This is typically solved by binary-searching the possible pile size x and checking feasibility.