Leetcode Hard || 2790. Maximum Number of Groups With Increasing Length || Weekly Contest 355

TC = o(nlogn) + o(n)
SC = o(1)

[corrosive]

CODE:
int usageLimits) {
sort(usageLimits.begin(), usageLimits.end());
long long extra = 0;
long long ans = 0;
long long sz = 1;
for(int i =0;i<usageLimits.size();i++)
{
int qt = usageLimits[i];
if(qt+extra>=sz)
{
ans++;
extra = qt+extra-sz;
sz++;
}else{
extra+=qt;
}
}
return ans;
}

[hitenmahawar]

hi big fen of this gaympley achhi video h

[Bruiser]

bhaiji btayenge c++ with dsa krne mei kitta time lgega?

[kunalthakur]

Sir ek doubt hai ...apse puchke clear krna hai 🤔

[Gobchemist]

GOB k liye bhe koi bharya code bna do bhai ☻🤗