Introduction to Stacks and Queues (Data Structures & Algorithms #12) | Chủ Đề về chủ đề stack c++ |

I saw the problem at the end of the video on LeetCode and I solved it

"This is how pancakes in the real world work"
Legendary!

what is 0(1)?

Imagine if your professor teaches like this and add up those simple analogies so their students will have an easier approach to grasp the lesson at hand….. anyways, thank you so much for your precious videos!

What app/ program did you use in creating this video?

solution in python

class Stack:

def __init__(self):

self.items = []

def isEmpty(self):

return self.items == []

def push(self, item):

self.items.append(item)

def pop(self):

return self.items.pop()

def peek(self):

return self.items[len(self.items)-1]

def size(self):

return len(self.items)

def parChecker(symbolString):

s = Stack()

balanced = True

index = 0

while index < len(symbolString) and balanced:

symbol = symbolString[index]

if symbol in "([{":

s.push(symbol)

else:

if s.isEmpty():

balanced = False

else:

top = s.pop()

if not matches(top,symbol):

balanced = False

index = index + 1

if balanced and s.isEmpty():

return True

else:

return False

def matches(open,close):

opens = "([{"

closers = ")]}"

return opens.index(open) == closers.index(close)

print(parChecker('{({([][])}())}'))

print(parChecker('[{()]'))

its good but there is too many ads

ok. now why do i need this? like why. what is this useful for

I love deque ( ͡° ͜ʖ ͡°)

If I have a queue, and it's a tasks queue, once that one task is completed I should remove the element from the queue, or just move the pointers?
And if I should just move the pointers, once that the pointers are on its limits, I would have to create another bigger queue to do what I want, right? This approach wouldn't use a lot of memory?
Once I made this remark, am I right if I define a queue as something that should be just a collection of things that will be freed of the memory soon, once it's completed?

Edit1: I was searching about, and one good response that I found was to use linked-lists, what I think is a great approach, once that it is first-in first-out, so you wouldn't have the problem of needing to change something or access something in the middle of the list, at least I think so.

Edit2: @t

Here's the code I've developed so far, trying to solve this issue.

感谢你的分享，让我学习了很多知识，谢谢。

Thank you. This channel really helps me with my data structures homework and such!

16 minute free video explains it better than a 4000 per year degree…

A solution for the problem at the end using Python3:

def is_balanced(chars: str):

abc = {'(': ')', '[': ']', '{': '}', '<': '>'}

list_chars = list(chars)

if chars == '':

return None

if len(list_chars) % 2 != 0:

return False # it is what it is

else:

i = 0

while len(list_chars) != 0:

if list_chars[i] in abc.keys():

if abc[list_chars[i]] == list_chars[i + 1]:

list_chars.pop(i + 1)

list_chars.pop(i)

if len(list_chars) == 0:

return True

if i > 0:

i -= 1

else:

i += 1

else:

return False

else:

return False

inp = '([]){{<><>}<[]>}()()'

print(is_balanced(inp)) # prints True

wow this helped me understand stack and queues easily Thank you really….. but i was curious how was he presenting like this?? i mean what tools are you using?

I just had a quiz on this subject and our topic was stack. This video was really helpful. Hopefully, you'll make a series about C or C++

wtf!
How come I wasn't notified by YouTube when you posted this video?!?

finally found a good programming teacher..

Awesome explanation ❤

But kivy tutorial plzz

Hi please bro tell me the best laptop for programing and not expensive

Please give me some tips for maintenance of my health as I can see you the same since 3 years…😋