Implement Queue using Stacks (LeetCode 232) | Side by side demo and diagrams

[@manojtate9604]

Whenever I see your video related to DSA, I am satisfied with the concept.

[@srushtikale7455]

All your explanations are just best

[@GAGGZz]

please make a playlist on Stack, queue, HashTables tries etc. as your teaching is awesome please continue your ds playlist

[@nikoo28]

there are problems available on stacks and queues, just not in a playlist...will do that eventually :)

[@adityajain3451]

@@nikoo28 sir please make a playlist so helpful

[@sdkaraarslan]

nice explanation with visuals and clear understanding, love this.

[@AcashBrands]

Great explanation sir ❤👍

[@ousmanbah10]

He is the best

[@Curiousity22]

4:34 But the elements enter from rear in queue: so order is 4, 8, 15, 16 ??

[@divyakumardivyanshu4279]

understood

[@DSA-q8q]

❤❤❤

[@sonuanand167]

nice explanation..... please make playlist for linked-list.. lot's of people are struggling in linked-list.. Thanks!

[@nikoo28]

did you already check this out: kzbin.info/aero/PLFdAYMIVJQHN6J5-OCh7pbG0o8WHC9so3

[@sumitraj6878]

class MyQueue { private Stack input; private Stack output; public MyQueue() { this.input = new Stack(); this.output = new Stack(); } public void push(int x) { input.push(x); } public int pop() { if (!output.isEmpty()) return output.pop(); while(!input.isEmpty()){ output.push(input.pop()); } return output.pop(); } public int peek() { if (output.isEmpty()) while (!input.isEmpty()) output.push(input.pop()); return output.peek(); } public boolean empty() { return (input.isEmpty() && output.isEmpty()); } } // thank me later!

[@limitless6189]

wonderfull broo

[@Blackswordsman28476]

You have playlists on all other data structures Can you make a playlist on stacks & queues too?

[@nikoo28]

i will try to find more problems that are explicitly on stacks and queues.

[@huyuzhong9849]

very interesting.