Sir please make similar videos on 1.Time and space complexity 2.Bit manipulation 3.Backtracking 4.Dynamic programming. And really loveing your videos sir.Please keep making content like this.These kind of quality videos are really rare on youtube
@techtuber1344
Жыл бұрын
Best explanation so far for sieve :) thanks
@sakshiankleshwariya1893
3 жыл бұрын
The explanation was very good . Sir pls make lecture series on Dynamic Programming .
@sourajitbhattacharjee4718
2 жыл бұрын
your way of teaching is really really good. You just don't say this is the algorithm and we have to do this. You also teach why this is required and where was the problem in the previous approach. I think this is very important for learning an algorithm and moreover to unknown problems students will be able to recognize the technique how to deal with it. Many many thanks from my end. You are doing a great job.
@torishi82
6 ай бұрын
Bilkul samaj aa gaya bhai. Thank you so much.
@deathrider9698
3 жыл бұрын
Make a full series on Competitive programming from beginner to end and Data Structures and algorithms. It's very hard to get good resources for free and not everyone can afford paid courses.
@arka6302
3 жыл бұрын
Step by step optimization and the size difference in global and main() is really helpful 😊
@Santosh_Kumar6205
11 ай бұрын
great lecture
@srvgr8
3 жыл бұрын
Fantastic video content...
@codeguy21
3 жыл бұрын
great explanation sir
@rohanmondal6998
3 жыл бұрын
Nicely explained!!!!
@kritagyaprasad7230
3 жыл бұрын
Understood bhaiya...well explained.
@prathamesh2906
3 жыл бұрын
Yes , I understood
@nikhilsharma7157
3 жыл бұрын
bro you are awesome in explanation!!
@roushanraj8530
3 жыл бұрын
Please bring one complete package series for bit manipulations from basic to advance.
@ashutoshjha5356
3 жыл бұрын
You have very good teaching skills
@gatecsemaster
Жыл бұрын
easy and best explanation
@kgCode658
3 жыл бұрын
Awesome bhaiya loved it
@sahilchauhan219
Жыл бұрын
ek dum op bhaiya
@lakhansharma8186
Жыл бұрын
j=i*i throwing error runtime error: signed integer overflow: 46349 * 46349 cannot be represented in type 'int' (solution.CPP) if we declare j as "unsigned int" will this be worth it to reduce the complexity max optimized is : int countPrimes(int n) { int count=0; vector prime(n+1,true); for(int i=2; i
@pryansh_
Жыл бұрын
you made my balls pain.. go get yourself some treatment.. you are sick..
@Saurav_suman-pj8uk
3 жыл бұрын
Please make for dynamic programming
@roushanraj8530
3 жыл бұрын
Great explanation bhaiya, please bring series for Tries, segment trees and fenwick trees. Please 🥲
@ashutoshjha5356
3 жыл бұрын
please make videos on bit manipulation bhaiya
@abhijitroy1958
3 жыл бұрын
gotta call my relatives now to let them know they are not prime
@aasthajha1051
3 жыл бұрын
Dynamic programming and Bit manipulation
@siddhantyadav4531
3 жыл бұрын
👌👌👌👌👌
@prathamesh2906
3 жыл бұрын
Nice Nice video
@DeepakKumar-xy8rw
3 жыл бұрын
Sir 1st make lectures on c++ stl practice questions
Пікірлер: 36