LeetCode 刷题顺序表
Id
|
Question
|
Difficulty
|
Frequency
|
Data Structures
|
Algorithms
|
---|---|---|---|---|---|
1 | Two Sum | 2 | 5 | array + set | sort + two pointers |
2 | Add Two Numbers | 3 | 4 | linked list | two pointers + math |
3 | Longest Substring Without Repeating Characters | 3 | 2 | string + hashtable | two pointers |
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 + heap | sort + 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 + linked list + red-black tree | sort + merge |
57 | Insert Interval | 4 | 5 | array + linked list + red-black tree | sort + merge |
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 + hashtable | recursion + 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 + tree | bfs + stack |
104 | Maximum Depth of Binary Tree | 1 | 1 | tree | dfs |
105 | Construct Binary Tree from Preorder and Inorder Tr | 3 | 3 | array + tree | dfs |
106 | Construct Binary Tree from Inorder and Postorder T | 3 | 3 | array + tree | dfs |
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 All in One 题目讲解汇总(持续更新中...)
LeetCode 刷题顺序表的更多相关文章
- ACM金牌选手整理的【LeetCode刷题顺序】
算法和数据结构知识点图 首先,了解算法和数据结构有哪些知识点,在后面的学习中有 大局观,对学习和刷题十分有帮助. 下面是我花了一天时间花的算法和数据结构的知识结构,大家可以看看. 后面是为大家 精心挑 ...
- C#LeetCode刷题-哈希表
哈希表篇 # 题名 刷题 通过率 难度 1 两数之和 C#LeetCode刷题之#1-两数之和(Two Sum) 42.8% 简单 3 无重复字符的最长子串 24.2% 中等 18 四数之和 ...
- LeetCode刷题总结-数组篇(上)
数组是算法中最常用的一种数据结构,也是面试中最常考的考点.在LeetCode题库中,标记为数组类型的习题到目前为止,已累计到了202题.然而,这202道习题并不是每道题只标记为数组一个考点,大部分习题 ...
- LeetCode刷题笔记和想法(C++)
主要用于记录在LeetCode刷题的过程中学习到的一些思想和自己的想法,希望通过leetcode提升自己的编程素养 :p 高效leetcode刷题小诀窍(这只是目前对我自己而言的小方法,之后会根据自己 ...
- LeetCode刷题的一点个人建议和心得
目录 1. 为什么我们要刷LeetCode? 2. LeetCode的现状和问题 3. 本文的初衷 4. LeetCode刷题建议 4.1入门数据结构,打基础阶段 4.2 建立 ...
- leetcode刷题指南
转载自:http://blog.csdn.net/lnho2015/article/details/50962989 以下是我个人做题过程中的一些体会: 1. LeetCode的题库越来越大,截止到目 ...
- LeetCode刷题专栏第一篇--思维导图&时间安排
昨天是元宵节,过完元宵节相当于这个年正式过完了.不知道大家有没有投入继续投入紧张的学习工作中.年前我想开一个Leetcode刷题专栏,于是发了一个投票想了解大家的需求征集意见.投票于2019年2月1日 ...
- leetcode刷题记录--js
leetcode刷题记录 两数之和 给定一个整数数组 nums 和一个目标值 target,请你在该数组中找出和为目标值的那 两个 整数,并返回他们的数组下标. 你可以假设每种输入只会对应一个答案.但 ...
- LeetCode刷题总结之双指针法
Leetcode刷题总结 目前已经刷了50道题,从零开始刷题学到了很多精妙的解法和深刻的思想,因此想按方法对写过的题做一个总结 双指针法 双指针法有时也叫快慢指针,在数组里是用两个整型值代表下标,在链 ...
随机推荐
- VIM学习笔记
参考: http://linux.chinaunix.net/techdoc/beginner/2009/12/20/1150108.shtml VIM命令大全 光标控制命令 命令 ...
- 生成n位随机字符串
--1.借助newid() Go --创建视图(因为在函数中无法直接使用newid()) create view vnewid as select newid() N'MacoId'; go --创建 ...
- Jmeter之录制脚本(二)
上一节已经已经介绍过Jmeter的安装,对于web测试的话,经常会用到一些脚本去执行某些功能,也就是所谓的半自动化测试, 对于不懂代码的童鞋来说,脚本是一个很头疼的概念,badboy的录制是一个对于刚 ...
- 解读Web Page Diagnostics网页细分图
解读Web Page Diagnostics网页细分图 http://blog.sina.com.cn/s/blog_62b8fc330100red5.html Web Page Diagnostic ...
- hdu 5692 Snacks 线段树+dfs
Snacks Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Sub ...
- SPOJ PHRASES 后缀数组
题目链接:http://www.spoj.com/problems/PHRASES/en/ 题意:给定n个字符串,求一个最长的子串至少在每个串中的不重叠出现次数都不小于2.输出满足条件的最长子串长度 ...
- iOS10 UI教程视图调试
iOS10 UI教程视图调试 iOS10 UI教程视图调试,当视图很复杂的时候,层次结构就不会很简单了.Xcode可以通过视图(View)调试帮助开发者解决层次结构复杂的问题.视图调试是在Xcode ...
- ios 简单的倒计时验证码数秒过程实现
timer = [NSTimer scheduledTimerWithTimeInterval:1.0 target:self selector:@selector(timerFireMethod:) ...
- sed 字符串替换
1. sed替换的基本语法为: sed 's/原字符串/替换字符串/' 单引号里面,s表示替换,三根斜线中间是替换的样式,特殊字符需要使用反斜线”\”进行转义. 2. 单引号” ‘ ’”是没有办法用反 ...
- 并查集(图论) LA 3644 X-Plosives
题目传送门 题意:训练指南P191 分析:本题特殊,n个物品,n种元素则会爆炸,可以转移到图论里的n个点,连一条边表示u,v元素放在一起,如果不出现环,一定是n点,n-1条边,所以如果两个元素在同一个 ...