First time viewer. Excellent instruction. I was looking for explanation of the extra check for n>1 in sqrt(n) solution. Understood that concept finally after watching the video till end. Thank you for the hardwork.
Bro when will you start linked list..... I am watching your series and it cleared my concept a lot but I can't attempt many questions due to involvement of linked list....it will help a lot if you cover at least basics of linked list in single video. :)
We can find divisors count, sum of divisors. But how can we find products of all divisors using this technique??? please response..... I'm from Bangladesh ❤️🖤
@11:23 It is O (sqrt (n)), right? The case of perfect squares is going to be the worst case, and in that case the outer loop iterates sqrt (n) - 1 and the inner loop iteratres 2 times. Is my analysis correct?
Hey luv Bro I have just started my programming journey by watching your videos only and I must say U have taken the videos from basic to a good level and I am sure your videos will help me getting placed in a good company. My concern for now is should I just focus on DSA From your tutorials only . Or is it necessary to learn dp also. As for now I have only 1.5 years for placement sessions so I think it will be really very difficult for me now to learn dp also. So if you can guide me that is it fine to leave dp and continue with your videos only and practice dsa and apti ? The bottom line is. Is it fine to drop DP concept and just do dsa.
Luv bhai is god of competitive programming :)
Please don't stop making videos. Such high quality content for free is awesome, i watch each of your videos atleast twice.
First time viewer. Excellent instruction. I was looking for explanation of the extra check for n>1 in sqrt(n) solution. Understood that concept finally after watching the video till end. Thank you for the hardwork.
worth to waiting for your videos🙏
Love the way you teach ❤
can anyone tell me the name of background music he's using in the beginning of the video. Seems pretty dope!
Your every video is amazing
Never stop this brother ❤️❤️❤️❤️❤️❤️❤️
Thanks luv bhaiya jai hind
nice explanation
The video was really good 👍
Thanks for the great videos
Bhaiya you are the best
you are just awesome vaiya💖💖💖
Ur r a hard worker bhai❤️❤️
*One request -> Step by step, Sequence me hi rakhna videos, level ekdam se agr increase hogi to smjne me prblm ho sakti hai, Thank you for this video*
yes,i am maintaining sequence.
@@iamluv Thank You bhai😊
3 method ye bhi to hai ki i
i
I couldn't find any channel called ''Code Tribe'' on UA-cam.
thanx bhaiya
thanks for the video
Can't wait for the next video!! Looking forward to it !!!!!!!!!!
once again the boss is here ...
Bhaiyaa aap Chinese Remainder Theorem pr bhi video banaoge kya?
UA-cam pe khi se bhi sahi se samj nhi aarha.
Please make a video on CRT.
bhaiya dp ke video bnao apka pdhane ka treeka bhut shi h
Bhai order me ja raha hun abhi time lagega
8:18 "chocha" 🤣 🤣 🤣
why is 1 printed ?i iterates from 2 ...so when is 1 inserted in the vector'?
Please upload 1 video daily
dil mange more sir!
Bro when will you start linked list..... I am watching your series and it cleared my concept a lot but I can't attempt many questions due to involvement of linked list....it will help a lot if you cover at least basics of linked list in single video. :)
This is CP course bro..
Linkedlist type questions asked in interviews better you watch interview course videos
@@haxiyi bro I don't agree with you linked and tree traversal questions are also asked in CP
same for tree traversal questions
Bhai aapke outputf me cout
We can find divisors count, sum of divisors. But how can we find products of all divisors using this technique??? please response..... I'm from Bangladesh ❤️🖤
@11:23 It is O (sqrt (n)), right?
The case of perfect squares is going to be the worst case, and in that case the outer loop iterates sqrt (n) - 1 and the inner loop iteratres 2 times.
Is my analysis correct?
inner loop will never run in case of primes, As n%i==0 will always be false
Hi, What do you use any editor? visual studio? please share your editor, because I saw the time record in the your editor that is good for me
the editor is "Sublime Text Editor"
Bro assuming part ko km kro and chijo ko likh kr explain kro.
Jaise while loop ke baad n kya bna.
Video lamba ho koi dikat ni hai.
Bhaiya particular range mai karna ho print toh kaise karenge like 20 to 30 ke veech ke prime numbers.
right now you can find if each number between 20 or 30 is prime or not, in coming videos we will learn sieve which can do all this.
@@iamluv thanks bhaiya
bhaiya codchef par kitne lecture ke baad long wali cp start kare
After completing stl, around 35-40lec
boss man
niceee
Bro ,Start DP asap...
it will take time
Hey luv Bro I have just started my programming journey by watching your videos only and I must say U have taken the videos from basic to a good level and I am sure your videos will help me getting placed in a good company. My concern for now is should I just focus on DSA From your tutorials only . Or is it necessary to learn dp also. As for now I have only 1.5 years for placement sessions so I think it will be really very difficult for me now to learn dp also. So if you can guide me that is it fine to leave dp and continue with your videos only and practice dsa and apti ? The bottom line is. Is it fine to drop DP concept and just do dsa.
I know you must be busy. So please co subscribers you may also help me to show the the correct direction and show the plight to me. Thanks and regards
dp needs to be done
18 March 2022
💛
codetribe channel udd gya kya??
🔥
8 grade student I'm in basic level
1st viewer
bhai please dp start kr do ,dp mein kisi ke bhi acche lectur nhi hai,ya fir bas uska basic de do 2 3 lectures mein bas
You can aditya Varma for time being, my dp videos will take time
Aditya Verma DP 👑💥💥
@@iamluv sir akhiri mein padhna apka hi padega to ,unnecessary kya hi padhe,bas sir kosis kareaga ki 2-3 mahine mein dp start kr dijiega
2nd😁
❤🧡💛💚💙💚💛🧡🧡
.
1 is not a prime number dude. Get yo basics checked🙂
That's what he said dude, first of all watch the lecture first.
Check it here 4:52
Thanks for the great videos
💛