3397. Maximum Number of Distinct Elements After Operations | Greedy

[@ARYANMITTAL]

Q3 & Q4 ❤- kzbin.info/www/bejne/a2m5ipSmp5mqeaM

[@rdforte]

Thanks for this video tutorial. The way you explained and broke down the question was very helpful. You have yourself a new subscriber!

[@Abhinav_2060]

The easiest and efficient solution I have seen for this solution . Thanks

[@mrmani1700]

your Explanation was Awsome! Thank you so much bhaiya❤

[@Its_Shubham_Negi]

Waiting for next two ❤❤❤

[@beinghappy9223]

How do you come up with such solution ? I coded this and got TLE for obvious k constraint class Solution { public: int maxDistinctElements(vector& nums, int k) { sort(nums.begin(),nums.end()); int n = nums.size(); setb; for(int i=0;i