# Title Solution Acceptance Difficulty Frequency  
  4   27.2% Hard  
  10   25.6% Hard  
  23   35.8% Hard  
  25   37.7% Hard  
  30   24.1% Hard  
  32   26.2% Hard  
  37   38.5% Hard  
  41   29.6% Hard  
  42   44.4% Hard  
  44   23.3% Hard  
  45
Jump Game II    
  28.7% Hard  
  51
N-Queens    
  41.1% Hard  
  52
N-Queens II    
  53.4% Hard  
  57   31.7% Hard  
  65
Valid Number    
  14.3% Hard  
  68   24.2% Hard  
  72   39.1% Hard  
  76   31.7% Hard  
  84   32.1% Hard  
  85   34.4% Hard  
  87   32.1% Hard  
  97   28.7% Hard  
  99   35.5% Hard  
  115   35.7% Hard  
  123   34.6% Hard  
  124   30.8% Hard  
  126   18.7% Hard  
  128   42.5% Hard  
  132   28.2% Hard  
  135
Candy    
  29.1% Hard  
  140   28.1% Hard  
  145   49.9% Hard  
  149   16.0% Hard  
  154   39.7% Hard  
  158   27.6% Hard  
  159   47.7% Hard  
  164
Maximum Gap    
  33.2% Hard  
  174
Dungeon Game    
  27.8% Hard  
  185   27.8% Hard  
  188   26.8% Hard  
  212   29.8% Hard  
  214   28.1% Hard  
  218   32.3% Hard  
  224   33.7% Hard  
  233   30.6% Hard  
  239   39.1% Hard  
  248   37.3% Hard  
  262   26.4% Hard  
  265   42.2% Hard  
  269   32.0% Hard  
  272   46.3% Hard  
  273   24.8% Hard  
  282   33.4% Hard  
  291   41.6% Hard  
  295   38.2% Hard  
  296   55.8% Hard  
  297   42.3% Hard  
  301   40.1% Hard  
  302   49.8% Hard  
  305   41.3% Hard  
  308   32.9% Hard  
  312   48.3% Hard  
  315   39.0% Hard  
  316   33.3% Hard  
  317   38.8% Hard  
  321   25.8% Hard  
  327   33.4% Hard  
  329   40.8% Hard  
  330   33.6% Hard  
  335   27.2% Hard  
  336   31.7% Hard  
  340   40.8% Hard  
  352   44.2% Hard  
  354   34.3% Hard  
  358   33.4% Hard  
  363   35.6% Hard  
  381   32.5% Hard  
  391   28.6% Hard  
  403
Frog Jump    
  36.9% Hard  
  407   39.9% Hard  
  410   42.8% Hard  
  411   35.2% Hard  
  420   16.6% Hard  
  425
Word Squares    
  45.2% Hard  
  428   55.2% Hard  
  431   65.0% Hard  
  432   30.3% Hard  
  440   27.0% Hard  
  446   30.9% Hard  
  458
Poor Pigs    
  46.1% Hard  
  460
LFU Cache    
  29.7% Hard  
  465   43.6% Hard  
  466   27.4% Hard  
  471   45.6% Hard  
  472   36.4% Hard  
  479   27.8% Hard  
  480   33.6% Hard  
  483   34.3% Hard  
  488
Zuma Game    
  39.7% Hard  
  489   65.8% Hard  
  493   23.5% Hard  
  499
The Maze III    
  38.0% Hard  
  502
IPO    
  38.4% Hard  
  514   41.0% Hard  
  517   37.0% Hard  
  527   51.2% Hard  
  546
Remove Boxes    
  38.9% Hard  
  552   33.8% Hard  
  564   19.0% Hard  
  568   38.5% Hard  
  569   49.6% Hard  
  571   46.5% Hard  
  579   34.7% Hard  
  587   34.6% Hard  
  588   41.3% Hard  
  591   33.2% Hard  
  600   33.1% Hard  
  601   37.3% Hard  
  615   39.2% Hard  
  618   44.3% Hard  
  629   29.6% Hard  
  630   32.4% Hard  
  631   29.5% Hard  
  632   48.8% Hard  
  639   25.5% Hard  
  642   39.3% Hard  
  644   29.5% Hard  
  656
