2897. Apply Operations on Array to Maximize Sum of Squares | Weekly Leetcode 366

[@Abbas.aktari]

Exactly same question came in sprinklr OA last week

[@miketsubasa3611]

Step by step explanation is greatly helpful

[@xtrahue]

hats off man...kya socha hai.....and really concise code.Keep it up.

[@rajvaghela4378]

Really nice efforts in the video. I got each and every concept you tried to explain. Thank you!!

[@prakhargarg4166]

Best explanation

[@chandrachurmukherjeejucse5816]

Really great lecture sir. Subscribed your channel 🚀

[@16avikasgupta70]

Thanks bhai for the explaination

[@16avikasgupta70]

Bhai also mention some similar problems for practise in description

[@sujayshanbhag2055]

Arey bhai aap itna jaldi kaise video bana lete ho? 🔥🔥🔥🔥

[@harshmishra061]

please make video for third one also

[@ketansarode17]

+1

[@AbhinavKumar-ee5wl]

+1

[@vinayjangra1401]

+1

[@akashsahu6079]

+1

[@codingmohan]

Sorry for the delay. My laptop hanged badly and took more time then expected to fix. Here you go - kzbin.info/www/bejne/e3yqYpJrraeBf8k

[@teqarine5752]

why have we taken cnt of size 31 and not of 32? aren't there 32 bits in an integer?

[@codingmohan]

Yes integers are 32 bits but the maximum value given in the problem is 10^9 which can fit in 30 bits easily

[@teqarine5752]

@@codingmohan so we can also make the cnt size 32 it'll work well?

[@codingmohan]

Yes. But 1

[@teqarine5752]

@@codingmohan ohh okay got it Thank you very much

[@dayashankarlakhotia4943]

class Solution { public int maxSum(List nums,int k){ long mod=1000000007; long ans=0; int cnt[]=new int [32]; for(int i=0;i

[@saitejachebolu4798]

I didn't understand what you u are doing can you tell me the intuition again

[@avirajkumar2619]

Only 360p quality

[@codingmohan]

KZbin takes some time to process it in higher resolution. Will be available in all resolutions in ~10 mins.

[@vinayjangra1401]

903 out of 918 test cases passed ,please help class Solution { public int maxSum(List nums, int k) { int mod = 1000000007; int[] ans = new int[k]; for(int i = 0; i < 32; i++) { //check jth bit int count = 0; int mask = 1 = 0 && count > 0; x--, count--) { //set ith bit in each number starting from end till we have count int mask2 = 1

[@chandrachurmukherjeejucse5816]

sum = (sum + (1ll * n * n) % mod) % mod; try doing this. change 1ll to similar thing in java

[@chandrachurmukherjeejucse5816]

class Solution { public: int maxSum(vector& nums, int k) { vector setBitCount(32, 0); int mod = 1e9 + 7; for(auto &it: nums) { for(int i = 0; i < 30; i++) { setBitCount[i] += ((it >> i) & 1); } } long long res = 0; for(int i = 0; i < k; i++) { int curr = 0; for(int j = 0; j < 32; j++) { if(setBitCount[j]) { setBitCount[j]--; curr |= (1