Stacks : Basic, STL and Implementation | Lecture 54 | Java and DSA Course

[@CollegeWallahbyPW]

PW Skills Instagram-: instagram.com/pw.skills/ PW CollegeWallah Instagram-: instagram.com/pwcollegewallah/ PW Skills Twitter - twitter.com/pw__skills PW Facebook Page-: facebook.com/officialpwskills PW Linkedin Page-: www.linkedin.com/company/ineuron-ai/

[@deepankarsharma7037]

One of the finest videos on stack. It explains everything in detail.

[@krishnanayak349]

Bhai main sach bol raha hu ....this course is 100% better then paid course......i compared it..❤❤❤

[@akashgautam583]

is video ko dekh kar meri aakhe bhar aayi 😢.... I was waiting for this lecture and also very excited.. Your Teaching style is very very good... Now, I am addicted to Your lecture.. Very very thank you sir,..❤❤❤ Sir, I downloaded your lecture then watch it.. because it save my internet..

[@hopealive3013]

I watched whole lecture in 2X and at no point I paused or rewind , great and crystal clear teaching!!!

[@devanshpal944]

Bhai ab is playlist ke tree wagera ke video kidhar hai

[@xnsglitch6152]

​@@devanshpal944 eveyone is focusing on paid course... I think treee, dp wagera k lia paid course lena padega

[@vcIND18]

other topics are on Pw website for free

[@nitindagur6969]

@@vcIND18 bhai link share krna mujhe nhi mil rha free wla

[@ratansarkar7444]

I'm a student of scaler achadamy but this contents is better then my paid course

[@MdArif-pc9bz]

Yeah it's true brother, the videos were very helpful 🤠

[@Luffy_2804]

why did you take the paid course on the first place ?

[@ashtheconqurer1782]

same brother bhai stack ka concept toh upar se gaya mera

[@tricksforsolving2804]

But But I saw on KZbin that scaler provide osm level of features for students

[@prabhatkumar9245]

Yes bro❤❤

[@sh.creation.]

Sir, Your way of teaching is amazing 😍. THANK YOU SIR for your efforts

[@sasta_reporter]

no one can teach better than raghav garg sir his teaching style always help me in learning thingss thankyou soo much raghav sir😇

[@Luffy_2804]

54:36 time complexity in this case will be O(n + n + 1) = O(2n+1) ~ O(n) printing will be constant time as we are counting the iteration of the while loop ie. n times inside that printing the element will be constant time , overall complexity is correct but the explanation for printing the elements is incorrect so this is for the people who are confused but the rest explanation is so good : ) really enjoying every bit of it thanks for this amazing free course

[@Luffy_2804]

1:20:30 push at bottom question solution : ) static void pushAtBottom(Stack stack , int element){ if(stack.isEmpty()){ stack.push(element); return; } int topElement = stack.pop(); pushAtBottom(stack, element); stack.push(topElement); }

[@f1channel60]

MAZA AA GAYA ❤‍🔥

[@rishabhsharma5245]

best lecture learned a lot and thank you pw team for providing us with this excellent tutorials which are way better than the paid courses and best among all you tubers

[@riyagholia6200]

respected sir , i came to your for the first time i thought i am clear with the topic recursion and doing stack with you here . bt sir you clerified my all little doubt very clearly so....thankyou so much sirr thanks alot

[@anilprasad3802]

Maza aaya sir.. kitna accha smjhte ho sir... Ek hi baar sb smjh gya.. thanku 😊

[@ayansiddiqui7383]

Best lecture on Stack on KZbin+ paid courses combined!

[@arvindkumarmishra7660]

Finally wait is over, hats off to you sir !!

[@VishalKumar-zd1xw]

2:35:52 Linked List implementation of stack size-- should be there in pop();

[@motivation.9]

Awesome explanation of stacks ❤❤

[@Danishalam1555]

thnk you sir maja aagya aapse pdhke kabhi bhi main bore nhi hota hu bas please aap yha baki ka topic complete krwa digiye please

[@rohannJhaaaa]

You made my super interest on DSA From Btech till having 2.5 years of experince, I hate dsa Mza aa gya...........

[@feedi_imraj2.1m43]

2:40:43 Sir size-- in pop function, After pop your out put came 3, before the size was 3

[@ABHISHEKSHARMA-jj5jh]

best video to watch for stack

[@akashvishwakarma7654]

Nice video sir Thank you😊😊

[@arpangarai949]

Maza ageya ❤🔥

[@_hustler_boy]

you are my favourite teacher

[@rajkapoor6166]

You Rock Sir

[@Dr_brainco_]

MAZZAA AA GYA '😀😀🔥🔥🔥🔥🔥🔥🔥

[@marvelanddisneyworld3141]

maazaa aa gya Sir..🤩😍😍😍

[@prithukathet193]

wow. Amazing. Thank you so much sir !!

[@vishalkiroriwal7699]

kya bawal chiz bnaya re 🥰🥰🥰

[@prathameshhiremath1379]

maja agay sirji ,it will help for placements

[@parthib.1555]

Mazza Aagaya

[@nageshmane_14606]

Thank you Sir EXcellent Teaching skills

[@Moment95817]

Recursion ki Duniya manvi mam ne clear kar diya hai ❤

[@CTrickC]

Have you watched all DSA lecture

[@Moment95817]

@@CTrickC Almost

[@aarzumustafa4586]

Thank you so much sir for your support ❤❤

[@aapkaapnabhojpuri9481]

Sir aap great ho

[@jagannathsahoo6018]

mazza agayaa sir❤❤👌

[@Luffy_2804]

