https://docs.google.com/spreadsheet/pub?key=0Aqt--%20wSNYfuxdGxQWVFsOGdVVWxQRlNUVXZTdEpOeEE&output=html
ID |
Question |
Diff |
Freq |
Data Structure |
Algorithms |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
Two Sum |
2 |
5 |
array |
sort |
|
|
|
|
|
set |
Two Pointers |
|
2 |
Add Two Numbers |
3 |
4 |
linked list |
Two Pointers |
|
|
|
|
|
|
Math |
|
3 |
Longest Substring Without Repeating Characters |
3 |
2 |
string |
Two Pointers |
|
|
|
|
|
hashtable |
|
|
4 |
Median of Two Sorted Arrays |
5 |
3 |
array |
Binary Search |
|
5 |
Longest Palindromic Substring |
4 |
2 |
string |
|
|
6 |
ZigZag Conversion |
3 |
1 |
string |
|
|
7 |
Reverse Integer |
2 |
3 |
|
Math |
|
8 |
String to Integer (atoi) |
2 |
5 |
string |
Math |
|
9 |
Palindrome Number |
2 |
2 |
|
Math |
|
10 |
Regular Expression Matching |
5 |
3 |
string |
Recursion |
|
|
|
|
|
|
DP |
|
11 |
Container With Most Water |
3 |
2 |
array |
Two Pointers |
|
12 |
Integer to Roman |
3 |
4 |
|
Math |
|
13 |
Roman to Integer |
2 |
4 |
|
Math |
|
14 |
Longest Common Prefix |
2 |
1 |
string |
|
|
15 |
3Sum |
3 |
5 |
array |
Two Pointers |
|
16 |
3Sum Closest |
3 |
1 |
array |
Two Pointers |
|
17 |
Letter Combinations of a Phone Number |
3 |
3 |
string |
DFS |
|
18 |
4Sum |
3 |
2 |
array |
|
|
19 |
Remove Nth Node From End of List |
2 |
3 |
linked list |
Two Pointers |
|
20 |
Valid Parentheses |
2 |
5 |
string |
Stack |
|
21 |
Merge Two Sorted Lists |
2 |
5 |
linked list |
sort |
|
|
|
|
|
|
Two Pointers |
|
|
|
|
|
|
merge |
|
22 |
Generate Parentheses |
3 |
4 |
string |
DFS |
|
23 |
Merge k Sorted Lists |
3 |
4 |
linked list |
sort |
|
|
|
|
|
heap |
Two Pointers |
|
|
|
|
|
|
merge |
|
24 |
Swap Nodes in Pairs |
2 |
4 |
linked list |
|
|
25 |
Reverse Nodes in k-Group |
4 |
2 |
linked list |
Recursion |
|
|
|
|
|
|
Two Pointers |
|
26 |
Remove Duplicates from Sorted Array |
1 |
3 |
array |
Two Pointers |
|
27 |
Remove Element |
1 |
4 |
array |
Two Pointers |
|
28 |
Implement strStr() |
4 |
5 |
string |
Two Pointers |
|
|
|
|
|
|
KMP |
|
|
|
|
|
|
rolling hash |
|
29 |
Divide Two Integers |
4 |
3 |
|
Binary Search |
|
|
|
|
|
|
Math |
|
30 |
Substring with Concatenation of All Words |
3 |
1 |
string |
Two Pointers |
|
31 |
Next Permutation |
5 |
2 |
array |
permutation |
|
32 |
Longest Valid Parentheses |
4 |
1 |
string |
DP |
|
33 |
Search in Rotated Sorted Array |
4 |
3 |
array |
Binary Search |
|
34 |
Search for a Range |
4 |
3 |
array |
Binary Search |
|
35 |
Search Insert Position |
2 |
2 |
array |
|
|
36 |
Valid Sudoku |
2 |
2 |
array |
|
|
37 |
Sudoku Solver |
4 |
2 |
array |
DFS |
|
38 |
Count and Say |
2 |
2 |
string |
Two Pointers |
|
39 |
Combination Sum |
3 |
3 |
array |
combination |
|
40 |
Combination Sum II |
4 |
2 |
array |
combination |
|
41 |
First Missing Positive |
5 |
2 |
array |
sort |
|
42 |
Trapping Rain Water |
4 |
2 |
array |
Two Pointers |
|
|
|
|
|
|
Stack |
|
43 |
Multiply Strings |
4 |
3 |
string |
Two Pointers |
|
|
|
|
|
|
Math |
|
44 |
Wildcard Matching |
5 |
3 |
string |
Recursion |
|
|
|
|
|
|
DP |
|
|
|
|
|
|
greedy |
|
45 |
Jump Game II |
4 |
2 |
array |
|
|
46 |
Permutations |
3 |
4 |
array |
permutation |
|
47 |
Permutations II |
4 |
2 |
array |
permutation |
|
48 |
Rotate Image |
4 |
2 |
array |
|
|
49 |
Anagrams |
3 |
4 |
string |
|
|
|
|
|
|
hashtable |
|
|
50 |
Pow(x, n) |
3 |
5 |
|
Binary Search |
|
|
|
|
|
|
Math |
|
51 |
N-Queens |
4 |
3 |
array |
DFS |
|
52 |
N-Queens II |
4 |
3 |
array |
DFS |
|
53 |
Maximum Subarray |
3 |
3 |
array |
DP |
|
54 |
Spiral Matrix |
4 |
2 |
array |
|
|
55 |
Jump Game |
3 |
2 |
array |
|
|
56 |
Merge Intervals |
4 |
5 |
array |
sort |
|
|
|
|
|
linked list |
merge |
|
|
|
|
|
red-black tree |
|
|
57 |
Insert Interval |
4 |
5 |
array |
sort |
|
|
|
|
|
linked list |
merge |
|
|
|
|
|
red-black tree |
|
|
58 |
Length of Last Word |
1 |
1 |
string |
|
|
59 |
Spiral Matrix II |
3 |
2 |
array |
|
|
60 |
Permutation Sequence |
5 |
1 |
|
permutation |
|
|
|
|
|
|
Math |
|
61 |
Rotate List |
3 |
2 |
linked list |
Two Pointers |
|
62 |
Unique Paths |
2 |
3 |
array |
DP |
|
63 |
Unique Paths II |
3 |
3 |
array |
DP |
|
64 |
Minimum Path Sum |
3 |
3 |
array |
DP |
|
65 |
Valid Number |
2 |
5 |
string |
Math |
|
66 |
Plus One |
1 |
2 |
array |
Math |
|
67 |
Add Binary |
2 |
4 |
string |
Two Pointers |
|
|
|
|
|
|
Math |
|
68 |
Text Justification |
4 |
2 |
string |
|
|
69 |
Sqrt(x) |
4 |
4 |
|
Binary Search |
|
70 |
Climbing Stairs |
2 |
5 |
|
DP |
|
71 |
Simplify Path |
3 |
1 |
string |
Stack |
|
72 |
Edit Distance |
4 |
3 |
string |
DP |
|
73 |
Set Matrix Zeroes |
3 |
5 |
array |
|
|
74 |
Search a 2D Matrix |
3 |
3 |
array |
Binary Search |
|
75 |
Sort Colors |
4 |
2 |
array |
sort |
|
|
|
|
|
|
Two Pointers |
|
76 |
Minimum Window Substring |
4 |
2 |
string |
Two Pointers |
|
77 |
Combinations |
3 |
4 |
|
combination |
|
78 |
Subsets |
3 |
4 |
array |
Recursion |
|
|
|
|
|
|
combination |
|
79 |
Word Search |
3 |
4 |
array |
DFS |
|
80 |
Remove Duplicates from Sorted Array II |
2 |
2 |
array |
Two Pointers |
|
81 |
Search in Rotated Sorted Array II |
5 |
3 |
array |
Binary Search |
|
82 |
Remove Duplicates from Sorted List II |
3 |
3 |
linked list |
Recursion |
|
|
|
|
|
|
Two Pointers |
|
83 |
Remove Duplicates from Sorted List |
1 |
3 |
linked list |
|
|
84 |
Largest Rectangle in Histogram |
5 |
2 |
array |
Stack |
|
85 |
Maximal Rectangle |
5 |
1 |
array |
DP |
|
|
|
|
|
|
Stack |
|
86 |
Partition List |
3 |
3 |
linked list |
Two Pointers |
|
87 |
Scramble String |
5 |
2 |
string |
Recursion |
|
|
|
|
|
|
DP |
|
88 |
Merge Sorted Array |
2 |
5 |
array |
Two Pointers |
|
|
|
|
|
|
merge |
|
89 |
Gray Code |
4 |
2 |
|
combination |
|
90 |
Subsets II |
4 |
2 |
array |
Recursion |
|
|
|
|
|
|
combination |
|
91 |
Decode Ways |
3 |
4 |
string |
Recursion |
|
|
|
|
|
|
DP |
|
92 |
Reverse Linked List II |
3 |
2 |
linked list |
Two Pointers |
|
93 |
Restore IP Addresses |
3 |
3 |
string |
DFS |
|
94 |
Binary Tree Inorder Traversal |
4 |
3 |
tree |
Recursion |
|
|
|
|
|
hashtable |
morris |
|
|
|
|
|
|
Stack |
|
95 |
Unique Binary Search Trees II |
4 |
1 |
tree |
DP |
|
|
|
|
|
|
DFS |
|
96 |
Unique Binary Search Trees |
3 |
1 |
tree |
DP |
|
97 |
Interleaving String |
5 |
2 |
string |
Recursion |
|
|
|
|
|
|
DP |
|
98 |
Validate Binary Search Tree |
3 |
5 |
tree |
DFS |
|
99 |
Recover Binary Search Tree |
4 |
2 |
tree |
DFS |
|
100 |
Same Tree |
1 |
1 |
tree |
DFS |
|
101 |
Symmetric Tree |
1 |
2 |
tree |
DFS |
|
102 |
Binary Tree Level Order Traversal |
3 |
4 |
tree |
BFS |
|
103 |
Binary Tree Zigzag Level Order Traversal |
4 |
3 |
queue |
BFS |
|
|
|
|
|
tree |
Stack |
|
104 |
Maximum Depth of Binary Tree |
1 |
1 |
tree |
DFS |
|
105 |
Construct Binary Tree from Preorder and Inorder Tr |
3 |
3 |
array |
DFS |
|
|
|
|
|
tree |
|
|
106 |
Construct Binary Tree from Inorder and Postorder T |
3 |
3 |
array |
DFS |
|
|
|
|
|
tree |
|
|
107 |
Binary Tree Level Order Traversal II |
3 |
1 |
tree |
BFS |
|
108 |
Convert Sorted Array to Binary Search Tree |
2 |
3 |
tree |
DFS |
|
109 |
Convert Sorted List to Binary Search Tree |
4 |
3 |
linked list |
Recursion |
|
|
|
|
|
|
Two Pointers |
|
110 |
Balanced Binary Tree |
1 |
2 |
tree |
DFS |
|
111 |
Minimum Depth of Binary Tree |
1 |
1 |
tree |
DFS |
|
112 |
Path Sum |
1 |
3 |
tree |
DFS |
|
113 |
Path Sum II |
2 |
2 |
tree |
DFS |
|
114 |
Flatten Binary Tree to Linked List |
3 |
3 |
tree |
Recursion |
|
|
|
|
|
|
Stack |
|
115 |
Distinct Subsequences |
4 |
2 |
string |
DP |
|
116 |
Populating Next Right Pointers in Each Node |
3 |
3 |
tree |
DFS |
|
117 |
Populating Next Right Pointers in Each Node II |
4 |
2 |
tree |
DFS |
|
118 |
Pascal's Triangle |
2 |
1 |
array |
|
|
119 |
Pascal's Triangle II |
2 |
1 |
array |
|
|
120 |
Triangle |
3 |
1 |
array |
DP |
|
121 |
Best Time to Buy and Sell Stock |
2 |
1 |
array |
DP |
|
122 |
Best Time to Buy and Sell Stock II |
3 |
1 |
array |
greedy |
|
123 |
Best Time to Buy and Sell Stock III |
4 |
1 |
array |
DP |
|
124 |
Binary Tree Maximum Path Sum |
4 |
2 |
tree |
DFS |
|
125 |
Valid Palindrome |
2 |
5 |
string |
Two Pointers |
|
126 |
Word Ladder II |
1 |
1 |
|
|
|
127 |
Word Ladder |
3 |
5 |
graph |
BFS |
|
|
|
|
|
|
shortest path |
|
128 |
Longest Consecutive Sequence |
4 |
3 |
array |
|
|
129 |
Sum Root to Leaf Numbers |
2 |
4 |
tree |
DFS |
|
130 |
Surrounded Regions |
4 |
3 |
array |
BFS |
|
|
|
|
|
|
DFS |
|
131 |
Palindrome Partitioning |
3 |
4 |
string |
DFS |
|
132 |
Palindrome Partitioning II |
4 |
3 |
string |
DP |
分享到:
相关推荐
LeetCode中的问题涵盖了从基础到高级的各种难度,不仅有助于提升个人技术水平,也是面试准备的重要部分,许多公司在招聘时会考察候选人的LeetCode解题能力。 C++是一种通用的、静态类型的、编译式的、并发型的、大...
在LeetCode上,你可以找到各种难度级别的题目,从基础到进阶,逐步提升自己的编程实力。这些题目通常与面试中的“白板编程”环节相似,让你习惯在压力下思考和解决问题。同时,LeetCode的社区功能允许用户分享解题...
5. 面试准备:许多公司在面试时会考察候选人的LeetCode能力,因此,刷题可以帮助准备技术面试。 "Leetcode-master" 可能包含的内容有: 1. 解决方案文件夹:每个文件可能对应一个LeetCode题目,包含了题目编号、...
对于准备面试的程序员来说,LeetCode是必不可少的练习工具,因为很多公司在面试时会参考LeetCode上的问题来评估候选人的技术能力。 在学习LeetCode的过程中,建议先从基础题目开始,逐步提升难度,每解完一个问题后...
标题中的“存在重复元素II”是LeetCode在线编程平台上的第219题,这道题目主要考察的是数组处理和哈希表的应用。在Python编程领域,这类问题通常需要我们高效地找出数组中是否有出现超过一次但不超过两次的元素。在...
第75题是中等难度的问题,主要考察了数组操作和双指针技术。 【描述】:此压缩包包含了解决问题的Java代码文件,以及可能的思路分析和解题过程。通过学习这个题解,你可以了解到如何在给定数组中对元素进行高效的...
在LeetCode上,你可以找到各种难度级别的问题,从基础到进阶,涵盖了数据结构、算法、设计模式等多个领域的知识。 Java是一种广泛使用的面向对象的编程语言,具有跨平台、高性能、丰富的类库等特点,因此是LeetCode...
在给定的压缩包文件"leetcode2sumc-leetcode:leetcode"中,我们可以推测这是一个与LeetCode相关的项目,其中包含了使用C语言实现的算法解决方案。LeetCode是一个在线平台,提供了各种编程挑战,尤其是针对算法和数据...
它提供的题目难度不一,从基础的数组操作到复杂的图论问题,覆盖了面试中常见的技术考察点。参与LeetCode的挑战,不仅可以提高编程能力,还有助于准备技术面试。 二、LeetCodeAnswer项目解析 "LeetCodeAnswer"项目...
《力码:LeetCode面试与招聘的全方位指南》 LeetCode,一个广为人知的在线编程挑战平台,已经成为程序员提升技能、准备面试的重要工具。它提供了丰富的算法题目,覆盖了数据结构、排序、搜索、图论等多个领域,帮助...
4. 面试准备:许多科技公司面试时会考察候选人的LeetCode技能,因此在这里练习可以帮助你为技术面试做好充分准备。 5. 社区交流:LeetCode社区允许用户分享解决方案,你可以从中学习他人的思路,同时也可以参与讨论...
leetcode 分类 Algorithm-Practice-EveryWeek Algorithm-Practice-EveryWeek-算法更新每周 详细记录见 算法练习记录-天 目录 刷题时建议按类型刷题,参考刷题类型分类 同时已经这样在刷题的参考 2019Year 2019-07-06...
《LeetCode刷题笔记》是针对编程爱好者和准备面试的开发者们的一份宝贵资源,它按照问题类型进行了精心分类,涵盖了LeetCode这个在线编程平台上的众多挑战。LeetCode以其丰富的算法题目和实际编程问题,成为了提升...
3. 面试准备:许多公司在面试时会参考LeetCode的题目,考察候选人的编程和算法能力。熟练掌握Java和LeetCode题目,对于Java开发者来说,无疑能够增加面试成功的几率。 三、解题策略与技巧 1. 读懂题目:理解问题是...
这份名为"Leetcode-Company-Questions-2020-2021"的压缩包文件,正是这样一个集大成者,它汇总了2020年至2021年间LeetCode平台上各公司面试问题的频率排名,为准备面试的程序员提供了宝贵的参考。 首先,我们要理解...
LeetCode中的问题通常分为几个难度级别:简单、中等和困难,这些问题涵盖了许多计算机科学的核心概念。让我们深入探讨一下这些可能涉及的知识点: 1. **排序算法**:如快速排序、归并排序、插入排序、选择排序、堆...
- 排序算法:快速排序、归并排序、插入排序、冒泡排序等是常见的排序算法,LeetCode 会考察它们的实现和性能优化。 - 搜索算法:二分查找、深度优先搜索(DFS)、广度优先搜索(BFS)是解决问题的关键工具。 - ...
在LeetCode上,你可以找到各种难度级别的问题,从基础到高级,涵盖数组、链表、字符串、二叉树、图、排序、搜索等多方面的编程知识。通过解这些问题,你可以深入理解各种算法和数据结构,这对于提升编程能力尤其是...
本压缩包“LeetCodeProblems-master”很可能包含了与LeetCode相关的Java解题代码库,供学习者参考和练习。 在LeetCode上,你可以找到各种难度级别的问题,涵盖了数据结构、算法、设计模式等多个领域。对于Java...
在编程学习与面试准备的过程中,LeetCode是一个备受推崇的在线平台,它提供了大量的算法题目,旨在提升编程能力和解决问题的能力。本篇将详细探讨使用Java语言在LeetCode上的实践和解决方案。 一、Java基础与...