Leetcode 2790. Maximum Number of Groups With Increasing Length

Given counts usageLimits[i] for distinct elements i, pack elements into the maximum number of groups such that each group has distinct elements, group sizes are strictly increasing, and each element i is used at most usageLimits[i] times total. This is a packing/greedy feasibility problem over n (<=1e5) items with large usage limits.