| leetcode (300) | LintCode (47) | graph (7) | union find (2) |
| solved (265) | tree (42) | two pointers (6) | topological sort (2) |
| medium (184) | math (29) | stack (6) | sampling (2) |
| array (113) | binary search (26) | recurrence (5) | file I/O (2) |
| hard (88) | link list (25) | heap (5) | divide and conquer (2) |
| failed many times (82) | hash (18) | greedy (5) | bst (2) |
| didn't solve (79) | bfs (13) | bit manipulation (5) | tree set (1) |
| string (67) | dfs (12) | trie (4) | random (1) |
| easy (51) | design (11) | bit (4) | new (1) |
| DP (50) | matrix (9) | binary tree (4) | leetcode variant (1) |
| recursion (49) | sort (8) | interview (3) | iterator (1) |
浙公网安备 33010602011771号