Queue Implementation using Arrays

In case you are thinking to buy courses, please check below:

Watch at 1.25x for better experience ..
---------------------------------------------------------------------------------------------------------------------------

---------------------------------------------------------------------------------------------------------------------------
_____________________________________________________________________________

---------------------------------------------------------------------------------------------------------------------------

#dsa​ #striver #leetcode

[takeUforward]

All DSA playlist can be found in the description..

[jeet-smokey]

Raj has come a long way. Kudos to all his efforts. Helping millions.

[bikashchoudhury]

Your assumption get correct this teaching style is very understandable. I saw your this 1st video board with teaching and I liked this 👍👍

[nehasingh]

Amazing work, Striver! You guys are really doing a great job for us by providing such a brilliant DSA course for free. It's genuinely useful for me.

[muditkothari]

Aah how easily u make concepts easier !! Hats off !

[anand_bhatu_]

every time i see your videos i feel so much motivated. THANK YOU....

[ritugoyak]

Understood bro....White board pr aur ache se smj aa rha hai..💯

[vishalkharadevk]

Bro hats off for your hard work….liked the video for your teaching style

[KiranKumar-emqy]

HI Striver, i guess there may be a mistake in the implementation for a corner case.
when the front or rear goes above the size n, it has to be reassigned back with modulo n, rather than keeping it like that.
fornt = (fornt +1) %n;
because in case if front reaches INT_MAX, it automatically resets to 0 which may give a wrong value, which isn't intended

[paragroy]

Nice explanation your videos are really good...please keep on making such videos.

[iamnottech]

For any beginner I want them to know that half of the video is about queue and then concept of circular queue starts so don't get confuse and yes if u are preparing for college exam then it is very much necessary to write what is written in the book as in my case I did it correct but my teacher said no this algo is not in book so be cautious, if u are preparing for upskill then this is best ..

[harshalgarg]

Isn't this the implementation of circular queue?

[Stellar_codes]

i am here after seen some of videos of a2z playlist and i wondered to see that his teaching method is op always, great explanation

[prithvichetty]

Thank you sir please stack and queues pura kar dena please 😅🙊

[gautamsuthar]

09:50 It should be a[i%n] not rear%n. Am I right?

[himanshukashyap]

Nycc videoo plzz upload more interesting concept

[divyanikashyap]

Raj bhaiya iam starting coding but iam really feeling it tough, can u guide me please?How can I contact u?

[ananddash]

Bro book allocation wala vdeo acha tha

[SaketAnandPage]

Wouldn’t that be i%n instead of front %n

[motivationalquotes]

If we follow dsa from x path and then practice sde sheet by striver bahiya enough to crack dsa part of any company