LeetCode Record

Ctrlk

Sort
linked list
Queue
Stack (some may involve tree map)
Priority Queue
Map/Set
Binary Search
2 pointer (including sliding window)
BFS (some may be solved by union find)
topological sort
BST binary search tree
DFS / Backtracking
DP
Prefix sum
Union find
Swipe Line
Segment tree
Monotonic Stack/Queue
Trie
TreeMap
Sessions
- BFS
  - Avoiding Bears
  - 🥲Taking courses

Powered by GitBook

On this page

Sessions

BFS

Avoiding Bears 🥲Taking courses

Previous218 The Skyline Problem NextAvoiding Bears