LeetCode Question Difficulty Distribution
参考链接: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 Question Difficulty Distribution的更多相关文章
- leetcode难度及面试频率
转载自:LeetCode Question Difficulty Distribution 1 Two Sum 2 5 array sort set ...
- LeetCode难度与出现频率
转载自:LeetCode Question Difficulty Distribution 1 Two Sum 2 5 array sort set Two ...
- LeetCode 刷题顺序表
Id Question Difficulty Frequency Data Structures Algorithms 1 Two Sum 2 5 array + set sort + two poi ...
- Leetcode难度表及解题汇总
Leetcode难度表及解题汇总 参考网上一份题目难度表,以及本人的解题. Id Question Difficulty Frequency Data Structures Algorithms Bl ...
- Leetcode: Convert sorted list to binary search tree (No. 109)
Sept. 22, 2015 学一道算法题, 经常回顾一下. 第二次重温, 决定增加一些图片, 帮助自己记忆. 在网上找他人的资料, 不如自己动手. 把从底向上树的算法搞通俗一些. 先做一个例子: 9 ...
- Leetcode study time
August 2, 2015 在http://zzk.cnblogs.com/ 用"找一找", 花了几个小时, 找出比较好的Leetcode博客. Read the leetcod ...
- 697. Degree of an Array - LeetCode
697. Degree of an Array - LeetCode Question 697. Degree of an Array - LeetCode Solution 理解两个概念: 数组的度 ...
- 从0开始,手把手教你用Vue开发一个答题App
项目演示 项目演示 项目源码 项目源码 教程说明 本教程适合对Vue基础知识有一点了解,但不懂得综合运用,还未曾使用Vue从头开发过一个小型App的读者.本教程不对所有的Vue知识点进行讲解,而是手把 ...
- leetcode difficulty and frequency distribution chart
Here is a difficulty and frequency distribution chart for each problem (which I got from the Interne ...
随机推荐
- spring生命周期
Github地址 最近在整合mybatis-spring. 公司里面已经有一个叫做kylin-datasource的开发包,以前能够提供master和slave2个数据源,最近更新了2.0版本,支持自 ...
- 用Leangoo做敏捷需求管理-敏捷团队协作
传统的瀑布工作模式使用详细的需求说明书来表达需求,需求人员负责做需求调研,根据调研情况编制详细的需求说明书,进行需求评审,评审之后签字确认交给研发团队设计开发.在这样的环境下,需求文档是信息传递的主体 ...
- Linux Shell 06 数学运算
1.let let "var+=1" let v2= echo $var,$v2 #2,4 a.只支持整数运算 b.基本支持所有运算符(包括++,——,**) c.表达式中使用变量 ...
- Swing应用开发实战系列之二:设计日期选择面板窗口
Swing本身没有提供什么华丽丽的日期时间选择控件,所以笔者就在网上搜了个第三方的jar包jdatepicker-1.3.2.jar,基于此设计了个很轻量的日期选择面板,很简单的.效果图如下所示: 代 ...
- 笔者的编辑语法:MarkDown
由于博客园里的文章有很多排版不好,一大堆文字堆在一块会影响到阅读. MarkDowm:百科 Markdown 是一种轻量级标记语言,创始人为约翰·格鲁伯(John Gruber).它允许人们“使用易读 ...
- Mongodb 字段类型转换
db.diningmembers.find({modifedDate:{$type:9}}).forEach(function(x){x.tel = String(x.tel);db.diningme ...
- Linux学习之三——操作档案与目录
一. 目录文档操作指令 1. pwd 显示目前所在目录 如果加上-P 的选项,则取得正确的目录名称,而不是以链接文件的路径来显示. 例如CentOS下,刚刚好/var/mail是/var/spool/ ...
- IOS版本被拒的经历
IOS版本被拒的经历: 1,登陆方式依赖外部平台 因为我们的APP是只用微博登陆,想做成类似meerkat类型的,也能各种消息都同步微博. 结果当然行不通,这个确实是不听好人言,网上多个人都说过这个问 ...
- 【NOIP提高组2015D2T1】uva 714 copying books【二分答案】——yhx
Before the invention of book-printing, it was very hard to make a copy of a book. All the contents h ...
- 怎么在ZBrush中渲染漫画风格的插画
创建“漫画插画”的外观和感觉想必一定很有趣吧,但是,获得想要的精确外观有时也会令人相当沮丧,因此了解一些基本原则,创建类似于ZBrush漫画MatCaps的作品很有必要. 若有疑问亦或者想查看具体的视 ...