Data Structure
- list
- stack, queue, deque
- linked list
- hash table
- binary search tree (BST), heap
- string & tries
- union find
- graph
- bit manipulation
Algorithm
- Basic method: divide and conquer; recursion; backtracking; greedy
- Sort: quicksort; shell sort; heapsort; mergesort; insertion sort; bucket sort; radix sort
- Search: scan-line; double pointers; binary search; breath-first-search (BFS); depth-first-search (DFS); binary search tree (BST)
- Dynamic programming
- Graph: topological sort; Dijkstra's algorithm; Floyd-Warshall algorithm; Bellman-Ford-Moore algorithm; Prim's algorithm
| # | Title | Difficulty |
|---|---|---|
| 252 | Meeting Rooms | Easy |
| 253 | Meeting Rooms II | Medium |
| 261 | Graph Valid Tree | Medium |
| 266 | Palindrome Permutation | Easy |
| 269 | Alien Dictionary | Hard |
| 277 | Find the Celebrity | Medium |
| 296 | Best Meeting Point | Hard |
| 311 | Sparse Matrix Multiplication | Medium |
| 314 | Binary Tree Vertical Order Traversal | Medium |
| 323 | Number of Connected Components in an Undirected Graph | Medium |
| 325 | Maximum Size Subarray Sum Equals k | Medium |
| 339 | Nested List Weight Sum | Easy |
| 369 | Plus One Linked List | Medium |
| 444 | Sequence Reconstruction | Medium |
| 490 | The Maze | Medium |
| 499 | The Maze III | Hard |
| 505 | The Maze II | Medium |
| 531 | Lonely Pixel I | Medium |
| 666 | Path Sum IV | Medium |
| 708 | Insert into a Sorted Circular Linked List | Medium |
| 734 | Sentence Similarity | Easy |
| 737 | Sentence Similarity II | Medium |
| 1059 | All Paths from Source Lead to Destination | Medium |
| 1102 | Path With Maximum Minimum Value | Medium |
| 1135 | Connecting Cities With Minimum Cost | Medium |
| 1214 | Two Sum BSTs | Medium |