# 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. HTTP服务器(2)

    import socket import re import multiprocessing def service_client(new_socket): """为这个 ...

  2. C++入门经典-例8.5-多重继承

    1:C++允许子类从多个父类继承公有的和受保护的成员,这称为多重继承. 2:多重继承的定义.多重继承有多个基类名称标识符,其声明形式如下: class 派生类名标识符:[继承方式] 基类名标识符1,. ...

  3. C++入门经典-例7.2-利用构造函数初始化成员变量

    1:在创建对象时,程序自动调用构造函数.同一个类中可以有多个构造函数,通过这样的形式创建一个CPerson对象,例如: CPerson p1(0,"jack",22,7000); ...

  4. 【软件工程】Alpha冲刺(1/6)

    链接部分 队名:女生都队 组长博客: 博客链接 作业博客:博客链接 小组内容 恩泽(组长) 过去两天完成了哪些任务 描述 了解了反馈机制的实现原理 确定好算法的框架 对接口的规范化进行学习 展示Git ...

  5. svn 巧用,如果遇到问题解决不了,而上一个版本可以正常使用,则可以查记录

    svn 巧用,如果遇到问题解决不了 1.svn上一个版本可以正常使用的情况下 2.查看历史 3. 丢失的代码复制回来即可

  6. web前端知识点反思总结

    当别人问你之前的知识,我们便会勾起之前的回忆,然后进行一番痛苦的挣扎后,发现我依然记得你 什么是 DTD ? 文档类型定义 (DTD) 可定义合法的 xml 文档的构建模块 ,他是使用一系列合法的元素 ...

  7. mongodb aggregate 聚合 操作(扁平化flatten)

    mongodb自带的函数非常多,最近用mongo做持久化数据库,遇到一个需求:子文档是个数组,把数组里的各个字段扁平化合到根文档中,查过资料后(主要是mongodb的文档和stackoverflow) ...

  8. python - paramiko模块 修改logging提示为静默

    import paramiko import logging log = paramiko.util.get_logger("paramiko") log.setLevel(log ...

  9. Systemd 指令

    Systemd 指令 原文:http://www.ruanyifeng.com/blog/2016/03/systemd-tutorial-commands.html 一.由来 历史上,Linux 的 ...

  10. linux下抓取tomcat相关内存、线程、文件句柄等快照,用于故障排除。

    以下脚本推荐放在定时任务里,写好cron表达式,在不影响业务系统的情况下dump一些信息分析系统性能瓶颈以及故障排除. 因为每次dump的时候jvm会暂停(几秒到几十秒不等).所以在生产系统使用时慎用 ...