Stacks and Queues (Python) - Data Structures and Algorithms

Start your software dev career - calcur.tech/dev-fundamentals 💯 FREE Courses (100+ hours) - calcur.tech/all-in-ones
🐍 Python Course - calcur.tech/python-courses
✅ Data Structures & Algorithms - calcur.tech/dsa-youtube
~~~~~~~~~~~~~~~ CONNECT ~~~~~~~~~~~~~~~
✉️ Newsletter - calcur.tech/newsletter
📸 Instagram - / calebcurry
🐦 Twitter - / calebcurry
🔗 LinkedIn - / calebcurry
▶️ Subscribe - calcur.tech/subscribe
👨🏻‍🎓 Courses - www.codebreakthrough.com
~~~~~~~~~~~~~~ SUPPORT ME ~~~~~~~~~~~~~~
↪ My Amazon Store - www.amazon.com/shop/calebcurry
🅿 Patreon - calcur.tech/patreon-calebcurry
🅖 GitHub Sponsors - github.com/sponsors/CalebCurry
Ⓟ Paypal - paypal.me/calcur
🅑 Bitcoin - 3HnF1SWTzo1dCU7RwFLhgk7SYiVfV37Pbq
🅔 Eth - 0x350139af84b60d075a3a0379716040b63f6D3853
📈 Buy Bitcoin - calcur.tech/crypto
Reserve the Ruby Steel crypto rewards card and get a $25 bonus (use affiliate code "Caleb") - calcur.tech/crypto

[@kundaichasinda9115]

"Gosh Claire, why do you always want to torment me?"

[@ScornfulSix]

Poor Claire 😭😭

[@chelseypeck9573]

I enjoy both kinds of videos you do. In person, and actually coding. I love the switch up of content. Really helps me pay attention and learn items from different perspectives.

[@k0.9486]

I think there is a lot of value derived from both the conceptual and hands on, I'd suggest staying with both for different types of learners!

[@janh2403]

You know that you can just write data[-1] to access the last element of the list?

[@ememmeme8722]

and who is clair?

[@sakshambali3040]

you can use arr[ : : -1] to reverse the array

[@SiphepheloMlungwana]

wooow!, well explained thanks man...👌

[@LilJollyJoker]

Thank you so much for this video!

[@carlosbarros6705]

The best!!!! Thanks, man.

[@superdahoho]

thanks caleb. you da man!

[@aymammetannamyradow8407]

useful video. thank you

[@temp3219]

What troubling me was why in python we just use an array for a stack for just pop and push, when you can just get array[ 2] or [3] easily. The fact that you mentioned "we just have to limit its usage to make it work like a stack" is what cleared my head. LOL. And the stack implementation using the class at the end was perfect. Thank you dowg.

[@aliceiselectric]

Really helpful video, and I watched quite a few others before this one. Yours had the perfect balance between being objective but also not superficial. Thanks!

[@afshin.m8624]

Tnx Caleb 💜

[@fatimadarbandsari1870]

it was really helpful

[@user-pj8ve1re6k]

i thought pop was only used for stacks and you are supposed to use deq for queues.. can you provide clarification on this?

[@mahdiataei7625]

Thanks❤

[@mamaafrica2512]

where is top or head and tail parameters?

[@callmexfalcon9621]

all my doubts cleared in a single vid regarding these topics

[@Troglodyte2021]

Clearly explained!

[@dsvhs93]

Caleb I beg of you to make one of these for Java lol I feel like they would be super similar but I also get confused

[@varunshrivastava2706]

Don't worry man, Let me suggest you THE BEST dsa course on java. Just search Kunal Kushwaha on youtube. I can guarantee you , you are gonna love it . Its literally the best course out there. But still don't listen to me just give it a try. And one last thing do give me reviews whether you like that or not, will ya?

[@digital-zm]

The code is invisible

[@BaconAndMinecraft]

What IDE are you using? :)

[@harambe2185]

Vsc

[@mapalo111]

"Gosh Claire, why do you... always want to torment me?" oh Claire😭🤣

[@dickheadrecs]

poor claire 😢

[@kvelez]

class Stack: def __init__(self, limit): self.stack = [] self.limit = limit def get_length(self): return len(self.stack) def push_stack(self, data): if self.get_length() < self.limit: self.stack.append(data) else: raise Exception("Stack is full") def pop_stack(self): if self.get_length() > 0: self.stack.pop() else: raise Exception("Stack is empty") def insert_at(self, index, data): if self.get_length() < self.limit: self.stack.insert(index, data) else: raise Exception("Invalid stack insertion") def remove_at(self, index): if self.get_length() > 0: self.stack.pop(index) else: raise Exception("Invalid stack removal") def show_stack(self): print(self.stack) def peek_stack(self): print(self.stack[-1]) stack = Stack(limit=6) stack.push_stack("a") stack.push_stack("b") stack.push_stack("c") stack.insert_at(1, "z") stack.remove_at(3) stack.pop_stack() print(stack.get_length()) stack.peek_stack() stack.show_stack()

[@liana9452]

Hindi ko gets

[@ample982]

Sad

[@tomcat9761]

Basta pre pag Stacks = LIFO. Meaning kung ano ung last element, aun lagi ung magagalaw (append/push, or ma-pop, or peek). Sa queue naman = FIFO. Kung ano ung una, ayun ung matatanggal. (append/push

[@Tech-vk2zk]

All my homies hate Claire

[@skulves9677]

toyota corrola chicken sandwich revolver god dangit

[@puzzlelovers529]

Can you do ASMR videos? Your voice sounds so soothing.

[@wholesama3302]

wtf

[@stephenboikanyo8696]

I dont think Claire would be comfortable with that.