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
- 208. Implement Trie (Prefix Tree)
TreeMap
Sessions
- BFS

Powered by GitBook

On this page

Trie

208. Implement Trie (Prefix Tree)

Previous42 Trapping rain water Next208. Implement Trie (Prefix Tree)