at 33:04 I did the same thing as you but from my previous exams I always think about putting a out of bound error check in there bc it technically isn't correct, imagine if the name was not in the stack, you would get an error... I guess if you wanted to do it you would add in another if statement and nest all the other ifs within it. In the wrapper function you would check for the bottom of the stack position AND if the names don't match return?
you're saving my life with this course thank you dearly
your saving my life my exam is tomorrow, thanks so much
bro you acc saved my life today for my exam today will forever appreciate you
Happy to help!
@@TheCSClassroom bro i acc wanna kiss your for carrying my ass in the test. no homo tho but like your actually a g.
this is what i needed thank u so much
Happy to help!
at 33:04 I did the same thing as you but from my previous exams I always think about putting a out of bound error check in there bc it technically isn't correct, imagine if the name was not in the stack, you would get an error... I guess if you wanted to do it you would add in another if statement and nest all the other ifs within it. In the wrapper function you would check for the bottom of the stack position AND if the names don't match return?
FInally...✨
Day before my exam :))
can anyone explain how is I used in the question at 11:20?
43:07 shouldn't be that the stack reverses the order of the queue numbers?
It does, in my code I just output the values instead of putting them back in the queue like the markscheme. This is what you're referring to, right?
@@TheCSClassroom yes, I was confused but now I get it
Hey, shouldnt at 34:09 the Queue say "the first element to be "enqueued" is the first to be "dequeued"?
Yes, apologies for the confusion 🙏
@@TheCSClassroom No worries! By the way, are you planning on making a video for Option B before Timezone B exam?
savior
thanks man, these videos are great help
When will part 3 come out?
Tomorrow or Wednesday at the latest.
God's work