|
Leetcode
(617)
|
starproblem
(18)
|
Quick Sort
(7)
|
Reorder
(3)
|
|
Array/String
(178)
|
Iteration
(17)
|
Permutation
(7)
|
Prime
(3)
|
|
DP
(98)
|
NP
(16)
|
Divide and Conquer
(7)
|
Overflow
(3)
|
|
Recursion
(72)
|
Integer
(16)
|
Bucket Sort
(7)
|
Minimax
(3)
|
|
Tree/Graph
(70)
|
Union Find
(15)
|
Anagram
(7)
|
Doubly LinkedList
(3)
|
|
Lintcode
(68)
|
TreeMap
(15)
|
Text
(6)
|
Deep copy
(3)
|
|
Math
(66)
|
Palindrome
(14)
|
Reduce Dimension
(6)
|
Comparable
(3)
|
|
Matrix
(47)
|
Construct Tree
(14)
|
Parentheses
(6)
|
Circular
(3)
|
|
HashMap
(46)
|
Window
(13)
|
Median
(6)
|
Sampling
(2)
|
|
Binary Search
(43)
|
Interval
(13)
|
Long
(6)
|
Multithreading
(2)
|
|
Stack
(39)
|
Subsequence
(12)
|
Iterator
(6)
|
HowToOptimize
(2)
|
|
Linkedlist
(39)
|
Queue
(12)
|
FollowUp
(6)
|
Deque
(2)
|
|
DFS
(35)
|
Preorder Transversal
(12)
|
Duplicates
(6)
|
Bit Mask
(2)
|
|
Greedy
(34)
|
Multidimensional DP
(12)
|
Trial and Error
(5)
|
Wiindow
(1)
|
|
BFS
(33)
|
Grammar
(12)
|
thinkagain
(5)
|
Unicode
(1)
|
|
Corner Cases
(29)
|
Comparator
(12)
|
Shortest Path
(5)
|
TSP
(1)
|
|
Summary
(28)
|
Global and local optimal
(11)
|
Rectangle
(5)
|
System Design
(1)
|
|
Heap
(28)
|
Combination
(11)
|
LCA
(5)
|
Shortest Path Tree
(1)
|
|
Bit Manipulation
(28)
|
StringBuffer
(10)
|
java函数参数问题
(5)
|
Random
(1)
|
|
sorting
(27)
|
Trie
(9)
|
Double
(5)
|
Minimum Spanning Tree
(1)
|
|
Backtracking
(24)
|
Topological Sort
(9)
|
TreeSet
(4)
|
LinkedHashSet
(1)
|
|
BST
(22)
|
Inorder Transversal
(9)
|
STDIN
(4)
|
Latex
(1)
|
|
ArrayList
(22)
|
HashSet
(9)
|
Postorder Transversal
(4)
|
Iterative
(1)
|
|
Graph
(21)
|
Backpack
(9)
|
Encoding
(4)
|
Hamilton Path
(1)
|
|
Design
(20)
|
Substring
(8)
|
Brain Teaser
(4)
|
External Sort
(1)
|
|
Hard
(19)
|
Segment Tree
(8)
|
0base1base
(4)
|
Eulerian Path
(1)
|
|
2 Pointers
(19)
|
夹逼
(7)
|
State Machine
(3)
|
Binary Index Tree
(1)
|