1:37:34 the clue really helped a lot to figure out the algo : ) static void pushAtBottom(Stack stack , int element){ if(stack.isEmpty()) { stack.push(element); return; } int topElement = stack.pop(); pushAtBottom(stack, element); stack.push(topElement); } static void reverseTheStack(Stack stack){ if(stack.size()==1) return; int topElement = stack.pop(); reverseTheStack(stack); pushAtBottom(stack, topElement); }

[@AmarGupta-sy9cy]

mza aa gya sir..

[@amandubey9296]

Maja aa gaya -- Thank you Sir 🙂

[@Luffy_2804]

1:25:35 remove from bottom / any index solution Stack stack = new Stack(); Stack stack2 = new Stack(); stack.push(20); stack.push(40); stack.push(60); // index - 2 stack.push(80); stack.push(100); // total size = 5 (5-2 = 3) 3-> index 2 (element to be removed) int index = 2; while(stack.size()-1>index){ // for 0 based indexing stack2.push(stack.pop()); } stack.pop(); // removing the element at given index while(stack2.size()>0){ stack.push(stack2.pop()); } System.out.println("the size of the stack is :" + stack.size()); System.out.println(stack);

[@princesingh713]

maaza aa gaya

[@MonkeyDLuffyOnePieceOfficial]

Maza Aagaya sir!!

[@samakpoetry4846]

maja aa gya.....👍

[@NirajKumar-fr3ef]

Bohot maja aaya sir..

[@indreshyadav3684]

Maza aa Gaya sir ji

[@RiskyBoy107]

Best Explanation

[@Luffy_2804]

1:08:09 after getting the clue i have implemented the recursive algo , we can print in reverse order using this given code : ) static void printTheStack(Stack stack){ if(stack.isEmpty()) return; int topElement = stack.pop(); System.out.print(topElement + " "); printTheStack(stack); }

[@op-zm8sw]

Bro I want to ask many questions can you please share your insta I'd or something else

[@Krishnayadav-jk6pn]

Good lecture for Beginners

[@GajananKamble-pc6lb]

maja aagya thank you so much sir

[@TripleH-p2b]

Sir your way of teaching ❤🥰

[@CTrickC]

Have you watched all DSA lecture

[@SKYian.]

Maza aa Gaya ❤❤

[@yogikoli1653]

Mzaa agya

[@svedits7567]

Nice lecture...completed it today

[@aamishcr7768]

Mazaa aa gaya sir

[@SnehansuPradhan]

Such a great explanation sir hats off

[@Usernamepreeti]

Stack padke maza aa gaya

[@Titanium-r7q]

Maza aa gaya ----->

[@Abhaykumar-lw7nr]

mza aa gya..

[@Luffy_2804]

1:52:42 my array implementation using constructor to take the size of the array : ) class Stack { private int size; private int index = 0; private int[] arr; Stack(int size) { this.size = size; arr = new int[this.size]; } void push(int x) { if (isFull()) { System.out.println("Stack is full!"); return; } arr[index] = x; // adding element index++; // increasing the value of index } int pop() { if (isEmpty()) { System.out.println("Stack is empty!"); return -1; } int topElement = arr[index - 1]; // storing top element arr[index - 1] = 0; // setting the top element to 0 as we are removing (default value) index--; // decreasing index as one element is removed return topElement; } void display() { for (int i = 0; i

[@aryamanray746]

Maza aa gaya!!!!!!

[@aksharbrahm4618]

great lecture and explanation

[@Beyondbalmiki]

Nice video sir ji

[@thesolocamperksvs965]

As follows maja aagya

[@imtiyazalam8628]

Maza aagaya

[@raskundu8106]

Maza aa Gaya ........

[@sasta_reporter]

maja aagya raghav sir

[@Inspire_with_SM]

bole to jhakasss!

[@TanmayInfotech]

2:51:28 maza aa gya

[@viveksahane1314]

sir aap bhut accha padhate hein thanks

[@AmitkumarMahto-d9c]

Maza aa gaya

[@Priyew]

Mazza aa gya..

[@nitindagur6969]

better than paid course

[@debapriyo007]

maza agaya..🥰🤞

[@Sibasundarj8]

Maja Aa Gaya

[@technoanalysis]

Also better than Coding Ninja which is costly

[@nabinkumarshaw4474]

Mja aa gya sir sach mey

[@JEKisCODING]

mazaa aa gya

[@vivektiwarii_]

Mzaaa aa gya sir

[@priyanshutrivedi2357]

2:51:21 maza aa gya 🔥🔥🔥

[@jayateerthag.h5372]

Maza aagya

[@MuhammadUsman-cp3up]

Maza agya

[@UdayGarg]

mza agyaa

[@amanshrivastavaofficials]

Maja aagya💓

[@vickyplaybeats]

maja aa gaya bhaiya

[@madhav2993]

maza aa gaya

[@surishtirajkaralia801]

Mjja a gya😊

[@JeetuKumar-wd1uw]

Awesome teacher

[@sunilverma-oz4nm]

mja a gya

[@harshchouksey7740]

great explanation👍👍👍

[@ParthDabhiOfficial]

Maja Aa Gaya, Radha Radha 🌺

[@tf6ml]

Maja aa gaya Sir

[@ArshadKhan-xb3sz]

maza aagya

[@mrinalpatra7415]

maza bahot aa gya aaj ... itna nhi aani chahiye thi😂

[@MotivationalMantra-dg9qi]

Mazaa aa gya

[@Luffy_2804]

Maza a gya

[@TripleH-p2b]

Thankue sir ❤

[@aditikaushik3334]

maza aa gya;;

[@vikashbachhety7515]

Add the video in Java and dsa playlist

[@GamersPaltan]

Maja aagaya sir 😊