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..
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)
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
00:04 Introduction to stack and queue 02:30 Introduction to Stack Data Structure Basics 07:37 Introduction to Stack and Queue implementation using Data Structures. 10:23 Implementing Stack and Queue using Data Structures 15:41 Implementation of Stack data structure in 10-size array 18:07 Implementing stack and queue using arrays have fixed sizes, not dynamic. 22:30 Explanation of stack operations like push and pop 24:50 Implementing push and pop operations in a queue using a circular array. 29:29 Implementation of pop and top operations in stack 31:43 Implementation of Stack using LinkedList 36:15 Implementing stack using a linked list 38:42 Implementing stack and queue using data structures 43:06 Implement Stack operations using Queue 45:28 Transforming Queue into Stack by reversing elements 49:55 Implementing Queue using Stack Data Structure 52:04 Simulating queue using stack data structure 56:19 Understanding time and space complexity of stack operations 58:35 Implementation of Stack and Queue using two stack approach. 1:02:47 Introduction to Stack and Queue 1:04:56 Introduction to Stack and Queue implementation
In implementation of queue using stack , why the pop is using lifo (deleting from the last)..It should follow fifo (deleting from the first )..plz explain
we shifted all from s1 to s2. therefore element that got inserted first in s1, is at the top in s2. hence it will be popped, thats what we intended to do.
Correct me if I'm wrong but the queue using array implementation in the video is actually the implementation of a circular queue right? instead of the traditional queue implementation
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❤
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
Bro whatever stuff like videos artice sheet you can acces now all will remain free as it is . In TUF+ there will be some new additional feature for which we have to pay
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..
Yes , also this playlist was uploaded yesterday right?
@@Josuke217 yes it was, had some audio issues.
@@takeUforwardthanks for uploading high quality content for free , we appreciate it a lot :)
@takeUforward thanks for uploading high quality content for free , we appreciate it a lot :)
Thank you for the amazing lecture series! Learning so much from your lectures, GOAT of DSA!!
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)
thanks bro :)
thanks for this!
Thank you so much buddy :)
Dude timestamps guys are the best
Thanks for it ☺️
@take U forward. In 43:41 you also have to do end = end->next;
Yes I noticed same mistake
Ohh I was looking for this one Thanks bro!
right
shouldn't we write end=temp; ?
@@prasannagodiyal6736haina
Guys comment "Strings" for next !!!
char
array
finally GOAT playlist of stacks on youtube 😍😍❤❤
43:34 after end.next=temp there will be end=temp to move end to temp
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
Vote For Strings NXT!
August end! Promise.
@@takeUforward
Please make it earlier please raj bhaiya, i know you have full time role & other things going on but please try to make it at earliest
@@takeUforward amazing striver, thank you so much
@@takeUforwardlove you striver
@@takeUforward no what? why? Bring it in the July end itself.
You missed something in queues implementation using linked list in the push function you have to add (end=temp)
please heaps and strings playlist next!! :")
At 43:35 I think end = end->next is missing
yes ,it will be end=temp
@takeUforward pls pin this comment
true
yes ofcourse, I was trying to find this in comment, but only few managed to spot on
clear like a star in sky
This playlist is so helpful for our upcoming placements. Love from UP ❤
Thank u bhaiya ,
Jabardast lecture hai.
Pura revision ek baar me within short period of time.
And this all playlists are very helpful for us. So, thank you very much for this🎉
I have no use of TUF+, but bought to support you, keep going, Thanks.
give it to me then it would be so helpful for me 😥
This is a gem channel. Thanks
Good to see a new lecture series
00:04 Introduction to stack and queue
02:30 Introduction to Stack Data Structure Basics
07:37 Introduction to Stack and Queue implementation using Data Structures.
10:23 Implementing Stack and Queue using Data Structures
15:41 Implementation of Stack data structure in 10-size array
18:07 Implementing stack and queue using arrays have fixed sizes, not dynamic.
22:30 Explanation of stack operations like push and pop
24:50 Implementing push and pop operations in a queue using a circular array.
29:29 Implementation of pop and top operations in stack
31:43 Implementation of Stack using LinkedList
36:15 Implementing stack using a linked list
38:42 Implementing stack and queue using data structures
43:06 Implement Stack operations using Queue
45:28 Transforming Queue into Stack by reversing elements
49:55 Implementing Queue using Stack Data Structure
52:04 Simulating queue using stack data structure
56:19 Understanding time and space complexity of stack operations
58:35 Implementation of Stack and Queue using two stack approach.
1:02:47 Introduction to Stack and Queue
1:04:56 Introduction to Stack and Queue implementation
wake up babe,striver just drop another banger!!!!
In the push in queue using LL, in the else condition, end->next = temp; But after, the end should also be pointing to temp right?
yeah true
How anyone can have this much knowledge!
We are waiting for your string playlist Striver
striver plz release full playlist once nd also string plzz
Here after seeing your post about the series. Thanks a lot ❤
He is soo underrated...... demnnnn!!
Outstanding method of teaching
God level....🔥
one mistake in optimal approach
solution :
int trap(vector& 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[i])
unit=unit+l_max-height[i];
else
l_max=height[i];
i++;
}
else if(height[j]height[j])
unit=unit+r_max-height[j];
else
r_max=height[j];
j--;
}
else
{
l_max=max(l_max,height[i++]);
}
}
return unit;
}
The OG is back again.........
Hoping for strings by end of August and Heaps by end of September. I think rest everything is covered. Looking forward to TUF+ and what it will have.
understood bhaiya❤
i didn't saw any comment for 29:40 i guess something is wrong, el = q[start] should be in 2nd case. correct me if I'm wrong
What happened to the playlist?
Striver, it would be great if you can add timestamps in this video. Thank you so much for this DSA playlist!!!
Should n't it be (s2.empty == 0) ?
Yes, correct.
Amazing video
Need heap sir, please ❤❤
remember bro is our teacher not slave !!! you can upload our class whenever you think sir!!!
In implementation of queue using stack , why the pop is using lifo (deleting from the last)..It should follow fifo (deleting from the first )..plz explain
we shifted all from s1 to s2. therefore element that got inserted first in s1, is at the top in s2. hence it will be popped, thats what we intended to do.
Correct me if I'm wrong but the queue using array implementation in the video is actually the implementation of a circular queue right? instead of the traditional queue implementation
yes
Understood♥♥♥♥
Thanks alot raj sir, helpful playlist, please upload strings also
thanks a lot for this. strings next pleaseeeee
Sir next topics pr video kb upload hoga..?
We are waiting for your next dsa topics.
Thank you so much sir your lecture is awesome
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❤
bhaiya arent the words "push" and "pop" not suitable for queue? we should use enque and deque right?
true
@striver please upload heap playlist. Most needed right now
I am slowly stating to believe that this course is in C++
What is the name of the software that u are using?
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
please attach these videos link in the website..
wow :) now we will have grasp on stack and queues
Great Content ❤
yayyyy finally its here
Bro when will the string playlist will come???
Wasnt this video uploaded yesterday striver?
One correction: The condition check on push should be if(top >= 10-1)
is this important for interviews??
43:33 Implementation of queue using LinkedList: after end->next = temp u forgot to update end= temp, kindly correct this
Hii .. please upload string playlist and Java collection
please upload "string" series......eagerly waiting
Striver please do strings and priority queues/heaps series
Are these being uploaded again as they were here yesterday no?
yes re-uploaded because of editing issues
Waiting for string series
WILL COMPLETE THIS PLAYLIST TODAY
AND COMMENT ON LAST VIDEO
can you make a course like this for web development too>? 🥺
sir plz upload string playlist.
tuf+ 🔥👇
String playlist please @ striver
bhaiya can you make a saperate video on printing all lcs , please.
Bhaiya can u make a detailed video on tuf+
I still not got it, if Tuf+ is free or paid?
Bro whatever stuff like videos artice sheet you can acces now all will remain free as it is . In TUF+ there will be some new additional feature for which we have to pay
@@EDU-Zone679 thnx Brother 🙌
please bring videos on string topic
amazing bro @takeUforward
amazing bhaiya
Hope you are doing well !
19:30 continue from here
thank you bhaiii
lessgo we got stacks now
strings playlist when?😭
search the questions you will find the solutions somewhere.
Striver bro realy need String playlist noww
Me watching this during my exams.....😅❤
String and recursion
UNDERSTOOD;
Thank you brother
Thanks bro... Might be ab video private nhi hoga
String
Thanks Raj bhai
thanks bhaiya
please post
heaps playlist
Striver ❤
String series please..
Next Heap??
Completed 17th July
1:01:39
Thanks
26:16 same formula hai🤣😁😁
strings banao bhai ab, strings pe bahut kam quality content hai