Flipkart SDE-1

During my Flipkart SDE-1 interview, I was presented with a complex algorithmic problem. The core task was to determine the maximum number of baskets that could be filled. A basket was considered filled if it contained at least K balls of different colors, and I had N balls, with their colors provided in an array. I recognized this as a problem suitable for a binary search approach on the answer. My strategy involved setting left = 0 and right = N / K and then checking if a mid number of baskets was achievable. The check involved iterating through the frequency map of colors; for each color, I could use at most mid balls across all mid baskets. If the total balls used (balls += min(mid, it.second)) met the condition (balls >= (k * mid)), I knew mid was possible and tried for more; otherwise, I reduced my search space.