- 浏览: 365369 次
最新评论
leetcode难度及面试频率
转载自:LeetCode Question Difficulty Distribution
|
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难度 leetcode 微软面试习题练习 我在leetcode上寻找中等难度的习题做练习,以期能够完成后成功面试微软。
这是个人搜集的LeetCode上一些经典面试问题的Java语言实现,涉及数组、链表、堆栈、队列、二叉树、并查集、字典树等15个维度,供各位学习参考使用!
LeetCode面试笔试题
leetcode + title + difficulty + topics + frequency + acceptance + companies Excel 文件可自己选择按频率排序,或者公司tag。每个题目都有leetcode链接。
leetcode刷多少面试 LeetCode 划分说明 这个重点题目是把Leetcode前400题进行精简,划分精简规则如下: 删除不常考,面试低频出现题目 删除重复代码题目(例:链表反转206题,代码在234题出现过) 删除过于简单题目...
acm和leetcode难度 ACM 数据结构与算法 目录按照LeetCode题目编写,* 代表简单, ** 代表中等, *** 代表困难 两数之和 时间复杂度为O(n) 使用了字典 方便得到序列号 两数相加 循环节点相加,大于十进位,要考虑两数...
这份资源整理了力扣(LeetCode)面试中的150道题目,以及它们的详细解答。这些题目涵盖了各种算法和数据结构的应用,包括但不限于数组、链表、树、图、动态规划、贪心算法等。通过这份整理,你可以系统地学习和掌握...
leetcode刷多少面试 leetcode 准备阶段 找了一些资料,关于如何开刷leetcode,后来看到别人整理的博客,按照别人整理的题目来做题的 刷题工具 在vscode进行的,安装了一个leetcode的模块,就可以在编译器里面进行...
leetcode 分类 leetcode leetcode刷题(中等难度分类)
面试题 01.07. 旋转矩阵 题目链接解题思路:顺时针旋转 90° 对应转换规则 (x,y)->(y,n-x) ,n=N-1public void rotat
leetcode中国leetcode leetcode 编码面试解决方案 参考链接: 力码: 力扣中国: 智慧峰的 LeetCode 回购: 系统设计入门:
1、在特定区间 [l, r] 中,选中某个数 x ,将大于等于 x 的放在左边,小于 x 的放在右边,其中 2、判断出第 k 大与 j 的大小关系,若 k <=
leetcode安卓 leetcode 根据难度,划分easy、middle、hard,收集了各个难度下的leetcode原题和面试题 easy middle ★ hard
刷链表和二叉树的题,这两部分的题需要一定的代码能力,而且也是面试中出现频率最高的,这部分题目性价比最高,可多刷 刷搜索题,可以挑简单的刷,主要是对深广搜要有一定的认识,这部分在面试一般不会让手写代码,...
leetcode刷多少面试 leetcode leetcode刷题, 全采用python3完成代码, IDE是pycharm, 题目来自leetcode,代码是原创。 给自己定个任务,每天刷10题。 20210105 刷10题 为数组类型题 最富有客户资产, 一维数组的...
用来记录我们刷LeetCode题目时候的心酸历史。我们保证,这些代码一定通过了当时LeetCode的测试,虽然后续可能因为LeetCode测试条件的改变导致某些解题无法通过,但我们会实时的跟进。 编程语言使用Golang,代码风格...
2020高频面试算法整理 leetcode ,18个大类,80+到常见算法题。 1.热身题|1)查找唯一数字|2)查找N/2数字|3)判断数字是否存在|4)合并二叉树|5)泡鸡蛋问题|2.互联网公司最常见的面试算法题有哪些?|3.TOP INTERVIEW ...
描述 王轶錾的LeetCode刷题与面试总结 LeetCode刷题与面试总结 LeetCode刷题 斑点 链表 面试资料 ,与 阅读书籍笔记 Q&A型回答问题 ,