Maximum subset size with average less than K
Filed under Sprinklr
The question
Given an array of N elements and an integer K, determine the maximum number of elements you can select in any subset such that the average of the selected elements is strictly less than K.
No write-up yet. Related questions below have one.
Related Sprinklr questions
Collected from public candidate posts and coding forums. Updated Nov 2026.