Find problem link, notes under Step 9: takeuforward.o... Follow me on socials: linktr.ee/take...
Пікірлер: 220
@takeUforward6 ай бұрын
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..
@Josuke2176 ай бұрын
Yes , also this playlist was uploaded yesterday right?
@takeUforward6 ай бұрын
@@Josuke217 yes it was, had some audio issues.
@Josuke2176 ай бұрын
@@takeUforwardthanks for uploading high quality content for free , we appreciate it a lot :)
@babulalyadav43056 ай бұрын
@takeUforward thanks for uploading high quality content for free , we appreciate it a lot :)
@ishankavdia53806 ай бұрын
Thank you for the amazing lecture series! Learning so much from your lectures, GOAT of DSA!!
@KartikeyTT6 ай бұрын
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)
@disastermaster42266 ай бұрын
thanks bro :)
@omkarshendge54386 ай бұрын
thanks for this!
@Moh_IT20014 ай бұрын
Thank you so much buddy :)
@Mel-up7un4 ай бұрын
Dude timestamps guys are the best
@nigamvaghani_0072 ай бұрын
Thanks for it ☺️
@simanraj82786 ай бұрын
finally GOAT playlist of stacks on youtube 😍😍❤❤
@sharath20036 ай бұрын
Guys comment "Strings" for next !!!
@niteshkhanna6906 ай бұрын
char
@SiddharthSingh-ln8co3 ай бұрын
array
@technologicalvivek75106 ай бұрын
Thank u bhaiya , Jabardast lecture hai. Pura revision ek baar me within short period of time.
@Sharath_Codm6 ай бұрын
Vote For Strings NXT!
@takeUforward6 ай бұрын
August end! Promise.
@realharshgautam6 ай бұрын
@@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
@SuvradipDasPhotographyOfficial6 ай бұрын
@@takeUforward amazing striver, thank you so much
@PavanAditya-zv4ic6 ай бұрын
@@takeUforwardlove you striver
@rounaksarkar30846 ай бұрын
@@takeUforward no what? why? Bring it in the July end itself.
@toushikbanik84526 ай бұрын
@take U forward. In 43:41 you also have to do end = end->next;
@mozeel_v6 ай бұрын
Yes I noticed same mistake
@radhepatel68766 ай бұрын
Ohh I was looking for this one Thanks bro!
@Akash-Bisariya6 ай бұрын
right
@prasannagodiyal67365 ай бұрын
shouldn't we write end=temp; ?
@k.manasaxi-c46224 ай бұрын
@@prasannagodiyal6736haina
@shatakshishukla88586 ай бұрын
please heaps and strings playlist next!! :")
@harshitmnnit6 ай бұрын
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
@mohitsengar28384 ай бұрын
clear like a star in sky
@souhardayasaha3 ай бұрын
43:34 after end.next=temp there will be end=temp to move end to temp
@pronoynath11716 ай бұрын
This is a gem channel. Thanks
@gargkapil6 ай бұрын
Good to see a new lecture series
@gradientO6 ай бұрын
Here after seeing your post about the series. Thanks a lot ❤
@adityamishra34616 ай бұрын
This playlist is so helpful for our upcoming placements. Love from UP ❤
@VighneshRaikar-sh9nu5 ай бұрын
You missed something in queues implementation using linked list in the push function you have to add (end=temp)
@KevalChudasama-f1c3 ай бұрын
And this all playlists are very helpful for us. So, thank you very much for this🎉
@Arshul-kg3ig2 ай бұрын
We are waiting for your string playlist Striver
@sougotasaha5256 ай бұрын
Outstanding method of teaching
@rumiNITPatnaАй бұрын
thank you striver ! done with the video
@AmitKumar-cp1oz4 ай бұрын
I have no use of TUF+, but bought to support you, keep going, Thanks.
@iamxpossible3 ай бұрын
give it to me then it would be so helpful for me 😥
@ANANDCHAPKEАй бұрын
Timestamps (Powered by Merlin AI) 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
@madhurimabhowmick78996 ай бұрын
thanks a lot for this. strings next pleaseeeee
@Messi234856 ай бұрын
Amazing video
@vaibhavbhosale25306 ай бұрын
wake up babe,striver just drop another banger!!!!
@pipinstallpycaret40562 ай бұрын
How anyone can have this much knowledge!
@kaira72523 ай бұрын
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
@brainmosquito76 ай бұрын
striver plz release full playlist once nd also string plzz
@ViswatejAbbireddy-w6e6 ай бұрын
At 43:35 I think end = end->next is missing
@AkashJaiswal-w4q6 ай бұрын
yes ,it will be end=temp
@firebout76755 ай бұрын
@takeUforward pls pin this comment
@oyeshxrme4 ай бұрын
true
@gamersgame433 ай бұрын
yes ofcourse, I was trying to find this in comment, but only few managed to spot on
@parth_38566 ай бұрын
The OG is back again.........
@sahilmujawar82173 ай бұрын
understood bhaiya❤
@SomrikTapaswi6 ай бұрын
wow :) now we will have grasp on stack and queues
@roydebraj21886 ай бұрын
yayyyy finally its here
@mayur3676 ай бұрын
Need heap sir, please ❤❤
@rongalamanindra52796 ай бұрын
Thank you so much sir your lecture is awesome
@KeerthenaАй бұрын
God level....🔥
@anuj88556 ай бұрын
Great Content ❤
@AbhijayaPal-dq3zt6 ай бұрын
Thanks alot raj sir, helpful playlist, please upload strings also
@avishshah21866 ай бұрын
Striver, it would be great if you can add timestamps in this video. Thank you so much for this DSA playlist!!!
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; }
@anush_206 ай бұрын
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❤
@deveshsingh5226 ай бұрын
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.
@harshitmnnit6 ай бұрын
amazing bhaiya
@Prakashrai__20036 ай бұрын
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
@srishtipandey60686 ай бұрын
@striver please upload heap playlist. Most needed right now
@COURATWENTYTHREE2 ай бұрын
Understood♥♥♥♥
@peakyblinderzz6 ай бұрын
Waiting for string series
@Praveen_x7776 ай бұрын
Hope you are doing well !
@bhavyasharma35006 ай бұрын
Thanks Raj bhai
@FullFootball-t5u5 ай бұрын
I am slowly stating to believe that this course is in C++
@srivishwap61076 ай бұрын
thank you bhaiii
@karthikmadan6 ай бұрын
WILL COMPLETE THIS PLAYLIST TODAY AND COMMENT ON LAST VIDEO
@jyothishreddynagaram67896 ай бұрын
Thank you brother
@Jyotikashyap0274 ай бұрын
String
@a_r_m_a_a_n5886 ай бұрын
lessgo we got stacks now
@harshitshrivas54445 ай бұрын
Striver bro realy need String playlist noww
@yash3009520 күн бұрын
understood!
@SatyaMantha3 ай бұрын
Striver please do strings and priority queues/heaps series
@_NITESHMOTIVATION6 ай бұрын
remember bro is our teacher not slave !!! you can upload our class whenever you think sir!!!
@DeadPoolx17124 ай бұрын
UNDERSTOOD;
@Archana-b4k5m3 ай бұрын
String and recursion
@oyeshxrme4 ай бұрын
thanks bhaiya
@anubhabdas95536 ай бұрын
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?
@guneeshvats466 ай бұрын
yeah true
@Cravings4906 ай бұрын
Striver ❤
@subee1286 ай бұрын
Thanks
@guneeshvats466 ай бұрын
amazing bro @takeUforward
@chaithuamala43485 ай бұрын
💌💌
@sanjitkumarjha92825 ай бұрын
Bro when will the string playlist will come???
@tusharsingh12576 ай бұрын
Completed 17th July
@darshilmodi68515 ай бұрын
understood
@sahilmujawar82173 ай бұрын
please bring videos on string topic
@rutujashelke42085 ай бұрын
Understood
@subornonaskar19326 ай бұрын
Hii .. please upload string playlist and Java collection
@mohammadanas7620Ай бұрын
19:30 continue from here
@vinit_notfound6 ай бұрын
❤❤❤
@KevalChudasama-f1c3 ай бұрын
Sir next topics pr video kb upload hoga..? We are waiting for your next dsa topics.
@SamirKumarRakshit-c4z6 ай бұрын
What happened to the playlist?
@Sameeksha_1_63 ай бұрын
sir plz upload string playlist.
@sangharshsingh20736 ай бұрын
String Please Friends please do vote for String
@iamstudying3894 ай бұрын
striiiinggggggggg
@urBro.Z6 ай бұрын
Me watching this during my exams.....😅❤
@AtulSingh-dp8wo6 ай бұрын
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
@Kshitijsingh-n7f6 ай бұрын
yes
@LoadTheCODE076 ай бұрын
Thanks bro... Might be ab video private nhi hoga
@nayankhuman10434 ай бұрын
understood :)
@dpxy15996 ай бұрын
God is here
@tanmaitallam52514 ай бұрын
strings playlist when?😭
@ToonDubberDuo4 ай бұрын
search the questions you will find the solutions somewhere.
@SahilThakur263 ай бұрын
One correction: The condition check on push should be if(top >= 10-1)
@akshat10786 ай бұрын
Next Heap??
@sri-z5d8 күн бұрын
1-2-25
@prathimaiyer1324Ай бұрын
String playlist please @ striver
@THUNDER_BOLT_6 ай бұрын
Bhaiya can u make a detailed video on tuf+
@valendradangi18226 ай бұрын
Should n't it be (s2.empty == 0) ?
@iamenait3 ай бұрын
Yes, correct.
@niteshsingh58186 ай бұрын
Strings
@moneeb-ur-rahman74 ай бұрын
heavy
@real_manikant6 ай бұрын
String series please..
@Kesar-7606 ай бұрын
please post heaps playlist
@payalsingh72383 ай бұрын
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
@Achiever647Ай бұрын
At 35:06 ,temp next is not NULL,can we delete that node ,my doubt is segregated node is deleted only ?