Coin Path    
  27.5% Hard  
  660
Remove 9    
  52.4% Hard  
  664   37.3% Hard  
  668   42.8% Hard  
  675   31.6% Hard  
  679
24 Game    
  43.6% Hard  
  683   34.5% Hard  
  685   31.1% Hard  
  689   44.3% Hard  
  691   39.1% Hard  
  699   40.5% Hard  
  710   32.0% Hard  
  711   47.0% Hard  
  715
Range Module    
  36.2% Hard  
  719   29.8% Hard  
  726   45.5% Hard  
  727   38.2% Hard  
  730   39.7% Hard  
  732   56.6% Hard  
  736   45.1% Hard  
  741   30.7% Hard  
  745   31.5% Hard  
  749   41.5% Hard  
  753   47.6% Hard  
  757   36.9% Hard  
  759   62.4% Hard  
  761   52.4% Hard  
  765   52.1% Hard  
  768   46.6% Hard  
  770   45.5% Hard  
  772   41.9% Hard  
  773   53.9% Hard  
  774   43.0% Hard  
  778   48.7% Hard  
  780   27.7% Hard  
  782   39.5% Hard  
  786   40.5% Hard  
  793   39.2% Hard  
  798   41.1% Hard  
  803   29.1% Hard  
  805   24.8% Hard  
  810   45.0% Hard  
  815
Bus Routes    
  40.6% Hard  
  818
Race Car    
  36.0% Hard  
  827   43.6% Hard  
  828   41.0% Hard  
  829   34.1% Hard  
  834   40.6% Hard  
  839   35.4% Hard  
  843   44.5% Hard  
  847   48.0% Hard  
  850   45.4% Hard  
  854   34.7% Hard  
  857   48.2% Hard  
  862   22.6% Hard  
  864   37.3% Hard  
  871   29.9% Hard  
  878   25.9% Hard  
  879   37.3% Hard  
  882   38.7% Hard  
  887   25.1% Hard  
  891   29.7% Hard  
  895   57.1% Hard  
  899   48.1% Hard  
  902   29.0% Hard  
  903   45.4% Hard  
  906   30.6% Hard  
  913   29.1% Hard  
  920   43.9% Hard  
  924   40.7% Hard  
  927   30.8% Hard  
  928   39.4% Hard  
  936   35.5% Hard  
  940   40.3% Hard  
  943   39.1% Hard  
  952   26.9% Hard  
  956   38.5% Hard  
  960   52.8% Hard  
  964   40.6% Hard  
  968   35.8% Hard  
  972   39.9% Hard  
  975   46.0% Hard  
  980   71.3% Hard  
  982   54.5% Hard  
  992   45.1% Hard  
  995   47.6% Hard  
  996   47.7% Hard  
  1000   34.8% Hard  
  1001   34.8% Hard  
  1012   34.9% Hard  
  1028   69.4% Hard  
  1032   42.9% Hard  
  1036   35.0% Hard  
  1044   22.9% Hard  
  1063   72.8% Hard  
  1067   37.9% Hard  
  1074   57.9% Hard  
  1088   36.1% Hard  
  1092   48.3% Hard  
  1095   34.3% Hard  
  1096   56.7% Hard  
  1097   47.0% Hard  
  1106   57.7% Hard  
  1121   53.6% Hard  
  1125   44.5% Hard  
  1127   45.4% Hard  
  1136   60.1% Hard  
  1147   57.8% Hard  
  1153   28.7% Hard  
  1157   32.3% Hard  
  1159   48.8% Hard  
  1163   29.9% Hard  
  1168   48.9% Hard  
  1172   42.1% Hard  
  1178   23.7% Hard

