{"id":15029204,"url":"https://github.com/halfrost/leetcode-go","last_synced_at":"2025-05-14T07:02:45.230Z","repository":{"id":37346027,"uuid":"97533102","full_name":"halfrost/LeetCode-Go","owner":"halfrost","description":"✅ Solutions to LeetCode by Go, 100% test coverage, runtime beats 100% / LeetCode 题解","archived":false,"fork":false,"pushed_at":"2024-12-11T05:55:51.000Z","size":19315,"stargazers_count":33503,"open_issues_count":20,"forks_count":5772,"subscribers_count":627,"default_branch":"master","last_synced_at":"2025-05-07T06:59:55.076Z","etag":null,"topics":["acm-icpc","algo","algorithm","algorithm-competitions","algorithms","algorithms-and-data-structures","dynamic-programming","facebook","go","golang","interview-questions","leetcode","leetcode-go","leetcode-golang","leetcode-solutions","math","pattern"],"latest_commit_sha":null,"homepage":"https://books.halfrost.com/leetcode","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/halfrost.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":".github/FUNDING.yml","license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null},"funding":{"github":["halfrost"],"patreon":null,"open_collective":null,"ko_fi":null,"tidelift":null,"community_bridge":null,"liberapay":null,"issuehunt":null,"otechie":null,"lfx_crowdfunding":null,"custom":null}},"created_at":"2017-07-18T00:06:14.000Z","updated_at":"2025-05-07T06:04:50.000Z","dependencies_parsed_at":"2023-02-02T19:47:32.298Z","dependency_job_id":"7f90f7de-d2f9-4db0-ad54-3fd4418cdbfd","html_url":"https://github.com/halfrost/LeetCode-Go","commit_stats":{"total_commits":1461,"total_committers":53,"mean_commits":"27.566037735849058","dds":0.2080766598220397,"last_synced_commit":"25c03cf13afa6ffb2bb305940c9bced152214536"},"previous_names":[],"tags_count":5,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/halfrost%2FLeetCode-Go","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/halfrost%2FLeetCode-Go/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/halfrost%2FLeetCode-Go/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/halfrost%2FLeetCode-Go/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/halfrost","download_url":"https://codeload.github.com/halfrost/LeetCode-Go/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254092648,"owners_count":22013290,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["acm-icpc","algo","algorithm","algorithm-competitions","algorithms","algorithms-and-data-structures","dynamic-programming","facebook","go","golang","interview-questions","leetcode","leetcode-go","leetcode-golang","leetcode-solutions","math","pattern"],"created_at":"2024-09-24T20:09:57.411Z","updated_at":"2025-05-14T07:02:43.735Z","avatar_url":"https://github.com/halfrost.png","language":"Go","funding_links":["https://github.com/sponsors/halfrost"],"categories":[],"sub_categories":[],"readme":"\n# LeetCode in Go\n[LeetCode Online Judge](https://leetcode.com/) is a website containing many **algorithm questions**. Most of them are real interview questions of **Google, Facebook, LinkedIn, Apple**, etc. and it always help to sharp our algorithm Skills. Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. This repo shows my solutions in Go with the code style strictly follows the [Google Golang Style Guide](https://github.com/golang/go/wiki/CodeReviewComments). Please feel free to reference and **STAR** to support this repo, thank you!\n\n\n\u003cp align='center'\u003e\n\u003cimg src='./logo.png'\u003e\n\u003c/p\u003e\n\n![](./website/static/wechat-qr-code.png)\n\n\u003cp align='center'\u003e\n\u003ca href=\"https://github.com/halfrost/leetcode-go/releases/\" rel=\"nofollow\"\u003e\u003cimg alt=\"GitHub All Releases\" src=\"https://img.shields.io/github/downloads/halfrost/LeetCode-Go/total?label=PDF%20downloads\"\u003e\u003c/a\u003e\n\u003cimg src=\"https://img.shields.io/badge/Total%20Word%20Count-738884-success\"\u003e\n\u003ca href=\"https://github.com/halfrost/leetcode-go/actions\" rel=\"nofollow\"\u003e\u003cimg src=\"https://github.com/halfrost/leetcode-go/workflows/Deploy%20leetcode-cookbook/badge.svg?branch=master\"\u003e\u003c/a\u003e\n\u003ca href=\"https://travis-ci.org/github/halfrost/LeetCode-Go\" rel=\"nofollow\"\u003e\u003cimg src=\"https://travis-ci.org/halfrost/LeetCode-Go.svg?branch=master\"\u003e\u003c/a\u003e\n\u003ca href=\"https://goreportcard.com/report/github.com/halfrost/LeetCode-Go\" rel=\"nofollow\"\u003e\u003cimg src=\"https://goreportcard.com/badge/github.com/halfrost/LeetCode-Go\"\u003e\u003c/a\u003e\n\u003cimg src=\"https://img.shields.io/badge/runtime%20beats-100%25-success\"\u003e\n\u003ca href=\"https://codecov.io/gh/halfrost/LeetCode-Go\"\u003e\u003cimg src=\"https://codecov.io/gh/halfrost/LeetCode-Go/branch/master/graph/badge.svg\" /\u003e\u003c/a\u003e\n\u003c!--\u003cimg alt=\"GitHub go.mod Go version\" src=\"https://img.shields.io/github/go-mod/go-version/halfrost/LeetCode-Go?color=26C2F0\"\u003e--\u003e\n\u003cimg alt=\"Support Go version\" src=\"https://img.shields.io/badge/Go-v1.15-26C2F0\"\u003e\n\u003cimg src=\"https://visitor-badge.laobi.icu/badge?page_id=halfrost.LeetCode-Go\"\u003e\n\u003c/p\u003e\n\n\u003cp align='center'\u003e\n\u003ca href=\"https://github.com/halfrost/leetcode-go/blob/master/LICENSE\"\u003e\u003cimg alt=\"GitHub\" src=\"https://img.shields.io/github/license/halfrost/LeetCode-Go?label=License\"\u003e\u003c/a\u003e\n\u003cimg src=\"https://img.shields.io/badge/License-CC-000000.svg\"\u003e\n\u003ca href=\"https://leetcode.com/halfrost/\"\u003e\u003cimg src=\"https://img.shields.io/badge/@halfrost-8751-yellow.svg\"\u003e\n\u003cimg src=\"https://img.shields.io/badge/language-Golang-26C2F0.svg\"\u003e\n\u003ca href=\"https://halfrost.com\"\u003e\u003cimg src=\"https://img.shields.io/badge/Blog-Halfrost--Field-80d4f9.svg?style=flat\"\u003e\u003c/a\u003e\n\u003ca href=\"http://weibo.com/halfrost\"\u003e\u003cimg src=\"https://img.shields.io/badge/weibo-@halfrost-f974ce.svg?style=flat\u0026colorA=f4292e\"\u003e\u003c/a\u003e\n\u003ca href=\"https://twitter.com/halffrost\"\u003e\u003cimg src=\"https://img.shields.io/badge/twitter-@halffrost-F8E81C.svg?style=flat\u0026colorA=009df2\"\u003e\u003c/a\u003e\n\u003ca href=\"https://www.zhihu.com/people/halfrost/activities\"\u003e\u003cimg src=\"https://img.shields.io/badge/%E7%9F%A5%E4%B9%8E-@halfrost-fd6f32.svg?style=flat\u0026colorA=0083ea\"\u003e\u003c/a\u003e\n\u003cimg src=\"https://img.shields.io/badge/made%20with-=1-blue.svg\"\u003e\n\u003ca href=\"https://github.com/halfrost/LeetCode-Go/pulls\"\u003e\u003cimg src=\"https://img.shields.io/badge/PR-Welcome-brightgreen.svg\"\u003e\u003c/a\u003e\n\u003c/p\u003e\n\n支持 Progressive Web Apps 和 Dark Mode 的题解电子书《LeetCode Cookbook》 \u003ca href=\"https://books.halfrost.com/leetcode/\" rel=\"nofollow\"\u003eOnline Reading\u003c/a\u003e\n\n\u003cp align='center'\u003e\n\u003ca href=\"https://books.halfrost.com/leetcode/\"\u003e\u003cimg src=\"https://img.halfrost.com/Leetcode/Cookbook_Safari_0.png\"\u003e\u003c/a\u003e\n\u003ca href=\"https://books.halfrost.com/leetcode/\"\u003e\u003cimg src=\"https://img.halfrost.com/Leetcode/Cookbook_Chrome_PWA.png\"\u003e\u003c/a\u003e\n\u003c/p\u003e\n\n离线版本的电子书《LeetCode Cookbook》PDF \u003ca href=\"https://github.com/halfrost/LeetCode-Go/releases/\" rel=\"nofollow\"\u003eDownload here\u003c/a\u003e\n\n\u003cp align='center'\u003e\n\u003ca href=\"https://github.com/halfrost/LeetCode-Go/releases/\"\u003e\u003cimg src=\"https://img.halfrost.com/Leetcode/Cookbook.png\"\u003e\u003c/a\u003e\n\u003c/p\u003e\n\n通过 iOS / Android 浏览器安装 PWA 版《LeetCode Cookbook》至设备桌面随时学习\n\n\u003cp align='center'\u003e\n\u003ca href=\"https://books.halfrost.com/leetcode/\"\u003e\u003cimg src=\"https://img.halfrost.com/Leetcode/Cookbook_PWA_iPad.png\"\u003e\u003c/a\u003e\n\u003ca href=\"https://books.halfrost.com/leetcode/\"\u003e\u003cimg src=\"https://img.halfrost.com/Leetcode/Cookbook_PWA_iPad_example1__.png\"\u003e\u003c/a\u003e\n\u003ca href=\"https://books.halfrost.com/leetcode/\"\u003e\u003cimg src=\"https://img.halfrost.com/Leetcode/Cookbook_PWA_iPad_example2__.png\"\u003e\u003c/a\u003e\n\u003c/p\u003e\n\n\n## Data Structures\n\n\u003e 标识了 ✅ 的专题是完成所有题目了的，没有标识的是还没有做完所有题目的\n\n\u003ca href=\"https://books.halfrost.com/leetcode/\"\u003e\u003cimg src=\"./website/static/logo.png\" alt=\"logo\" height=\"550\" align=\"right\" /\u003e\u003c/a\u003e\n\n* [Array](#array)\n* [String](#string)\n* [✅ Two Pointers](#two-pointers)\n* [✅ Linked List](#linked-list)\n* [✅ Stack](#stack)\n* [Tree](#tree)\n* [Dynamic programming](#dynamic-programming)\n* [✅ Backtracking](#backtracking)\n* [Depth First Search](#depth-first-search)\n* [Breadth First Search](#breadth-first-search)\n* [Binary Search](#binary-search)\n* [Math](#math)\n* [Hash Table](#hash-table)\n* [✅ Sort](#sort)\n* [✅ Bit Manipulation](#bit-manipulation)\n* [✅ Union Find](#union-find)\n* [✅ Sliding Window](#sliding-window)\n* [✅ Segment Tree](#segment-tree)\n* [✅ Binary Indexed Tree](#binary-indexed-tree)\n\n\u003cbr\u003e\n\u003cbr\u003e\n\n| 数据结构 | 变种 | 相关题目 | 讲解文章 | \n|:-------:|:-------|:------|:------|\n|顺序线性表：向量||||\n|单链表|1. 双向链表\u003cbr\u003e2. 静态链表\u003cbr\u003e3. 对称矩阵\u003cbr\u003e4. 稀疏矩阵|||\n|哈希表|1. 散列函数\u003cbr\u003e2. 解决碰撞/填充因子\u003cbr\u003e|||\n|栈和队列|1. 广义栈\u003cbr\u003e2. 双端队列\u003cbr\u003e|||\n|队列|1. 链表实现\u003cbr\u003e2. 循环数组实现\u003cbr\u003e3. 双端队列|||\n|字符串|1. KMP算法\u003cbr\u003e2. 有限状态自动机\u003cbr\u003e3. 模式匹配有限状态自动机\u003cbr\u003e4. BM 模式匹配算法\u003cbr\u003e5. BM-KMP 算法\u003cbr\u003e6. BF 算法|||\n|树|1. 二叉树\u003cbr\u003e2. 并查集\u003cbr\u003e3. Huffman 树|||\n|数组实现的堆|1. 极大堆和极小堆\u003cbr\u003e2. 极大极小堆\u003cbr\u003e3. 双端堆\u003cbr\u003e4. d 叉堆|||\n|树实现的堆|1. 左堆\u003cbr\u003e2. 扁堆\u003cbr\u003e3. 二项式堆\u003cbr\u003e4. 斐波那契堆\u003cbr\u003e5. 配对堆|||\n|查找|1. 哈希表\u003cbr\u003e2. 跳跃表\u003cbr\u003e3. 排序二叉树\u003cbr\u003e4. AVL 树\u003cbr\u003e5. B 树 / B+ 树 / B* 树\u003cbr\u003e6. AA 树\u003cbr\u003e7. 红黑树\u003cbr\u003e8. 排序二叉堆\u003cbr\u003e9. Splay 树\u003cbr\u003e10. 双链树\u003cbr\u003e11. Trie 树\u003cbr\u003e12. R 树|||\n|--------------------------------------------|--------------------------------------------------------------------------------------------|---------------------------|-----------------------------------|\n\n\n## Algorithm\n\n\n| 算法 | 具体类型 | 相关题目 | 讲解文章 | \n|:-------:|:-------|:------|:------|\n|排序算法|1. 冒泡排序\u003cbr\u003e2. 插入排序\u003cbr\u003e3. 选择排序\u003cbr\u003e4. 希尔 Shell 排序\u003cbr\u003e5. 快速排序\u003cbr\u003e6. 归并排序\u003cbr\u003e7. 堆排序\u003cbr\u003e8. 线性排序算法\u003cbr\u003e9. 自省排序\u003cbr\u003e10. 间接排序\u003cbr\u003e11. 计数排序\u003cbr\u003e12. 基数排序\u003cbr\u003e13. 桶排序\u003cbr\u003e14. 外部排序 - k 路归并败者树\u003cbr\u003e15. 外部排序 - 最佳归并树|||\n|递归与分治||1. 二分搜索/查找\u003cbr\u003e2. 大整数的乘法\u003cbr\u003e3. Strassen 矩阵乘法\u003cbr\u003e4. 棋盘覆盖\u003cbr\u003e5. 合并排序\u003cbr\u003e6. 快速排序\u003cbr\u003e7. 线性时间选择\u003cbr\u003e8. 最接近点对问题\u003cbr\u003e9. 循环赛日程表\u003cbr\u003e||\n|动态规划||1. 矩阵连乘问题\u003cbr\u003e2. 最长公共子序列\u003cbr\u003e3. 最大子段和\u003cbr\u003e4. 凸多边形最优三角剖分\u003cbr\u003e5. 多边形游戏\u003cbr\u003e6. 图像压缩\u003cbr\u003e7. 电路布线\u003cbr\u003e8. 流水作业调度\u003cbr\u003e9. 0-1 背包问题/背包九讲\u003cbr\u003e10. 最优二叉搜索树\u003cbr\u003e11. 动态规划加速原理\u003cbr\u003e12. 树型 DP\u003cbr\u003e||\n|贪心||1. 活动安排问题\u003cbr\u003e2. 最优装载\u003cbr\u003e3. 哈夫曼编码\u003cbr\u003e4. 单源最短路径\u003cbr\u003e5. 最小生成树\u003cbr\u003e6. 多机调度问题\u003cbr\u003e||\n|回溯法||1. 装载问题\u003cbr\u003e2. 批处理作业调度\u003cbr\u003e3. 符号三角形问题\u003cbr\u003e4. n 后问题\u003cbr\u003e5. 0-1 背包问题\u003cbr\u003e6. 最大团问题\u003cbr\u003e7. 图的 m 着色问题\u003cbr\u003e8. 旅行售货员问题\u003cbr\u003e9. 圆排列问题\u003cbr\u003e10. 电路板排列问题\u003cbr\u003e11. 连续邮资问题\u003cbr\u003e||\n|搜索|1. 枚举\u003cbr\u003e2. DFS\u003cbr\u003e3. BFS\u003cbr\u003e4. 启发式搜索\u003cbr\u003e|||\n|随机化|1. 随机数\u003cbr\u003e2. 数值随机化算法\u003cbr\u003e3. Sherwood 舍伍德算法\u003cbr\u003e4. Las Vegas 拉斯维加斯算法\u003cbr\u003e5. Monte Carlo 蒙特卡罗算法\u003cbr\u003e|1. 计算 π 值\u003cbr\u003e2. 计算定积分\u003cbr\u003e3. 解非线性方程组\u003cbr\u003e4. 线性时间选择算法\u003cbr\u003e5. 跳跃表\u003cbr\u003e6. n 后问题\u003cbr\u003e7. 整数因子分解\u003cbr\u003e8. 主元素问题\u003cbr\u003e9. 素数测试\u003cbr\u003e||\n|图论|1. 遍历 DFS / BFS\u003cbr\u003e2. AOV / AOE 网络\u003cbr\u003e3. Kruskal 算法(最小生成树)\u003cbr\u003e4. Prim 算法(最小生成树)\u003cbr\u003e5. Boruvka 算法(最小生成树)\u003cbr\u003e6. Dijkstra 算法(单源最短路径)\u003cbr\u003e7. Bellman-Ford 算法(单源最短路径)\u003cbr\u003e8. SPFA 算法(单源最短路径)\u003cbr\u003e9. Floyd 算法(多源最短路径)\u003cbr\u003e10. Johnson 算法(多源最短路径)\u003cbr\u003e11. Fleury 算法(欧拉回路)\u003cbr\u003e12. Ford-Fulkerson 算法(最大网络流增广路)\u003cbr\u003e13. Edmonds-Karp 算法(最大网络流)\u003cbr\u003e14. Dinic 算法(最大网络流)\u003cbr\u003e15. 一般预流推进算法\u003cbr\u003e16. 最高标号预流推进 HLPP 算法\u003cbr\u003e17. Primal-Dual 原始对偶算法(最小费用流)18. Kosaraju 算法(有向图强连通分量)\u003cbr\u003e19. Tarjan 算法(有向图强连通分量)\u003cbr\u003e20. Gabow 算法(有向图强连通分量)\u003cbr\u003e21. 匈牙利算法(二分图匹配)\u003cbr\u003e22. Hopcroft－Karp 算法(二分图匹配)\u003cbr\u003e23. kuhn munkras 算法(二分图最佳匹配)\u003cbr\u003e24. Edmonds’ Blossom-Contraction 算法(一般图匹配)\u003cbr\u003e|1. 图遍历\u003cbr\u003e2. 有向图和无向图的强弱连通性\u003cbr\u003e3. 割点/割边\u003cbr\u003e3. AOV 网络和拓扑排序\u003cbr\u003e4. AOE 网络和关键路径\u003cbr\u003e5. 最小代价生成树/次小生成树\u003cbr\u003e6. 最短路径问题/第 K 短路问题\u003cbr\u003e7. 最大网络流问题\u003cbr\u003e8. 最小费用流问题\u003cbr\u003e9. 图着色问题\u003cbr\u003e10. 差分约束系统\u003cbr\u003e11. 欧拉回路\u003cbr\u003e12. 中国邮递员问题\u003cbr\u003e13. 汉密尔顿回路\u003cbr\u003e14. 最佳边割集/最佳点割集/最小边割集/最小点割集/最小路径覆盖/最小点集覆盖 \u003cbr\u003e15. 边覆盖集\u003cbr\u003e16. 二分图完美匹配和最大匹配问题\u003cbr\u003e17. 仙人掌图\u003cbr\u003e18. 弦图\u003cbr\u003e19. 稳定婚姻问题\u003cbr\u003e20. 最大团问题\u003cbr\u003e||\n|数论||1. 最大公约数\u003cbr\u003e 2. 最小公倍数\u003cbr\u003e3. 分解质因数\u003cbr\u003e4. 素数判定\u003cbr\u003e5. 进制转换\u003cbr\u003e6. 高精度计算\u003cbr\u003e7. 整除问题\u003cbr\u003e8. 同余问题\u003cbr\u003e9. 欧拉函数\u003cbr\u003e10. 扩展欧几里得\u003cbr\u003e11. 置换群\u003cbr\u003e12. 母函数\u003cbr\u003e13. 离散变换\u003cbr\u003e14. 康托展开\u003cbr\u003e15. 矩阵\u003cbr\u003e16. 向量\u003cbr\u003e17. 线性方程组\u003cbr\u003e18. 线性规划\u003cbr\u003e ||\n|几何||1. 凸包 - Gift wrapping\u003cbr\u003e2. 凸包 - Graham scan\u003cbr\u003e3. 线段问题\u003cbr\u003e 4. 多边形和多面体相关问题\u003cbr\u003e||\n|NP 完全|1. 计算模型\u003cbr\u003e2. P 类与 NP 类问题\u003cbr\u003e3. NP 完全问题\u003cbr\u003e4. NP 完全问题的近似算法\u003cbr\u003e|1. 随机存取机 RAM\u003cbr\u003e2. 随机存取存储程序机 RASP\u003cbr\u003e3. 图灵机\u003cbr\u003e4. 非确定性图灵机\u003cbr\u003e5. P 类与 NP 类语言\u003cbr\u003e6. 多项式时间验证\u003cbr\u003e7. 多项式时间变换\u003cbr\u003e8. Cook定理\u003cbr\u003e9. 合取范式的可满足性问题 CNF-SAT\u003cbr\u003e10. 3 元合取范式的可满足性问题 3-SAT\u003cbr\u003e11. 团问题 CLIQUE\u003cbr\u003e12. 顶点覆盖问题 VERTEX-COVER\u003cbr\u003e13. 子集和问题 SUBSET-SUM\u003cbr\u003e14. 哈密顿回路问题 HAM-CYCLE\u003cbr\u003e15. 旅行售货员问题 TSP\u003cbr\u003e16. 顶点覆盖问题的近似算法\u003cbr\u003e17. 旅行售货员问题近似算法\u003cbr\u003e18. 具有三角不等式性质的旅行售货员问题\u003cbr\u003e19. 一般的旅行售货员问题\u003cbr\u003e20. 集合覆盖问题的近似算法\u003cbr\u003e21. 子集和问题的近似算法\u003cbr\u003e22. 子集和问题的指数时间算法\u003cbr\u003e23. 子集和问题的多项式时间近似格式\u003cbr\u003e||\n|------------|------------------------------------------------------------------|-----------------------------------------------------------------|--------------------|\n\n\n## LeetCode Problems\n\n## 一. 个人数据\n\n|    |  Easy  |  Medium  |  Hard |  Total |\n|:--------:|:--------:|:--------:|:--------:|:--------:|\n|Optimizing|31|78|43|152|\n|Accepted|**287**|**484**|**142**|**913**|\n|Total|600|1305|539|2444|\n|Perfection Rate|89.2%|83.9%|69.7%|83.4%|\n|Completion Rate|47.8%|37.1%|26.3%|37.4%|\n|------------|----------------------------|----------------------------|----------------------------|----------------------------|\n\n## 二. 目录\n\n以下已经收录了 787 道题的题解，还有 11 道题在尝试优化到 beats 100%\n\n| No.    |  Title  |  Solution  |  Acceptance |  Difficulty |  Frequency |\n|:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:|\n|0001|Two Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0001.Two-Sum)|49.1%|Easy||\n|0002|Add Two Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0002.Add-Two-Numbers)|39.7%|Medium||\n|0003|Longest Substring Without Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters)|33.8%|Medium||\n|0004|Median of Two Sorted Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0004.Median-of-Two-Sorted-Arrays)|35.1%|Hard||\n|0005|Longest Palindromic Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0005.Longest-Palindromic-Substring)|32.4%|Medium||\n|0006|Zigzag Conversion|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0006.Zigzag-Conversion)|43.0%|Medium||\n|0007|Reverse Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0007.Reverse-Integer)|27.2%|Medium||\n|0008|String to Integer (atoi)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0008.String-to-Integer-atoi)|16.6%|Medium||\n|0009|Palindrome Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0009.Palindrome-Number)|52.8%|Easy||\n|0010|Regular Expression Matching||28.3%|Hard||\n|0011|Container With Most Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water)|54.3%|Medium||\n|0012|Integer to Roman|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0012.Integer-to-Roman)|60.5%|Medium||\n|0013|Roman to Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0013.Roman-to-Integer)|58.2%|Easy||\n|0014|Longest Common Prefix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0014.Longest-Common-Prefix)|40.7%|Easy||\n|0015|3Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0015.3Sum)|32.2%|Medium||\n|0016|3Sum Closest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0016.3Sum-Closest)|46.2%|Medium||\n|0017|Letter Combinations of a Phone Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0017.Letter-Combinations-of-a-Phone-Number)|55.5%|Medium||\n|0018|4Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0018.4Sum)|36.5%|Medium||\n|0019|Remove Nth Node From End of List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0019.Remove-Nth-Node-From-End-of-List)|39.9%|Medium||\n|0020|Valid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0020.Valid-Parentheses)|40.7%|Easy||\n|0021|Merge Two Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0021.Merge-Two-Sorted-Lists)|61.8%|Easy||\n|0022|Generate Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0022.Generate-Parentheses)|71.7%|Medium||\n|0023|Merge k Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0023.Merge-k-Sorted-Lists)|48.3%|Hard||\n|0024|Swap Nodes in Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0024.Swap-Nodes-in-Pairs)|60.3%|Medium||\n|0025|Reverse Nodes in k-Group|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0025.Reverse-Nodes-in-k-Group)|53.4%|Hard||\n|0026|Remove Duplicates from Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0026.Remove-Duplicates-from-Sorted-Array)|50.3%|Easy||\n|0027|Remove Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0027.Remove-Element)|52.0%|Easy||\n|0028|Find the Index of the First Occurrence in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String)|37.4%|Medium||\n|0029|Divide Two Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0029.Divide-Two-Integers)|17.4%|Medium||\n|0030|Substring with Concatenation of All Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0030.Substring-with-Concatenation-of-All-Words)|30.9%|Hard||\n|0031|Next Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0031.Next-Permutation)|37.1%|Medium||\n|0032|Longest Valid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0032.Longest-Valid-Parentheses)|32.7%|Hard||\n|0033|Search in Rotated Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0033.Search-in-Rotated-Sorted-Array)|38.6%|Medium||\n|0034|Find First and Last Position of Element in Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array)|41.5%|Medium||\n|0035|Search Insert Position|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0035.Search-Insert-Position)|42.0%|Easy||\n|0036|Valid Sudoku|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0036.Valid-Sudoku)|56.7%|Medium||\n|0037|Sudoku Solver|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0037.Sudoku-Solver)|56.6%|Hard||\n|0038|Count and Say||51.1%|Medium||\n|0039|Combination Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0039.Combination-Sum)|67.5%|Medium||\n|0040|Combination Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0040.Combination-Sum-II)|53.3%|Medium||\n|0041|First Missing Positive|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0041.First-Missing-Positive)|36.5%|Hard||\n|0042|Trapping Rain Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water)|58.7%|Hard||\n|0043|Multiply Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0043.Multiply-Strings)|38.7%|Medium||\n|0044|Wildcard Matching||26.8%|Hard||\n|0045|Jump Game II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0045.Jump-Game-II)|38.5%|Medium||\n|0046|Permutations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0046.Permutations)|74.6%|Medium||\n|0047|Permutations II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0047.Permutations-II)|56.6%|Medium||\n|0048|Rotate Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0048.Rotate-Image)|69.8%|Medium||\n|0049|Group Anagrams|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0049.Group-Anagrams)|65.9%|Medium||\n|0050|Pow(x, n)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0050.Powx-n)|32.8%|Medium||\n|0051|N-Queens|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0051.N-Queens)|62.8%|Hard||\n|0052|N-Queens II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0052.N-Queens-II)|70.8%|Hard||\n|0053|Maximum Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray)|50.0%|Medium||\n|0054|Spiral Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix)|43.6%|Medium||\n|0055|Jump Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0055.Jump-Game)|38.4%|Medium||\n|0056|Merge Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0056.Merge-Intervals)|45.9%|Medium||\n|0057|Insert Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0057.Insert-Interval)|37.9%|Medium||\n|0058|Length of Last Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0058.Length-of-Last-Word)|40.3%|Easy||\n|0059|Spiral Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0059.Spiral-Matrix-II)|66.5%|Medium||\n|0060|Permutation Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0060.Permutation-Sequence)|43.7%|Hard||\n|0061|Rotate List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0061.Rotate-List)|35.7%|Medium||\n|0062|Unique Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0062.Unique-Paths)|62.2%|Medium||\n|0063|Unique Paths II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0063.Unique-Paths-II)|39.1%|Medium||\n|0064|Minimum Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0064.Minimum-Path-Sum)|60.6%|Medium||\n|0065|Valid Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0065.Valid-Number)|18.6%|Hard||\n|0066|Plus One|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0066.Plus-One)|43.3%|Easy||\n|0067|Add Binary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0067.Add-Binary)|51.3%|Easy||\n|0068|Text Justification||36.6%|Hard||\n|0069|Sqrt(x)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0069.Sqrtx)|37.0%|Easy||\n|0070|Climbing Stairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0070.Climbing-Stairs)|51.7%|Easy||\n|0071|Simplify Path|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0071.Simplify-Path)|39.2%|Medium||\n|0072|Edit Distance||52.6%|Hard||\n|0073|Set Matrix Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0073.Set-Matrix-Zeroes)|49.9%|Medium||\n|0074|Search a 2D Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0074.Search-a-2D-Matrix)|46.7%|Medium||\n|0075|Sort Colors|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0075.Sort-Colors)|57.1%|Medium||\n|0076|Minimum Window Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring)|40.0%|Hard||\n|0077|Combinations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0077.Combinations)|66.0%|Medium||\n|0078|Subsets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets)|73.7%|Medium||\n|0079|Word Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0079.Word-Search)|39.8%|Medium||\n|0080|Remove Duplicates from Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II)|51.5%|Medium||\n|0081|Search in Rotated Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0081.Search-in-Rotated-Sorted-Array-II)|35.7%|Medium||\n|0082|Remove Duplicates from Sorted List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0082.Remove-Duplicates-from-Sorted-List-II)|45.4%|Medium||\n|0083|Remove Duplicates from Sorted List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0083.Remove-Duplicates-from-Sorted-List)|49.8%|Easy||\n|0084|Largest Rectangle in Histogram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0084.Largest-Rectangle-in-Histogram)|42.1%|Hard||\n|0085|Maximal Rectangle||44.1%|Hard||\n|0086|Partition List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0086.Partition-List)|51.3%|Medium||\n|0087|Scramble String||36.1%|Hard||\n|0088|Merge Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0088.Merge-Sorted-Array)|45.7%|Easy||\n|0089|Gray Code|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0089.Gray-Code)|56.4%|Medium||\n|0090|Subsets II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0090.Subsets-II)|55.2%|Medium||\n|0091|Decode Ways|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0091.Decode-Ways)|32.2%|Medium||\n|0092|Reverse Linked List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II)|45.3%|Medium||\n|0093|Restore IP Addresses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0093.Restore-IP-Addresses)|43.3%|Medium||\n|0094|Binary Tree Inorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0094.Binary-Tree-Inorder-Traversal)|72.9%|Easy||\n|0095|Unique Binary Search Trees II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0095.Unique-Binary-Search-Trees-II)|51.4%|Medium||\n|0096|Unique Binary Search Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0096.Unique-Binary-Search-Trees)|59.2%|Medium||\n|0097|Interleaving String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0097.Interleaving-String)|37.1%|Medium||\n|0098|Validate Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0098.Validate-Binary-Search-Tree)|31.7%|Medium||\n|0099|Recover Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0099.Recover-Binary-Search-Tree)|50.2%|Medium||\n|0100|Same Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0100.Same-Tree)|56.3%|Easy||\n|0101|Symmetric Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree)|52.8%|Easy||\n|0102|Binary Tree Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0102.Binary-Tree-Level-Order-Traversal)|63.2%|Medium||\n|0103|Binary Tree Zigzag Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal)|55.0%|Medium||\n|0104|Maximum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0104.Maximum-Depth-of-Binary-Tree)|73.0%|Easy||\n|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal)|60.6%|Medium||\n|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal)|57.3%|Medium||\n|0107|Binary Tree Level Order Traversal II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0107.Binary-Tree-Level-Order-Traversal-II)|60.2%|Medium||\n|0108|Convert Sorted Array to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree)|68.9%|Easy||\n|0109|Convert Sorted List to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree)|57.2%|Medium||\n|0110|Balanced Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0110.Balanced-Binary-Tree)|48.1%|Easy||\n|0111|Minimum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree)|43.5%|Easy||\n|0112|Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0112.Path-Sum)|47.6%|Easy||\n|0113|Path Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0113.Path-Sum-II)|56.5%|Medium||\n|0114|Flatten Binary Tree to Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0114.Flatten-Binary-Tree-to-Linked-List)|61.0%|Medium||\n|0115|Distinct Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0115.Distinct-Subsequences)|43.7%|Hard||\n|0116|Populating Next Right Pointers in Each Node|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node)|59.3%|Medium||\n|0117|Populating Next Right Pointers in Each Node II||49.6%|Medium||\n|0118|Pascal's Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0118.Pascals-Triangle)|68.9%|Easy||\n|0119|Pascal's Triangle II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0119.Pascals-Triangle-II)|59.5%|Easy||\n|0120|Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0120.Triangle)|53.8%|Medium||\n|0121|Best Time to Buy and Sell Stock|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock)|54.5%|Easy||\n|0122|Best Time to Buy and Sell Stock II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II)|63.2%|Medium||\n|0123|Best Time to Buy and Sell Stock III||44.8%|Hard||\n|0124|Binary Tree Maximum Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0124.Binary-Tree-Maximum-Path-Sum)|38.4%|Hard||\n|0125|Valid Palindrome|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0125.Valid-Palindrome)|43.5%|Easy||\n|0126|Word Ladder II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II)|27.6%|Hard||\n|0127|Word Ladder|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0127.Word-Ladder)|36.6%|Hard||\n|0128|Longest Consecutive Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0128.Longest-Consecutive-Sequence)|49.0%|Medium||\n|0129|Sum Root to Leaf Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0129.Sum-Root-to-Leaf-Numbers)|58.6%|Medium||\n|0130|Surrounded Regions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0130.Surrounded-Regions)|35.8%|Medium||\n|0131|Palindrome Partitioning|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0131.Palindrome-Partitioning)|62.3%|Medium||\n|0132|Palindrome Partitioning II||33.6%|Hard||\n|0133|Clone Graph||50.5%|Medium||\n|0134|Gas Station||45.0%|Medium||\n|0135|Candy|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0135.Candy)|40.7%|Hard||\n|0136|Single Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0136.Single-Number)|70.0%|Easy||\n|0137|Single Number II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0137.Single-Number-II)|57.7%|Medium||\n|0138|Copy List with Random Pointer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0138.Copy-List-with-Random-Pointer)|50.4%|Medium||\n|0139|Word Break||45.4%|Medium||\n|0140|Word Break II||44.3%|Hard||\n|0141|Linked List Cycle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0141.Linked-List-Cycle)|46.8%|Easy||\n|0142|Linked List Cycle II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0142.Linked-List-Cycle-II)|46.2%|Medium||\n|0143|Reorder List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0143.Reorder-List)|50.9%|Medium||\n|0144|Binary Tree Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0144.Binary-Tree-Preorder-Traversal)|64.5%|Easy||\n|0145|Binary Tree Postorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0145.Binary-Tree-Postorder-Traversal)|66.5%|Easy||\n|0146|LRU Cache|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0146.LRU-Cache)|40.5%|Medium||\n|0147|Insertion Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0147.Insertion-Sort-List)|50.1%|Medium||\n|0148|Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0148.Sort-List)|54.0%|Medium||\n|0149|Max Points on a Line||21.7%|Hard||\n|0150|Evaluate Reverse Polish Notation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0150.Evaluate-Reverse-Polish-Notation)|44.1%|Medium||\n|0151|Reverse Words in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0151.Reverse-Words-in-a-String)|30.2%|Medium||\n|0152|Maximum Product Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0152.Maximum-Product-Subarray)|34.9%|Medium||\n|0153|Find Minimum in Rotated Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array)|48.4%|Medium||\n|0154|Find Minimum in Rotated Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II)|43.4%|Hard||\n|0155|Min Stack|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0155.Min-Stack)|51.7%|Medium||\n|0156|Binary Tree Upside Down||61.5%|Medium||\n|0157|Read N Characters Given Read4||40.7%|Easy||\n|0158|Read N Characters Given read4 II - Call Multiple Times||41.4%|Hard||\n|0159|Longest Substring with At Most Two Distinct Characters||53.5%|Medium||\n|0160|Intersection of Two Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0160.Intersection-of-Two-Linked-Lists)|53.1%|Easy||\n|0161|One Edit Distance||34.1%|Medium||\n|0162|Find Peak Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0162.Find-Peak-Element)|46.2%|Medium||\n|0163|Missing Ranges||31.9%|Easy||\n|0164|Maximum Gap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0164.Maximum-Gap)|42.6%|Hard||\n|0165|Compare Version Numbers||35.3%|Medium||\n|0166|Fraction to Recurring Decimal||24.0%|Medium||\n|0167|Two Sum II - Input Array Is Sorted|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0167.Two-Sum-II-Input-Array-Is-Sorted)|60.0%|Medium||\n|0168|Excel Sheet Column Title|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0168.Excel-Sheet-Column-Title)|34.7%|Easy||\n|0169|Majority Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0169.Majority-Element)|63.8%|Easy||\n|0170|Two Sum III - Data structure design||37.3%|Easy||\n|0171|Excel Sheet Column Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0171.Excel-Sheet-Column-Number)|61.3%|Easy||\n|0172|Factorial Trailing Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0172.Factorial-Trailing-Zeroes)|41.6%|Medium||\n|0173|Binary Search Tree Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0173.Binary-Search-Tree-Iterator)|69.0%|Medium||\n|0174|Dungeon Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0174.Dungeon-Game)|37.2%|Hard||\n|0175|Combine Two Tables||72.8%|Easy||\n|0176|Second Highest Salary||36.4%|Medium||\n|0177|Nth Highest Salary||37.3%|Medium||\n|0178|Rank Scores||59.7%|Medium||\n|0179|Largest Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0179.Largest-Number)|33.9%|Medium||\n|0180|Consecutive Numbers||46.7%|Medium||\n|0181|Employees Earning More Than Their Managers||68.4%|Easy||\n|0182|Duplicate Emails||70.5%|Easy||\n|0183|Customers Who Never Order||67.6%|Easy||\n|0184|Department Highest Salary||49.5%|Medium||\n|0185|Department Top Three Salaries||49.9%|Hard||\n|0186|Reverse Words in a String II||52.3%|Medium||\n|0187|Repeated DNA Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0187.Repeated-DNA-Sequences)|46.1%|Medium||\n|0188|Best Time to Buy and Sell Stock IV||37.8%|Hard||\n|0189|Rotate Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0189.Rotate-Array)|39.2%|Medium||\n|0190|Reverse Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0190.Reverse-Bits)|51.9%|Easy||\n|0191|Number of 1 Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0191.Number-of-1-Bits)|64.5%|Easy||\n|0192|Word Frequency||25.6%|Medium||\n|0193|Valid Phone Numbers||26.0%|Easy||\n|0194|Transpose File||25.3%|Medium||\n|0195|Tenth Line||32.9%|Easy||\n|0196|Delete Duplicate Emails||58.3%|Easy||\n|0197|Rising Temperature||44.4%|Easy||\n|0198|House Robber|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0198.House-Robber)|48.6%|Medium||\n|0199|Binary Tree Right Side View|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0199.Binary-Tree-Right-Side-View)|61.1%|Medium||\n|0200|Number of Islands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0200.Number-of-Islands)|56.1%|Medium||\n|0201|Bitwise AND of Numbers Range|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0201.Bitwise-AND-of-Numbers-Range)|42.2%|Medium||\n|0202|Happy Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0202.Happy-Number)|54.3%|Easy||\n|0203|Remove Linked List Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0203.Remove-Linked-List-Elements)|44.7%|Easy||\n|0204|Count Primes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0204.Count-Primes)|33.1%|Medium||\n|0205|Isomorphic Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0205.Isomorphic-Strings)|42.5%|Easy||\n|0206|Reverse Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0206.Reverse-Linked-List)|72.3%|Easy||\n|0207|Course Schedule|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0207.Course-Schedule)|45.3%|Medium||\n|0208|Implement Trie (Prefix Tree)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0208.Implement-Trie-Prefix-Tree)|60.7%|Medium||\n|0209|Minimum Size Subarray Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0209.Minimum-Size-Subarray-Sum)|44.4%|Medium||\n|0210|Course Schedule II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0210.Course-Schedule-II)|47.9%|Medium||\n|0211|Design Add and Search Words Data Structure|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0211.Design-Add-and-Search-Words-Data-Structure)|43.2%|Medium||\n|0212|Word Search II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0212.Word-Search-II)|37.0%|Hard||\n|0213|House Robber II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0213.House-Robber-II)|40.6%|Medium||\n|0214|Shortest Palindrome||32.2%|Hard||\n|0215|Kth Largest Element in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0215.Kth-Largest-Element-in-an-Array)|65.7%|Medium||\n|0216|Combination Sum III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0216.Combination-Sum-III)|67.0%|Medium||\n|0217|Contains Duplicate|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0217.Contains-Duplicate)|61.2%|Easy||\n|0218|The Skyline Problem|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0218.The-Skyline-Problem)|41.5%|Hard||\n|0219|Contains Duplicate II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0219.Contains-Duplicate-II)|40.9%|Easy||\n|0220|Contains Duplicate III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0220.Contains-Duplicate-III)|21.8%|Hard||\n|0221|Maximal Square||44.4%|Medium||\n|0222|Count Complete Tree Nodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0222.Count-Complete-Tree-Nodes)|57.4%|Medium||\n|0223|Rectangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0223.Rectangle-Area)|40.8%|Medium||\n|0224|Basic Calculator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0224.Basic-Calculator)|41.1%|Hard||\n|0225|Implement Stack using Queues|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0225.Implement-Stack-using-Queues)|57.4%|Easy||\n|0226|Invert Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0226.Invert-Binary-Tree)|73.1%|Easy||\n|0227|Basic Calculator II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0227.Basic-Calculator-II)|42.2%|Medium||\n|0228|Summary Ranges|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0228.Summary-Ranges)|46.8%|Easy||\n|0229|Majority Element II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0229.Majority-Element-II)|44.0%|Medium||\n|0230|Kth Smallest Element in a BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0230.Kth-Smallest-Element-in-a-BST)|69.2%|Medium||\n|0231|Power of Two|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0231.Power-of-Two)|45.6%|Easy||\n|0232|Implement Queue using Stacks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0232.Implement-Queue-using-Stacks)|61.0%|Easy||\n|0233|Number of Digit One||34.2%|Hard||\n|0234|Palindrome Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0234.Palindrome-Linked-List)|49.4%|Easy||\n|0235|Lowest Common Ancestor of a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree)|60.1%|Medium||\n|0236|Lowest Common Ancestor of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree)|57.9%|Medium||\n|0237|Delete Node in a Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0237.Delete-Node-in-a-Linked-List)|75.1%|Medium||\n|0238|Product of Array Except Self||64.7%|Medium||\n|0239|Sliding Window Maximum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0239.Sliding-Window-Maximum)|46.6%|Hard||\n|0240|Search a 2D Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0240.Search-a-2D-Matrix-II)|50.5%|Medium||\n|0241|Different Ways to Add Parentheses||63.1%|Medium||\n|0242|Valid Anagram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram)|62.7%|Easy||\n|0243|Shortest Word Distance||64.9%|Easy||\n|0244|Shortest Word Distance II||60.7%|Medium||\n|0245|Shortest Word Distance III||57.5%|Medium||\n|0246|Strobogrammatic Number||47.6%|Easy||\n|0247|Strobogrammatic Number II||51.4%|Medium||\n|0248|Strobogrammatic Number III||41.7%|Hard||\n|0249|Group Shifted Strings||64.2%|Medium||\n|0250|Count Univalue Subtrees||55.2%|Medium||\n|0251|Flatten 2D Vector||48.9%|Medium||\n|0252|Meeting Rooms||57.0%|Easy||\n|0253|Meeting Rooms II||50.4%|Medium||\n|0254|Factor Combinations||48.8%|Medium||\n|0255|Verify Preorder Sequence in Binary Search Tree||48.0%|Medium||\n|0256|Paint House||60.5%|Medium||\n|0257|Binary Tree Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0257.Binary-Tree-Paths)|60.5%|Easy||\n|0258|Add Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0258.Add-Digits)|63.3%|Easy||\n|0259|3Sum Smaller||50.7%|Medium||\n|0260|Single Number III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0260.Single-Number-III)|67.4%|Medium||\n|0261|Graph Valid Tree||46.8%|Medium||\n|0262|Trips and Users||38.4%|Hard||\n|0263|Ugly Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0263.Ugly-Number)|41.7%|Easy||\n|0264|Ugly Number II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0264.Ugly-Number-II)|46.1%|Medium||\n|0265|Paint House II||52.2%|Hard||\n|0266|Palindrome Permutation||65.8%|Easy||\n|0267|Palindrome Permutation II||40.4%|Medium||\n|0268|Missing Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0268.Missing-Number)|61.5%|Easy||\n|0269|Alien Dictionary||35.2%|Hard||\n|0270|Closest Binary Search Tree Value||54.5%|Easy||\n|0271|Encode and Decode Strings||41.3%|Medium||\n|0272|Closest Binary Search Tree Value II||58.2%|Hard||\n|0273|Integer to English Words||29.9%|Hard||\n|0274|H-Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0274.H-Index)|38.1%|Medium||\n|0275|H-Index II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0275.H-Index-II)|37.4%|Medium||\n|0276|Paint Fence||44.0%|Medium||\n|0277|Find the Celebrity||46.7%|Medium||\n|0278|First Bad Version|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0278.First-Bad-Version)|42.9%|Easy||\n|0279|Perfect Squares|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0279.Perfect-Squares)|52.2%|Medium||\n|0280|Wiggle Sort||66.3%|Medium||\n|0281|Zigzag Iterator||62.3%|Medium||\n|0282|Expression Add Operators||39.2%|Hard||\n|0283|Move Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0283.Move-Zeroes)|61.3%|Easy||\n|0284|Peeking Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0284.Peeking-Iterator)|58.2%|Medium||\n|0285|Inorder Successor in BST||48.3%|Medium||\n|0286|Walls and Gates||60.2%|Medium||\n|0287|Find the Duplicate Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0287.Find-the-Duplicate-Number)|59.1%|Medium||\n|0288|Unique Word Abbreviation||25.2%|Medium||\n|0289|Game of Life||66.6%|Medium||\n|0290|Word Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0290.Word-Pattern)|40.4%|Easy||\n|0291|Word Pattern II||46.9%|Medium||\n|0292|Nim Game||55.8%|Easy||\n|0293|Flip Game||63.0%|Easy||\n|0294|Flip Game II||51.7%|Medium||\n|0295|Find Median from Data Stream||51.1%|Hard||\n|0296|Best Meeting Point||59.6%|Hard||\n|0297|Serialize and Deserialize Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0297.Serialize-and-Deserialize-Binary-Tree)|54.9%|Hard||\n|0298|Binary Tree Longest Consecutive Sequence||52.5%|Medium||\n|0299|Bulls and Cows|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0299.Bulls-and-Cows)|48.5%|Medium||\n|0300|Longest Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0300.Longest-Increasing-Subsequence)|51.5%|Medium||\n|0301|Remove Invalid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0301.Remove-Invalid-Parentheses)|47.1%|Hard||\n|0302|Smallest Rectangle Enclosing Black Pixels||58.2%|Hard||\n|0303|Range Sum Query - Immutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0303.Range-Sum-Query-Immutable)|57.9%|Easy||\n|0304|Range Sum Query 2D - Immutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0304.Range-Sum-Query-2D-Immutable)|52.1%|Medium||\n|0305|Number of Islands II||39.5%|Hard||\n|0306|Additive Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0306.Additive-Number)|30.9%|Medium||\n|0307|Range Sum Query - Mutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0307.Range-Sum-Query-Mutable)|40.7%|Medium||\n|0308|Range Sum Query 2D - Mutable||42.2%|Hard||\n|0309|Best Time to Buy and Sell Stock with Cooldown|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown)|54.4%|Medium||\n|0310|Minimum Height Trees||38.5%|Medium||\n|0311|Sparse Matrix Multiplication||67.1%|Medium||\n|0312|Burst Balloons||56.9%|Hard||\n|0313|Super Ugly Number||45.8%|Medium||\n|0314|Binary Tree Vertical Order Traversal||52.0%|Medium||\n|0315|Count of Smaller Numbers After Self|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0315.Count-of-Smaller-Numbers-After-Self)|42.8%|Hard||\n|0316|Remove Duplicate Letters||44.5%|Medium||\n|0317|Shortest Distance from All Buildings||43.0%|Hard||\n|0318|Maximum Product of Word Lengths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0318.Maximum-Product-of-Word-Lengths)|60.1%|Medium||\n|0319|Bulb Switcher|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0319.Bulb-Switcher)|48.0%|Medium||\n|0320|Generalized Abbreviation||57.3%|Medium||\n|0321|Create Maximum Number||28.8%|Hard||\n|0322|Coin Change|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0322.Coin-Change)|41.5%|Medium||\n|0323|Number of Connected Components in an Undirected Graph||62.0%|Medium||\n|0324|Wiggle Sort II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0324.Wiggle-Sort-II)|32.9%|Medium||\n|0325|Maximum Size Subarray Sum Equals k||49.3%|Medium||\n|0326|Power of Three|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0326.Power-of-Three)|45.2%|Easy||\n|0327|Count of Range Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0327.Count-of-Range-Sum)|36.0%|Hard||\n|0328|Odd Even Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0328.Odd-Even-Linked-List)|60.2%|Medium||\n|0329|Longest Increasing Path in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0329.Longest-Increasing-Path-in-a-Matrix)|52.1%|Hard||\n|0330|Patching Array||40.0%|Hard||\n|0331|Verify Preorder Serialization of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree)|44.2%|Medium||\n|0332|Reconstruct Itinerary||40.9%|Hard||\n|0333|Largest BST Subtree||42.3%|Medium||\n|0334|Increasing Triplet Subsequence||42.7%|Medium||\n|0335|Self Crossing||29.3%|Hard||\n|0336|Palindrome Pairs||35.2%|Hard||\n|0337|House Robber III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0337.House-Robber-III)|53.8%|Medium||\n|0338|Counting Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0338.Counting-Bits)|75.2%|Easy||\n|0339|Nested List Weight Sum||82.0%|Medium||\n|0340|Longest Substring with At Most K Distinct Characters||47.8%|Medium||\n|0341|Flatten Nested List Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0341.Flatten-Nested-List-Iterator)|61.5%|Medium||\n|0342|Power of Four|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0342.Power-of-Four)|45.6%|Easy||\n|0343|Integer Break|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0343.Integer-Break)|55.3%|Medium||\n|0344|Reverse String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String)|76.1%|Easy||\n|0345|Reverse Vowels of a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0345.Reverse-Vowels-of-a-String)|47.7%|Easy||\n|0346|Moving Average from Data Stream||77.0%|Easy||\n|0347|Top K Frequent Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0347.Top-K-Frequent-Elements)|64.8%|Medium||\n|0348|Design Tic-Tac-Toe||57.6%|Medium||\n|0349|Intersection of Two Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays)|70.2%|Easy||\n|0350|Intersection of Two Arrays II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0350.Intersection-of-Two-Arrays-II)|55.5%|Easy||\n|0351|Android Unlock Patterns||51.3%|Medium||\n|0352|Data Stream as Disjoint Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0352.Data-Stream-as-Disjoint-Intervals)|51.5%|Hard||\n|0353|Design Snake Game||39.0%|Medium||\n|0354|Russian Doll Envelopes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0354.Russian-Doll-Envelopes)|38.3%|Hard||\n|0355|Design Twitter||36.5%|Medium||\n|0356|Line Reflection||34.6%|Medium||\n|0357|Count Numbers with Unique Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0357.Count-Numbers-with-Unique-Digits)|51.5%|Medium||\n|0358|Rearrange String k Distance Apart||37.5%|Hard||\n|0359|Logger Rate Limiter||75.5%|Easy||\n|0360|Sort Transformed Array||54.6%|Medium||\n|0361|Bomb Enemy||50.9%|Medium||\n|0362|Design Hit Counter||68.3%|Medium||\n|0363|Max Sum of Rectangle No Larger Than K||44.1%|Hard||\n|0364|Nested List Weight Sum II||67.3%|Medium||\n|0365|Water and Jug Problem||36.5%|Medium||\n|0366|Find Leaves of Binary Tree||80.1%|Medium||\n|0367|Valid Perfect Square|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0367.Valid-Perfect-Square)|43.3%|Easy||\n|0368|Largest Divisible Subset|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0368.Largest-Divisible-Subset)|41.2%|Medium||\n|0369|Plus One Linked List||60.9%|Medium||\n|0370|Range Addition||70.8%|Medium||\n|0371|Sum of Two Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0371.Sum-of-Two-Integers)|50.7%|Medium||\n|0372|Super Pow|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0372.Super-Pow)|37.2%|Medium||\n|0373|Find K Pairs with Smallest Sums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0373.Find-K-Pairs-with-Smallest-Sums)|38.4%|Medium||\n|0374|Guess Number Higher or Lower|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0374.Guess-Number-Higher-or-Lower)|50.4%|Easy||\n|0375|Guess Number Higher or Lower II||46.3%|Medium||\n|0376|Wiggle Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0376.Wiggle-Subsequence)|48.2%|Medium||\n|0377|Combination Sum IV|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0377.Combination-Sum-IV)|52.1%|Medium||\n|0378|Kth Smallest Element in a Sorted Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix)|61.6%|Medium||\n|0379|Design Phone Directory||50.9%|Medium||\n|0380|Insert Delete GetRandom O(1)||52.0%|Medium||\n|0381|Insert Delete GetRandom O(1) - Duplicates allowed||35.7%|Hard||\n|0382|Linked List Random Node|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0382.Linked-List-Random-Node)|59.5%|Medium||\n|0383|Ransom Note|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0383.Ransom-Note)|57.6%|Easy||\n|0384|Shuffle an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0384.Shuffle-an-Array)|57.6%|Medium||\n|0385|Mini Parser|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0385.Mini-Parser)|36.5%|Medium||\n|0386|Lexicographical Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0386.Lexicographical-Numbers)|60.5%|Medium||\n|0387|First Unique Character in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0387.First-Unique-Character-in-a-String)|58.8%|Easy||\n|0388|Longest Absolute File Path||46.5%|Medium||\n|0389|Find the Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0389.Find-the-Difference)|60.4%|Easy||\n|0390|Elimination Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0390.Elimination-Game)|46.6%|Medium||\n|0391|Perfect Rectangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0391.Perfect-Rectangle)|32.5%|Hard||\n|0392|Is Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0392.Is-Subsequence)|49.3%|Easy||\n|0393|UTF-8 Validation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0393.UTF-8-Validation)|45.2%|Medium||\n|0394|Decode String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0394.Decode-String)|57.5%|Medium||\n|0395|Longest Substring with At Least K Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters)|44.8%|Medium||\n|0396|Rotate Function|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0396.Rotate-Function)|40.3%|Medium||\n|0397|Integer Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0397.Integer-Replacement)|35.1%|Medium||\n|0398|Random Pick Index||62.9%|Medium||\n|0399|Evaluate Division|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0399.Evaluate-Division)|59.5%|Medium||\n|0400|Nth Digit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0400.Nth-Digit)|34.0%|Medium||\n|0401|Binary Watch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0401.Binary-Watch)|51.4%|Easy||\n|0402|Remove K Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0402.Remove-K-Digits)|30.5%|Medium||\n|0403|Frog Jump||43.1%|Hard||\n|0404|Sum of Left Leaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0404.Sum-of-Left-Leaves)|56.2%|Easy||\n|0405|Convert a Number to Hexadecimal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0405.Convert-a-Number-to-Hexadecimal)|46.1%|Easy||\n|0406|Queue Reconstruction by Height||72.8%|Medium||\n|0407|Trapping Rain Water II||47.4%|Hard||\n|0408|Valid Word Abbreviation||34.8%|Easy||\n|0409|Longest Palindrome|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0409.Longest-Palindrome)|54.6%|Easy||\n|0410|Split Array Largest Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0410.Split-Array-Largest-Sum)|53.2%|Hard||\n|0411|Minimum Unique Word Abbreviation||39.2%|Hard||\n|0412|Fizz Buzz|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0412.Fizz-Buzz)|68.6%|Easy||\n|0413|Arithmetic Slices|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0413.Arithmetic-Slices)|65.0%|Medium||\n|0414|Third Maximum Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0414.Third-Maximum-Number)|32.5%|Easy||\n|0415|Add Strings||52.6%|Easy||\n|0416|Partition Equal Subset Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0416.Partition-Equal-Subset-Sum)|46.7%|Medium||\n|0417|Pacific Atlantic Water Flow|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0417.Pacific-Atlantic-Water-Flow)|53.9%|Medium||\n|0418|Sentence Screen Fitting||35.6%|Medium||\n|0419|Battleships in a Board|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0419.Battleships-in-a-Board)|74.6%|Medium||\n|0420|Strong Password Checker||14.3%|Hard||\n|0421|Maximum XOR of Two Numbers in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array)|54.6%|Medium||\n|0422|Valid Word Square||38.8%|Easy||\n|0423|Reconstruct Original Digits from English|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0423.Reconstruct-Original-Digits-from-English)|51.3%|Medium||\n|0424|Longest Repeating Character Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement)|51.4%|Medium||\n|0425|Word Squares||52.6%|Hard||\n|0426|Convert Binary Search Tree to Sorted Doubly Linked List||64.6%|Medium||\n|0427|Construct Quad Tree||66.3%|Medium||\n|0428|Serialize and Deserialize N-ary Tree||65.3%|Hard||\n|0429|N-ary Tree Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0429.N-ary-Tree-Level-Order-Traversal)|70.6%|Medium||\n|0430|Flatten a Multilevel Doubly Linked List||59.4%|Medium||\n|0431|Encode N-ary Tree to Binary Tree||78.6%|Hard||\n|0432|All O`one Data Structure||36.6%|Hard||\n|0433|Minimum Genetic Mutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0433.Minimum-Genetic-Mutation)|48.1%|Medium||\n|0434|Number of Segments in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0434.Number-of-Segments-in-a-String)|37.7%|Easy||\n|0435|Non-overlapping Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0435.Non-overlapping-Intervals)|49.8%|Medium||\n|0436|Find Right Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0436.Find-Right-Interval)|50.3%|Medium||\n|0437|Path Sum III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0437.Path-Sum-III)|48.8%|Medium||\n|0438|Find All Anagrams in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0438.Find-All-Anagrams-in-a-String)|48.9%|Medium||\n|0439|Ternary Expression Parser||58.2%|Medium||\n|0440|K-th Smallest in Lexicographical Order||30.7%|Hard||\n|0441|Arranging Coins|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0441.Arranging-Coins)|46.0%|Easy||\n|0442|Find All Duplicates in an Array||73.3%|Medium||\n|0443|String Compression||48.7%|Medium||\n|0444|Sequence Reconstruction||26.3%|Medium||\n|0445|Add Two Numbers II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0445.Add-Two-Numbers-II)|59.4%|Medium||\n|0446|Arithmetic Slices II - Subsequence||39.8%|Hard||\n|0447|Number of Boomerangs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0447.Number-of-Boomerangs)|54.6%|Medium||\n|0448|Find All Numbers Disappeared in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0448.Find-All-Numbers-Disappeared-in-an-Array)|59.6%|Easy||\n|0449|Serialize and Deserialize BST||56.7%|Medium||\n|0450|Delete Node in a BST||49.9%|Medium||\n|0451|Sort Characters By Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0451.Sort-Characters-By-Frequency)|68.5%|Medium||\n|0452|Minimum Number of Arrows to Burst Balloons||53.2%|Medium||\n|0453|Minimum Moves to Equal Array Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0453.Minimum-Moves-to-Equal-Array-Elements)|55.6%|Medium||\n|0454|4Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0454.4Sum-II)|57.3%|Medium||\n|0455|Assign Cookies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0455.Assign-Cookies)|50.6%|Easy||\n|0456|132 Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0456.132-Pattern)|32.4%|Medium||\n|0457|Circular Array Loop|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0457.Circular-Array-Loop)|32.1%|Medium||\n|0458|Poor Pigs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0458.Poor-Pigs)|65.0%|Hard||\n|0459|Repeated Substring Pattern||43.7%|Easy||\n|0460|LFU Cache|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0460.LFU-Cache)|40.3%|Hard||\n|0461|Hamming Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0461.Hamming-Distance)|74.8%|Easy||\n|0462|Minimum Moves to Equal Array Elements II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II)|60.1%|Medium||\n|0463|Island Perimeter|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0463.Island-Perimeter)|69.4%|Easy||\n|0464|Can I Win||29.8%|Medium||\n|0465|Optimal Account Balancing||49.3%|Hard||\n|0466|Count The Repetitions||29.2%|Hard||\n|0467|Unique Substrings in Wraparound String||38.2%|Medium||\n|0468|Validate IP Address||26.5%|Medium||\n|0469|Convex Polygon||38.5%|Medium||\n|0470|Implement Rand10() Using Rand7()|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0470.Implement-Rand10-Using-Rand7)|46.7%|Medium||\n|0471|Encode String with Shortest Length||50.7%|Hard||\n|0472|Concatenated Words||45.5%|Hard||\n|0473|Matchsticks to Square|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0473.Matchsticks-to-Square)|40.5%|Medium||\n|0474|Ones and Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0474.Ones-and-Zeroes)|46.7%|Medium||\n|0475|Heaters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0475.Heaters)|36.0%|Medium||\n|0476|Number Complement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0476.Number-Complement)|67.1%|Easy||\n|0477|Total Hamming Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0477.Total-Hamming-Distance)|52.2%|Medium||\n|0478|Generate Random Point in a Circle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0478.Generate-Random-Point-in-a-Circle)|39.6%|Medium||\n|0479|Largest Palindrome Product||31.6%|Hard||\n|0480|Sliding Window Median|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0480.Sliding-Window-Median)|41.4%|Hard||\n|0481|Magical String||50.4%|Medium||\n|0482|License Key Formatting||43.2%|Easy||\n|0483|Smallest Good Base|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0483.Smallest-Good-Base)|38.4%|Hard||\n|0484|Find Permutation||67.0%|Medium||\n|0485|Max Consecutive Ones|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0485.Max-Consecutive-Ones)|56.0%|Easy||\n|0486|Predict the Winner||50.8%|Medium||\n|0487|Max Consecutive Ones II||49.2%|Medium||\n|0488|Zuma Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0488.Zuma-Game)|34.9%|Hard||\n|0489|Robot Room Cleaner||76.5%|Hard||\n|0490|The Maze||55.4%|Medium||\n|0491|Increasing Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0491.Increasing-Subsequences)|52.0%|Medium||\n|0492|Construct the Rectangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0492.Construct-the-Rectangle)|53.6%|Easy||\n|0493|Reverse Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0493.Reverse-Pairs)|30.8%|Hard||\n|0494|Target Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0494.Target-Sum)|45.6%|Medium||\n|0495|Teemo Attacking|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0495.Teemo-Attacking)|57.0%|Easy||\n|0496|Next Greater Element I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0496.Next-Greater-Element-I)|71.3%|Easy||\n|0497|Random Point in Non-overlapping Rectangles|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles)|39.3%|Medium||\n|0498|Diagonal Traverse|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0498.Diagonal-Traverse)|58.0%|Medium||\n|0499|The Maze III||46.9%|Hard||\n|0500|Keyboard Row|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0500.Keyboard-Row)|69.0%|Easy||\n|0501|Find Mode in Binary Search Tree||48.5%|Easy||\n|0502|IPO||44.9%|Hard||\n|0503|Next Greater Element II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0503.Next-Greater-Element-II)|63.0%|Medium||\n|0504|Base 7|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0504.Base-7)|47.9%|Easy||\n|0505|The Maze II||52.4%|Medium||\n|0506|Relative Ranks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0506.Relative-Ranks)|58.8%|Easy||\n|0507|Perfect Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0507.Perfect-Number)|37.7%|Easy||\n|0508|Most Frequent Subtree Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0508.Most-Frequent-Subtree-Sum)|64.2%|Medium||\n|0509|Fibonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0509.Fibonacci-Number)|69.2%|Easy||\n|0510|Inorder Successor in BST II||61.1%|Medium||\n|0511|Game Play Analysis I||78.8%|Easy||\n|0512|Game Play Analysis II||54.1%|Easy||\n|0513|Find Bottom Left Tree Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0513.Find-Bottom-Left-Tree-Value)|66.3%|Medium||\n|0514|Freedom Trail||46.8%|Hard||\n|0515|Find Largest Value in Each Tree Row|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row)|64.6%|Medium||\n|0516|Longest Palindromic Subsequence||60.6%|Medium||\n|0517|Super Washing Machines||39.7%|Hard||\n|0518|Coin Change II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0518.Coin-Change-II)|59.7%|Medium||\n|0519|Random Flip Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0519.Random-Flip-Matrix)|39.6%|Medium||\n|0520|Detect Capital|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0520.Detect-Capital)|55.6%|Easy||\n|0521|Longest Uncommon Subsequence I||60.3%|Easy||\n|0522|Longest Uncommon Subsequence II||40.4%|Medium||\n|0523|Continuous Subarray Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0523.Continuous-Subarray-Sum)|27.7%|Medium||\n|0524|Longest Word in Dictionary through Deleting|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting)|51.2%|Medium||\n|0525|Contiguous Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0525.Contiguous-Array)|46.8%|Medium||\n|0526|Beautiful Arrangement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0526.Beautiful-Arrangement)|64.6%|Medium||\n|0527|Word Abbreviation||60.3%|Hard||\n|0528|Random Pick with Weight|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0528.Random-Pick-with-Weight)|46.1%|Medium||\n|0529|Minesweeper|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0529.Minesweeper)|65.5%|Medium||\n|0530|Minimum Absolute Difference in BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0530.Minimum-Absolute-Difference-in-BST)|56.7%|Easy||\n|0531|Lonely Pixel I||62.0%|Medium||\n|0532|K-diff Pairs in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0532.K-diff-Pairs-in-an-Array)|40.7%|Medium||\n|0533|Lonely Pixel II||48.4%|Medium||\n|0534|Game Play Analysis III||82.5%|Medium||\n|0535|Encode and Decode TinyURL|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0535.Encode-and-Decode-TinyURL)|85.7%|Medium||\n|0536|Construct Binary Tree from String||56.1%|Medium||\n|0537|Complex Number Multiplication|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0537.Complex-Number-Multiplication)|71.3%|Medium||\n|0538|Convert BST to Greater Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0538.Convert-BST-to-Greater-Tree)|67.3%|Medium||\n|0539|Minimum Time Difference||56.3%|Medium||\n|0540|Single Element in a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0540.Single-Element-in-a-Sorted-Array)|58.5%|Medium||\n|0541|Reverse String II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0541.Reverse-String-II)|50.5%|Easy||\n|0542|01 Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0542.01-Matrix)|44.1%|Medium||\n|0543|Diameter of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0543.Diameter-of-Binary-Tree)|55.9%|Easy||\n|0544|Output Contest Matches||76.7%|Medium||\n|0545|Boundary of Binary Tree||44.2%|Medium||\n|0546|Remove Boxes||47.6%|Hard||\n|0547|Number of Provinces|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0547.Number-of-Provinces)|63.2%|Medium||\n|0548|Split Array with Equal Sum||50.1%|Hard||\n|0549|Binary Tree Longest Consecutive Sequence II||49.5%|Medium||\n|0550|Game Play Analysis IV||44.1%|Medium||\n|0551|Student Attendance Record I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0551.Student-Attendance-Record-I)|48.0%|Easy||\n|0552|Student Attendance Record II||41.1%|Hard||\n|0553|Optimal Division||59.7%|Medium||\n|0554|Brick Wall|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0554.Brick-Wall)|53.1%|Medium||\n|0555|Split Concatenated Strings||43.5%|Medium||\n|0556|Next Greater Element III||34.1%|Medium||\n|0557|Reverse Words in a String III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0557.Reverse-Words-in-a-String-III)|81.5%|Easy||\n|0558|Logical OR of Two Binary Grids Represented as Quad-Trees||48.2%|Medium||\n|0559|Maximum Depth of N-ary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0559.Maximum-Depth-of-N-ary-Tree)|71.6%|Easy||\n|0560|Subarray Sum Equals K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0560.Subarray-Sum-Equals-K)|44.0%|Medium||\n|0561|Array Partition|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0561.Array-Partition)|76.5%|Easy||\n|0562|Longest Line of Consecutive One in Matrix||50.0%|Medium||\n|0563|Binary Tree Tilt|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0563.Binary-Tree-Tilt)|59.3%|Easy||\n|0564|Find the Closest Palindrome||21.9%|Hard||\n|0565|Array Nesting||56.5%|Medium||\n|0566|Reshape the Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0566.Reshape-the-Matrix)|62.7%|Easy||\n|0567|Permutation in String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0567.Permutation-in-String)|43.8%|Medium||\n|0568|Maximum Vacation Days||44.8%|Hard||\n|0569|Median Employee Salary||68.3%|Hard||\n|0570|Managers with at Least 5 Direct Reports||67.1%|Medium||\n|0571|Find Median Given Frequency of Numbers||44.7%|Hard||\n|0572|Subtree of Another Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0572.Subtree-of-Another-Tree)|45.9%|Easy||\n|0573|Squirrel Simulation||55.0%|Medium||\n|0574|Winning Candidate||59.7%|Medium||\n|0575|Distribute Candies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0575.Distribute-Candies)|66.1%|Easy||\n|0576|Out of Boundary Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0576.Out-of-Boundary-Paths)|44.3%|Medium||\n|0577|Employee Bonus||75.3%|Easy||\n|0578|Get Highest Answer Rate Question||41.7%|Medium||\n|0579|Find Cumulative Salary of an Employee||45.0%|Hard||\n|0580|Count Student Number in Departments||58.2%|Medium||\n|0581|Shortest Unsorted Continuous Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0581.Shortest-Unsorted-Continuous-Subarray)|36.2%|Medium||\n|0582|Kill Process||68.4%|Medium||\n|0583|Delete Operation for Two Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0583.Delete-Operation-for-Two-Strings)|59.2%|Medium||\n|0584|Find Customer Referee||76.0%|Easy||\n|0585|Investments in 2016||53.5%|Medium||\n|0586|Customer Placing the Largest Number of Orders||72.5%|Easy||\n|0587|Erect the Fence||43.2%|Hard||\n|0588|Design In-Memory File System||48.8%|Hard||\n|0589|N-ary Tree Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0589.N-ary-Tree-Preorder-Traversal)|76.3%|Easy||\n|0590|N-ary Tree Postorder Traversal||77.1%|Easy||\n|0591|Tag Validator||37.0%|Hard||\n|0592|Fraction Addition and Subtraction||52.1%|Medium||\n|0593|Valid Square||44.1%|Medium||\n|0594|Longest Harmonious Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0594.Longest-Harmonious-Subsequence)|53.1%|Easy||\n|0595|Big Countries||73.8%|Easy||\n|0596|Classes More Than 5 Students||46.5%|Easy||\n|0597|Friend Requests I: Overall Acceptance Rate||42.9%|Easy||\n|0598|Range Addition II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0598.Range-Addition-II)|55.0%|Easy||\n|0599|Minimum Index Sum of Two Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0599.Minimum-Index-Sum-of-Two-Lists)|52.7%|Easy||\n|0600|Non-negative Integers without Consecutive Ones||39.0%|Hard||\n|0601|Human Traffic of Stadium||50.6%|Hard||\n|0602|Friend Requests II: Who Has the Most Friends||61.3%|Medium||\n|0603|Consecutive Available Seats||68.2%|Easy||\n|0604|Design Compressed String Iterator||39.4%|Easy||\n|0605|Can Place Flowers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0605.Can-Place-Flowers)|33.0%|Easy||\n|0606|Construct String from Binary Tree||63.5%|Easy||\n|0607|Sales Person||72.1%|Easy||\n|0608|Tree Node||74.9%|Medium||\n|0609|Find Duplicate File in System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0609.Find-Duplicate-File-in-System)|67.8%|Medium||\n|0610|Triangle Judgement||71.1%|Easy||\n|0611|Valid Triangle Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0611.Valid-Triangle-Number)|50.3%|Medium||\n|0612|Shortest Distance in a Plane||63.5%|Medium||\n|0613|Shortest Distance in a Line||81.5%|Easy||\n|0614|Second Degree Follower||36.9%|Medium||\n|0615|Average Salary: Departments VS Company||57.3%|Hard||\n|0616|Add Bold Tag in String||48.6%|Medium||\n|0617|Merge Two Binary Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0617.Merge-Two-Binary-Trees)|78.5%|Easy||\n|0618|Students Report By Geography||64.2%|Hard||\n|0619|Biggest Single Number||48.7%|Easy||\n|0620|Not Boring Movies||73.3%|Easy||\n|0621|Task Scheduler||55.6%|Medium||\n|0622|Design Circular Queue|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0622.Design-Circular-Queue)|51.8%|Medium||\n|0623|Add One Row to Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0623.Add-One-Row-to-Tree)|59.4%|Medium||\n|0624|Maximum Distance in Arrays||41.7%|Medium||\n|0625|Minimum Factorization||33.4%|Medium||\n|0626|Exchange Seats||70.6%|Medium||\n|0627|Swap Salary||82.8%|Easy||\n|0628|Maximum Product of Three Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers)|46.4%|Easy||\n|0629|K Inverse Pairs Array||43.0%|Hard||\n|0630|Course Schedule III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0630.Course-Schedule-III)|40.2%|Hard||\n|0631|Design Excel Sum Formula||43.3%|Hard||\n|0632|Smallest Range Covering Elements from K Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists)|60.4%|Hard||\n|0633|Sum of Square Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0633.Sum-of-Square-Numbers)|34.7%|Medium||\n|0634|Find the Derangement of An Array||41.8%|Medium||\n|0635|Design Log Storage System||62.7%|Medium||\n|0636|Exclusive Time of Functions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0636.Exclusive-Time-of-Functions)|61.0%|Medium||\n|0637|Average of Levels in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0637.Average-of-Levels-in-Binary-Tree)|71.6%|Easy||\n|0638|Shopping Offers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0638.Shopping-Offers)|54.3%|Medium||\n|0639|Decode Ways II||30.4%|Hard||\n|0640|Solve the Equation||43.3%|Medium||\n|0641|Design Circular Deque||57.6%|Medium||\n|0642|Design Search Autocomplete System||48.7%|Hard||\n|0643|Maximum Average Subarray I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0643.Maximum-Average-Subarray-I)|43.8%|Easy||\n|0644|Maximum Average Subarray II||35.7%|Hard||\n|0645|Set Mismatch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0645.Set-Mismatch)|41.4%|Easy||\n|0646|Maximum Length of Pair Chain||56.4%|Medium||\n|0647|Palindromic Substrings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0647.Palindromic-Substrings)|66.3%|Medium||\n|0648|Replace Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0648.Replace-Words)|62.7%|Medium||\n|0649|Dota2 Senate||40.4%|Medium||\n|0650|2 Keys Keyboard||53.1%|Medium||\n|0651|4 Keys Keyboard||54.5%|Medium||\n|0652|Find Duplicate Subtrees||56.5%|Medium||\n|0653|Two Sum IV - Input is a BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0653.Two-Sum-IV-Input-is-a-BST)|60.9%|Easy||\n|0654|Maximum Binary Tree||84.4%|Medium||\n|0655|Print Binary Tree||61.3%|Medium||\n|0656|Coin Path||31.6%|Hard||\n|0657|Robot Return to Origin||75.3%|Easy||\n|0658|Find K Closest Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements)|46.7%|Medium||\n|0659|Split Array into Consecutive Subsequences||50.6%|Medium||\n|0660|Remove 9||56.8%|Hard||\n|0661|Image Smoother|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0661.Image-Smoother)|55.0%|Easy||\n|0662|Maximum Width of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0662.Maximum-Width-of-Binary-Tree)|40.6%|Medium||\n|0663|Equal Tree Partition||41.4%|Medium||\n|0664|Strange Printer||46.8%|Hard||\n|0665|Non-decreasing Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0665.Non-decreasing-Array)|24.1%|Medium||\n|0666|Path Sum IV||59.1%|Medium||\n|0667|Beautiful Arrangement II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0667.Beautiful-Arrangement-II)|59.7%|Medium||\n|0668|Kth Smallest Number in Multiplication Table|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table)|51.5%|Hard||\n|0669|Trim a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0669.Trim-a-Binary-Search-Tree)|66.3%|Medium||\n|0670|Maximum Swap||47.8%|Medium||\n|0671|Second Minimum Node In a Binary Tree||44.0%|Easy||\n|0672|Bulb Switcher II||50.9%|Medium||\n|0673|Number of Longest Increasing Subsequence||42.1%|Medium||\n|0674|Longest Continuous Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0674.Longest-Continuous-Increasing-Subsequence)|49.0%|Easy||\n|0675|Cut Off Trees for Golf Event||34.3%|Hard||\n|0676|Implement Magic Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0676.Implement-Magic-Dictionary)|56.9%|Medium||\n|0677|Map Sum Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0677.Map-Sum-Pairs)|57.0%|Medium||\n|0678|Valid Parenthesis String||33.9%|Medium||\n|0679|24 Game||49.1%|Hard||\n|0680|Valid Palindrome II||39.3%|Easy||\n|0681|Next Closest Time||46.4%|Medium||\n|0682|Baseball Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0682.Baseball-Game)|73.6%|Easy||\n|0683|K Empty Slots||36.9%|Hard||\n|0684|Redundant Connection|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0684.Redundant-Connection)|62.0%|Medium||\n|0685|Redundant Connection II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0685.Redundant-Connection-II)|34.1%|Hard||\n|0686|Repeated String Match||34.0%|Medium||\n|0687|Longest Univalue Path||40.1%|Medium||\n|0688|Knight Probability in Chessboard||52.0%|Medium||\n|0689|Maximum Sum of 3 Non-Overlapping Subarrays||48.8%|Hard||\n|0690|Employee Importance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0690.Employee-Importance)|65.1%|Medium||\n|0691|Stickers to Spell Word||46.3%|Hard||\n|0692|Top K Frequent Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0692.Top-K-Frequent-Words)|55.2%|Medium||\n|0693|Binary Number with Alternating Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0693.Binary-Number-with-Alternating-Bits)|61.2%|Easy||\n|0694|Number of Distinct Islands||60.6%|Medium||\n|0695|Max Area of Island|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0695.Max-Area-of-Island)|71.6%|Medium||\n|0696|Count Binary Substrings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0696.Count-Binary-Substrings)|65.5%|Easy||\n|0697|Degree of an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0697.Degree-of-an-Array)|55.8%|Easy||\n|0698|Partition to K Equal Sum Subsets||41.1%|Medium||\n|0699|Falling Squares|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0699.Falling-Squares)|44.4%|Hard||\n|0700|Search in a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0700.Search-in-a-Binary-Search-Tree)|77.1%|Easy||\n|0701|Insert into a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0701.Insert-into-a-Binary-Search-Tree)|74.6%|Medium||\n|0702|Search in a Sorted Array of Unknown Size||71.4%|Medium||\n|0703|Kth Largest Element in a Stream|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0703.Kth-Largest-Element-in-a-Stream)|55.5%|Easy||\n|0704|Binary Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0704.Binary-Search)|55.1%|Easy||\n|0705|Design HashSet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0705.Design-HashSet)|66.0%|Easy||\n|0706|Design HashMap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0706.Design-HashMap)|65.1%|Easy||\n|0707|Design Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0707.Design-Linked-List)|27.5%|Medium||\n|0708|Insert into a Sorted Circular Linked List||34.5%|Medium||\n|0709|To Lower Case|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0709.To-Lower-Case)|81.9%|Easy||\n|0710|Random Pick with Blacklist|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0710.Random-Pick-with-Blacklist)|33.6%|Hard||\n|0711|Number of Distinct Islands II||51.8%|Hard||\n|0712|Minimum ASCII Delete Sum for Two Strings||62.2%|Medium||\n|0713|Subarray Product Less Than K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0713.Subarray-Product-Less-Than-K)|45.0%|Medium||\n|0714|Best Time to Buy and Sell Stock with Transaction Fee|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee)|64.2%|Medium||\n|0715|Range Module|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0715.Range-Module)|44.6%|Hard||\n|0716|Max Stack||45.3%|Hard||\n|0717|1-bit and 2-bit Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0717.1-bit-and-2-bit-Characters)|46.0%|Easy||\n|0718|Maximum Length of Repeated Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0718.Maximum-Length-of-Repeated-Subarray)|51.6%|Medium||\n|0719|Find K-th Smallest Pair Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0719.Find-K-th-Smallest-Pair-Distance)|36.3%|Hard||\n|0720|Longest Word in Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0720.Longest-Word-in-Dictionary)|51.8%|Medium||\n|0721|Accounts Merge|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0721.Accounts-Merge)|56.3%|Medium||\n|0722|Remove Comments||38.0%|Medium||\n|0723|Candy Crush||76.3%|Medium||\n|0724|Find Pivot Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0724.Find-Pivot-Index)|53.3%|Easy||\n|0725|Split Linked List in Parts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0725.Split-Linked-List-in-Parts)|57.2%|Medium||\n|0726|Number of Atoms|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0726.Number-of-Atoms)|52.2%|Hard||\n|0727|Minimum Window Subsequence||42.8%|Hard||\n|0728|Self Dividing Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0728.Self-Dividing-Numbers)|77.5%|Easy||\n|0729|My Calendar I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0729.My-Calendar-I)|57.2%|Medium||\n|0730|Count Different Palindromic Subsequences||44.4%|Hard||\n|0731|My Calendar II||54.7%|Medium||\n|0732|My Calendar III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0732.My-Calendar-III)|71.6%|Hard||\n|0733|Flood Fill|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0733.Flood-Fill)|60.3%|Easy||\n|0734|Sentence Similarity||43.1%|Easy||\n|0735|Asteroid Collision|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0735.Asteroid-Collision)|44.4%|Medium||\n|0736|Parse Lisp Expression||51.6%|Hard||\n|0737|Sentence Similarity II||48.7%|Medium||\n|0738|Monotone Increasing Digits||47.0%|Medium||\n|0739|Daily Temperatures|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0739.Daily-Temperatures)|66.5%|Medium||\n|0740|Delete and Earn||57.4%|Medium||\n|0741|Cherry Pickup||36.3%|Hard||\n|0742|Closest Leaf in a Binary Tree||45.8%|Medium||\n|0743|Network Delay Time||51.4%|Medium||\n|0744|Find Smallest Letter Greater Than Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target)|44.6%|Easy||\n|0745|Prefix and Suffix Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0745.Prefix-and-Suffix-Search)|41.3%|Hard||\n|0746|Min Cost Climbing Stairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0746.Min-Cost-Climbing-Stairs)|62.3%|Easy||\n|0747|Largest Number At Least Twice of Others|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0747.Largest-Number-At-Least-Twice-of-Others)|46.3%|Easy||\n|0748|Shortest Completing Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0748.Shortest-Completing-Word)|59.1%|Easy||\n|0749|Contain Virus||50.8%|Hard||\n|0750|Number Of Corner Rectangles||67.5%|Medium||\n|0751|IP to CIDR||54.7%|Medium||\n|0752|Open the Lock|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0752.Open-the-Lock)|55.5%|Medium||\n|0753|Cracking the Safe|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0753.Cracking-the-Safe)|55.4%|Hard||\n|0754|Reach a Number||42.5%|Medium||\n|0755|Pour Water||46.1%|Medium||\n|0756|Pyramid Transition Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0756.Pyramid-Transition-Matrix)|53.3%|Medium||\n|0757|Set Intersection Size At Least Two||43.8%|Hard||\n|0758|Bold Words in String||50.6%|Medium||\n|0759|Employee Free Time||71.7%|Hard||\n|0760|Find Anagram Mappings||82.8%|Easy||\n|0761|Special Binary String||60.3%|Hard||\n|0762|Prime Number of Set Bits in Binary Representation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation)|67.6%|Easy||\n|0763|Partition Labels|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0763.Partition-Labels)|79.8%|Medium||\n|0764|Largest Plus Sign||48.4%|Medium||\n|0765|Couples Holding Hands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0765.Couples-Holding-Hands)|56.9%|Hard||\n|0766|Toeplitz Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0766.Toeplitz-Matrix)|68.1%|Easy||\n|0767|Reorganize String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0767.Reorganize-String)|52.7%|Medium||\n|0768|Max Chunks To Make Sorted II||52.7%|Hard||\n|0769|Max Chunks To Make Sorted||58.2%|Medium||\n|0770|Basic Calculator IV||56.0%|Hard||\n|0771|Jewels and Stones|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0771.Jewels-and-Stones)|88.0%|Easy||\n|0772|Basic Calculator III||48.4%|Hard||\n|0773|Sliding Puzzle||63.7%|Hard||\n|0774|Minimize Max Distance to Gas Station||51.4%|Hard||\n|0775|Global and Local Inversions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0775.Global-and-Local-Inversions)|43.8%|Medium||\n|0776|Split BST||58.7%|Medium||\n|0777|Swap Adjacent in LR String||37.1%|Medium||\n|0778|Swim in Rising Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0778.Swim-in-Rising-Water)|59.6%|Hard||\n|0779|K-th Symbol in Grammar||40.7%|Medium||\n|0780|Reaching Points||32.3%|Hard||\n|0781|Rabbits in Forest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0781.Rabbits-in-Forest)|55.3%|Medium||\n|0782|Transform to Chessboard||51.9%|Hard||\n|0783|Minimum Distance Between BST Nodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0783.Minimum-Distance-Between-BST-Nodes)|56.8%|Easy||\n|0784|Letter Case Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0784.Letter-Case-Permutation)|73.4%|Medium||\n|0785|Is Graph Bipartite?|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0785.Is-Graph-Bipartite)|52.6%|Medium||\n|0786|K-th Smallest Prime Fraction|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0786.K-th-Smallest-Prime-Fraction)|50.6%|Medium||\n|0787|Cheapest Flights Within K Stops||35.9%|Medium||\n|0788|Rotated Digits||56.9%|Medium||\n|0789|Escape The Ghosts||60.6%|Medium||\n|0790|Domino and Tromino Tiling||48.4%|Medium||\n|0791|Custom Sort String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0791.Custom-Sort-String)|69.4%|Medium||\n|0792|Number of Matching Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0792.Number-of-Matching-Subsequences)|51.9%|Medium||\n|0793|Preimage Size of Factorial Zeroes Function|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function)|42.7%|Hard||\n|0794|Valid Tic-Tac-Toe State|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0794.Valid-Tic-Tac-Toe-State)|35.2%|Medium||\n|0795|Number of Subarrays with Bounded Maximum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum)|52.7%|Medium||\n|0796|Rotate String||54.0%|Easy||\n|0797|All Paths From Source to Target||81.4%|Medium||\n|0798|Smallest Rotation with Highest Score||49.6%|Hard||\n|0799|Champagne Tower||51.2%|Medium||\n|0800|Similar RGB Color||66.4%|Easy||\n|0801|Minimum Swaps To Make Sequences Increasing||39.2%|Hard||\n|0802|Find Eventual Safe States|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0802.Find-Eventual-Safe-States)|54.9%|Medium||\n|0803|Bricks Falling When Hit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0803.Bricks-Falling-When-Hit)|34.3%|Hard||\n|0804|Unique Morse Code Words||82.6%|Easy||\n|0805|Split Array With Same Average||25.9%|Hard||\n|0806|Number of Lines To Write String||66.1%|Easy||\n|0807|Max Increase to Keep City Skyline|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0807.Max-Increase-to-Keep-City-Skyline)|85.9%|Medium||\n|0808|Soup Servings||43.1%|Medium||\n|0809|Expressive Words||46.3%|Medium||\n|0810|Chalkboard XOR Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0810.Chalkboard-XOR-Game)|55.1%|Hard||\n|0811|Subdomain Visit Count|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0811.Subdomain-Visit-Count)|75.1%|Medium||\n|0812|Largest Triangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0812.Largest-Triangle-Area)|60.1%|Easy||\n|0813|Largest Sum of Averages||52.9%|Medium||\n|0814|Binary Tree Pruning||72.6%|Medium||\n|0815|Bus Routes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0815.Bus-Routes)|45.7%|Hard||\n|0816|Ambiguous Coordinates|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0816.Ambiguous-Coordinates)|56.0%|Medium||\n|0817|Linked List Components|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0817.Linked-List-Components)|58.1%|Medium||\n|0818|Race Car||43.6%|Hard||\n|0819|Most Common Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0819.Most-Common-Word)|45.0%|Easy||\n|0820|Short Encoding of Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0820.Short-Encoding-of-Words)|60.7%|Medium||\n|0821|Shortest Distance to a Character|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0821.Shortest-Distance-to-a-Character)|71.3%|Easy||\n|0822|Card Flipping Game||45.4%|Medium||\n|0823|Binary Trees With Factors|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0823.Binary-Trees-With-Factors)|50.0%|Medium||\n|0824|Goat Latin||67.8%|Easy||\n|0825|Friends Of Appropriate Ages|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0825.Friends-Of-Appropriate-Ages)|46.3%|Medium||\n|0826|Most Profit Assigning Work|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0826.Most-Profit-Assigning-Work)|44.3%|Medium||\n|0827|Making A Large Island||44.7%|Hard||\n|0828|Count Unique Characters of All Substrings of a Given String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String)|51.5%|Hard||\n|0829|Consecutive Numbers Sum||41.5%|Hard||\n|0830|Positions of Large Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0830.Positions-of-Large-Groups)|51.7%|Easy||\n|0831|Masking Personal Information||46.8%|Medium||\n|0832|Flipping an Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0832.Flipping-an-Image)|80.3%|Easy||\n|0833|Find And Replace in String||54.1%|Medium||\n|0834|Sum of Distances in Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0834.Sum-of-Distances-in-Tree)|54.1%|Hard||\n|0835|Image Overlap||61.0%|Medium||\n|0836|Rectangle Overlap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0836.Rectangle-Overlap)|43.3%|Easy||\n|0837|New 21 Game||36.2%|Medium||\n|0838|Push Dominoes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0838.Push-Dominoes)|57.0%|Medium||\n|0839|Similar String Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0839.Similar-String-Groups)|47.5%|Hard||\n|0840|Magic Squares In Grid||38.5%|Medium||\n|0841|Keys and Rooms|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0841.Keys-and-Rooms)|70.1%|Medium||\n|0842|Split Array into Fibonacci Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence)|38.2%|Medium||\n|0843|Guess the Word||42.0%|Hard||\n|0844|Backspace String Compare|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0844.Backspace-String-Compare)|48.0%|Easy||\n|0845|Longest Mountain in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0845.Longest-Mountain-in-Array)|40.1%|Medium||\n|0846|Hand of Straights|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0846.Hand-of-Straights)|56.5%|Medium||\n|0847|Shortest Path Visiting All Nodes||61.3%|Hard||\n|0848|Shifting Letters||45.4%|Medium||\n|0849|Maximize Distance to Closest Person||47.6%|Medium||\n|0850|Rectangle Area II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0850.Rectangle-Area-II)|53.7%|Hard||\n|0851|Loud and Rich|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0851.Loud-and-Rich)|58.1%|Medium||\n|0852|Peak Index in a Mountain Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0852.Peak-Index-in-a-Mountain-Array)|69.5%|Medium||\n|0853|Car Fleet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0853.Car-Fleet)|50.0%|Medium||\n|0854|K-Similar Strings||40.0%|Hard||\n|0855|Exam Room||43.5%|Medium||\n|0856|Score of Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0856.Score-of-Parentheses)|65.1%|Medium||\n|0857|Minimum Cost to Hire K Workers||52.0%|Hard||\n|0858|Mirror Reflection||63.3%|Medium||\n|0859|Buddy Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0859.Buddy-Strings)|29.0%|Easy||\n|0860|Lemonade Change||52.8%|Easy||\n|0861|Score After Flipping Matrix||75.1%|Medium||\n|0862|Shortest Subarray with Sum at Least K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K)|26.1%|Hard||\n|0863|All Nodes Distance K in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree)|62.1%|Medium||\n|0864|Shortest Path to Get All Keys|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0864.Shortest-Path-to-Get-All-Keys)|45.3%|Hard||\n|0865|Smallest Subtree with all the Deepest Nodes||68.5%|Medium||\n|0866|Prime Palindrome||25.8%|Medium||\n|0867|Transpose Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0867.Transpose-Matrix)|63.4%|Easy||\n|0868|Binary Gap||61.9%|Easy||\n|0869|Reordered Power of 2|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0869.Reordered-Power-of-2)|64.1%|Medium||\n|0870|Advantage Shuffle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0870.Advantage-Shuffle)|51.6%|Medium||\n|0871|Minimum Number of Refueling Stops||39.9%|Hard||\n|0872|Leaf-Similar Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0872.Leaf-Similar-Trees)|65.2%|Easy||\n|0873|Length of Longest Fibonacci Subsequence||48.6%|Medium||\n|0874|Walking Robot Simulation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0874.Walking-Robot-Simulation)|38.3%|Medium||\n|0875|Koko Eating Bananas|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0875.Koko-Eating-Bananas)|52.4%|Medium||\n|0876|Middle of the Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0876.Middle-of-the-Linked-List)|73.7%|Easy||\n|0877|Stone Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0877.Stone-Game)|69.7%|Medium||\n|0878|Nth Magical Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0878.Nth-Magical-Number)|35.7%|Hard||\n|0879|Profitable Schemes||40.5%|Hard||\n|0880|Decoded String at Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0880.Decoded-String-at-Index)|28.3%|Medium||\n|0881|Boats to Save People|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0881.Boats-to-Save-People)|52.7%|Medium||\n|0882|Reachable Nodes In Subdivided Graph||50.3%|Hard||\n|0883|Projection Area of 3D Shapes||70.7%|Easy||\n|0884|Uncommon Words from Two Sentences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0884.Uncommon-Words-from-Two-Sentences)|65.9%|Easy||\n|0885|Spiral Matrix III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0885.Spiral-Matrix-III)|73.0%|Medium||\n|0886|Possible Bipartition||48.4%|Medium||\n|0887|Super Egg Drop|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0887.Super-Egg-Drop)|27.2%|Hard||\n|0888|Fair Candy Swap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0888.Fair-Candy-Swap)|60.5%|Easy||\n|0889|Construct Binary Tree from Preorder and Postorder Traversal||70.8%|Medium||\n|0890|Find and Replace Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0890.Find-and-Replace-Pattern)|77.9%|Medium||\n|0891|Sum of Subsequence Widths|[Go](https://","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhalfrost%2Fleetcode-go","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhalfrost%2Fleetcode-go","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhalfrost%2Fleetcode-go/lists"}