Please watch the new video which covers it in more depth, and also prints it: ua-cam.com/video/tp8JIuCXBaU/v-deo.html Watch the video, and leave one of the either comments "understood" or "not understood" ! If you appreciate the channel's work, you can join the family: ua-cam.com/channels/JskGeByzRRSvmOyZOz61ig.htmljoin
Giving back to the community is one of the best work you can do, just wait for few more years and people joining in the biggest companies will proudly say that Striver taught us how to think and code! 💯
Great explanation as always, thanks❤️ Also a small intuition add-on for those who are wondering why we aren't incrementing mid when we encounter a 2 by it: the value that high holds might be a 0, in which case, it wouldn't have been swapped with the low's position, had we incremented mid along with high's decrement.
What a coincidence... I stuck in this problem for last half-hour.. and when my notification bell vibes and show this..i think iam the most happiest person in that period of time on this planet.. Thanku bhaiya!!!!
Sir, today i've started working on your SDE sheet and i'm impressed by the way you explain and make things simple .....i have placements coming this year .sure this playlist will help me out there
I have completed my third year, About to enter my 4th year. I just got the news that I have cracked DXC interview. I am very happy . I am not very good in DSA. But I want to improve my skills to get much better offers so from today I will start solving your DSA sheet to clear my concepts. And from the bottom of my heart I would like to thank you Striver for all your dedication to provide all of us with this gold mine of DSA. Also, congrats for your new house. May u keep touching heights brother.
Just loved it 😃 This is the best channel on youtube ,to enhance our CP skills. And making videos amidst office work is much appreciated bro. You're really doing a great job.
This series is going to be one of the best leaning series forever. So, it's my humble request that please don't stop until it is completed. And Thanks for all your efforts!!
Awesome explanation Raj. I left my gfg DSA course to watch your video and I find your free content way better than gfg's paid courses. Massive respect bro, you deserve all the good things happening to you.
I love the fact that you took suggestions from the previous comments and adjusted your pace accordingly. You are doing a great job for the community. Hats off to you, brother.
I think this series is going to be a masterpiece, because he does his research about every solution to a given problem , also it helps to learn about various new algorithms which I never heard off. Thanks a lot for this and hoping you try your best to finishing this series as soon as possible 🔥👍.
Bhaiya I firmly waiting for your video on the dutch national algorithm. You taught so nice that it got sticked to my mind in just 1 pass :) Thankyou very much !!
Decided Today to prepare for the SDE Sheet, After Procastinating for the very long time, being in the comfort zone, thanks bro for the great content. I make sure that I will learn all these concepts well which no one taught.
Ohh gossh such a wonderful explanation. I had watched 2-3 youtube video but still some doubt in my mind because they haven't explained the graphically now it's clear to me. Tons of thanks striver
Thank you for such a clear explanation. It was my First video of your series and surely i am going to follow all your playlist and will let other's know about this channel too.
Wonderful..... I was searching for this for long time.. Trust me.. You are the best creator on UA-cam. Your explanation is superb and fantastic.. Please please add more such videos...
Thank you won't be enough. You have no idea how much I respect you brother. Thank you for this. Thank you so much. You are really an inspiration and really helping us. Respect for you. My real guru 🙌🙌🙌🙌🙌
damnn!! You explain things so well bro... Even though I am a working professional and didn't have CSE background, I always go through your videos, and do the problems too. Honestly, each video backs me up with a knowledge that I couldn't have even gained in a couple of months. I think I will be graduate from here with flying colours. I appreciate your enthusiasm and dedication for spreading such a great content. Lots of Love. Thank You Brother.
this is exactly what he wrote, except i used if else instead of switch i wrote the same on leetcode but still not passing can you please find the mistake, it is giving Wrong ans on leetcode class Solution { public: void sortColors(vector& nums) { int low=0; int mid =0; int high = nums.size()-1; while(mid
you are a god level explainer , i dont know how i am understanding that easily from your videos , because iam always confused but you made all this very easy.
Awesome. Never thought would be able to understand an algorithm under 10mins. Thank you bhaiyya ♥️. Looking forward to complete this entire series along with you.
Striver your fan here..) I like your videos and they are very useful to me for making my concepts understandable. Please keep uploading these kind of videos..plzz plzz
thank you but bro also attach file or document or some blog on algorithm you uses while solving problem , so that if anyone wants to read about that they can quickly click the links on description box . thanks :)
i do understand the way only problem i got is that the key use uses the inbuilt function like vectors and all......... but your explanation is best i do got the point and logic ....
Brother, You are helping me alot. I subscribed your channel. Keep the good work. Thanks for giving/sharing your knowledge with community. I am a web developer and machine learning practitioner. I am not that much good in writing optimal solution.
instead of creating pointers,we can also do this by creating three variable containing frequencies of 0,1 and 2 this approach uses O(n) TC and SC of three variables. correct me if i am wrong
Quality content as I am a computer science engineering we are not able to grow by own we need strong community who pick up us to become a quality software engineers.
Bhaiya... your videos are so helpful!!!.... After watching your STL video , I have got a very good grip on it... Also this series provided me with a track on how to proceed with competitive programming! Junior from same school.
Superb sir, thank you for this series, we will definitely support you as you are supporting us by putiing nice question in brute, better and optimal solution Hoping for a lot more videos sir
Please watch our new video on the same topic: ua-cam.com/video/tp8JIuCXBaU/v-deo.html
Please watch the new video which covers it in more depth, and also prints it: ua-cam.com/video/tp8JIuCXBaU/v-deo.html
Watch the video, and leave one of the either comments "understood" or "not understood" !
If you appreciate the channel's work, you can join the family: ua-cam.com/channels/JskGeByzRRSvmOyZOz61ig.htmljoin
Giving back to the community is one of the best work you can do, just wait for few more years and people joining in the biggest companies will proudly say that Striver taught us how to think and code! 💯
after watching your explanation I was able to code without looking your code😀😀😀😀😀
Can you upload more videos or increase the upload frequency ... Because the video quality is awesome 👌.. each strategy is very well explained...
Understood
@@japneetsingh1336 he's working so that's not possible . we must understand his situations too right ?
2 years later. Still the best place to learn. Thank you striver
Great explanation as always, thanks❤️
Also a small intuition add-on for those who are wondering why we aren't incrementing mid when we encounter a 2 by it: the value that high holds might be a 0, in which case, it wouldn't have been swapped with the low's position, had we incremented mid along with high's decrement.
Nice👍
@@yashjain1492 Thanks :)
In which year you are studying?
@@yashjain1492 Graduated already, working.
Then why are you watching these dsa videos?
Can't wait for the next one! Looking forward to a wonderful playlist. This is going to be one of the best playlists ever! Learning so much!
Great !!!
Akram bhai dil ka bat bol diy tm💝
bro you are really doing great job.Instead of telling the same dialogue like "improve your dsa" you are actually teaching us, thnakyou so much bro.
💝💝💝 bro ekdm shi bat bola tm
What a coincidence... I stuck in this problem for last half-hour.. and when my notification bell vibes and show this..i think iam the most happiest person in that period of time on this planet.. Thanku bhaiya!!!!
Sir, today i've started working on your SDE sheet and i'm impressed by the way you explain and make things simple .....i have placements coming this year .sure this playlist will help me out there
Could u tell me how did u prepare for placements 😅 Or how did you prioritise between DSA and projects
actually i paid 3800 for dsa self paced course. but after seeing yours i never opened that. you really great bhaiya
course name?
Bhai gfg self placed course bhi sahi hai , hn lekin Kyi bar explanation ke liye yt dekhna padhta hai
Bhai self placed se accha course nahi hai
Open nahi kiye ho isliye tumhe pata nahi hai, kabhi open karke dekh lena😂
Keep up the good work. I'll stick to your videos for this wonderful playlist.
Awesome, thank you!
I have completed my third year, About to enter my 4th year. I just got the news that I have cracked DXC interview. I am very happy .
I am not very good in DSA. But I want to improve my skills to get much better offers so from today I will start solving your DSA sheet to clear my concepts.
And from the bottom of my heart I would like to thank you Striver for all your dedication to provide all of us with this gold mine of DSA.
Also, congrats for your new house. May u keep touching heights brother.
did you get a better offer
Exactly,did you get any offer ?
Just loved it 😃 This is the best channel on youtube ,to enhance our CP skills. And making videos amidst office work is much appreciated bro. You're really doing a great job.
This is not cp this is just basic ds algo.
Cp is very hard and nobody asks it in interviews
This series is going to be one of the best leaning series forever. So, it's my humble request that please don't stop until it is completed.
And
Thanks for all your efforts!!
Awesome explanation Raj. I left my gfg DSA course to watch your video and I find your free content way better than gfg's paid courses. Massive respect bro, you deserve all the good things happening to you.
Indeed it is, I did the same
I'm not that good at DSA. But this made me realise i can do it. Thanks brother ❤️
DSA is about memorization. CP is about pure logical skills
@@aryanverma7800 really aryan??
since i am good at memorising things it will be good for me XD
@@shaniyadav33 its both
I have started focusing from today on the campus document list
Thanks Striver
Don't have a mentor......
.
.
Don't worry striver here !! 🔥🔥
same
@Muhammad Elian it wants 12$ to get Access Code
@@karanbhati7552 That's what a scam looks like
Superb sir ,I watched many videos about this concept but I don't understand the concept ur explanation is very useful to me✨✨
I love the fact that you took suggestions from the previous comments and adjusted your pace accordingly. You are doing a great job for the community. Hats off to you, brother.
I think this series is going to be a masterpiece, because he does his research about every solution to a given problem , also it helps to learn about various new algorithms which I never heard off. Thanks a lot for this and hoping you try your best to finishing this series as soon as possible 🔥👍.
Bhai kasam se ye problem tumne sbse acche se smjhaya hua hai.
Bhaiya , ek hi dil hai , kitni baar jeeto ge❤!!
Blessed to have a mentor like you
Love from ITER ,BBSR
Bhaiya I firmly waiting for your video on the dutch national algorithm. You taught so nice that it got sticked to my mind in just 1 pass :)
Thankyou very much !!
Decided Today to prepare for the SDE Sheet, After Procastinating for the very long time, being in the comfort zone, thanks bro for the great content. I make sure that I will learn all these concepts well which no one taught.
I had to sort the array in ascending/decending order in the practicals so i rememberd this 😂--
int n = nums.size();
for(int i=0; i
Bhaiyya did not expected that can do in O(N),O(1) ...but you showed. superb explanation ...keep doing on bhaiyya
Thank you so much, the second approach was something that I would never be able to think off 🤗
Clarity is mind blowing. You're the BEST.
only youtuber who clearly explain everything......
Ohh gossh such a wonderful explanation. I had watched 2-3 youtube video but still some doubt in my mind because they haven't explained the graphically now it's clear to me. Tons of thanks striver
I simply used map.
class Solution {
public:
void sortColors(vector& nums) {
map m;
for(int i=0; i
When striver explains you are bound to comment "understood". Very well explained the algo
Thank you for such a clear explanation. It was my First video of your series and surely i am going to follow all your playlist and will let other's know about this channel too.
Wonderful.....
I was searching for this for long time..
Trust me..
You are the best creator on UA-cam.
Your explanation is superb and fantastic..
Please please add more such videos...
bhaya ekdam basic se samz gaya ,superb aap bahot acchse samzate ho thanku thanku so much :)
Bss itna kahunga bhaiya pyar ho gya aapse bhaiya kya smjhate h wow..💝
Excellent explanation. Simple explanation
Thank you won't be enough. You have no idea how much I respect you brother. Thank you for this. Thank you so much. You are really an inspiration and really helping us. Respect for you. My real guru 🙌🙌🙌🙌🙌
damnn!! You explain things so well bro... Even though I am a working professional and didn't have CSE background, I always go through your videos, and do the problems too. Honestly, each video backs me up with a knowledge that I couldn't have even gained in a couple of months. I think I will be graduate from here with flying colours. I appreciate your enthusiasm and dedication for spreading such a great content. Lots of Love. Thank You Brother.
u really make dsa simpler with ur explanation videos...thankyou
this is exactly what he wrote, except i used if else instead of switch i wrote the same on leetcode but still not passing can you please find the mistake, it is giving Wrong ans on leetcode
class Solution {
public:
void sortColors(vector& nums) {
int low=0;
int mid =0;
int high = nums.size()-1;
while(mid
you are a god level explainer , i dont know how i am understanding that easily from your videos , because iam always confused but you made all this very easy.
Understood..crystal clear explanation. Thank you
Awesome. Never thought would be able to understand an algorithm under 10mins. Thank you bhaiyya ♥️. Looking forward to complete this entire series along with you.
void Solution::sortColors(vector &A) {
int low=0;
int mid=0;
int high = A.size()-1;
while(mid
great efforts striver.....we guys r so blessed to receive such quality content that too free by uh..thanks a lot
Striver your fan here..)
I like your videos and they are very useful to me for making my concepts understandable. Please keep uploading these kind of videos..plzz plzz
Thanks, will do!
That was one of the best explanation. Understood in one go.
this solution is giving TLE. Amother approach.
class Solution {
public:
void sortColors(vector& nums) {
int last = nums.size()-1;
for(int i=0,j=0,k=last;j
Understood the problem, beautifully explained.
I love the solution striver thank you so much for explaining dutch nation algorithm in a simple manner
You are my inspiration striver,do come up with solutions in python also...
thank you but bro also attach file or document or some blog on algorithm you uses while solving problem , so that if anyone wants to read about that they can quickly click the links on description box . thanks :)
Thanks for making videos and selflessly helping others to enhance their skills.👏
You're helping me a lot, thank you so much
you are awesome man!!...we are fortunate to have you.
i do understand the way only problem i got is that the key use uses the inbuilt function like vectors and all......... but your explanation is best i do got the point and logic ....
u surely changed the lives of 100s, may god bless u with all his grace..❤❤
Great video. Very easy to understand.Hope you will upload videos of this series on a daily basis
Bhaiya aaj realise hua ki problem ko krne ka boht way h .... Or iske liy question ko aaps me discuss krna chahiye✅
Really easy to understand..... Thank you for the detailed explanation
Very nice explanation I'm too impressed by the way you interact with us good luck man keep making such amazing videos 🙂🙂🙂👍👍
next level explanation
the way u are explaning was really good and helpfull for people like me who dont no what to do next
Understood, Thanks a lot! ❤
Your explanation is easy to grasp the concepts :)
Man this is seriously the best approach I think😮🔥
Excellent explanation & one the best on UA-cam.
sort and informative ..explain the concept smoothly
Brother, You are helping me alot. I subscribed your channel. Keep the good work. Thanks for giving/sharing your knowledge with community. I am a web developer and machine learning practitioner. I am not that much good in writing optimal solution.
For swapping you don't need a temporary variable as nums[mid] ill either be 0 or 2
instead of creating pointers,we can also do this by creating three variable containing frequencies of 0,1 and 2 this approach uses O(n) TC and SC of three variables. correct me if i am wrong
that is a two pass approach, it is not cp bro!!
class Solution {
public:
void sortColors(vector& nums) {
int low=0,mid=0,high=nums.size()-1;
while(mid
This question was asked in my Microsoft Interview.Thanks :)
Hello Raj,
Thanks for helping out students and professionals to improve their skills. Yours way of explaining is excellant.
Please never stop uploading. We depend on you.
lovvee the way you explained........ keep teaching........ thankssss for the video.........
Thanks man......... really appreciate your work......it helps me a lot and also saves my time.....thanks again
Quality content as I am a computer science engineering we are not able to grow by own we need strong community who pick up us to become a quality software engineers.
You are a great Mentor, Simply Thanks.
Thanks alot for these placement series bro, I always wished for something like this to help me at this time, My respect to you bro!🤴🏻
Best explaination video for this problem on UA-cam!
Thanks Driver bhai For everything :)❤
Bhaiya... your videos are so helpful!!!.... After watching your STL video , I have got a very good grip on it... Also this series provided me with a track on how to proceed with competitive programming!
Junior from same school.
PYTHON SOLUTION:
class Solution:
def sortColors(self, nums: List[int]) -> None:
l=len(nums)
low=0
mid=0
high=len(nums)-1
while mid
Please keep posting ...Ur Way of describing the algorithm is so easy to understand 💛
Understood by your explanation. Thanks much.
Loved it ❤ ... I wish my engineering professor was like you. I would have slept by this time 😊
thanks !! understood the problem, algorithm and the coding part.. couldn't stop myself from subscribing
Thanks for teaching a new algo along with its application.
Amazing man. This playlist is Gold! 🙏❤️
your explanation is really awesome....the way you explain with the dry run is much helful
Quite precisely explained.kudos 🙌🙌
pure and best explanation ty so much striver
Superb sir, thank you for this series, we will definitely support you as you are supporting us by putiing nice question in brute, better and optimal solution
Hoping for a lot more videos sir
Thanks sir
By you i am learning abc of programs
Way you taught make things easy.
Explanation was far better than perfect🙃
solution with three approach ,incredible ! 😍
Striver I really like you video... keep it up 🤜🤛
Bhai thanks for the video plss make 2-3 question daily if possible
Understood .. your explanations are very very gud...