leetcode hard的更多相关文章

  1. 我为什么要写LeetCode的博客?

    # 增强学习成果 有一个研究成果,在学习中传授他人知识和讨论是最高效的做法,而看书则是最低效的做法(具体研究成果没找到地址).我写LeetCode博客主要目的是增强学习成果.当然,我也想出名,然而不知 ...

  2. LeetCode All in One 题目讲解汇总(持续更新中...)

    终于将LeetCode的免费题刷完了,真是漫长的第一遍啊,估计很多题都忘的差不多了,这次开个题目汇总贴,并附上每道题目的解题连接,方便之后查阅吧~ 477 Total Hamming Distance ...

  3. [LeetCode] Longest Substring with At Least K Repeating Characters 至少有K个重复字符的最长子字符串

    Find the length of the longest substring T of a given string (consists of lowercase letters only) su ...

  4. Leetcode 笔记 113 - Path Sum II

    题目链接:Path Sum II | LeetCode OJ Given a binary tree and a sum, find all root-to-leaf paths where each ...

  5. Leetcode 笔记 112 - Path Sum

    题目链接:Path Sum | LeetCode OJ Given a binary tree and a sum, determine if the tree has a root-to-leaf ...

  6. Leetcode 笔记 110 - Balanced Binary Tree

    题目链接:Balanced Binary Tree | LeetCode OJ Given a binary tree, determine if it is height-balanced. For ...

  7. Leetcode 笔记 100 - Same Tree

    题目链接:Same Tree | LeetCode OJ Given two binary trees, write a function to check if they are equal or ...

  8. Leetcode 笔记 99 - Recover Binary Search Tree

    题目链接:Recover Binary Search Tree | LeetCode OJ Two elements of a binary search tree (BST) are swapped ...

  9. Leetcode 笔记 98 - Validate Binary Search Tree

    题目链接:Validate Binary Search Tree | LeetCode OJ Given a binary tree, determine if it is a valid binar ...

  10. Leetcode 笔记 101 - Symmetric Tree

    题目链接:Symmetric Tree | LeetCode OJ Given a binary tree, check whether it is a mirror of itself (ie, s ...

随机推荐

  1. svn 同步hook

    hook 目录下 cp pre-revprop-change.tmpl pre-revprop-change chmod a+x pre-revprop-change 同步代码初始化 sudo svn ...

  2. C++入门经典-例7.6-this指针,同一个类的不同对象数据

    1:对于类的非静态成员,每个对象都有自己的一份拷贝,即每个对象都有自己的数据成员,不过成员函数却是每个对象共享的.那么调用共享的成员函数如何找到自己的数据成员呢?答案是通过类中隐藏的this指针. 2 ...

  3. (一)C语言的四大数据类型

  4. MySQL中获取天、周、月等数据

    MySQL中获取天.周.月等数据 1.今天 select * from 表名 where to_days(时间字段名) = to_days(now()); 2.昨天 SELECT * FROM 表名 ...

  5. jmeter源代码开发环境构建

    1.下载jmeter源码:http://jmeter.apache.org/download_jmeter.cgi 2.新建-->java Project-->Next-->src- ...

  6. PHP获取文件扩展名五种以上的方法和注释

    在PHP面试中或者考试中会有很大几率碰到写出五种获取文件扩展名的方法,下面是我自己总结的一些方法 $file = ‘需要进行获取扩展名的文件.php’; //第一种,根据.拆分,获取最后一个元素的值f ...

  7. PMML辅助机器学习算法上线

    在机器学习用于产品的时候,我们经常会遇到跨平台的问题.比如我们用Python基于一系列的机器学习库训练了一个模型,但是有时候其他的产品和项目想把这个模型集成进去,但是这些产品很多只支持某些特定的生产环 ...

  8. 阶段3 3.SpringMVC·_05.文件上传_3 文件上传之Springmvc方式上传原理分析

    需要配置文件解析器这个对象 id配置时候必须叫做mutipartResolver 最终

  9. java+实现文件的上传和下载

    项目截图 路径配置 将localhost:8080/up6全部替换为实际项目路径 使用mysql文件夹下的脚本创建数据表. 创建后可以在数据库中看到创建好的数据表 2.修改数据库连接 3.修改上传地址 ...

  10. 基于axis的WebService的案例

    1.axis axis是Apache旗下产品,它是一个webservice容器,可被用于创建.部署和运行webservice.网址http://axis.apache.org/,网址上的部分截图如下. ...