วีดีโอ

Bhaiya Kaal weekly ka upload karoge ky?

Hamesha aise he banate rahiye 🙏🙏🙏

kya mast samjaya hai bhai🤩💯💯, new concept sikhne ko mila.

isko Line segments se bhi better visualize karwa sakta ho and woh point lo jo maximum no of segments mai common h.

Thanks bro Today i learnt New technique.

Bhaiya codechef ke editorial boht din se nahi aa rhe ,ab nahi bnaoge kya,used to be very helpful

Thank you 😊

Hi bro, i need ur advice abt solving the question in contest, i m not able to solve the question more than one in contest and i m learning dsa more than six months,, i m in very much confusion,what should i do to improve please tell me....

explanation samaj me aya thank you

aaj ka contest hard tha 🥲

thank you

bhai tum beech beech m gaayeb kaha ho jaate ho ? atleast hard ques explain krdia kro baaki k contests ka bhi

Hi bro, I have been doing LC for 6 months and have solved many questions, but I can't seem to figure out this approach. How can I master this approach in a short time, and how long have you been solving LC?

codeforces ka video aega?

This guy is damnnn good at explaining..... save him at any cost...

was today's contest hard from your pov?

Thanks for the editorial

I cleared oa round and i got the invitation for the interview.. i need the guidance to clear thr interview

Clean implementation of E . Was expecting the F also . I gave my 1 hour to F and couldn't solve it but one thing that i learnt that is to find xor of integers from L to R in O(1) TC and SC

Thank you amazing!!

welcome back.

Didn't watch other videos because i believed you would upload this time 😁

Was waiting for long time please continue regular

Best Explanation Thanku Bhaiya

Vai itna din kaha tha?

Well explained

Back after long time.pls upload solutions for div2 contest regularly, your approach very much helpful

Love your explanation

Good work mate

Nice explanation 🎉🎉

kaha chale gaye bhai videos nhi aarhi ab?

love the explanation

bro i am unable to solve 1800 and 1800+ rated question , even after so much practice . my profile :- _Untrackable_ where do u practice such mind twisting problems? especially 1800+ difficult greedy and implementation .

cannot see the code from the link "Tree Pruning Solution"

Amazing explanation for D ❤

are you busy vai..? no video coming?or sick?

best explanation for E on youtube, didnt see rest but will sub

Bhaiya leetcode Weekly 420 and Codechef Starters 156 ke solution ka video bana do . Apke videos se jada Samajh aata hai Please bhaiya bana do video. 🙏

Can't we find contribution of each cell with 2d prefix sums???

Bhaiya yeh question mai [k-1][I+1]--[I+N] maximum yeh kaise socha

bro we are waiting, start uploading contest videos bro !

Sir abhi videos kyu nahi daal rhe ho?

thanks, great explanation

aap konsa year me ho aur kon sa branch h aapka ?

Very nice

W explanation bro loved it lekin aise logic sochenge kaise??

6 din se apne video nhi banaya😟

beautifully explained. Subs done.

ll n; tc(t) { cin>>n; if(n==1) { cout<<1<<endl; continue; } vll indices; ll k = __builtin_popcount(n); ll temp = n ; fl(i,60) { if((1<<i) & (temp)) indices.pb(i); } vll ans(k+1); for(ll i = 1; i <= k ;i ++) { ll num = n & (~(1<<indices[i-1])); ans[k-i] = num; } ans[k] = n; for(auto& x: ans) cout<<x<<" "; cout<<endl; }

brother u are a very gooooddddd explainer!!!!!!!!!!!!!