# 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. python3 输入与输出

    pyhon3 io 输入和输出myread=open('E:/路径.txt')#open()会将返回一个file对象mywrite=open('E:/3/路径.txt','w')#后面w是如果文件存在 ...

  2. Python最高效爬虫框架

    Overview Scrapy is a fast high-level screen scraping and web crawling framework, used to crawl websi ...

  3. ubuntu18.04系统桌面很卡 换回16.04桌面

    https://jingyan.baidu.com/article/37bce2bea3c07f1002f3a22a.html

  4. java多线程编程详细总结

    一.多线程的优缺点 多线程的优点: 1)资源利用率更好2)程序设计在某些情况下更简单3)程序响应更快 多线程的代价: 1)设计更复杂虽然有一些多线程应用程序比单线程的应用程序要简单,但其他的一般都更复 ...

  5. leetcode题目10.正则表达式匹配(困难)

    题目描述: 给你一个字符串 s 和一个字符规律 p,请你来实现一个支持 '.' 和 '*' 的正则表达式匹配. '.' 匹配任意单个字符'*' 匹配零个或多个前面的那一个元素所谓匹配,是要涵盖 整个  ...

  6. 石川es6课程---12、Promise

    石川es6课程---12.Promise 一.总结 一句话总结: 用同步的方式来书写异步代码,让异步书写变的特别简单 用同步的方式来书写异步代码Promise 让异步操作写起来,像在写同步操作的流程, ...

  7. oc 计算 带括号 式子

    下面代码实现可以计算 类似以下的字符窜. @"(1+2*(3+4)+3)/2" 自写一个简单 stack .不知道 OC为什么不提供Stack类. #import <Foun ...

  8. RequestsLibrary接口测试

    RequestsLibrary常用的关键字 关  键  字 描   述 Create Session 创建HTTP会话 Get Request 采用get方式请求 Post Request 采用Pos ...

  9. C# 防火墙操作之开启与关闭

    通过代码操作防火墙的方式有两种:一是代码操作修改注册表启用或关闭防火墙:二是直接操作防火墙对象来启用或关闭防火墙.不论哪一种方式,都需要使用管理员权限,所以操作前需要判断程序是否具有管理员权限. 1. ...

  10. SLC-Microsoft:Microsoft Lifecycle Policy

    ylbtech-SLC-Microsoft:Microsoft Lifecycle Policy Microsoft Lifecycle Policy The Microsoft Lifecycle ...