it’s better if you’d have explained the intuition behind the aj/ai+aj formula which was not at all clear had to read the admin’s solution for it.

Man this is one of the best explanations I've ever seen!

did your code fail on TC 31 ?!

5:42 if(n<=2) return false? or if(n<2) return false....is not 2 a prime number ,..

how do we prove this though that if they have same id then ans is swap - 1

Dude whosoever you are. YOU ARE AWESOME!! If possible, can you make a video on ternary search.

All clear ! thank you sir

Any practice questions.

@Acodedaily is this course still available on KZbin. I an not abe to find hashing video.

How do i select problem from leetcode according to the roadmap. Should i just select tag and do bunch of easy medium and hards

getting wrong answer on tc - 2

Cool!

Thankyou Bhaiya.

I had a doubt does CPH judge submit works during contests? I was trying it during the last contest and it didn't seem to work for me. But on other problems it works like a charm. Great video, watching it for the 2nd time.

How to do this problem using visualogo? Please reply

Hey dude, thanks for the video :)

Which tools and devices you are using to draw this way?

the extension is now available on chrome

Awsome!

Where do I find the problem set?

Best explanation on YT brother

How to do for Java ?

it is not working

Not so a good explaination

I know you might not answer but here is my doubt on D1: Suppose lastUsed variable tells which program is running on CPU1. Let's say a3 is running on cpu1 and a1 is running on cpu2. Now at i=4, we can see that a[i-1], i.e., a[3] is running on cpu1 but how can we comment what is running on cpu2?

Bhaiya plz ek or profile review session karo

thank you ❤

sample % python3 ../test.py -c correct.cpp -w wrong.cpp -g generator.cpp -t 1

21:35 bro came here to flex and get appreciation.. //that was visible throughout the conversation

thanks man, it makes my cpp coding 7000ms faster ⚡⚡⚡

thx,finally understand

thanks

Fyi, Kev became candidate master 😅 (I am not Kev btw)

Note: (n-r)+1 ✅ (n-r+1) ❌

okay but whats the answer to the question in the thumbnail?

Wow! what an explanation with drawings.... You are a very good teacher...

Just a little doubt , can we consider any node as root node and answer will be same????

Very nice explanation sir, Thank you!

Sir, I thought of an approach that if the count of the bits at particular point is 1 if it is greater than or equal to n then it's gonna fail because we can't make the number out of it. And I have taken care of the fact that it occurs in different numbers. but at the 2nd test case it give TLE

what for this test case n=5 3=1 2 3 3=1 2 3 4=1 2 3 4 3=1 2 3 3=1 2 3

should it not be 1/1000, 1/999 and 1/998?

Are you iit graduated??

Hey! may you help me why my code is showing wrong answer on test case 2 . Output of my code on wrong test case is same as yours, also on other test cases. #include<bits/stdc++.h> using namespace std; #define int long long vector<int>divisors(int n){vector<int>v;for(int i=1;i*i<=n;i++){if(n%i==0){if(n/i==i){v.push_back(i);}else {v.push_back(i);v.push_back(n/i);}}}sort(v.begin(),v.end());return v;} void func(){ int n; cin>>n; vector<int>v; v=divisors(n); int t=v.size(); int cnt=0; int j=0; // for(int i=0;i<t;i++)cout<<v[i]<<" ";cout<<endl; while(j<t){ cnt++; if(v[j]-v[j-1]>1){ break;//abababababa } j++; } // cout<<cnt<<endl; string s; char ch='a'; for(int i=0;i<n;i++){ // cout<<ch; s+=ch; ch+=1; if(ch-'a'>=cnt)ch='a'; } cout<<s<<endl; } signed main(){ int T=1; cin>>T; while(T--){ func(); } return 0; }

thanks man.

Nice

submit feature is only limited to Firefox :(

I am currently learning Dsa(java) can i do cp (c++)also along with it

Sir, please do upload the videos on prefix sum and recursion / dfs.....

Well a brilliant video. Comprehensively covers everything for everyone. I think Creating KZbin shorts out of the answers to the questions would help in increasing the growth of this channel even further.

nice stream . enjoyed it