Hey Guys, if you want more such tech educational videos on this channel then please support me by subscribing to this channel & also share it with your friends as it helps me create more content just for you ✌
Thank you so much Chetna, this was really a great compliment. Will keep outdoing myself as long as I have such wonderful support from you and our Simple Snippets Family. Please do share the videos with your friends too. Thats the biggest help and support for our channel :-)
I was having so much problem as to where will I be able to learn all the DS, but you really made it up very easy, thank you very much sir ..whole heartedly thank you very much
Thanks a lot for providing this amazing content that's also for free.... It means a lot brother..... For the first time in my 2 years of college... I have understood what queue is and how it's actually implemented.... Thanks a lot.
In first time in my life i understood algos so precisely and didnt get bored.thanks for creating this masterpiece bhaya.Seriously you are a legend.....
Hehe thanks Mahesh 🤟 very happy to know this. Please do share the channel with your friends & ask them to join our Subscriber family too😊 that will be the biggest help & support 🤟
This is the only indian channel where i can relax to watch DS else I go for some foreigners because you know in India there are many channels which are doing same stuff again and again with boaring techniques , but this bro Tanmay came with lit energy with also fab English speaking and awesome techniques i hooked up watching video of stack and now I'm going to do binge watching and binge working for DS practice , peace out and thanks again bro Tanmay 🤟🤟🤟
Wow thank you so much Pirthavi for such wonderful feedback. Really very glad to know that my DSA videos are helpful. Please so support me by sharing our videos with your friends too 🙏
I have already share this video to my 5-6 friends and they gave me a fab positive reaction , this is the only channel where we get implementation of data structure with c++ language .....
@SimpleSnippets, sup, a few questions. 1. If the `front` variable can only be equal to `-1` when the queue is empty, then why do you check for `rear`, too, in `isEmpty()`? 2. What is faster: checking for `front < 0` or for `front == -1`? I mean not for C++ specifically, but for popular CPU arches. From what I understand, comparison of two numbers is typically done in the CPU in the ALU. But do compilers make it a moot point because they somehow change the Time Complexity of the comparisons on the higher level so even if on the ALU level it is faster to check for `-lt` (less then) than for equality, the workings of the higher level add other algorithms above it and the total Time Complexity of the underlying algo and of the higher-level algo turns out to be the opposite: that the check for equality is faster, because the higher-level algo is more Time-Complex than the underlying algo, so it grows faster and works slower on large input. Pls correct me if I'm saying bs, I'm still figuring this out. 3. Why don't you put `x = arr[front]` BEFORE the if-else construct in `dequeue()`? I mean at this point (after the check for emptiness) it will execute either way. Thanks for the vid. Just discovered you playlist thanks to your Big-O notation introduction, it was very awesome and I'm still kind of dazed I got it. NOW I HAVE THE POWER TO RULE THE WORLD! P. S. Your vids are very nice, I like how you exaplain things in simple terms, as you would to a friend in the kitchen, and also take care to highlight stuff in different colors, it helps understanding a lot, I kind of categorize the stuff you talk about right away when you use different colors, wish more people would do that, especially in term definitions like you do. And also SPECIAL BIG-PUMPKIN THANKS for the practical examples both in Tech and Real Life, I guess you know just like I do what it's like to live in the world of mostly purely theoretical study materials of any significant depth and be a practically minded person at the same time. You're life saver. This rocks!
That's great to know Loukik, please do Subscribe to our channel as we have a lot tech educational content which you'll surely like. Also please do share our channel and videos with your friends too, that's the biggest help and support you can provide buddy ✌
Hi everyone! I think in enQueue( ) operation there should not be an elseif part, instead, you should place an else part, and in that there can be an if and else function. because in the video, arr[rear]=value will be executed rather arr[] is full or not. here is my approach. correct me if I'm wrong. void enQueue(int element) { if (isFull()) { cout
Fantastic video! I have one question. After performing out last dequeue operation, the last read value is not cleared out. I added a arr[front] = 0; in my dequeue "else if" so that when I read the last queued item (when front == rear), that value is read, then cleared. Does this track?
bro suppose the queue size is 4 and we enqueue 4 values and we dequeue 1 value now front var points 1 and rear var points 3 then will it denote queue as full caz rear var = size(arr)-1 ....? but we have 1 free unused space at front
why we are incrementing front in enqueue operation? like enqueue can be performed by using rear only. right? so why here u had increment front to 0? let it point to -1 only...we will use front in dequeue. so there we should increment the value of front na?
I have a doubt... If the queue is full ..and we remove a item from front , after that can't we entre a new value at back (by shifting every object forward )
Thats really great to know buddy🙏 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
Please sir read it Sir size of array is n and we dequeue elements from 0 to n-2 and we check isfull(rear==n-1) I thik it return true so is there any way to solve this problem
Thank you so much buddy. I am glad to see this response from you. Please do subscribe to this channel & share the videos with your friends too. That will be the biggest help and support for everyone 😇
Thank you so much Fazal I am glad to see this response from you. Please do subscribe to this channel & share the videos with your friends too. That will be the biggest help and support for everyone 😇
Not yet but soon it will 😇 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
Please find a solution for that, because I do not understand Hindi, and your explanation is very beautiful. I hope that you will add automatic translation into Arabic in all the course videos as soon as possible, as in the stack lesson.
Hey man. I got a doubt. Suppose we enqueue 4times to make the queue full. So now, rear=3,front=0. Now we dequeue 3times,so there's only one element now. So now, rear =3,front=3. Now if we dequeue again, which position will the new element get into?? I know the question is a bit lengthy, but please try to understand, if possible. Thank you
I guess this thing is the drawback of this linear type of queue. the element will possibly start to enqueue from first location if we use circular queue
thank u so much bhai for wrking this great for making us to understand in the best way ever.... i love the way u explain.. i have a small doubt i hope u wll definitely clarify it ... i have done ur oops with c++, datastructures and in progress with java. suggest me what should i proceed with the next course after these to get good job oppurtunities to get settle well. plz bhai.
Wayne automatic translation of the Arabic language Please find a solution for that, because I do not understand Hindi, and your explanation is very beautiful. I hope that you will add automatic translation into Arabic in all the course videos as soon as possible, as in the stack lesson.
Hey Guys, if you want more such tech educational videos on this channel then please support me by subscribing to this channel & also share it with your friends as it helps me create more content just for you ✌
the Indian guy helping me out more than my uni teachers, keeping going thanks
Always 🤟😊
Where are you from?👀
bro i can understand very nicely each and every topic...thank u from my bottom of my heart.
Most welcome bro. I am very happy to hear this from you. Please share this video with your other friends too 😇👍
for me this is the Best Data Structure playlist ...in youtube.. easily understandable and the visual representation is too good ...
Found this channel today, Your work is truly appreciable brother. 🔥🤘
Welcome to Simple Snippets Family!
You are the only one who took time to explain it first rather than jumping to code!
Thanks alot...Your videos mean so much to us❣
I know I'm commenting on almost every video... But dayummmmm..... You outdo yourself everytime!!
Thank you very much!!!
Thank you so much Chetna, this was really a great compliment. Will keep outdoing myself as long as I have such wonderful support from you and our Simple Snippets Family. Please do share the videos with your friends too. Thats the biggest help and support for our channel :-)
best in world
i watched it before and second time i did't get this type of describe in any other video so keep it up buddy too good
Thank you so much brother 😁 please share this entire DSA video tutorials with your friends buddy 😊 that will be the biggest help and support ✌️
@@SimpleSnippets shourly
bro your videos are short and to the point. Really helpful
Your videos are so well presented and so much clarity of concepts - thanks for sharing really amazing
I was having so much problem as to where will I be able to learn all the DS, but you really made it up very easy, thank you very much sir ..whole heartedly thank you very much
Thanks a lot for providing this amazing content that's also for free.... It means a lot brother..... For the first time in my 2 years of college... I have understood what queue is and how it's actually implemented.... Thanks a lot.
Most welcome buddy. I'm very happy these videos are helping you 🤘 Keep growing 😊
amazing bro thanks by heart .now i think i am able to learn DSA
Thank you for explaining it in such a detailed manner!
In first time in my life i understood algos so precisely and didnt get bored.thanks for creating this masterpiece bhaya.Seriously you are a legend.....
Thank you so much buddy. Really happy to hear this. It would mean a lot if you could please share our channel and videos with your friends too ✌
underrated utube channel
best playlist ever. Too much underrated. You deserve more subs
You make it so easy bro, I am a non Comp Sci guy and its still so easy for me to get this...thankss!!!
That's the best feedback ❤️ glad you liked it. Please do share the videos with your friend too🤟
After watching your videos,now i really think ,i will implement it 😎🤩 ,thanks from bottom of my heart
Lol, kaha Naresh it channel ki bookish knowledge and kaha humara bhai sakpaal, love you bhai
Thank you so much Kavan 🙏
bro this is the best explanation of queue that I have came across
Hehe thanks Mahesh 🤟 very happy to know this. Please do share the channel with your friends & ask them to join our Subscriber family too😊 that will be the biggest help & support 🤟
This is the only indian channel where i can relax to watch DS else I go for some foreigners because you know in India there are many channels which are doing same stuff again and again with boaring techniques , but this bro Tanmay came with lit energy with also fab English speaking and awesome techniques i hooked up watching video of stack and now I'm going to do binge watching and binge working for DS practice , peace out and thanks again bro Tanmay 🤟🤟🤟
Wow thank you so much Pirthavi for such wonderful feedback. Really very glad to know that my DSA videos are helpful. Please so support me by sharing our videos with your friends too 🙏
I have already share this video to my 5-6 friends and they gave me a fab positive reaction , this is the only channel where we get implementation of data structure with c++ language .....
@SimpleSnippets, sup, a few questions.
1. If the `front` variable can only be equal to `-1` when the queue is empty, then why do you check for `rear`, too, in `isEmpty()`?
2. What is faster: checking for `front < 0` or for `front == -1`? I mean not for C++ specifically, but for popular CPU arches. From what I understand, comparison of two numbers is typically done in the CPU in the ALU. But do compilers make it a moot point because they somehow change the Time Complexity of the comparisons on the higher level so even if on the ALU level it is faster to check for `-lt` (less then) than for equality, the workings of the higher level add other algorithms above it and the total Time Complexity of the underlying algo and of the higher-level algo turns out to be the opposite: that the check for equality is faster, because the higher-level algo is more Time-Complex than the underlying algo, so it grows faster and works slower on large input. Pls correct me if I'm saying bs, I'm still figuring this out.
3. Why don't you put `x = arr[front]` BEFORE the if-else construct in `dequeue()`? I mean at this point (after the check for emptiness) it will execute either way.
Thanks for the vid. Just discovered you playlist thanks to your Big-O notation introduction, it was very awesome and I'm still kind of dazed I got it. NOW I HAVE THE POWER TO RULE THE WORLD!
P. S. Your vids are very nice, I like how you exaplain things in simple terms, as you would to a friend in the kitchen, and also take care to highlight stuff in different colors, it helps understanding a lot, I kind of categorize the stuff you talk about right away when you use different colors, wish more people would do that, especially in term definitions like you do. And also SPECIAL BIG-PUMPKIN THANKS for the practical examples both in Tech and Real Life, I guess you know just like I do what it's like to live in the world of mostly purely theoretical study materials of any significant depth and be a practically minded person at the same time. You're life saver. This rocks!
best channel for c++ programmer
bro thanku so much from the bottom of my heart. now i can sleep well in the class.
Hahahaha most welcome bro. Sleep tight 😂😴
Just don't get caught 😜
Damn man i searched a lot of videos for dsa and urs is the only one i actually understood.Thank you keep up the good work!
That's great to know Loukik, please do Subscribe to our channel as we have a lot tech educational content which you'll surely like. Also please do share our channel and videos with your friends too, that's the biggest help and support you can provide buddy ✌
At 20:40 wont we make arr[front]=0 ?
bro thankyou so much your teaching style is amazing and i like this thx bro for understanding queue
It's my pleasure. Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
@@SimpleSnippets ya bro i have also share with my IT friends
Hi everyone! I think in enQueue( ) operation there should not be an elseif part, instead, you should place an else part, and in that there can be an if and else function. because in the video, arr[rear]=value will be executed rather arr[] is full or not.
here is my approach. correct me if I'm wrong.
void enQueue(int element) {
if (isFull()) {
cout
looks like yours works too but his's more... readable in a sense. You can more easily tell what his code is saying compared to yours
It was really helpfull i understood every concept!!!!!
The way you explain 😍😍😍....
Hehe thanks bro ♥️😊 means a lot to me✌️
Thank you so much for this much clear explanation! 🤩
Most welcome buddy, do share the video with your friends too ✌️ that's the biggest support you can do for me 😊
Fantastic video! I have one question. After performing out last dequeue operation, the last read value is not cleared out. I added a arr[front] = 0; in my dequeue "else if" so that when I read the last queued item (when front == rear), that value is read, then cleared. Does this track?
Can you tell me what is the time complexity of
Enqueue=?
Dequeue=?
Best case and worst case ☺️
Dude superb explaination
Thanks bro 🤟 glad you liked it. Please do share the video with your friends too ✌️
Awesome Bro, may you prosper in life
Most welcome my friend 😊 thanks for the support always. I would request you to keep sharing our channel and content with your friends 😊✌️
14:20 isempty should have parenthesis
So easy to understand. Thank you ❤🙏
Happy to learn from u.keep doing this for ever😉
Thank you so much buddy🙏 And yes many more videos will be coming soon ✌
bro suppose the queue size is 4 and we enqueue 4 values and we dequeue 1 value now front var points 1 and rear var points 3 then will it denote queue as full caz rear var = size(arr)-1 ....? but we have 1 free unused space at front
It does make sense
You've earned your subscriber.
Welcome to Simple Snippets family!
Bro U are life saver subscribed good work man
Glad I could help. Please share the videos and channel with your friends too. Thats the biggest support you can show for our community.
Simple Snippets for sure man
Excellent explanation once again.
why we are incrementing front in enqueue operation? like enqueue can be performed by using rear only. right? so why here u had increment front to 0? let it point to -1 only...we will use front in dequeue. so there we should increment the value of front na?
I have a doubt...
If the queue is full ..and we remove a item from front , after that can't we entre a new value at back (by shifting every object forward )
We can if we want to, but standard queue conventionally does not provide facility ✌
@@SimpleSnippets Bro I watched some videos on queue . they shifted every object forward while performing Dequeue operation
Well the operation is dependent on how you implement. Even their implementation is correct. 😊✌️
Well explained thank you :)
Excellent work sir👌🏻👌🏻👌🏻🥰🥰💯💯💯
thank u sir. all concept u covered.
Thats really great to know buddy🙏 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
bro when we do front++ why preceding value gets erased we have only shifted the arrow
Because now front points next index so previous value become garbage
This course is good or as per the level of faang companies???
Make a video series for aptitude and logical reasoning now a days it's very useful for cracking interviews or for competitive exams as well
th-cam.com/video/OVcoHHGJvUk/w-d-xo.html
Thanks for the amazing explanation
so can i shift all element after the dequeue?
great video
awesome bro, go on
Thanks bro ✌️😊 please do share the videos ✌️
@@SimpleSnippets of course
Thank you so much buddy 😊✌️
I am lil confused as why will queue does not require pointer for rear or front .
very nice !!! i super i like all your videos
Thank you so much 😀
Hey please make a video on STL IF POSSIBLE... love your all videos...
Please sir read it Sir size of array is n and we dequeue elements from 0 to n-2 and we check isfull(rear==n-1) I thik it return true so is there any way to solve this problem
Is this course enough for placement????
what's the difference b/w learning dsa using struct nd classes?
Not much
الشرح يجنن عراقية مرت من هنا
You deserve 100M subscribers. 🙏
Please make video on heap
Thanks Anoop! And yes will cover Heap soon!
Hlw bro your vedios are very useful keep going
Thank you so much buddy. I am glad to see this response from you. Please do subscribe to this channel & share the videos with your friends too. That will be the biggest help and support for everyone 😇
Thankyou !!!
Ah bro first I thought that what he is saying then I see your video again then I understand your oncepts
*Osm Sir..*
Thank you so much Fazal I am glad to see this response from you. Please do subscribe to this channel & share the videos with your friends too. That will be the biggest help and support for everyone 😇
@@SimpleSnippets ok sir...
is this by using linked list
Thanks, after hours of mental torture, you saved me!
Hehe glad to be your saviour 🤟 please do share our videos with your friends too and definitely Subscribe 😁 thats the biggest help & support 🤟
awesome dude tqsm
Happy to help😇
Congratulations for 100k in advance 😀
Thank you so much 😀
Bro, you are amazing!!!
Please upload videos on dynamic programming as well.
Sure I will
easy to know. thanks.
Glad it was helpful!
awsome bro ,keeo it up
Thank you brother....
Sir will u give us notes of that
Thanku so much bhaiya
On point.
Thats the whole motto of my videos, to be on point 😇✌
awesome bro...always with u... :)
Thanks bro 😊👍
Does this playlist cover all tha data structures and alogs ?????
Not yet but soon it will 😇 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
Thank you sir
Most welcome buddy 😇 Please share it ✌
My Saviour
thanks for the video
❤
Bhaiya complete roadmap bnao ds algo in C++ Khan se kre on utube.Really need..by a person like u..
Please find a solution for that, because I do not understand Hindi, and your explanation is very beautiful. I hope that you will add automatic translation into Arabic in all the course videos as soon as possible, as in the stack lesson.
Awesome
Thanks bro 😁 please share the videos with your friends ✌️
Bhai
Pls tree haep hash pr bhi video bana do
Pls pls
superb
Skip intro 1:30
Hey man. I got a doubt.
Suppose we enqueue 4times to make the queue full. So now, rear=3,front=0.
Now we dequeue 3times,so there's only one element now. So now, rear =3,front=3.
Now if we dequeue again, which position will the new element get into??
I know the question is a bit lengthy, but please try to understand, if possible.
Thank you
I guess this thing is the drawback of this linear type of queue. the element will possibly start to enqueue from first location if we use circular queue
@@honeypatre ya, I watched the next video and my doubt was cleared.
Dude one series on STL plz... It's very confusing for most of us
Will do in future ✌
thank u so much bhai for wrking this great for making us to understand in the best way ever.... i love the way u explain.. i have a small doubt i hope u wll definitely clarify it ... i have done ur oops with c++, datastructures and in progress with java.
suggest me what should i proceed with the next course after these to get good job oppurtunities to get settle well. plz bhai.
Thank you so much and I am very happy to know that you have gained so much knowledge. Start with competitive programming practice now.
@@SimpleSnippets I think u dint started the play list on competitive programming yet...
Only one video is there ryt?
Yeah that's a long way to go. DSA is left so will complete that first ✌️
@@SimpleSnippets OK bhai thank u so muchhh... Happy to see ur reply 😍🙈
I wll be waiting fr ur new playlistts
Bhai will u complete data structure s and algorithms both in 5 to 6 months plz tell me,how much time does it take
Actually there's no real end date to this series but I'm expecting that in the next few months majority of fundamental topics will be covered. ✌️😊
Next single linked hey kat Bhai .plz tell me when will u post .just tell me bro
Next is Implementing Queue DS in C++ Programming. Next video might come tomorrow. Others take time ✌
Thanks bro
Most welcome my friend. I would request you to please share this video with your friends too 😊✌️
Why couldn't we use pointer??
Thanks bro
Welcome Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
Wayne automatic translation of the Arabic language
Please find a solution for that, because I do not understand Hindi, and your explanation is very beautiful. I hope that you will add automatic translation into Arabic in all the course videos as soon as possible, as in the stack lesson.
Can I get these slides please?
Legend
Glad it helped! Keep up the support by sharing the videos with your friends too! 😇
pls provide ppts and code. it is necessary for teaching students