What is Queue Data Structure ? | Queue Operations | Data Structure & Algorithms (DSA) | Part - 1 

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 ✌

Found this channel today, Your work is truly appreciable brother. 🔥🤘

bro i can understand very nicely each and every topic...thank u from my bottom of my heart.

I know I'm commenting on almost every video... But dayummmmm..... You outdo yourself everytime!! Thank you very much!!!

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

Your videos are so well presented and so much clarity of concepts - thanks for sharing really amazing

for me this is the Best Data Structure playlist ...in youtube.. easily understandable and the visual representation is too good ...

Can you tell me what is the time complexity of Enqueue=? Dequeue=? Best case and worst case ☺️

the Indian guy helping me out more than my uni teachers, keeping going thanks

@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!

Ah bro first I thought that what he is saying then I see your video again then I understand your oncepts

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

bro your videos are short and to the point. Really helpful

الشرح يجنن عراقية مرت من هنا

After watching your videos,now i really think ,i will implement it 😎🤩 ,thanks from bottom of my heart

amazing bro thanks by heart .now i think i am able to learn DSA

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

Anyone from isc

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?

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.

Hey please make a video on STL IF POSSIBLE... love your all videos...

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

My Saviour

❤

Lol, kaha Naresh it channel ki bookish knowledge and kaha humara bhai sakpaal, love you bhai

Thanks, after hours of mental torture, you saved me!

bro thanku so much from the bottom of my heart. now i can sleep well in the class.

bro thankyou so much your teaching style is amazing and i like this thx bro for understanding queue

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

underrated utube channel

Martinez Barbara Davis Ruth Smith Helen

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 )

14:20 isempty should have parenthesis

This course is good or as per the level of faang companies???

very nice !!! i super i like all your videos

Is this course enough for placement????

At 20:40 wont we make arr[front]=0 ?

Thank you for explaining it in such a detailed manner!

It was really helpfull i understood every concept!!!!!

Hall Cynthia Taylor Cynthia Garcia Jeffrey

You should make this videos in hindi too

awesome bro, go on

bro when we do front++ why preceding value gets erased we have only shifted the arrow

Wayne automatic translation of the Arabic language

Why couldn't we use pointer??

Hlw bro your vedios are very useful keep going

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❣

pls provide ppts and code. it is necessary for teaching students

Dude superb explaination

Thank you so much for this much clear explanation! 🤩

Well explained thank you :)

Bhai Pls tree haep hash pr bhi video bana do Pls pls

The way you explain 😍😍😍....

EARNED A SUB

Awesome Bro, may you prosper in life

Double ended Queue is not there

great video

Sir will u give us notes of that

Thankyou !!!

what's the difference b/w learning dsa using struct nd classes?

Anyone from bsc cs?

You make it so easy bro, I am a non Comp Sci guy and its still so easy for me to get this...thankss!!!

Legend

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 🤟🤟🤟

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.

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

Can I get these slides please?

is this by using linked list

Dude one series on STL plz... It's very confusing for most of us

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?

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.

Skip intro 1:30

Congratulations for 100k in advance 😀

Bro, you are amazing!!! Please upload videos on dynamic programming as well.

fay = 5

superb

bro this is the best explanation of queue that I have came across

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.

I am lil confused as why will queue does not require pointer for rear or front .

thank u sir. all concept u covered.

You've earned your subscriber.

Bro U are life saver subscribed good work man

Awesome

Excellent work sir👌🏻👌🏻👌🏻🥰🥰💯💯💯

awesome bro...always with u... :)

Thank you brother....

so can i shift all element after the dequeue?

Happy to learn from u.keep doing this for ever😉

Thanks bro

easy to know. thanks.

damm man you are great and your teaching meathod is also too good please complete this palylist fast bro plaese upload more types of algorithms and hashing one also pleasebro and keep it up

awesome dude tqsm

Thanks for the amazing explanation

Thanku so much bhaiya

You deserve 100M subscribers. 🙏

best channel for c++ programmer

thanks for the video

So easy to understand. Thank you ❤🙏

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.....