L1. Introduction to Stack and Queue | Implementation using Data Structures

[takeUforward]

TUF+ launching on 7th August, are you excited about it? If you are wanting to give hate for us bringing a paid model. Here are a few things you must read.

1. if you are an engineer, you know the server cost to run takeuforward website which has 13M+ views every month.
2. TUF stays free, so should not affect anyone, just blink an eye.

It will be a course, but not a course! Miles apart from what others are providing you..

[sharath]

Guys comment "Strings" for next !!!

[KartikeyTT]

TIMESTAMPS
0:00 Intro
1:54 What is Stack
5:37 What is queue
8:58 Implementing stack and queue using inbuilt library
10:47 Implementing stack using array
19:30 Implementing queue using array
31:53 Implementing stack using linked list
38:22 Implementing queue using linked list
44:58 Implementing stack using queue
51:08 Implementing queue using stack (approach 1)
58:12 Implementing queue using stack (approach 2)

[ViswatejAbbireddy-we]

At 43:35 I think end = end->next is missing

[simanraj]

finally GOAT playlist of stacks on youtube 😍😍❤❤

[technologicalvivek]

Thank u bhaiya,
Jabardast lecture hai.
Pura revision ek baar me within short period of time.

[shatakshishukla]

please heaps and strings playlist next!! :")

[adityamishra]

This playlist is so helpful for our upcoming placements. Love from UP ❤

[gradientO]

Here after seeing your post about the series. Thanks a lot ❤

[toushikbanik]

@take U forward. In 43:41 you also have to do end = end->next;

[harshitmnnit]

gonna buy the TUF+ also ...we will support you striver...aapne hume itna high quality content free me diya h, now its our responsibiilty to support you

[vaibhavbhosale]

wake up babe, striver just drop another banger!!!!

[SomrikTapaswi]

wow :) now we will have grasp on stack and queues

[rongalamanindra]

Thank you so much sir your lecture is awesome

[brainmosquito]

striver plz release full playlist once nd also string plzz

[avishshah]

Striver, it would be great if you can add timestamps in this video. Thank you so much for this DSA playlist!!!

[_NITESHMOTIVATION]

remember bro is our teacher not slave !!! you can upload our class whenever you think sir!!!

[modigautam]

one mistake in optimal approach
solution :
int trap(vector<int>& height) {
int n=height.size();
int unit=0;
int i=0, j=n-1;
int l_max=0, r_max=0;
while(i!=j)
{
if(height[i]<height[j])
{
if(l_max>height[i])
unit=unit+l_max-height[i];
else
l_max=height[i];
i++;
}
else if(height[j]<height[i])
{
if(r_max>height[j])
unit=unit+r_max-height[j];
else
r_max=height[j];
j--;
}
else
{
l_max=max(l_max, height[i++]);
}
}
return unit;
}

[shetty-md]

Bro i can understand easily after seeing your videos but when i am solving question for first time i am not able to do please give some advice or tips. Please striver bhaiya reply. By the way i love ur way of teaching❤

[PrakashRai-ffpr]

I am waiting for this😢i search on tuf and got old lecture i thought when will you drop new video and now coincidently i am hear for search of stack playliST and now its available