Stack Data Structure Tutorial – Solve Coding Challenges

Questions on the stack data structure are very common in technical interviews. Learn how to master the data structure, starting from the easiest problems on LeetCode and InterviewBit and slowly building up intuitions so that the hard problems seem easy. All the questions are popular interview questions from Google, Meta, Microsoft and more!

⭐️ Course Conetents ⭐️
SECTION 0 – Introduction
⌨️ (0:00:00) Introduction to the course on the Stack data structure
⌨️ (0:00:31) Stack implementation intuitions + Code in Python3 and C++
⌨️ (0:06:23) Simplify Path | InterviewBit | LeetCode
⌨️ (0:19:01) Min Stack | InterviewBit | LeetCode

SECTION 1 – Parentheses
⌨️ (0:30:04) Introduction to Parentheses questions
⌨️ (0:40:24) Valid Parentheses | InterviewBit | LeetCode
⌨️ (0:52:27) Redundant Braces | InterviewBit
⌨️ (1:02:08) Minimum Remove to Make Valid Parentheses | LeetCode
⌨️ (1:12:58) Longest Valid Parentheses | LeetCode

SECTION 2 – Calculator
⌨️ (1:17:42) Introduction to Calculator questions
⌨️ (1:22:51) Convert Infix to Postfix
⌨️ (1:40:15) Evaluate Reverse Polish Notation| InterviewBit | LeetCode
⌨️ (1:47:18) Basic Calculator I, II, III | LeetCode

🎉 Thanks to our Champion and Sponsor supporters:
👾 Raymond Odero
👾 Agustín Kussrow
👾 aldo ferretti
👾 Otis Morgan
👾 DeezMaster

--

[EsotericEchoesTailored]

guys, what this channel does...is unmeasurable. Thank you for your effort and for putting ALL this so, so valuable information online. Especially for us, self-taught :P

[SuperHARIS]

at 1:53:25 its possible that the expression is "5 - ( -2)". Note the space before the "-" so the result won't be correct.
We can solve it by looking at the last element in the stack instead.
if(s.charAt(i) == '-' && (infix.size() == 0 || {
infix.add("0");
}

[sandeepchandupatla]

Just completed this tutorial very nice video ❤

[RobinHistoryMystery]

probably one of the best stack video out there

[georgegray]

Wow, just now when I am learning Dynamic Memory. Thank you for uploading this!

[DLandpscrew]

I love it, I learn new techniques everyday

[daayemshehzad]

Honestly this was such a good video tutorial. Loved it!!

[Naoty_san]

Remove book on top = pop (stack.pop() s.pop())
Add = push (p: stack.append(3) c++: s.push(3))
Look at the top = peek (stack[-1] s.top())

Is it empty? (stack (false, it’s empty) s.empty() (true, empty))

6:23

[SelfCheckout]

noob question here, at like 17:21 there's the else case with pass if the stack is empty. Is this necessary? In my head the if statement alone should be enough and maybe you put the else case just for clarity for new programmers.

[Olivier.Luethy]

When will a tutorial about Ionic come?

[organizedchaos]

Is there a playlist for this for each data structure?

[אני-שת]

hey, in redundat braces, why u didnt check before the while if stack is empty?

[lex-ztuc]

i am still not clear about why we are adding the zero when a- is found at the start or at the start of the opening bracket, please can someone explain it

[MaxMov-sphr]

I'm sorry, but where is the link to Unix based paths resources? I can't find...

[belalelhagrasy]

Guys what is the best book or free course to learn computer architecture?

[disrael]

What is this actually used for in real life applications?