Leetcode Biweekly Contest 138 & Weekly Contest 413 Discussion & Editorial 🚀 | Abhinav Awasthi

[@harchitgulati3065]

sir aapki explanation itni acch hei !!! Genuine fan of ur explanation

[@AyushPetwal-b3i]

best for contest upsolving 💯💯

[@raisanjeeb42]

Bhot acha explain kiya bhaiya apne Loved how you approached Biweekly Q3.

[@newglobal2056]

Waiting for it 😅

[@AbhinavAwasthi]

🙌🏻

[@abhinay.k]

thanks

[@TheChampionPushpendrarj]

Mast video Abhinav Bhai ❤❤ Khair mujhe nahi pta yeh sah kya hai par comment kar diya m😅😅😅😅

[@AbhinavAwasthi]

Are thanks bhai

[@ShresthBhattacharjee-xz7ih]

I think the last question was similar to longest palindromic substring

[@rajchinagundi7498]

Take it as a constructive criticism bro, but you need to explain & breakdown the solution as well as intuition behind the solution in a better fashion, just pasting the code an saying this is this, this is that especially for the ones where upsolving is required Q3s and Q4s.

[@AbhinavAwasthi]

Yes I understand, will take care of this, thanks for your suggestion

[@arnav6885]

Yeh i agree with you

[@abdheshkumar7699]

Hii Sir, just puchna tha aapka koi course yaa phir sara youtube pe kyunki mera bhi logic hritu and kusharga jesa tha tle dia tha

[@rajchinagundi7498]

Q1 Biweekly code looks so unreadable, this is how I wrote it in contest ```class Solution { public: int generateKey(int num1, int num2, int num3) { int ans=0; int k=4; int p=0; while(k--){ int a=num1%10; int b=num2%10; int c=num3%10; num1/=10; num2/=10; num3/=10; int mn=min(min(a,b),c); ans+=mn*pow(10,p); p++; } return ans; } };``` stick to fundamentals.

[@yashsiwch]

How can i join you on meet while upsolving

[@AbhinavAwasthi]

Soon I am launching a group that you can join for live discussion

[@shivanshmahajan2281]

class Solution { public: int findMultiplier(int health, int power){ int m = health/power; if(health%power > 0) m += 1; return m; } long long minDamage(int power, vector& damage, vector& health) { int n = damage.size(); vector nums; long long total_damage = accumulate(damage.begin(), damage.end(), 0); long long min_damage_to_bob = 0; for(int i=0; i

[@sahils-z5q]

Nice

[@saumyaagarwal7]

mastt hai

[@hiteshpatwal9688]

Bhai div 3 codeforces round 970 please 😢😢😢

[@vikassinghbisht7305]

great work bhaiya

[@Mohitkumar-zz4mp]

👋👍👍