README.md

Queue & Stack

Queue: First-in-first-out Data Structure

• Implement Queue in Go
• Design Circular Queue

solution:

• Moving Average from Data Stream [Locked]

Queue and BFS

BFS - Template

• Template 1
• Template 2

solution:

• Walls and Gates [Locked]
• Number of Islands
• Open the Lock
• Perfect Square

Stack: Last-in-first-out Data Structure

• Implement Stack in Go
• Design Min Stack

solution:

• Valid Parentheses
• Daily Temperatures
• Evaluate Reverse Polish Notation

Stack and DFS

DFS - Template I

• Template - Recursion
• Template - using an explicit stack

solution:

• Number of Islands
• Clone Graph
• Target Sum
• Binary Tree Inorder Traversal

Conclusion

• Implement Queue using Stacks

  • approach 1, 2 Stacks, Push O(n), Pop O(1)
  • approach 2, 2 Stacks, Push O(1), Pop O(1)~O(n)

• Implement Stack using Queues

  • approach 1, 2 Queues, Push O(1), Pop O(n)
  • approach 2, 2 Queues, Push O(n), Pop O(1)
  • approach 3, 1 Queue, Push O(n), Pop O(1)

• Decode String

• Flood Fill

• 01 Matrix

• Keys and Rooms