Circular Queue Implementation using Linked List Data Structure(C++ Program with Diagram Explanation)

[@emanalikhan591]

Sir the way you teach things in so much easy way, tbh i hate coding but then i watch video and now i have interest in coding. Love from Pakistan sir. Fan sir apkay fan

[@syedzaingilani515]

thankyou so much sir you are such great teacher your teaching method is so wonderful♥♥♥♥♥

[@nirajtiwari7531]

Thank you so much for taking request made by me and other viewers !! And it's posted ASAP that's very kind of you❤️ . Cheers!

[@SimpleSnippets]

Most welcome Niraj😊 Please keep up the support by sharing our channel and videos with your friends 🙏

[@parneet30]

I think this line should also be added in the enqueue function's first if statement front = n; rear = n; n->next=front; // this one cout

[@jamesnash9675]

you are the best.........masum

[@nagiriraghavendrarohith3560]

in the count function when the circular queue is empty it should return 0 but as you used do while it will increment the count even though the queue is empty. So one if condition should be included to check initially if front=NULL and then return 0.

[@alifkhandakar9818]

Hey Tanmay, you have helped through a really hard times,,,thank u very much Just wanna make a little request if u kindly make video on topic hash table,trees and graph. Badly in need of your lectures

[@SimpleSnippets]

You dont have to SPAM Alif ✌

[@sanjeevkm1656]

I have been watching tour video for the past 10 days and all your dsa tutorials are excellent. Please make tutorials on non-linear ds . I am waiting for it.

[@SimpleSnippets]

Thank you so much Sanjeev for the amazing feedback on DSA videos. I will soon cover the non linear data structures too. Please do support Simple Snippets by sharing the channel and videos with your friends ✌

[@UdaySharma-lw4tn]

bhai is video ka code abhi bhi nahi hai!! Baaki aapki videos bhut achi hain, even english improve ho rhi hai❤

[@kingjack8436]

Thank you so much but the Enqueue have the problem. I think u need this line rear->next = front in the end of the if(isEmpty()) .But anyway thank you so much for the tutorial !

[@fathimaasma8216]

Thank you very much.Great favor

[@SimpleSnippets]

Glad you liked it! ✌

[@fathimaasma8216]

Simple Snippets no one can dislike your videos

[@giggleglyphs]

You are lifesaver 💖

[@teb-24prajwalsontakke33]

Thanks a lot sir 👍

[@SimpleSnippets]

Most welcome Prajwal 🙏 please support me by sharing our channel & videos with your friends too 😊

[@shivam4you744]

continue sir please...

[@justedgy7776]

This channel is perfect, the only thing that could make it better is a dark theme for your editor :) but then again, maybe you prefer light. Just my opinion 👍🏼

[@SimpleSnippets]

Thanks a lot 😊 I am glad you found this great. Talking about your suggestion, personally I love DARK theme myself. However, its not very good for visibility while watching video when it comes to coding on IDE. This is scientifically proven. Try watching any coding video on low res with both light and dark theme. You will be able to still see the code text on light theme. Thats the only reason why I use light themed code editors as the text is more crisp. However, I will someday try to use a dark themed IDE just to see how everyone finds it cause as I said I personally love it too 😇✌

[@justedgy7776]

Simple Snippets Ahhh, that makes sense! I definitely would like to see you try it one day and see if it would actually be better or not :)

[@SimpleSnippets]

Sure thing 🤟

[@rahulraskar2836]

Thank you for the great work. Please make videos on tree and graph

[@SimpleSnippets]

Most welcome Rahul, soon I will cover all these topics. It will take some time though. Please support me by sharing this video and our channel with your friends too. Thats the biggest help you can provide to not just me but also someone who might gain knowledge from our channel 🙂✌

[@bt11103]

What's the difference between these two dynamic declarations in the video Node n1 = new Node(); Node * new_node = new Node(); Is the first one creating only a dynamically allocated node, whereas the second one creates a dynamically allocated node as well as a pointer to that node?

[@saranyaghosh2003]

He has explained this in the previous video. Why don't you try watching that and see if it helps?

[@saurabhpandey5606]

Woooh, her you are!!

[@madhanram5598]

Hii bro In execution initially we make the count operations that get wrong output bro Because In programming we use do while loop so initially count is incremented so its not give proper output So pls give a solution bro Tq for ur lecture ❤️

[@shivam4you744]

sir when you start about tree...??

[@SimpleSnippets]

Will take some time Shivam ✌

[@savitaa.c]

This code is not there in website and i have made some changes in my code as you are doing in your code but its not working its showing error in enqueue and i k your code is running here if possible plz upload this code in your website so i can refer it

[@preranapatro2414]

Ek bar ke baad wo run nahi jo raha ..ek se jada values nahi le eaha ..fir kese baneigi list ..

[@spurthimaddala5254]

Dudeee please start python know☹ Ive learnt c and cpp through your channel And ive also cleared my subjects

[@SimpleSnippets]

Wow I'm glad you've cleared your subjects. Well about python, I won't lie, even I'm not an expert. So videos on it will be taking quite a long time especially cause this DSA course is gonna take super long 😅

[@spurthimaddala5254]

@@SimpleSnippets okayyy anyways thank you:)

[@vishalsangole6001]

U haven't uploaded code of this tutorial

[@hamzazahid6852]

bro it you provided normal queue using singly list code in the description

[@SimpleSnippets]

Updated

[@hamzazahid6852]

@@SimpleSnippets bro it isn't the same code as you written in the video Circular Queue Implementation using Linked List *