Section 9: Stack and Queues

📚 Vanakkam DSA Course (24 sections) · Hope AI — ML & DS Course

Lessons

#Lesson NameDurationNotes
1Intro to Stacks & Queues35m 24s
2Playing with Stacks & Queues23m 14s
3Implement Stack using Two Queues55m 54s
4Implement Stack using One Queue13m 28s
5Implement Queue using Stacks43m 47s
6Valid Parentheses25m 39s
7Min Stack29m 9s
8Remove Outermost Parentheses - Using Stack43m 32s
9Remove Outermost Parentheses - without Stack13m 5s
10Evaluate Reverse Polish Notation51m 14s
11Next Greater Element-
12Daily Temperatures-
13Next Greater Element II-
14Rotting Oranges-

Progress Checklist

  • [ ] Intro to Stacks & Queues
  • [ ] Playing with Stacks & Queues
  • [ ] Implement Stack using Two Queues
  • [ ] Implement Stack using One Queue
  • [ ] Implement Queue using Stacks
  • [ ] Valid Parentheses
  • [ ] Min Stack
  • [ ] Remove Outermost Parentheses - Using Stack
  • [ ] Remove Outermost Parentheses - without Stack
  • [ ] Evaluate Reverse Polish Notation
  • [ ] Next Greater Element
  • [ ] Daily Temperatures
  • [ ] Next Greater Element II
  • [ ] Rotting Oranges

My Notes

Add your notes here as you progress through the section...

← S8 — StringsS10 — Binary Search →