4.8 Implementation of DEQUE using Circular Array | Data Structures Tutorials

this course is far better than code with harry dsa i can say that i have completed his whole playlist but the way you make us understand is great ... you are the goat for teaching dsa

mam coa padhao please

Thanks

thank u

hello ma'am,
i have one doubt regarding this topic. if my queue is [A,_,B,C], front=0, rear=2. and perform insert at front in double ended queue is it possible?

demgh ki dahi ho chuki h

Where is priority queue lecture mam.. please let me know !!! 🥺🥺

Instead set condition fir bit rare-- and front -- before 0 we can use front=(front+4)%5 ,now if front =3 and we want to add I front then we use (3+4)%5=2(front index)

Mam Priority Queue?

Maam can you make videos in Hindi language????!!!!!

Ma'am, Is the video of priority queue missing?? If not , can you please provide the link . Bcoz the next video is of trees.

Madam please do a video lecture on priority queue. please madam

Ma'am please provide display code.

Thanks you mam 🙏🏻 ❤

Priority que??

Priority queues lecture is missing

here f and r means front and rear
so we can write f and r instead of front and rear is that true?
i think im right becoz we never declared anything like front and rear in the program!!

You the best teacher mam❤

Even after 4 yrs, your channel is 👌🙏🙌💯✅

Thank you mam🎉❤

Mam kindly upload priority queue lecture ! Pls 🙏

Madam in enquerear operation if front is at 0 and rear at size -1 . Is it working madam

mam can you do video on finding time complexity of quick sort and merge sort

Mam the session was amazing.....🎉🎉but it is showing the l value error in the condition void enqueuerear....mam please can you rectify it....

Thankyou mam..

madam you forgot to add priorty queue in the playlist

I have never ever seen some one else teaching the tough concepts of DSA in such a best way. You are doing very good thing for the humanity.

Mam u are 5really cute

instead of taking 2 else for insertion, can't we just one else in which we take front=(front-1)%N ??
that will satisfy both if else and else part?..

display funtion me i!=(rear+1)%n hoga

Day 39

you are too good in terms of explanation Mam

Your videos are really very helpful mam. Keep up making this kind of videos

Shouldn't their also be a condition if front = rear - 1 while checking whether the stack is full or not

display function is wrong

Nice explanation mam ❤

I wish my teacher teached the class like this instead of blindly reading powerpoints.

Jenny you are the MVP !

What a great video indeed mam! Thank you so so so much mam :) Anyone who is looking for there concepts to get cleared, this video is the way to go!

maam can you please make a video on priority queues

So far best.

❤

dimaag ka bhosda ho gya.....

Before watching this video d queue it was very toughest concept for me but after the watching of this video i got the concept totally. Thank you ma'am.u really deserves much growth 📈.

Best teacher 🎉🎉

Thank you mam you helping me a lot

Mam what will happen in dequeuerear() if r is 0, but f is also 0? Will it go for the 2nd case or 3rd case?