Leetcode Questions | ||||
ID | QUESTION | DIFFICULTY | FREQENCY | DATA STRUCTURES |
58 | Length of Last Word | 1 | 1 | string |
100 | Same Tree | 1 | 1 | tree |
104 | Maximum Depth of Binary Tree | 1 | 1 | tree |
111 | Minimum Depth of Binary Tree | 1 | 1 | tree |
126 | Word Ladder II | 1 | 1 | |
14 | Longest Common Prefix | 2 | 1 | string |
118 | Pascal’s Triangle | 2 | 1 | array |
119 | Pascal’s Triangle II | 2 | 1 | array |
121 | Best Time to Buy and Sell Stock | 2 | 1 | array |
6 | ZigZag Conversion | 3 | 1 | string |
16 | 3Sum Closest | 3 | 1 | array |
30 | Substring with Concatenation of All Words | 3 | 1 | string |
71 | Simplify Path | 3 | 1 | string |
96 | Unique Binary Search Trees | 3 | 1 | tree |
107 | Binary Tree Level Order Traversal II | 3 | 1 | tree |
120 | Triangle | 3 | 1 | array |
122 | Best Time to Buy and Sell Stock II | 3 | 1 | array |
32 | Longest Valid Parentheses | 4 | 1 | string |
95 | Unique Binary Search Trees II | 4 | 1 | tree |
123 | Best Time to Buy and Sell Stock III | 4 | 1 | array |
60 | Permutation Sequence | 5 | 1 | |
85 | Maximal Rectangle | 5 | 1 | array |
66 | Plus One | 1 | 2 | array |
101 | Symmetric Tree | 1 | 2 | tree |
110 | Balanced Binary Tree | 1 | 2 | tree |
9 | Palindrome Number | 2 | 2 | |
35 | Search Insert Position | 2 | 2 | array |
36 | Valid Sudoku | 2 | 2 | array |
38 | Count and Say | 2 | 2 | string |
80 | Remove Duplicates from Sorted Array II | 2 | 2 | array |
113 | Path Sum II | 2 | 2 | tree |
3 | Longest Substring Without Repeating Characters | 3 | 2 | string, hashtable |
11 | Container With Most Water | 3 | 2 | array |
18 | 4Sum | 3 | 2 | array |
55 | Jump Game | 3 | 2 | array |
59 | Spiral Matrix II | 3 | 2 | array |
61 | Rotate List | 3 | 2 | linked list |
92 | Reverse Linked List II | 3 | 2 | linked list |
5 | Longest Palindromic Substring | 4 | 2 | string |
25 | Reverse Nodes in k-Group | 4 | 2 | linked list |
37 | Sudoku Solver | 4 | 2 | array |
40 | Combination Sum II | 4 | 2 | array |
42 | Trapping Rain Water | 4 | 2 | array |
45 | Jump Game II | 4 | 2 | array |
47 | Permutations II | 4 | 2 | array |
48 | Rotate Image | 4 | 2 | array |
54 | Spiral Matrix | 4 | 2 | array |
68 | Text Justification | 4 | 2 | string |
75 | Sort Colors | 4 | 2 | array |
76 | Minimum Window Substring | 4 | 2 | string |
89 | Gray Code | 4 | 2 | |
90 | Subsets II | 4 | 2 | array |
99 | Recover Binary Search Tree | 4 | 2 | tree |
115 | Distinct Subsequences | 4 | 2 | string |
117 | Populating Next Right Pointers in Each Node II | 4 | 2 | tree |
124 | Binary Tree Maximum Path Sum | 4 | 2 | tree |
31 | Next Permutation | 5 | 2 | array |
41 | First Missing Positive | 5 | 2 | array |
84 | Largest Rectangle in Histogram | 5 | 2 | array |
87 | Scramble String | 5 | 2 | string |
97 | Interleaving String | 5 | 2 | string |
26 | Remove Duplicates from Sorted Array | 1 | 3 | array |
83 | Remove Duplicates from Sorted List | 1 | 3 | linked list |
112 | Path Sum | 1 | 3 | tree |
7 | Reverse Integer | 2 | 3 | |
19 | Remove Nth Node From End of List | 2 | 3 | linked list |
62 | Unique Paths | 2 | 3 | array |
108 | Convert Sorted Array to Binary Search Tree | 2 | 3 | tree |
17 | Letter Combinations of a Phone Number | 3 | 3 | string |
39 | Combination Sum | 3 | 3 | array |
53 | Maximum Subarray | 3 | 3 | array |
63 | Unique Paths II | 3 | 3 | array |
64 | Minimum Path Sum | 3 | 3 | array |
74 | Search a 2D Matrix | 3 | 3 | array |
82 | Remove Duplicates from Sorted List II | 3 | 3 | linked list |
86 | Partition List | 3 | 3 | linked list |
93 | Restore IP Addresses | 3 | 3 | string |
105 | Construct Binary Tree from Preorder and Inorder Tr | 3 | 3 | array, tree |
106 | Construct Binary Tree from Inorder and Postorder T | 3 | 3 | array, tree |
114 | Flatten Binary Tree to Linked List | 3 | 3 | tree |
116 | Populating Next Right Pointers in Each Node | 3 | 3 | tree |
29 | Divide Two Integers | 4 | 3 | |
33 | Search in Rotated Sorted Array | 4 | 3 | array |
34 | Search for a Range | 4 | 3 | array |
43 | Multiply Strings | 4 | 3 | string |
51 | N-Queens | 4 | 3 | array |
52 | N-Queens II | 4 | 3 | array |
72 | Edit Distance | 4 | 3 | string |
94 | Binary Tree Inorder Traversal | 4 | 3 | tree, hashtable |
103 | Binary Tree Zigzag Level Order Traversal | 4 | 3 | queue, tree |
109 | Convert Sorted List to Binary Search Tree | 4 | 3 | linked list |
128 | Longest Consecutive Sequence | 4 | 3 | array |
130 | Surrounded Regions | 4 | 3 | array |
132 | Palindrome Partitioning II | 4 | 3 | string |
4 | Median of Two Sorted Arrays | 5 | 3 | array |
10 | Regular Expression Matching | 5 | 3 | string |
44 | Wildcard Matching | 5 | 3 | string |
81 | Search in Rotated Sorted Array II | 5 | 3 | array |
27 | Remove Element | 1 | 4 | array |
13 | Roman to Integer | 2 | 4 | |
24 | Swap Nodes in Pairs | 2 | 4 | linked list |
67 | Add Binary | 2 | 4 | string |
129 | Sum Root to Leaf Numbers | 2 | 4 | tree |
2 | Add Two Numbers | 3 | 4 | linked list |
12 | Integer to Roman | 3 | 4 | |
22 | Generate Parentheses | 3 | 4 | string |
23 | Merge k Sorted Lists | 3 | 4 | linked list, heap |
46 | Permutations | 3 | 4 | array |
49 | Anagrams | 3 | 4 | string, hashtable |
77 | Combinations | 3 | 4 | |
78 | Subsets | 3 | 4 | array |
79 | Word Search | 3 | 4 | array |
91 | Decode Ways | 3 | 4 | string |
102 | Binary Tree Level Order Traversal | 3 | 4 | tree |
131 | Palindrome Partitioning | 3 | 4 | string |
69 | Sqrt(x) | 4 | 4 | |
1 | Two Sum | 2 | 5 | array, set |
8 | String to Integer (atoi) | 2 | 5 | string |
20 | Valid Parentheses | 2 | 5 | string |
21 | Merge Two Sorted Lists | 2 | 5 | linked list |
65 | Valid Number | 2 | 5 | string |
70 | Climbing Stairs | 2 | 5 | |
88 | Merge Sorted Array | 2 | 5 | array |
125 | Valid Palindrome | 2 | 5 | string |
15 | 3Sum | 3 | 5 | array |
50 | Pow(x, n) | 3 | 5 | |
73 | Set Matrix Zeroes | 3 | 5 | array |
98 | Validate Binary Search Tree | 3 | 5 | tree |
127 | Word Ladder | 3 | 5 | graph |
28 | Implement strStr() | 4 | 5 | string |
56 | Merge Intervals | 4 | 5 | array, linked list, red-black tree |
57 | Insert Interval | 4 | 5 | array, linked list, red-black tree |
Leetcode高頻題頻率表(轉載)
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.