From b3c62a3e0803789c767e9ef2a9602c20adb5539a Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Fri, 14 Dec 2018 22:14:31 +0800
Subject: [PATCH 01/22] Add: gh-pages

---
 README.md             |   1 +
 _config.yml           |   4 +
 _layouts/default.html |  55 +++
 index.md              | 960 ++++++++++++++++++++++++++++++++++++++++++
 4 files changed, 1020 insertions(+)
 create mode 100644 README.md
 create mode 100644 _config.yml
 create mode 100644 _layouts/default.html
 create mode 100644 index.md
diff --git a/README.md b/README.md
new file mode 100644
index 000000000..fedae2030
--- /dev/null
+++ b/README.md
@@ -0,0 +1 @@
+# &copy;2019 Openset. All rights reserved.
diff --git a/_config.yml b/_config.yml
new file mode 100644
index 000000000..1338eb460
--- /dev/null
+++ b/_config.yml
@@ -0,0 +1,4 @@
+lang:   zh-CN
+owner_name: Openset
+google_analytics: UA-103591670-1
+theme: jekyll-theme-cayman
diff --git a/_layouts/default.html b/_layouts/default.html
new file mode 100644
index 000000000..ee38e760e
--- /dev/null
+++ b/_layouts/default.html
@@ -0,0 +1,55 @@
+<!DOCTYPE html>
+<html lang="{{ site.lang | default: "en-US" }}">
+<head>
+    <meta charset="UTF-8">
+    {% seo %}
+    <meta name="description"
+          content="{{ page.description | default: site.description | default: site.github.project_tagline }}"/>
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <meta name="theme-color" content="#157878">
+    <link href='https://fonts.googleapis.com/css?family=Open+Sans:400,700' rel='stylesheet' type='text/css'>
+    <link rel="stylesheet" href="{{ '/assets/css/style.css?v=' | append: site.github.build_revision | relative_url }}">
+    <link rel="shortcut icon" href="https://openset.github.io/favicon.ico">
+</head>
+<body>
+
+<section class="main-content">
+
+    {{ content }}
+
+    <footer class="site-footer">
+    <span class="site-footer-owner">
+        <span style="float: left;width:76%; max-width:400px;">&copy;{{ site.time | date: "%Y" }} {{ site.owner_name }}. All rights reserved.</span>
+        <a href="{{ site.github.repository_url | default: site.github.owner_url }}" target="_blank">
+            <svg height="24" version="1.1" viewBox="0 0 16 16" width="24">
+                <path fill-rule="evenodd"
+                      d="M8 0C3.58 0 0 3.58 0 8c0 3.54 2.29 6.53 5.47 7.59.4.07.55-.17.55-.38 0-.19-.01-.82-.01-1.49-2.01.37-2.53-.49-2.69-.94-.09-.23-.48-.94-.82-1.13-.28-.15-.68-.52-.01-.53.63-.01 1.08.58 1.23.82.72 1.21 1.87.87 2.33.66.07-.52.28-.87.51-1.07-1.78-.2-3.64-.89-3.64-3.95 0-.87.31-1.59.82-2.15-.08-.2-.36-1.02.08-2.12 0 0 .67-.21 2.2.82.64-.18 1.32-.27 2-.27.68 0 1.36.09 2 .27 1.53-1.04 2.2-.82 2.2-.82.44 1.1.16 1.92.08 2.12.51.56.82 1.27.82 2.15 0 3.07-1.87 3.75-3.65 3.95.29.25.54.73.54 1.48 0 1.07-.01 1.93-.01 2.2 0 .21.15.46.55.38A8.013 8.013 0 0 0 16 8c0-4.42-3.58-8-8-8z"></path>
+            </svg>
+        </a>
+        <span style="float: right;">
+            <a href="javascript:window.scrollTo(0,0);">TOP</a>
+        </span>
+    </span>
+    </footer>
+</section>
+
+{% if site.google_analytics %}
+<script type="text/javascript">
+    (function (i, s, o, g, r, a, m) {
+        i['GoogleAnalyticsObject'] = r;
+        i[r] = i[r] || function () {
+                    (i[r].q = i[r].q || []).push(arguments)
+                }, i[r].l = 1 * new Date();
+        a = s.createElement(o),
+                m = s.getElementsByTagName(o)[0];
+        a.async = 1;
+        a.src = g;
+        m.parentNode.insertBefore(a, m)
+    })(window, document, 'script', '//www.google-analytics.com/analytics.js', 'ga');
+
+    ga('create', '{{ site.google_analytics }}', 'auto');
+    ga('send', 'pageview');
+</script>
+{% endif %}
+</body>
+</html>
diff --git a/index.md b/index.md
new file mode 100644
index 000000000..7078f7841
--- /dev/null
+++ b/index.md
@@ -0,0 +1,960 @@
+# LeetCode
+LeetCode Problems' Solutions
+
+[![Build Status](https://travis-ci.org/openset/leetcode.svg?branch=master)](https://travis-ci.org/openset/leetcode)
+[![Go Report Card](https://goreportcard.com/badge/github.com/openset/leetcode)](https://goreportcard.com/report/github.com/openset/leetcode)
+[![GitHub contributors](https://img.shields.io/github/contributors/openset/leetcode.svg)](https://github.com/openset/leetcode/graphs/contributors)
+[![license](https://img.shields.io/github/license/openset/leetcode.svg)](https://github.com/openset/leetcode/blob/master/LICENSE)
+[![GitHub code size in bytes](https://img.shields.io/github/languages/code-size/openset/leetcode.svg?colorB=green)](https://github.com/openset/leetcode/archive/master.zip)
+
+| # | Title | Solution | Difficulty |
+| :-: | - | - | :-: |
+| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | [Golang](solution/two-sum) | Easy |
+| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | [Golang](solution/add-two-numbers) | Medium |
+| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [Golang](solution/longest-substring-without-repeating-characters) | Medium |
+| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [Golang](solution/median-of-two-sorted-arrays) | Hard |
+| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [Golang](solution/longest-palindromic-substring) | Medium |
+| 6 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | [Golang](solution/zigzag-conversion) | Medium |
+| 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [Golang](solution/reverse-integer) | Easy |
+| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-(atoi)) | [Golang](solution/string-to-integer-(atoi)) | Medium |
+| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [Golang](solution/palindrome-number) | Easy |
+| 10 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | [Golang](solution/regular-expression-matching) | Hard |
+| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [Golang](solution/container-with-most-water) | Medium |
+| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [Golang](solution/integer-to-roman) | Medium |
+| 13 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | [Golang](solution/roman-to-integer) | Easy |
+| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | [Golang](solution/longest-common-prefix) | Easy |
+| 15 | [3Sum](https://leetcode.com/problems/3sum) | [Golang](solution/3sum) | Medium |
+| 16 | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | [Golang](solution/3sum-closest) | Medium |
+| 17 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [Golang](solution/letter-combinations-of-a-phone-number) | Medium |
+| 18 | [4Sum](https://leetcode.com/problems/4sum) | [Golang](solution/4sum) | Medium |
+| 19 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [Golang](solution/remove-nth-node-from-end-of-list) | Medium |
+| 20 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [Golang](solution/valid-parentheses) | Easy |
+| 21 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [Golang](solution/merge-two-sorted-lists) | Easy |
+| 22 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | [Golang](solution/generate-parentheses) | Medium |
+| 23 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | [Golang](solution/merge-k-sorted-lists) | Hard |
+| 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | [Golang](solution/swap-nodes-in-pairs) | Medium |
+| 25 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [Golang](solution/reverse-nodes-in-k-group) | Hard |
+| 26 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [Golang](solution/remove-duplicates-from-sorted-array) | Easy |
+| 27 | [Remove Element](https://leetcode.com/problems/remove-element) | [Golang](solution/remove-element) | Easy |
+| 28 | [Implement strStr()](https://leetcode.com/problems/implement-strstr()) | [Golang](solution/implement-strstr()) | Easy |
+| 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | [Golang](solution/divide-two-integers) | Medium |
+| 30 | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | [Golang](solution/substring-with-concatenation-of-all-words) | Hard |
+| 31 | [Next Permutation](https://leetcode.com/problems/next-permutation) | [Golang](solution/next-permutation) | Medium |
+| 32 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses) | [Golang](solution/longest-valid-parentheses) | Hard |
+| 33 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [Golang](solution/search-in-rotated-sorted-array) | Medium |
+| 34 | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | [Golang](solution/find-first-and-last-position-of-element-in-sorted-array) | Medium |
+| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | [Golang](solution/search-insert-position) | Easy |
+| 36 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | [Golang](solution/valid-sudoku) | Medium |
+| 37 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | [Golang](solution/sudoku-solver) | Hard |
+| 38 | [Count and Say](https://leetcode.com/problems/count-and-say) | [Golang](solution/count-and-say) | Easy |
+| 39 | [Combination Sum](https://leetcode.com/problems/combination-sum) | [Golang](solution/combination-sum) | Medium |
+| 40 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | [Golang](solution/combination-sum-ii) | Medium |
+| 41 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | [Golang](solution/first-missing-positive) | Hard |
+| 42 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | [Golang](solution/trapping-rain-water) | Hard |
+| 43 | [Multiply Strings](https://leetcode.com/problems/multiply-strings) | [Golang](solution/multiply-strings) | Medium |
+| 44 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | [Golang](solution/wildcard-matching) | Hard |
+| 45 | [Jump Game II](https://leetcode.com/problems/jump-game-ii) | [Golang](solution/jump-game-ii) | Hard |
+| 46 | [Permutations](https://leetcode.com/problems/permutations) | [Golang](solution/permutations) | Medium |
+| 47 | [Permutations II](https://leetcode.com/problems/permutations-ii) | [Golang](solution/permutations-ii) | Medium |
+| 48 | [Rotate Image](https://leetcode.com/problems/rotate-image) | [Golang](solution/rotate-image) | Medium |
+| 49 | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | [Golang](solution/group-anagrams) | Medium |
+| 50 | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [Golang](solution/powx-n) | Medium |
+| 51 | [N-Queens](https://leetcode.com/problems/n-queens) | [Golang](solution/n-queens) | Hard |
+| 52 | [N-Queens II](https://leetcode.com/problems/n-queens-ii) | [Golang](solution/n-queens-ii) | Hard |
+| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [Golang](solution/maximum-subarray) | Easy |
+| 54 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | [Golang](solution/spiral-matrix) | Medium |
+| 55 | [Jump Game](https://leetcode.com/problems/jump-game) | [Golang](solution/jump-game) | Medium |
+| 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [Golang](solution/merge-intervals) | Medium |
+| 57 | [Insert Interval](https://leetcode.com/problems/insert-interval) | [Golang](solution/insert-interval) | Hard |
+| 58 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [Golang](solution/length-of-last-word) | Easy |
+| 59 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) | [Golang](solution/spiral-matrix-ii) | Medium |
+| 60 | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence) | [Golang](solution/permutation-sequence) | Medium |
+| 61 | [Rotate List](https://leetcode.com/problems/rotate-list) | [Golang](solution/rotate-list) | Medium |
+| 62 | [Unique Paths](https://leetcode.com/problems/unique-paths) | [Golang](solution/unique-paths) | Medium |
+| 63 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | [Golang](solution/unique-paths-ii) | Medium |
+| 64 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | [Golang](solution/minimum-path-sum) | Medium |
+| 65 | [Valid Number](https://leetcode.com/problems/valid-number) | [Golang](solution/valid-number) | Hard |
+| 66 | [Plus One](https://leetcode.com/problems/plus-one) | [Golang](solution/plus-one) | Easy |
+| 67 | [Add Binary](https://leetcode.com/problems/add-binary) | [Golang](solution/add-binary) | Easy |
+| 68 | [Text Justification](https://leetcode.com/problems/text-justification) | [Golang](solution/text-justification) | Hard |
+| 69 | [Sqrt(x)](https://leetcode.com/problems/sqrt(x)) | [Golang](solution/sqrt(x)) | Easy |
+| 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Golang](solution/climbing-stairs) | Easy |
+| 71 | [Simplify Path](https://leetcode.com/problems/simplify-path) | [Golang](solution/simplify-path) | Medium |
+| 72 | [Edit Distance](https://leetcode.com/problems/edit-distance) | [Golang](solution/edit-distance) | Hard |
+| 73 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | [Golang](solution/set-matrix-zeroes) | Medium |
+| 74 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | [Golang](solution/search-a-2d-matrix) | Medium |
+| 75 | [Sort Colors](https://leetcode.com/problems/sort-colors) | [Golang](solution/sort-colors) | Medium |
+| 76 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | [Golang](solution/minimum-window-substring) | Hard |
+| 77 | [Combinations](https://leetcode.com/problems/combinations) | [Golang](solution/combinations) | Medium |
+| 78 | [Subsets](https://leetcode.com/problems/subsets) | [Golang](solution/subsets) | Medium |
+| 79 | [Word Search](https://leetcode.com/problems/word-search) | [Golang](solution/word-search) | Medium |
+| 80 | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [Golang](solution/remove-duplicates-from-sorted-array-ii) | Medium |
+| 81 | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | [Golang](solution/search-in-rotated-sorted-array-ii) | Medium |
+| 82 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) | [Golang](solution/remove-duplicates-from-sorted-list-ii) | Medium |
+| 83 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | [Golang](solution/remove-duplicates-from-sorted-list) | Easy |
+| 84 | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) | [Golang](solution/largest-rectangle-in-histogram) | Hard |
+| 85 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | [Golang](solution/maximal-rectangle) | Hard |
+| 86 | [Partition List](https://leetcode.com/problems/partition-list) | [Golang](solution/partition-list) | Medium |
+| 87 | [Scramble String](https://leetcode.com/problems/scramble-string) | [Golang](solution/scramble-string) | Hard |
+| 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | [Golang](solution/merge-sorted-array) | Easy |
+| 89 | [Gray Code](https://leetcode.com/problems/gray-code) | [Golang](solution/gray-code) | Medium |
+| 90 | [Subsets II](https://leetcode.com/problems/subsets-ii) | [Golang](solution/subsets-ii) | Medium |
+| 91 | [Decode Ways](https://leetcode.com/problems/decode-ways) | [Golang](solution/decode-ways) | Medium |
+| 92 | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | [Golang](solution/reverse-linked-list-ii) | Medium |
+| 93 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | [Golang](solution/restore-ip-addresses) | Medium |
+| 94 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | [Golang](solution/binary-tree-inorder-traversal) | Medium |
+| 95 | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii) | [Golang](solution/unique-binary-search-trees-ii) | Medium |
+| 96 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) | [Golang](solution/unique-binary-search-trees) | Medium |
+| 97 | [Interleaving String](https://leetcode.com/problems/interleaving-string) | [Golang](solution/interleaving-string) | Hard |
+| 98 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | [Golang](solution/validate-binary-search-tree) | Medium |
+| 99 | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) | [Golang](solution/recover-binary-search-tree) | Hard |
+| 100 | [Same Tree](https://leetcode.com/problems/same-tree) | [Golang](solution/same-tree) | Easy |
+| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | [Golang](solution/symmetric-tree) | Easy |
+| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [Golang](solution/binary-tree-level-order-traversal) | Medium |
+| 103 | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | [Golang](solution/binary-tree-zigzag-level-order-traversal) | Medium |
+| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [Golang](solution/maximum-depth-of-binary-tree) | Easy |
+| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [Golang](solution/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium |
+| 106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [Golang](solution/construct-binary-tree-from-inorder-and-postorder-traversal) | Medium |
+| 107 | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | [Golang](solution/binary-tree-level-order-traversal-ii) | Easy |
+| 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | [Golang](solution/convert-sorted-array-to-binary-search-tree) | Easy |
+| 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) | [Golang](solution/convert-sorted-list-to-binary-search-tree) | Medium |
+| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | [Golang](solution/balanced-binary-tree) | Easy |
+| 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | [Golang](solution/minimum-depth-of-binary-tree) | Easy |
+| 112 | [Path Sum](https://leetcode.com/problems/path-sum) | [Golang](solution/path-sum) | Easy |
+| 113 | [Path Sum II](https://leetcode.com/problems/path-sum-ii) | [Golang](solution/path-sum-ii) | Medium |
+| 114 | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) | [Golang](solution/flatten-binary-tree-to-linked-list) | Medium |
+| 115 | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences) | [Golang](solution/distinct-subsequences) | Hard |
+| 116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | [Golang](solution/populating-next-right-pointers-in-each-node) | Medium |
+| 117 | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | [Golang](solution/populating-next-right-pointers-in-each-node-ii) | Medium |
+| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascal's-triangle) | [Golang](solution/pascal's-triangle) | Easy |
+| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascal's-triangle-ii) | [Golang](solution/pascal's-triangle-ii) | Easy |
+| 120 | [Triangle](https://leetcode.com/problems/triangle) | [Golang](solution/triangle) | Medium |
+| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [Golang](solution/best-time-to-buy-and-sell-stock) | Easy |
+| 122 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [Golang](solution/best-time-to-buy-and-sell-stock-ii) | Easy |
+| 123 | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | [Golang](solution/best-time-to-buy-and-sell-stock-iii) | Hard |
+| 124 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [Golang](solution/binary-tree-maximum-path-sum) | Hard |
+| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [Golang](solution/valid-palindrome) | Easy |
+| 126 | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii) | [Golang](solution/word-ladder-ii) | Hard |
+| 127 | [Word Ladder](https://leetcode.com/problems/word-ladder) | [Golang](solution/word-ladder) | Medium |
+| 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | [Golang](solution/longest-consecutive-sequence) | Hard |
+| 129 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | [Golang](solution/sum-root-to-leaf-numbers) | Medium |
+| 130 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions) | [Golang](solution/surrounded-regions) | Medium |
+| 131 | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) | [Golang](solution/palindrome-partitioning) | Medium |
+| 132 | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii) | [Golang](solution/palindrome-partitioning-ii) | Hard |
+| 133 | [Clone Graph](https://leetcode.com/problems/clone-graph) | [Golang](solution/clone-graph) | Medium |
+| 134 | [Gas Station](https://leetcode.com/problems/gas-station) | [Golang](solution/gas-station) | Medium |
+| 135 | [Candy](https://leetcode.com/problems/candy) | [Golang](solution/candy) | Hard |
+| 136 | [Single Number](https://leetcode.com/problems/single-number) | [Golang](solution/single-number) | Easy |
+| 137 | [Single Number II](https://leetcode.com/problems/single-number-ii) | [Golang](solution/single-number-ii) | Medium |
+| 138 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | [Golang](solution/copy-list-with-random-pointer) | Medium |
+| 139 | [Word Break](https://leetcode.com/problems/word-break) | [Golang](solution/word-break) | Medium |
+| 140 | [Word Break II](https://leetcode.com/problems/word-break-ii) | [Golang](solution/word-break-ii) | Hard |
+| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [Golang](solution/linked-list-cycle) | Easy |
+| 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) | [Golang](solution/linked-list-cycle-ii) | Medium |
+| 143 | [Reorder List](https://leetcode.com/problems/reorder-list) | [Golang](solution/reorder-list) | Medium |
+| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | [Golang](solution/binary-tree-preorder-traversal) | Medium |
+| 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | [Golang](solution/binary-tree-postorder-traversal) | Hard |
+| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache) | [Golang](solution/lru-cache) | Hard |
+| 147 | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) | [Golang](solution/insertion-sort-list) | Medium |
+| 148 | [Sort List](https://leetcode.com/problems/sort-list) | [Golang](solution/sort-list) | Medium |
+| 149 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | [Golang](solution/max-points-on-a-line) | Hard |
+| 150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | [Golang](solution/evaluate-reverse-polish-notation) | Medium |
+| 151 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | [Golang](solution/reverse-words-in-a-string) | Medium |
+| 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | [Golang](solution/maximum-product-subarray) | Medium |
+| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [Golang](solution/find-minimum-in-rotated-sorted-array) | Medium |
+| 154 | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | [Golang](solution/find-minimum-in-rotated-sorted-array-ii) | Hard |
+| 155 | [Min Stack](https://leetcode.com/problems/min-stack) | [Golang](solution/min-stack) | Easy |
+| 156 | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) | [Golang](solution/binary-tree-upside-down) | Medium |
+| 157 | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) | [Golang](solution/read-n-characters-given-read4) | Easy |
+| 158 | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii---call-multiple-times) | [Golang](solution/read-n-characters-given-read4-ii---call-multiple-times) | Hard |
+| 159 | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) | [Golang](solution/longest-substring-with-at-most-two-distinct-characters) | Hard |
+| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Golang](solution/intersection-of-two-linked-lists) | Easy |
+| 161 | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) | [Golang](solution/one-edit-distance) | Medium |
+| 162 | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [Golang](solution/find-peak-element) | Medium |
+| 163 | [Missing Ranges](https://leetcode.com/problems/missing-ranges) | [Golang](solution/missing-ranges) | Medium |
+| 164 | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [Golang](solution/maximum-gap) | Hard |
+| 165 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [Golang](solution/compare-version-numbers) | Medium |
+| 166 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [Golang](solution/fraction-to-recurring-decimal) | Medium |
+| 167 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii---input-array-is-sorted) | [Golang](solution/two-sum-ii---input-array-is-sorted) | Easy |
+| 168 | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [Golang](solution/excel-sheet-column-title) | Easy |
+| 169 | [Majority Element](https://leetcode.com/problems/majority-element) | [Golang](solution/majority-element) | Easy |
+| 170 | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii---data-structure-design) | [Golang](solution/two-sum-iii---data-structure-design) | Easy |
+| 171 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [Golang](solution/excel-sheet-column-number) | Easy |
+| 172 | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Golang](solution/factorial-trailing-zeroes) | Easy |
+| 173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Golang](solution/binary-search-tree-iterator) | Medium |
+| 174 | [Dungeon Game](https://leetcode.com/problems/dungeon-game) | [Golang](solution/dungeon-game) | Hard |
+| 175 | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | [Golang](solution/combine-two-tables) | Easy |
+| 176 | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | [Golang](solution/second-highest-salary) | Easy |
+| 177 | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary) | [Golang](solution/nth-highest-salary) | Medium |
+| 178 | [Rank Scores](https://leetcode.com/problems/rank-scores) | [Golang](solution/rank-scores) | Medium |
+| 179 | [Largest Number](https://leetcode.com/problems/largest-number) | [Golang](solution/largest-number) | Medium |
+| 180 | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers) | [Golang](solution/consecutive-numbers) | Medium |
+| 181 | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | [Golang](solution/employees-earning-more-than-their-managers) | Easy |
+| 182 | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails) | [Golang](solution/duplicate-emails) | Easy |
+| 183 | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [Golang](solution/customers-who-never-order) | Easy |
+| 184 | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [Golang](solution/department-highest-salary) | Medium |
+| 185 | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [Golang](solution/department-top-three-salaries) | Hard |
+| 186 | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) | [Golang](solution/reverse-words-in-a-string-ii) | Medium |
+| 187 | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [Golang](solution/repeated-dna-sequences) | Medium |
+| 188 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [Golang](solution/best-time-to-buy-and-sell-stock-iv) | Hard |
+| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array) | [Golang](solution/rotate-array) | Easy |
+| 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | [Golang](solution/reverse-bits) | Easy |
+| 191 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | [Golang](solution/number-of-1-bits) | Easy |
+| 192 | [Word Frequency](https://leetcode.com/problems/word-frequency) | [Golang](solution/word-frequency) | Medium |
+| 193 | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Golang](solution/valid-phone-numbers) | Easy |
+| 194 | [Transpose File](https://leetcode.com/problems/transpose-file) | [Golang](solution/transpose-file) | Medium |
+| 195 | [Tenth Line](https://leetcode.com/problems/tenth-line) | [Golang](solution/tenth-line) | Easy |
+| 196 | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | [Golang](solution/delete-duplicate-emails) | Easy |
+| 197 | [Rising Temperature](https://leetcode.com/problems/rising-temperature) | [Golang](solution/rising-temperature) | Easy |
+| 198 | [House Robber](https://leetcode.com/problems/house-robber) | [Golang](solution/house-robber) | Easy |
+| 199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [Golang](solution/binary-tree-right-side-view) | Medium |
+| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | [Golang](solution/number-of-islands) | Medium |
+| 201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | [Golang](solution/bitwise-and-of-numbers-range) | Medium |
+| 202 | [Happy Number](https://leetcode.com/problems/happy-number) | [Golang](solution/happy-number) | Easy |
+| 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | [Golang](solution/remove-linked-list-elements) | Easy |
+| 204 | [Count Primes](https://leetcode.com/problems/count-primes) | [Golang](solution/count-primes) | Easy |
+| 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | [Golang](solution/isomorphic-strings) | Easy |
+| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [Golang](solution/reverse-linked-list) | Easy |
+| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule) | [Golang](solution/course-schedule) | Medium |
+| 208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-(prefix-tree)) | [Golang](solution/implement-trie-(prefix-tree)) | Medium |
+| 209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | [Golang](solution/minimum-size-subarray-sum) | Medium |
+| 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | [Golang](solution/course-schedule-ii) | Medium |
+| 211 | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word---data-structure-design) | [Golang](solution/add-and-search-word---data-structure-design) | Medium |
+| 212 | [Word Search II](https://leetcode.com/problems/word-search-ii) | [Golang](solution/word-search-ii) | Hard |
+| 213 | [House Robber II](https://leetcode.com/problems/house-robber-ii) | [Golang](solution/house-robber-ii) | Medium |
+| 214 | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome) | [Golang](solution/shortest-palindrome) | Hard |
+| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [Golang](solution/kth-largest-element-in-an-array) | Medium |
+| 216 | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii) | [Golang](solution/combination-sum-iii) | Medium |
+| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [Golang](solution/contains-duplicate) | Easy |
+| 218 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | [Golang](solution/the-skyline-problem) | Hard |
+| 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | [Golang](solution/contains-duplicate-ii) | Easy |
+| 220 | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii) | [Golang](solution/contains-duplicate-iii) | Medium |
+| 221 | [Maximal Square](https://leetcode.com/problems/maximal-square) | [Golang](solution/maximal-square) | Medium |
+| 222 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | [Golang](solution/count-complete-tree-nodes) | Medium |
+| 223 | [Rectangle Area](https://leetcode.com/problems/rectangle-area) | [Golang](solution/rectangle-area) | Medium |
+| 224 | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | [Golang](solution/basic-calculator) | Hard |
+| 225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues) | [Golang](solution/implement-stack-using-queues) | Easy |
+| 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | [Golang](solution/invert-binary-tree) | Easy |
+| 227 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii) | [Golang](solution/basic-calculator-ii) | Medium |
+| 228 | [Summary Ranges](https://leetcode.com/problems/summary-ranges) | [Golang](solution/summary-ranges) | Medium |
+| 229 | [Majority Element II](https://leetcode.com/problems/majority-element-ii) | [Golang](solution/majority-element-ii) | Medium |
+| 230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [Golang](solution/kth-smallest-element-in-a-bst) | Medium |
+| 231 | [Power of Two](https://leetcode.com/problems/power-of-two) | [Golang](solution/power-of-two) | Easy |
+| 232 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | [Golang](solution/implement-queue-using-stacks) | Easy |
+| 233 | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one) | [Golang](solution/number-of-digit-one) | Hard |
+| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | [Golang](solution/palindrome-linked-list) | Easy |
+| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [Golang](solution/lowest-common-ancestor-of-a-binary-search-tree) | Easy |
+| 236 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | [Golang](solution/lowest-common-ancestor-of-a-binary-tree) | Medium |
+| 237 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | [Golang](solution/delete-node-in-a-linked-list) | Easy |
+| 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | [Golang](solution/product-of-array-except-self) | Medium |
+| 239 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | [Golang](solution/sliding-window-maximum) | Hard |
+| 240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | [Golang](solution/search-a-2d-matrix-ii) | Medium |
+| 241 | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) | [Golang](solution/different-ways-to-add-parentheses) | Medium |
+| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [Golang](solution/valid-anagram) | Easy |
+| 243 | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) | [Golang](solution/shortest-word-distance) | Easy |
+| 244 | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) | [Golang](solution/shortest-word-distance-ii) | Medium |
+| 245 | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) | [Golang](solution/shortest-word-distance-iii) | Medium |
+| 246 | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) | [Golang](solution/strobogrammatic-number) | Easy |
+| 247 | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) | [Golang](solution/strobogrammatic-number-ii) | Medium |
+| 248 | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) | [Golang](solution/strobogrammatic-number-iii) | Hard |
+| 249 | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) | [Golang](solution/group-shifted-strings) | Medium |
+| 250 | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) | [Golang](solution/count-univalue-subtrees) | Medium |
+| 251 | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) | [Golang](solution/flatten-2d-vector) | Medium |
+| 252 | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) | [Golang](solution/meeting-rooms) | Easy |
+| 253 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) | [Golang](solution/meeting-rooms-ii) | Medium |
+| 254 | [Factor Combinations](https://leetcode.com/problems/factor-combinations) | [Golang](solution/factor-combinations) | Medium |
+| 255 | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) | [Golang](solution/verify-preorder-sequence-in-binary-search-tree) | Medium |
+| 256 | [Paint House](https://leetcode.com/problems/paint-house) | [Golang](solution/paint-house) | Easy |
+| 257 | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | [Golang](solution/binary-tree-paths) | Easy |
+| 258 | [Add Digits](https://leetcode.com/problems/add-digits) | [Golang](solution/add-digits) | Easy |
+| 259 | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) | [Golang](solution/3sum-smaller) | Medium |
+| 260 | [Single Number III](https://leetcode.com/problems/single-number-iii) | [Golang](solution/single-number-iii) | Medium |
+| 261 | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) | [Golang](solution/graph-valid-tree) | Medium |
+| 262 | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [Golang](solution/trips-and-users) | Hard |
+| 263 | [Ugly Number](https://leetcode.com/problems/ugly-number) | [Golang](solution/ugly-number) | Easy |
+| 264 | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [Golang](solution/ugly-number-ii) | Medium |
+| 265 | [Paint House II](https://leetcode.com/problems/paint-house-ii) | [Golang](solution/paint-house-ii) | Hard |
+| 266 | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) | [Golang](solution/palindrome-permutation) | Easy |
+| 267 | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) | [Golang](solution/palindrome-permutation-ii) | Medium |
+| 268 | [Missing Number](https://leetcode.com/problems/missing-number) | [Golang](solution/missing-number) | Easy |
+| 269 | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) | [Golang](solution/alien-dictionary) | Hard |
+| 270 | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) | [Golang](solution/closest-binary-search-tree-value) | Easy |
+| 271 | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) | [Golang](solution/encode-and-decode-strings) | Medium |
+| 272 | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) | [Golang](solution/closest-binary-search-tree-value-ii) | Hard |
+| 273 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | [Golang](solution/integer-to-english-words) | Hard |
+| 274 | [H-Index](https://leetcode.com/problems/h-index) | [Golang](solution/h-index) | Medium |
+| 275 | [H-Index II](https://leetcode.com/problems/h-index-ii) | [Golang](solution/h-index-ii) | Medium |
+| 276 | [Paint Fence](https://leetcode.com/problems/paint-fence) | [Golang](solution/paint-fence) | Easy |
+| 277 | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) | [Golang](solution/find-the-celebrity) | Medium |
+| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version) | [Golang](solution/first-bad-version) | Easy |
+| 279 | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | [Golang](solution/perfect-squares) | Medium |
+| 280 | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) | [Golang](solution/wiggle-sort) | Medium |
+| 281 | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) | [Golang](solution/zigzag-iterator) | Medium |
+| 282 | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | [Golang](solution/expression-add-operators) | Hard |
+| 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [Golang](solution/move-zeroes) | Easy |
+| 284 | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | [Golang](solution/peeking-iterator) | Medium |
+| 285 | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) | [Golang](solution/inorder-successor-in-bst) | Medium |
+| 286 | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) | [Golang](solution/walls-and-gates) | Medium |
+| 287 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | [Golang](solution/find-the-duplicate-number) | Medium |
+| 288 | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) | [Golang](solution/unique-word-abbreviation) | Medium |
+| 289 | [Game of Life](https://leetcode.com/problems/game-of-life) | [Golang](solution/game-of-life) | Medium |
+| 290 | [Word Pattern](https://leetcode.com/problems/word-pattern) | [Golang](solution/word-pattern) | Easy |
+| 291 | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) | [Golang](solution/word-pattern-ii) | Hard |
+| 292 | [Nim Game](https://leetcode.com/problems/nim-game) | [Golang](solution/nim-game) | Easy |
+| 293 | [Flip Game](https://leetcode.com/problems/flip-game) | [Golang](solution/flip-game) | Easy |
+| 294 | [Flip Game II](https://leetcode.com/problems/flip-game-ii) | [Golang](solution/flip-game-ii) | Medium |
+| 295 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [Golang](solution/find-median-from-data-stream) | Hard |
+| 296 | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) | [Golang](solution/best-meeting-point) | Hard |
+| 297 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [Golang](solution/serialize-and-deserialize-binary-tree) | Hard |
+| 298 | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) | [Golang](solution/binary-tree-longest-consecutive-sequence) | Medium |
+| 299 | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | [Golang](solution/bulls-and-cows) | Medium |
+| 300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [Golang](solution/longest-increasing-subsequence) | Medium |
+| 301 | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Golang](solution/remove-invalid-parentheses) | Hard |
+| 302 | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) | [Golang](solution/smallest-rectangle-enclosing-black-pixels) | Hard |
+| 303 | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query---immutable) | [Golang](solution/range-sum-query---immutable) | Easy |
+| 304 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d---immutable) | [Golang](solution/range-sum-query-2d---immutable) | Medium |
+| 305 | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) | [Golang](solution/number-of-islands-ii) | Hard |
+| 306 | [Additive Number](https://leetcode.com/problems/additive-number) | [Golang](solution/additive-number) | Medium |
+| 307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query---mutable) | [Golang](solution/range-sum-query---mutable) | Medium |
+| 308 | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d---mutable) | [Golang](solution/range-sum-query-2d---mutable) | Hard |
+| 309 | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [Golang](solution/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
+| 310 | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [Golang](solution/minimum-height-trees) | Medium |
+| 311 | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) | [Golang](solution/sparse-matrix-multiplication) | Medium |
+| 312 | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | [Golang](solution/burst-balloons) | Hard |
+| 313 | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number) | [Golang](solution/super-ugly-number) | Medium |
+| 314 | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) | [Golang](solution/binary-tree-vertical-order-traversal) | Medium |
+| 315 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | [Golang](solution/count-of-smaller-numbers-after-self) | Hard |
+| 316 | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | [Golang](solution/remove-duplicate-letters) | Hard |
+| 317 | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) | [Golang](solution/shortest-distance-from-all-buildings) | Hard |
+| 318 | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | [Golang](solution/maximum-product-of-word-lengths) | Medium |
+| 319 | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [Golang](solution/bulb-switcher) | Medium |
+| 320 | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) | [Golang](solution/generalized-abbreviation) | Medium |
+| 321 | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | [Golang](solution/create-maximum-number) | Hard |
+| 322 | [Coin Change](https://leetcode.com/problems/coin-change) | [Golang](solution/coin-change) | Medium |
+| 323 | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) | [Golang](solution/number-of-connected-components-in-an-undirected-graph) | Medium |
+| 324 | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | [Golang](solution/wiggle-sort-ii) | Medium |
+| 325 | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) | [Golang](solution/maximum-size-subarray-sum-equals-k) | Medium |
+| 326 | [Power of Three](https://leetcode.com/problems/power-of-three) | [Golang](solution/power-of-three) | Easy |
+| 327 | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | [Golang](solution/count-of-range-sum) | Hard |
+| 328 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | [Golang](solution/odd-even-linked-list) | Medium |
+| 329 | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | [Golang](solution/longest-increasing-path-in-a-matrix) | Hard |
+| 330 | [Patching Array](https://leetcode.com/problems/patching-array) | [Golang](solution/patching-array) | Hard |
+| 331 | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | [Golang](solution/verify-preorder-serialization-of-a-binary-tree) | Medium |
+| 332 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | [Golang](solution/reconstruct-itinerary) | Medium |
+| 333 | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) | [Golang](solution/largest-bst-subtree) | Medium |
+| 334 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | [Golang](solution/increasing-triplet-subsequence) | Medium |
+| 335 | [Self Crossing](https://leetcode.com/problems/self-crossing) | [Golang](solution/self-crossing) | Hard |
+| 336 | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs) | [Golang](solution/palindrome-pairs) | Hard |
+| 337 | [House Robber III](https://leetcode.com/problems/house-robber-iii) | [Golang](solution/house-robber-iii) | Medium |
+| 338 | [Counting Bits](https://leetcode.com/problems/counting-bits) | [Golang](solution/counting-bits) | Medium |
+| 339 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) | [Golang](solution/nested-list-weight-sum) | Easy |
+| 340 | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) | [Golang](solution/longest-substring-with-at-most-k-distinct-characters) | Hard |
+| 341 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | [Golang](solution/flatten-nested-list-iterator) | Medium |
+| 342 | [Power of Four](https://leetcode.com/problems/power-of-four) | [Golang](solution/power-of-four) | Easy |
+| 343 | [Integer Break](https://leetcode.com/problems/integer-break) | [Golang](solution/integer-break) | Medium |
+| 344 | [Reverse String](https://leetcode.com/problems/reverse-string) | [Golang](solution/reverse-string) | Easy |
+| 345 | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [Golang](solution/reverse-vowels-of-a-string) | Easy |
+| 346 | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) | [Golang](solution/moving-average-from-data-stream) | Easy |
+| 347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [Golang](solution/top-k-frequent-elements) | Medium |
+| 348 | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) | [Golang](solution/design-tic-tac-toe) | Medium |
+| 349 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | [Golang](solution/intersection-of-two-arrays) | Easy |
+| 350 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | [Golang](solution/intersection-of-two-arrays-ii) | Easy |
+| 351 | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) | [Golang](solution/android-unlock-patterns) | Medium |
+| 352 | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals) | [Golang](solution/data-stream-as-disjoint-intervals) | Hard |
+| 353 | [Design Snake Game](https://leetcode.com/problems/design-snake-game) | [Golang](solution/design-snake-game) | Medium |
+| 354 | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | [Golang](solution/russian-doll-envelopes) | Hard |
+| 355 | [Design Twitter](https://leetcode.com/problems/design-twitter) | [Golang](solution/design-twitter) | Medium |
+| 356 | [Line Reflection](https://leetcode.com/problems/line-reflection) | [Golang](solution/line-reflection) | Medium |
+| 357 | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | [Golang](solution/count-numbers-with-unique-digits) | Medium |
+| 358 | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) | [Golang](solution/rearrange-string-k-distance-apart) | Hard |
+| 359 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) | [Golang](solution/logger-rate-limiter) | Easy |
+| 360 | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) | [Golang](solution/sort-transformed-array) | Medium |
+| 361 | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) | [Golang](solution/bomb-enemy) | Medium |
+| 362 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) | [Golang](solution/design-hit-counter) | Medium |
+| 363 | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | [Golang](solution/max-sum-of-rectangle-no-larger-than-k) | Hard |
+| 364 | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) | [Golang](solution/nested-list-weight-sum-ii) | Medium |
+| 365 | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem) | [Golang](solution/water-and-jug-problem) | Medium |
+| 366 | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) | [Golang](solution/find-leaves-of-binary-tree) | Medium |
+| 367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | [Golang](solution/valid-perfect-square) | Easy |
+| 368 | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | [Golang](solution/largest-divisible-subset) | Medium |
+| 369 | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) | [Golang](solution/plus-one-linked-list) | Medium |
+| 370 | [Range Addition](https://leetcode.com/problems/range-addition) | [Golang](solution/range-addition) | Medium |
+| 371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | [Golang](solution/sum-of-two-integers) | Easy |
+| 372 | [Super Pow](https://leetcode.com/problems/super-pow) | [Golang](solution/super-pow) | Medium |
+| 373 | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | [Golang](solution/find-k-pairs-with-smallest-sums) | Medium |
+| 374 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | [Golang](solution/guess-number-higher-or-lower) | Easy |
+| 375 | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii) | [Golang](solution/guess-number-higher-or-lower-ii) | Medium |
+| 376 | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence) | [Golang](solution/wiggle-subsequence) | Medium |
+| 377 | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [Golang](solution/combination-sum-iv) | Medium |
+| 378 | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [Golang](solution/kth-smallest-element-in-a-sorted-matrix) | Medium |
+| 379 | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) | [Golang](solution/design-phone-directory) | Medium |
+| 380 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o(1)) | [Golang](solution/insert-delete-getrandom-o(1)) | Medium |
+| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o(1)---duplicates-allowed) | [Golang](solution/insert-delete-getrandom-o(1)---duplicates-allowed) | Hard |
+| 382 | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [Golang](solution/linked-list-random-node) | Medium |
+| 383 | [Ransom Note](https://leetcode.com/problems/ransom-note) | [Golang](solution/ransom-note) | Easy |
+| 384 | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | [Golang](solution/shuffle-an-array) | Medium |
+| 385 | [Mini Parser](https://leetcode.com/problems/mini-parser) | [Golang](solution/mini-parser) | Medium |
+| 386 | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers) | [Golang](solution/lexicographical-numbers) | Medium |
+| 387 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | [Golang](solution/first-unique-character-in-a-string) | Easy |
+| 388 | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path) | [Golang](solution/longest-absolute-file-path) | Medium |
+| 389 | [Find the Difference](https://leetcode.com/problems/find-the-difference) | [Golang](solution/find-the-difference) | Easy |
+| 390 | [Elimination Game](https://leetcode.com/problems/elimination-game) | [Golang](solution/elimination-game) | Medium |
+| 391 | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle) | [Golang](solution/perfect-rectangle) | Hard |
+| 392 | [Is Subsequence](https://leetcode.com/problems/is-subsequence) | [Golang](solution/is-subsequence) | Medium |
+| 393 | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation) | [Golang](solution/utf-8-validation) | Medium |
+| 394 | [Decode String](https://leetcode.com/problems/decode-string) | [Golang](solution/decode-string) | Medium |
+| 395 | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters) | [Golang](solution/longest-substring-with-at-least-k-repeating-characters) | Medium |
+| 396 | [Rotate Function](https://leetcode.com/problems/rotate-function) | [Golang](solution/rotate-function) | Medium |
+| 397 | [Integer Replacement](https://leetcode.com/problems/integer-replacement) | [Golang](solution/integer-replacement) | Medium |
+| 398 | [Random Pick Index](https://leetcode.com/problems/random-pick-index) | [Golang](solution/random-pick-index) | Medium |
+| 399 | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | [Golang](solution/evaluate-division) | Medium |
+| 400 | [Nth Digit](https://leetcode.com/problems/nth-digit) | [Golang](solution/nth-digit) | Easy |
+| 401 | [Binary Watch](https://leetcode.com/problems/binary-watch) | [Golang](solution/binary-watch) | Easy |
+| 402 | [Remove K Digits](https://leetcode.com/problems/remove-k-digits) | [Golang](solution/remove-k-digits) | Medium |
+| 403 | [Frog Jump](https://leetcode.com/problems/frog-jump) | [Golang](solution/frog-jump) | Hard |
+| 404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves) | [Golang](solution/sum-of-left-leaves) | Easy |
+| 405 | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [Golang](solution/convert-a-number-to-hexadecimal) | Easy |
+| 406 | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | [Golang](solution/queue-reconstruction-by-height) | Medium |
+| 407 | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | [Golang](solution/trapping-rain-water-ii) | Hard |
+| 408 | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) | [Golang](solution/valid-word-abbreviation) | Easy |
+| 409 | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [Golang](solution/longest-palindrome) | Easy |
+| 410 | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | [Golang](solution/split-array-largest-sum) | Hard |
+| 411 | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) | [Golang](solution/minimum-unique-word-abbreviation) | Hard |
+| 412 | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [Golang](solution/fizz-buzz) | Easy |
+| 413 | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | [Golang](solution/arithmetic-slices) | Medium |
+| 414 | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | [Golang](solution/third-maximum-number) | Easy |
+| 415 | [Add Strings](https://leetcode.com/problems/add-strings) | [Golang](solution/add-strings) | Easy |
+| 416 | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Golang](solution/partition-equal-subset-sum) | Medium |
+| 417 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [Golang](solution/pacific-atlantic-water-flow) | Medium |
+| 418 | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) | [Golang](solution/sentence-screen-fitting) | Medium |
+| 419 | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | [Golang](solution/battleships-in-a-board) | Medium |
+| 420 | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker) | [Golang](solution/strong-password-checker) | Hard |
+| 421 | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | [Golang](solution/maximum-xor-of-two-numbers-in-an-array) | Medium |
+| 422 | [Valid Word Square](https://leetcode.com/problems/valid-word-square) | [Golang](solution/valid-word-square) | Easy |
+| 423 | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english) | [Golang](solution/reconstruct-original-digits-from-english) | Medium |
+| 424 | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [Golang](solution/longest-repeating-character-replacement) | Medium |
+| 425 | [Word Squares](https://leetcode.com/problems/word-squares) | [Golang](solution/word-squares) | Hard |
+| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) | [Golang](solution/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
+| 427 | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree) | [Golang](solution/construct-quad-tree) | Easy |
+| 428 | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) | [Golang](solution/serialize-and-deserialize-n-ary-tree) | Hard |
+| 429 | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [Golang](solution/n-ary-tree-level-order-traversal) | Easy |
+| 430 | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [Golang](solution/flatten-a-multilevel-doubly-linked-list) | Medium |
+| 431 | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) | [Golang](solution/encode-n-ary-tree-to-binary-tree) | Hard |
+| 432 | [All O`one Data Structure](https://leetcode.com/problems/all-o`one-data-structure) | [Golang](solution/all-o`one-data-structure) | Hard |
+| 433 | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [Golang](solution/minimum-genetic-mutation) | Medium |
+| 434 | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [Golang](solution/number-of-segments-in-a-string) | Easy |
+| 435 | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | [Golang](solution/non-overlapping-intervals) | Medium |
+| 436 | [Find Right Interval](https://leetcode.com/problems/find-right-interval) | [Golang](solution/find-right-interval) | Medium |
+| 437 | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | [Golang](solution/path-sum-iii) | Easy |
+| 438 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [Golang](solution/find-all-anagrams-in-a-string) | Easy |
+| 439 | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) | [Golang](solution/ternary-expression-parser) | Medium |
+| 440 | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order) | [Golang](solution/k-th-smallest-in-lexicographical-order) | Hard |
+| 441 | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | [Golang](solution/arranging-coins) | Easy |
+| 442 | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [Golang](solution/find-all-duplicates-in-an-array) | Medium |
+| 443 | [String Compression](https://leetcode.com/problems/string-compression) | [Golang](solution/string-compression) | Easy |
+| 444 | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) | [Golang](solution/sequence-reconstruction) | Medium |
+| 445 | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [Golang](solution/add-two-numbers-ii) | Medium |
+| 446 | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii---subsequence) | [Golang](solution/arithmetic-slices-ii---subsequence) | Hard |
+| 447 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Golang](solution/number-of-boomerangs) | Easy |
+| 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | [Golang](solution/find-all-numbers-disappeared-in-an-array) | Easy |
+| 449 | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | [Golang](solution/serialize-and-deserialize-bst) | Medium |
+| 450 | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst) | [Golang](solution/delete-node-in-a-bst) | Medium |
+| 451 | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency) | [Golang](solution/sort-characters-by-frequency) | Medium |
+| 452 | [Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons) | [Golang](solution/minimum-number-of-arrows-to-burst-balloons) | Medium |
+| 453 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | [Golang](solution/minimum-moves-to-equal-array-elements) | Easy |
+| 454 | [4Sum II](https://leetcode.com/problems/4sum-ii) | [Golang](solution/4sum-ii) | Medium |
+| 455 | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | [Golang](solution/assign-cookies) | Easy |
+| 456 | [132 Pattern](https://leetcode.com/problems/132-pattern) | [Golang](solution/132-pattern) | Medium |
+| 457 | [Circular Array Loop](https://leetcode.com/problems/circular-array-loop) | [Golang](solution/circular-array-loop) | Medium |
+| 458 | [Poor Pigs](https://leetcode.com/problems/poor-pigs) | [Golang](solution/poor-pigs) | Easy |
+| 459 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | [Golang](solution/repeated-substring-pattern) | Easy |
+| 460 | [LFU Cache](https://leetcode.com/problems/lfu-cache) | [Golang](solution/lfu-cache) | Hard |
+| 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance) | [Golang](solution/hamming-distance) | Easy |
+| 462 | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | [Golang](solution/minimum-moves-to-equal-array-elements-ii) | Medium |
+| 463 | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | [Golang](solution/island-perimeter) | Easy |
+| 464 | [Can I Win](https://leetcode.com/problems/can-i-win) | [Golang](solution/can-i-win) | Medium |
+| 465 | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) | [Golang](solution/optimal-account-balancing) | Hard |
+| 466 | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions) | [Golang](solution/count-the-repetitions) | Hard |
+| 467 | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [Golang](solution/unique-substrings-in-wraparound-string) | Medium |
+| 468 | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [Golang](solution/validate-ip-address) | Medium |
+| 469 | [Convex Polygon](https://leetcode.com/problems/convex-polygon) | [Golang](solution/convex-polygon) | Medium |
+| 470 | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10()-using-rand7()) | [Golang](solution/implement-rand10()-using-rand7()) | Medium |
+| 471 | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) | [Golang](solution/encode-string-with-shortest-length) | Hard |
+| 472 | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [Golang](solution/concatenated-words) | Hard |
+| 473 | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [Golang](solution/matchsticks-to-square) | Medium |
+| 474 | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | [Golang](solution/ones-and-zeroes) | Medium |
+| 475 | [Heaters](https://leetcode.com/problems/heaters) | [Golang](solution/heaters) | Easy |
+| 476 | [Number Complement](https://leetcode.com/problems/number-complement) | [Golang](solution/number-complement) | Easy |
+| 477 | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance) | [Golang](solution/total-hamming-distance) | Medium |
+| 478 | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle) | [Golang](solution/generate-random-point-in-a-circle) | Medium |
+| 479 | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product) | [Golang](solution/largest-palindrome-product) | Easy |
+| 480 | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median) | [Golang](solution/sliding-window-median) | Hard |
+| 481 | [Magical String](https://leetcode.com/problems/magical-string) | [Golang](solution/magical-string) | Medium |
+| 482 | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [Golang](solution/license-key-formatting) | Easy |
+| 483 | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | [Golang](solution/smallest-good-base) | Hard |
+| 484 | [Find Permutation](https://leetcode.com/problems/find-permutation) | [Golang](solution/find-permutation) | Medium |
+| 485 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | [Golang](solution/max-consecutive-ones) | Easy |
+| 486 | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | [Golang](solution/predict-the-winner) | Medium |
+| 487 | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) | [Golang](solution/max-consecutive-ones-ii) | Medium |
+| 488 | [Zuma Game](https://leetcode.com/problems/zuma-game) | [Golang](solution/zuma-game) | Hard |
+| 489 | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) | [Golang](solution/robot-room-cleaner) | Hard |
+| 490 | [The Maze](https://leetcode.com/problems/the-maze) | [Golang](solution/the-maze) | Medium |
+| 491 | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences) | [Golang](solution/increasing-subsequences) | Medium |
+| 492 | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | [Golang](solution/construct-the-rectangle) | Easy |
+| 493 | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | [Golang](solution/reverse-pairs) | Hard |
+| 494 | [Target Sum](https://leetcode.com/problems/target-sum) | [Golang](solution/target-sum) | Medium |
+| 495 | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking) | [Golang](solution/teemo-attacking) | Medium |
+| 496 | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [Golang](solution/next-greater-element-i) | Easy |
+| 497 | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles) | [Golang](solution/random-point-in-non-overlapping-rectangles) | Medium |
+| 498 | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | [Golang](solution/diagonal-traverse) | Medium |
+| 499 | [The Maze III](https://leetcode.com/problems/the-maze-iii) | [Golang](solution/the-maze-iii) | Hard |
+| 500 | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | [Golang](solution/keyboard-row) | Easy |
+| 501 | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | [Golang](solution/find-mode-in-binary-search-tree) | Easy |
+| 502 | [IPO](https://leetcode.com/problems/ipo) | [Golang](solution/ipo) | Hard |
+| 503 | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | [Golang](solution/next-greater-element-ii) | Medium |
+| 504 | [Base 7](https://leetcode.com/problems/base-7) | [Golang](solution/base-7) | Easy |
+| 505 | [The Maze II](https://leetcode.com/problems/the-maze-ii) | [Golang](solution/the-maze-ii) | Medium |
+| 506 | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | [Golang](solution/relative-ranks) | Easy |
+| 507 | [Perfect Number](https://leetcode.com/problems/perfect-number) | [Golang](solution/perfect-number) | Easy |
+| 508 | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [Golang](solution/most-frequent-subtree-sum) | Medium |
+| 513 | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value) | [Golang](solution/find-bottom-left-tree-value) | Medium |
+| 514 | [Freedom Trail](https://leetcode.com/problems/freedom-trail) | [Golang](solution/freedom-trail) | Hard |
+| 515 | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row) | [Golang](solution/find-largest-value-in-each-tree-row) | Medium |
+| 516 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | [Golang](solution/longest-palindromic-subsequence) | Medium |
+| 517 | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines) | [Golang](solution/super-washing-machines) | Hard |
+| 518 | [Coin Change 2](https://leetcode.com/problems/coin-change-2) | [Golang](solution/coin-change-2) | Medium |
+| 519 | [Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix) | [Golang](solution/random-flip-matrix) | Medium |
+| 520 | [Detect Capital](https://leetcode.com/problems/detect-capital) | [Golang](solution/detect-capital) | Easy |
+| 521 | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | [Golang](solution/longest-uncommon-subsequence-i) | Easy |
+| 522 | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii) | [Golang](solution/longest-uncommon-subsequence-ii) | Medium |
+| 523 | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | [Golang](solution/continuous-subarray-sum) | Medium |
+| 524 | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [Golang](solution/longest-word-in-dictionary-through-deleting) | Medium |
+| 525 | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | [Golang](solution/contiguous-array) | Medium |
+| 526 | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | [Golang](solution/beautiful-arrangement) | Medium |
+| 527 | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) | [Golang](solution/word-abbreviation) | Hard |
+| 528 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | [Golang](solution/random-pick-with-weight) | Medium |
+| 529 | [Minesweeper](https://leetcode.com/problems/minesweeper) | [Golang](solution/minesweeper) | Medium |
+| 530 | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [Golang](solution/minimum-absolute-difference-in-bst) | Easy |
+| 531 | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) | [Golang](solution/lonely-pixel-i) | Medium |
+| 532 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [Golang](solution/k-diff-pairs-in-an-array) | Easy |
+| 533 | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) | [Golang](solution/lonely-pixel-ii) | Medium |
+| 535 | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | [Golang](solution/encode-and-decode-tinyurl) | Medium |
+| 536 | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) | [Golang](solution/construct-binary-tree-from-string) | Medium |
+| 537 | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | [Golang](solution/complex-number-multiplication) | Medium |
+| 538 | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | [Golang](solution/convert-bst-to-greater-tree) | Easy |
+| 539 | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [Golang](solution/minimum-time-difference) | Medium |
+| 540 | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array) | [Golang](solution/single-element-in-a-sorted-array) | Medium |
+| 541 | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [Golang](solution/reverse-string-ii) | Easy |
+| 542 | [01 Matrix](https://leetcode.com/problems/01-matrix) | [Golang](solution/01-matrix) | Medium |
+| 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [Golang](solution/diameter-of-binary-tree) | Easy |
+| 544 | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) | [Golang](solution/output-contest-matches) | Medium |
+| 545 | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) | [Golang](solution/boundary-of-binary-tree) | Medium |
+| 546 | [Remove Boxes](https://leetcode.com/problems/remove-boxes) | [Golang](solution/remove-boxes) | Hard |
+| 547 | [Friend Circles](https://leetcode.com/problems/friend-circles) | [Golang](solution/friend-circles) | Medium |
+| 548 | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) | [Golang](solution/split-array-with-equal-sum) | Medium |
+| 549 | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) | [Golang](solution/binary-tree-longest-consecutive-sequence-ii) | Medium |
+| 551 | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [Golang](solution/student-attendance-record-i) | Easy |
+| 552 | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | [Golang](solution/student-attendance-record-ii) | Hard |
+| 553 | [Optimal Division](https://leetcode.com/problems/optimal-division) | [Golang](solution/optimal-division) | Medium |
+| 554 | [Brick Wall](https://leetcode.com/problems/brick-wall) | [Golang](solution/brick-wall) | Medium |
+| 555 | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) | [Golang](solution/split-concatenated-strings) | Medium |
+| 556 | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii) | [Golang](solution/next-greater-element-iii) | Medium |
+| 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [Golang](solution/reverse-words-in-a-string-iii) | Easy |
+| 558 | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection) | [Golang](solution/quad-tree-intersection) | Easy |
+| 559 | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [Golang](solution/maximum-depth-of-n-ary-tree) | Easy |
+| 560 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | [Golang](solution/subarray-sum-equals-k) | Medium |
+| 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i) | [Golang](solution/array-partition-i) | Easy |
+| 562 | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) | [Golang](solution/longest-line-of-consecutive-one-in-matrix) | Medium |
+| 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [Golang](solution/binary-tree-tilt) | Easy |
+| 564 | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome) | [Golang](solution/find-the-closest-palindrome) | Hard |
+| 565 | [Array Nesting](https://leetcode.com/problems/array-nesting) | [Golang](solution/array-nesting) | Medium |
+| 566 | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix) | [Golang](solution/reshape-the-matrix) | Easy |
+| 567 | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | [Golang](solution/permutation-in-string) | Medium |
+| 568 | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) | [Golang](solution/maximum-vacation-days) | Hard |
+| 569 | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) | [Golang](solution/median-employee-salary) | Hard |
+| 570 | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) | [Golang](solution/managers-with-at-least-5-direct-reports) | Medium |
+| 571 | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) | [Golang](solution/find-median-given-frequency-of-numbers) | Hard |
+| 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [Golang](solution/subtree-of-another-tree) | Easy |
+| 573 | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) | [Golang](solution/squirrel-simulation) | Medium |
+| 574 | [Winning Candidate](https://leetcode.com/problems/winning-candidate) | [Golang](solution/winning-candidate) | Medium |
+| 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | [Golang](solution/distribute-candies) | Easy |
+| 576 | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [Golang](solution/out-of-boundary-paths) | Medium |
+| 577 | [Employee Bonus](https://leetcode.com/problems/employee-bonus) | [Golang](solution/employee-bonus) | Easy |
+| 578 | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) | [Golang](solution/get-highest-answer-rate-question) | Medium |
+| 579 | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) | [Golang](solution/find-cumulative-salary-of-an-employee) | Hard |
+| 580 | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) | [Golang](solution/count-student-number-in-departments) | Medium |
+| 581 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Golang](solution/shortest-unsorted-continuous-subarray) | Easy |
+| 582 | [Kill Process](https://leetcode.com/problems/kill-process) | [Golang](solution/kill-process) | Medium |
+| 583 | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [Golang](solution/delete-operation-for-two-strings) | Medium |
+| 584 | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) | [Golang](solution/find-customer-referee) | Easy |
+| 585 | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) | [Golang](solution/investments-in-2016) | Medium |
+| 586 | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) | [Golang](solution/customer-placing-the-largest-number-of-orders) | Easy |
+| 587 | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | [Golang](solution/erect-the-fence) | Hard |
+| 588 | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) | [Golang](solution/design-in-memory-file-system) | Hard |
+| 589 | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | [Golang](solution/n-ary-tree-preorder-traversal) | Easy |
+| 590 | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | [Golang](solution/n-ary-tree-postorder-traversal) | Easy |
+| 591 | [Tag Validator](https://leetcode.com/problems/tag-validator) | [Golang](solution/tag-validator) | Hard |
+| 592 | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction) | [Golang](solution/fraction-addition-and-subtraction) | Medium |
+| 593 | [Valid Square](https://leetcode.com/problems/valid-square) | [Golang](solution/valid-square) | Medium |
+| 594 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Golang](solution/longest-harmonious-subsequence) | Easy |
+| 595 | [Big Countries](https://leetcode.com/problems/big-countries) | [Golang](solution/big-countries) | Easy |
+| 596 | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [Golang](solution/classes-more-than-5-students) | Easy |
+| 597 | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i:-overall-acceptance-rate) | [Golang](solution/friend-requests-i:-overall-acceptance-rate) | Easy |
+| 598 | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Golang](solution/range-addition-ii) | Easy |
+| 599 | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Golang](solution/minimum-index-sum-of-two-lists) | Easy |
+| 600 | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Golang](solution/non-negative-integers-without-consecutive-ones) | Hard |
+| 601 | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [Golang](solution/human-traffic-of-stadium) | Hard |
+| 602 | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii:-who-has-the-most-friends) | [Golang](solution/friend-requests-ii:-who-has-the-most-friends) | Medium |
+| 603 | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) | [Golang](solution/consecutive-available-seats) | Easy |
+| 604 | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) | [Golang](solution/design-compressed-string-iterator) | Easy |
+| 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [Golang](solution/can-place-flowers) | Easy |
+| 606 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [Golang](solution/construct-string-from-binary-tree) | Easy |
+| 607 | [Sales Person](https://leetcode.com/problems/sales-person) | [Golang](solution/sales-person) | Easy |
+| 608 | [Tree Node](https://leetcode.com/problems/tree-node) | [Golang](solution/tree-node) | Medium |
+| 609 | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [Golang](solution/find-duplicate-file-in-system) | Medium |
+| 610 | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) | [Golang](solution/triangle-judgement) | Easy |
+| 611 | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | [Golang](solution/valid-triangle-number) | Medium |
+| 612 | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) | [Golang](solution/shortest-distance-in-a-plane) | Medium |
+| 613 | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) | [Golang](solution/shortest-distance-in-a-line) | Easy |
+| 614 | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) | [Golang](solution/second-degree-follower) | Medium |
+| 615 | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary:-departments-vs-company) | [Golang](solution/average-salary:-departments-vs-company) | Hard |
+| 616 | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) | [Golang](solution/add-bold-tag-in-string) | Medium |
+| 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Golang](solution/merge-two-binary-trees) | Easy |
+| 618 | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) | [Golang](solution/students-report-by-geography) | Hard |
+| 619 | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) | [Golang](solution/biggest-single-number) | Easy |
+| 620 | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [Golang](solution/not-boring-movies) | Easy |
+| 621 | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [Golang](solution/task-scheduler) | Medium |
+| 622 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [Golang](solution/design-circular-queue) | Medium |
+| 623 | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [Golang](solution/add-one-row-to-tree) | Medium |
+| 624 | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) | [Golang](solution/maximum-distance-in-arrays) | Easy |
+| 625 | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) | [Golang](solution/minimum-factorization) | Medium |
+| 626 | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [Golang](solution/exchange-seats) | Medium |
+| 627 | [Swap Salary](https://leetcode.com/problems/swap-salary) | [Golang](solution/swap-salary) | Easy |
+| 628 | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [Golang](solution/maximum-product-of-three-numbers) | Easy |
+| 629 | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [Golang](solution/k-inverse-pairs-array) | Hard |
+| 630 | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [Golang](solution/course-schedule-iii) | Hard |
+| 631 | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) | [Golang](solution/design-excel-sum-formula) | Hard |
+| 632 | [Smallest Range](https://leetcode.com/problems/smallest-range) | [Golang](solution/smallest-range) | Hard |
+| 633 | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [Golang](solution/sum-of-square-numbers) | Easy |
+| 634 | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) | [Golang](solution/find-the-derangement-of-an-array) | Medium |
+| 635 | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) | [Golang](solution/design-log-storage-system) | Medium |
+| 636 | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | [Golang](solution/exclusive-time-of-functions) | Medium |
+| 637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [Golang](solution/average-of-levels-in-binary-tree) | Easy |
+| 638 | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | [Golang](solution/shopping-offers) | Medium |
+| 639 | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii) | [Golang](solution/decode-ways-ii) | Hard |
+| 640 | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | [Golang](solution/solve-the-equation) | Medium |
+| 641 | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | [Golang](solution/design-circular-deque) | Medium |
+| 642 | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) | [Golang](solution/design-search-autocomplete-system) | Hard |
+| 643 | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [Golang](solution/maximum-average-subarray-i) | Easy |
+| 644 | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) | [Golang](solution/maximum-average-subarray-ii) | Hard |
+| 645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [Golang](solution/set-mismatch) | Easy |
+| 646 | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | [Golang](solution/maximum-length-of-pair-chain) | Medium |
+| 647 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | [Golang](solution/palindromic-substrings) | Medium |
+| 648 | [Replace Words](https://leetcode.com/problems/replace-words) | [Golang](solution/replace-words) | Medium |
+| 649 | [Dota2 Senate](https://leetcode.com/problems/dota2-senate) | [Golang](solution/dota2-senate) | Medium |
+| 650 | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [Golang](solution/2-keys-keyboard) | Medium |
+| 651 | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) | [Golang](solution/4-keys-keyboard) | Medium |
+| 652 | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [Golang](solution/find-duplicate-subtrees) | Medium |
+| 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv---input-is-a-bst) | [Golang](solution/two-sum-iv---input-is-a-bst) | Easy |
+| 654 | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [Golang](solution/maximum-binary-tree) | Medium |
+| 655 | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [Golang](solution/print-binary-tree) | Medium |
+| 656 | [Coin Path](https://leetcode.com/problems/coin-path) | [Golang](solution/coin-path) | Hard |
+| 657 | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [Golang](solution/robot-return-to-origin) | Easy |
+| 658 | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | [Golang](solution/find-k-closest-elements) | Medium |
+| 659 | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [Golang](solution/split-array-into-consecutive-subsequences) | Medium |
+| 660 | [Remove 9](https://leetcode.com/problems/remove-9) | [Golang](solution/remove-9) | Hard |
+| 661 | [Image Smoother](https://leetcode.com/problems/image-smoother) | [Golang](solution/image-smoother) | Easy |
+| 662 | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | [Golang](solution/maximum-width-of-binary-tree) | Medium |
+| 663 | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) | [Golang](solution/equal-tree-partition) | Medium |
+| 664 | [Strange Printer](https://leetcode.com/problems/strange-printer) | [Golang](solution/strange-printer) | Hard |
+| 665 | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | [Golang](solution/non-decreasing-array) | Easy |
+| 666 | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) | [Golang](solution/path-sum-iv) | Medium |
+| 667 | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | [Golang](solution/beautiful-arrangement-ii) | Medium |
+| 668 | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | [Golang](solution/kth-smallest-number-in-multiplication-table) | Hard |
+| 669 | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [Golang](solution/trim-a-binary-search-tree) | Easy |
+| 670 | [Maximum Swap](https://leetcode.com/problems/maximum-swap) | [Golang](solution/maximum-swap) | Medium |
+| 671 | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | [Golang](solution/second-minimum-node-in-a-binary-tree) | Easy |
+| 672 | [Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii) | [Golang](solution/bulb-switcher-ii) | Medium |
+| 673 | [Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence) | [Golang](solution/number-of-longest-increasing-subsequence) | Medium |
+| 674 | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | [Golang](solution/longest-continuous-increasing-subsequence) | Easy |
+| 675 | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event) | [Golang](solution/cut-off-trees-for-golf-event) | Hard |
+| 676 | [Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary) | [Golang](solution/implement-magic-dictionary) | Medium |
+| 677 | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs) | [Golang](solution/map-sum-pairs) | Medium |
+| 678 | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | [Golang](solution/valid-parenthesis-string) | Medium |
+| 679 | [24 Game](https://leetcode.com/problems/24-game) | [Golang](solution/24-game) | Hard |
+| 680 | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | [Golang](solution/valid-palindrome-ii) | Easy |
+| 681 | [Next Closest Time](https://leetcode.com/problems/next-closest-time) | [Golang](solution/next-closest-time) | Medium |
+| 682 | [Baseball Game](https://leetcode.com/problems/baseball-game) | [Golang](solution/baseball-game) | Easy |
+| 683 | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) | [Golang](solution/k-empty-slots) | Hard |
+| 684 | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | [Golang](solution/redundant-connection) | Medium |
+| 685 | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | [Golang](solution/redundant-connection-ii) | Hard |
+| 686 | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | [Golang](solution/repeated-string-match) | Easy |
+| 687 | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path) | [Golang](solution/longest-univalue-path) | Easy |
+| 688 | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard) | [Golang](solution/knight-probability-in-chessboard) | Medium |
+| 689 | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) | [Golang](solution/maximum-sum-of-3-non-overlapping-subarrays) | Hard |
+| 690 | [Employee Importance](https://leetcode.com/problems/employee-importance) | [Golang](solution/employee-importance) | Easy |
+| 691 | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word) | [Golang](solution/stickers-to-spell-word) | Hard |
+| 692 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | [Golang](solution/top-k-frequent-words) | Medium |
+| 693 | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [Golang](solution/binary-number-with-alternating-bits) | Easy |
+| 694 | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) | [Golang](solution/number-of-distinct-islands) | Medium |
+| 695 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | [Golang](solution/max-area-of-island) | Medium |
+| 696 | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [Golang](solution/count-binary-substrings) | Easy |
+| 697 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Golang](solution/degree-of-an-array) | Easy |
+| 698 | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) | [Golang](solution/partition-to-k-equal-sum-subsets) | Medium |
+| 699 | [Falling Squares](https://leetcode.com/problems/falling-squares) | [Golang](solution/falling-squares) | Hard |
+| 700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [Golang](solution/search-in-a-binary-search-tree) | Easy |
+| 701 | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree) | [Golang](solution/insert-into-a-binary-search-tree) | Medium |
+| 702 | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) | [Golang](solution/search-in-a-sorted-array-of-unknown-size) | Medium |
+| 703 | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [Golang](solution/kth-largest-element-in-a-stream) | Easy |
+| 704 | [Binary Search](https://leetcode.com/problems/binary-search) | [Golang](solution/binary-search) | Easy |
+| 705 | [Design HashSet](https://leetcode.com/problems/design-hashset) | [Golang](solution/design-hashset) | Easy |
+| 706 | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [Golang](solution/design-hashmap) | Easy |
+| 707 | [Design Linked List](https://leetcode.com/problems/design-linked-list) | [Golang](solution/design-linked-list) | Easy |
+| 708 | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) | [Golang](solution/insert-into-a-cyclic-sorted-list) | Medium |
+| 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [Golang](solution/to-lower-case) | Easy |
+| 710 | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist) | [Golang](solution/random-pick-with-blacklist) | Hard |
+| 711 | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) | [Golang](solution/number-of-distinct-islands-ii) | Hard |
+| 712 | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | [Golang](solution/minimum-ascii-delete-sum-for-two-strings) | Medium |
+| 713 | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | [Golang](solution/subarray-product-less-than-k) | Medium |
+| 714 | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [Golang](solution/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
+| 715 | [Range Module](https://leetcode.com/problems/range-module) | [Golang](solution/range-module) | Hard |
+| 716 | [Max Stack](https://leetcode.com/problems/max-stack) | [Golang](solution/max-stack) | Easy |
+| 717 | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | [Golang](solution/1-bit-and-2-bit-characters) | Easy |
+| 718 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | [Golang](solution/maximum-length-of-repeated-subarray) | Medium |
+| 719 | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [Golang](solution/find-k-th-smallest-pair-distance) | Hard |
+| 720 | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | [Golang](solution/longest-word-in-dictionary) | Easy |
+| 721 | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | [Golang](solution/accounts-merge) | Medium |
+| 722 | [Remove Comments](https://leetcode.com/problems/remove-comments) | [Golang](solution/remove-comments) | Medium |
+| 723 | [Candy Crush](https://leetcode.com/problems/candy-crush) | [Golang](solution/candy-crush) | Medium |
+| 724 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | [Golang](solution/find-pivot-index) | Easy |
+| 725 | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [Golang](solution/split-linked-list-in-parts) | Medium |
+| 726 | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | [Golang](solution/number-of-atoms) | Hard |
+| 727 | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) | [Golang](solution/minimum-window-subsequence) | Hard |
+| 728 | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers) | [Golang](solution/self-dividing-numbers) | Easy |
+| 729 | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | [Golang](solution/my-calendar-i) | Medium |
+| 730 | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | [Golang](solution/count-different-palindromic-subsequences) | Hard |
+| 731 | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | [Golang](solution/my-calendar-ii) | Medium |
+| 732 | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | [Golang](solution/my-calendar-iii) | Hard |
+| 733 | [Flood Fill](https://leetcode.com/problems/flood-fill) | [Golang](solution/flood-fill) | Easy |
+| 734 | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) | [Golang](solution/sentence-similarity) | Easy |
+| 735 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [Golang](solution/asteroid-collision) | Medium |
+| 736 | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression) | [Golang](solution/parse-lisp-expression) | Hard |
+| 737 | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) | [Golang](solution/sentence-similarity-ii) | Medium |
+| 738 | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | [Golang](solution/monotone-increasing-digits) | Medium |
+| 739 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [Golang](solution/daily-temperatures) | Medium |
+| 740 | [Delete and Earn](https://leetcode.com/problems/delete-and-earn) | [Golang](solution/delete-and-earn) | Medium |
+| 741 | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup) | [Golang](solution/cherry-pickup) | Hard |
+| 742 | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) | [Golang](solution/closest-leaf-in-a-binary-tree) | Medium |
+| 743 | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | [Golang](solution/network-delay-time) | Easy |
+| 744 | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [Golang](solution/find-smallest-letter-greater-than-target) | Easy |
+| 745 | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search) | [Golang](solution/prefix-and-suffix-search) | Hard |
+| 746 | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | [Golang](solution/min-cost-climbing-stairs) | Easy |
+| 747 | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [Golang](solution/largest-number-at-least-twice-of-others) | Easy |
+| 748 | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [Golang](solution/shortest-completing-word) | Easy |
+| 749 | [Contain Virus](https://leetcode.com/problems/contain-virus) | [Golang](solution/contain-virus) | Hard |
+| 750 | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) | [Golang](solution/number-of-corner-rectangles) | Medium |
+| 751 | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) | [Golang](solution/ip-to-cidr) | Easy |
+| 752 | [Open the Lock](https://leetcode.com/problems/open-the-lock) | [Golang](solution/open-the-lock) | Medium |
+| 753 | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | [Golang](solution/cracking-the-safe) | Hard |
+| 754 | [Reach a Number](https://leetcode.com/problems/reach-a-number) | [Golang](solution/reach-a-number) | Easy |
+| 755 | [Pour Water](https://leetcode.com/problems/pour-water) | [Golang](solution/pour-water) | Medium |
+| 756 | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | [Golang](solution/pyramid-transition-matrix) | Medium |
+| 757 | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two) | [Golang](solution/set-intersection-size-at-least-two) | Hard |
+| 758 | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) | [Golang](solution/bold-words-in-string) | Easy |
+| 759 | [Employee Free Time](https://leetcode.com/problems/employee-free-time) | [Golang](solution/employee-free-time) | Hard |
+| 760 | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) | [Golang](solution/find-anagram-mappings) | Easy |
+| 761 | [Special Binary String](https://leetcode.com/problems/special-binary-string) | [Golang](solution/special-binary-string) | Hard |
+| 762 | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [Golang](solution/prime-number-of-set-bits-in-binary-representation) | Easy |
+| 763 | [Partition Labels](https://leetcode.com/problems/partition-labels) | [Golang](solution/partition-labels) | Medium |
+| 764 | [Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign) | [Golang](solution/largest-plus-sign) | Medium |
+| 765 | [Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands) | [Golang](solution/couples-holding-hands) | Hard |
+| 766 | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | [Golang](solution/toeplitz-matrix) | Easy |
+| 767 | [Reorganize String](https://leetcode.com/problems/reorganize-string) | [Golang](solution/reorganize-string) | Medium |
+| 768 | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii) | [Golang](solution/max-chunks-to-make-sorted-ii) | Hard |
+| 769 | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | [Golang](solution/max-chunks-to-make-sorted) | Medium |
+| 770 | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv) | [Golang](solution/basic-calculator-iv) | Hard |
+| 771 | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | [Golang](solution/jewels-and-stones) | Easy |
+| 772 | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) | [Golang](solution/basic-calculator-iii) | Hard |
+| 773 | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle) | [Golang](solution/sliding-puzzle) | Hard |
+| 774 | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) | [Golang](solution/minimize-max-distance-to-gas-station) | Hard |
+| 775 | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | [Golang](solution/global-and-local-inversions) | Medium |
+| 776 | [Split BST](https://leetcode.com/problems/split-bst) | [Golang](solution/split-bst) | Medium |
+| 777 | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string) | [Golang](solution/swap-adjacent-in-lr-string) | Medium |
+| 778 | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water) | [Golang](solution/swim-in-rising-water) | Hard |
+| 779 | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | [Golang](solution/k-th-symbol-in-grammar) | Medium |
+| 780 | [Reaching Points](https://leetcode.com/problems/reaching-points) | [Golang](solution/reaching-points) | Hard |
+| 781 | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest) | [Golang](solution/rabbits-in-forest) | Medium |
+| 782 | [Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard) | [Golang](solution/transform-to-chessboard) | Hard |
+| 783 | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | [Golang](solution/minimum-distance-between-bst-nodes) | Easy |
+| 784 | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation) | [Golang](solution/letter-case-permutation) | Easy |
+| 785 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite?) | [Golang](solution/is-graph-bipartite?) | Medium |
+| 786 | [K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction) | [Golang](solution/k-th-smallest-prime-fraction) | Hard |
+| 787 | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops) | [Golang](solution/cheapest-flights-within-k-stops) | Medium |
+| 788 | [Rotated Digits](https://leetcode.com/problems/rotated-digits) | [Golang](solution/rotated-digits) | Easy |
+| 789 | [Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts) | [Golang](solution/escape-the-ghosts) | Medium |
+| 790 | [Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling) | [Golang](solution/domino-and-tromino-tiling) | Medium |
+| 791 | [Custom Sort String](https://leetcode.com/problems/custom-sort-string) | [Golang](solution/custom-sort-string) | Medium |
+| 792 | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences) | [Golang](solution/number-of-matching-subsequences) | Medium |
+| 793 | [Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function) | [Golang](solution/preimage-size-of-factorial-zeroes-function) | Hard |
+| 794 | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state) | [Golang](solution/valid-tic-tac-toe-state) | Medium |
+| 795 | [Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum) | [Golang](solution/number-of-subarrays-with-bounded-maximum) | Medium |
+| 796 | [Rotate String](https://leetcode.com/problems/rotate-string) | [Golang](solution/rotate-string) | Easy |
+| 797 | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | [Golang](solution/all-paths-from-source-to-target) | Medium |
+| 798 | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score) | [Golang](solution/smallest-rotation-with-highest-score) | Hard |
+| 799 | [Champagne Tower](https://leetcode.com/problems/champagne-tower) | [Golang](solution/champagne-tower) | Medium |
+| 800 | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) | [Golang](solution/similar-rgb-color) | Easy |
+| 801 | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | [Golang](solution/minimum-swaps-to-make-sequences-increasing) | Medium |
+| 802 | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states) | [Golang](solution/find-eventual-safe-states) | Medium |
+| 803 | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit) | [Golang](solution/bricks-falling-when-hit) | Hard |
+| 804 | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words) | [Golang](solution/unique-morse-code-words) | Easy |
+| 805 | [Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average) | [Golang](solution/split-array-with-same-average) | Hard |
+| 806 | [Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string) | [Golang](solution/number-of-lines-to-write-string) | Easy |
+| 807 | [Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline) | [Golang](solution/max-increase-to-keep-city-skyline) | Medium |
+| 808 | [Soup Servings](https://leetcode.com/problems/soup-servings) | [Golang](solution/soup-servings) | Medium |
+| 809 | [Expressive Words](https://leetcode.com/problems/expressive-words) | [Golang](solution/expressive-words) | Medium |
+| 810 | [Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game) | [Golang](solution/chalkboard-xor-game) | Hard |
+| 811 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count) | [Golang](solution/subdomain-visit-count) | Easy |
+| 812 | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | [Golang](solution/largest-triangle-area) | Easy |
+| 813 | [Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages) | [Golang](solution/largest-sum-of-averages) | Medium |
+| 814 | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning) | [Golang](solution/binary-tree-pruning) | Medium |
+| 815 | [Bus Routes](https://leetcode.com/problems/bus-routes) | [Golang](solution/bus-routes) | Hard |
+| 816 | [Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates) | [Golang](solution/ambiguous-coordinates) | Medium |
+| 817 | [Linked List Components](https://leetcode.com/problems/linked-list-components) | [Golang](solution/linked-list-components) | Medium |
+| 818 | [Race Car](https://leetcode.com/problems/race-car) | [Golang](solution/race-car) | Hard |
+| 819 | [Most Common Word](https://leetcode.com/problems/most-common-word) | [Golang](solution/most-common-word) | Easy |
+| 820 | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words) | [Golang](solution/short-encoding-of-words) | Medium |
+| 821 | [Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character) | [Golang](solution/shortest-distance-to-a-character) | Easy |
+| 822 | [Card Flipping Game](https://leetcode.com/problems/card-flipping-game) | [Golang](solution/card-flipping-game) | Medium |
+| 823 | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors) | [Golang](solution/binary-trees-with-factors) | Medium |
+| 824 | [Goat Latin](https://leetcode.com/problems/goat-latin) | [Golang](solution/goat-latin) | Easy |
+| 825 | [Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages) | [Golang](solution/friends-of-appropriate-ages) | Medium |
+| 826 | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work) | [Golang](solution/most-profit-assigning-work) | Medium |
+| 827 | [Making A Large Island](https://leetcode.com/problems/making-a-large-island) | [Golang](solution/making-a-large-island) | Hard |
+| 828 | [Unique Letter String](https://leetcode.com/problems/unique-letter-string) | [Golang](solution/unique-letter-string) | Hard |
+| 829 | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum) | [Golang](solution/consecutive-numbers-sum) | Hard |
+| 830 | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups) | [Golang](solution/positions-of-large-groups) | Easy |
+| 831 | [Masking Personal Information](https://leetcode.com/problems/masking-personal-information) | [Golang](solution/masking-personal-information) | Medium |
+| 832 | [Flipping an Image](https://leetcode.com/problems/flipping-an-image) | [Golang](solution/flipping-an-image) | Easy |
+| 833 | [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string) | [Golang](solution/find-and-replace-in-string) | Medium |
+| 834 | [Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree) | [Golang](solution/sum-of-distances-in-tree) | Hard |
+| 835 | [Image Overlap](https://leetcode.com/problems/image-overlap) | [Golang](solution/image-overlap) | Medium |
+| 836 | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | [Golang](solution/rectangle-overlap) | Easy |
+| 837 | [New 21 Game](https://leetcode.com/problems/new-21-game) | [Golang](solution/new-21-game) | Medium |
+| 838 | [Push Dominoes](https://leetcode.com/problems/push-dominoes) | [Golang](solution/push-dominoes) | Medium |
+| 839 | [Similar String Groups](https://leetcode.com/problems/similar-string-groups) | [Golang](solution/similar-string-groups) | Hard |
+| 840 | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid) | [Golang](solution/magic-squares-in-grid) | Easy |
+| 841 | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms) | [Golang](solution/keys-and-rooms) | Medium |
+| 842 | [Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence) | [Golang](solution/split-array-into-fibonacci-sequence) | Medium |
+| 843 | [Guess the Word](https://leetcode.com/problems/guess-the-word) | [Golang](solution/guess-the-word) | Hard |
+| 844 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | [Golang](solution/backspace-string-compare) | Easy |
+| 845 | [Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array) | [Golang](solution/longest-mountain-in-array) | Medium |
+| 846 | [Hand of Straights](https://leetcode.com/problems/hand-of-straights) | [Golang](solution/hand-of-straights) | Medium |
+| 847 | [Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes) | [Golang](solution/shortest-path-visiting-all-nodes) | Hard |
+| 848 | [Shifting Letters](https://leetcode.com/problems/shifting-letters) | [Golang](solution/shifting-letters) | Medium |
+| 849 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | [Golang](solution/maximize-distance-to-closest-person) | Easy |
+| 850 | [Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii) | [Golang](solution/rectangle-area-ii) | Hard |
+| 851 | [Loud and Rich](https://leetcode.com/problems/loud-and-rich) | [Golang](solution/loud-and-rich) | Medium |
+| 852 | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array) | [Golang](solution/peak-index-in-a-mountain-array) | Easy |
+| 853 | [Car Fleet](https://leetcode.com/problems/car-fleet) | [Golang](solution/car-fleet) | Medium |
+| 854 | [K-Similar Strings](https://leetcode.com/problems/k-similar-strings) | [Golang](solution/k-similar-strings) | Hard |
+| 855 | [Exam Room](https://leetcode.com/problems/exam-room) | [Golang](solution/exam-room) | Medium |
+| 856 | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses) | [Golang](solution/score-of-parentheses) | Medium |
+| 857 | [Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers) | [Golang](solution/minimum-cost-to-hire-k-workers) | Hard |
+| 858 | [Mirror Reflection](https://leetcode.com/problems/mirror-reflection) | [Golang](solution/mirror-reflection) | Medium |
+| 859 | [Buddy Strings](https://leetcode.com/problems/buddy-strings) | [Golang](solution/buddy-strings) | Easy |
+| 860 | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [Golang](solution/lemonade-change) | Easy |
+| 861 | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix) | [Golang](solution/score-after-flipping-matrix) | Medium |
+| 862 | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | [Golang](solution/shortest-subarray-with-sum-at-least-k) | Hard |
+| 863 | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree) | [Golang](solution/all-nodes-distance-k-in-binary-tree) | Medium |
+| 864 | [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys) | [Golang](solution/shortest-path-to-get-all-keys) | Hard |
+| 865 | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes) | [Golang](solution/smallest-subtree-with-all-the-deepest-nodes) | Medium |
+| 866 | [Prime Palindrome](https://leetcode.com/problems/prime-palindrome) | [Golang](solution/prime-palindrome) | Medium |
+| 867 | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | [Golang](solution/transpose-matrix) | Easy |
+| 868 | [Binary Gap](https://leetcode.com/problems/binary-gap) | [Golang](solution/binary-gap) | Easy |
+| 869 | [Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2) | [Golang](solution/reordered-power-of-2) | Medium |
+| 870 | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle) | [Golang](solution/advantage-shuffle) | Medium |
+| 871 | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops) | [Golang](solution/minimum-number-of-refueling-stops) | Hard |
+| 872 | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | [Golang](solution/leaf-similar-trees) | Easy |
+| 873 | [Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) | [Golang](solution/length-of-longest-fibonacci-subsequence) | Medium |
+| 874 | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation) | [Golang](solution/walking-robot-simulation) | Easy |
+| 875 | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas) | [Golang](solution/koko-eating-bananas) | Medium |
+| 876 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | [Golang](solution/middle-of-the-linked-list) | Easy |
+| 877 | [Stone Game](https://leetcode.com/problems/stone-game) | [Golang](solution/stone-game) | Medium |
+| 878 | [Nth Magical Number](https://leetcode.com/problems/nth-magical-number) | [Golang](solution/nth-magical-number) | Hard |
+| 879 | [Profitable Schemes](https://leetcode.com/problems/profitable-schemes) | [Golang](solution/profitable-schemes) | Hard |
+| 880 | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index) | [Golang](solution/decoded-string-at-index) | Medium |
+| 881 | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people) | [Golang](solution/boats-to-save-people) | Medium |
+| 882 | [Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph) | [Golang](solution/reachable-nodes-in-subdivided-graph) | Hard |
+| 883 | [Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes) | [Golang](solution/projection-area-of-3d-shapes) | Easy |
+| 884 | [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences) | [Golang](solution/uncommon-words-from-two-sentences) | Easy |
+| 885 | [Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii) | [Golang](solution/spiral-matrix-iii) | Medium |
+| 886 | [Possible Bipartition](https://leetcode.com/problems/possible-bipartition) | [Golang](solution/possible-bipartition) | Medium |
+| 887 | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop) | [Golang](solution/super-egg-drop) | Hard |
+| 888 | [Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap) | [Golang](solution/fair-candy-swap) | Easy |
+| 889 | [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | [Golang](solution/construct-binary-tree-from-preorder-and-postorder-traversal) | Medium |
+| 890 | [Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern) | [Golang](solution/find-and-replace-pattern) | Medium |
+| 891 | [Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths) | [Golang](solution/sum-of-subsequence-widths) | Hard |
+| 892 | [Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes) | [Golang](solution/surface-area-of-3d-shapes) | Easy |
+| 893 | [Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings) | [Golang](solution/groups-of-special-equivalent-strings) | Easy |
+| 894 | [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees) | [Golang](solution/all-possible-full-binary-trees) | Medium |
+| 895 | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack) | [Golang](solution/maximum-frequency-stack) | Hard |
+| 896 | [Monotonic Array](https://leetcode.com/problems/monotonic-array) | [Golang](solution/monotonic-array) | Easy |
+| 897 | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree) | [Golang](solution/increasing-order-search-tree) | Easy |
+| 898 | [Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays) | [Golang](solution/bitwise-ors-of-subarrays) | Medium |
+| 899 | [Orderly Queue](https://leetcode.com/problems/orderly-queue) | [Golang](solution/orderly-queue) | Hard |
+| 900 | [RLE Iterator](https://leetcode.com/problems/rle-iterator) | [Golang](solution/rle-iterator) | Medium |
+| 901 | [Online Stock Span](https://leetcode.com/problems/online-stock-span) | [Golang](solution/online-stock-span) | Medium |
+| 902 | [Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set) | [Golang](solution/numbers-at-most-n-given-digit-set) | Hard |
+| 903 | [Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence) | [Golang](solution/valid-permutations-for-di-sequence) | Hard |
+| 904 | [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets) | [Golang](solution/fruit-into-baskets) | Medium |
+| 905 | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity) | [Golang](solution/sort-array-by-parity) | Easy |
+| 906 | [Super Palindromes](https://leetcode.com/problems/super-palindromes) | [Golang](solution/super-palindromes) | Hard |
+| 907 | [Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums) | [Golang](solution/sum-of-subarray-minimums) | Medium |
+| 908 | [Smallest Range I](https://leetcode.com/problems/smallest-range-i) | [Golang](solution/smallest-range-i) | Easy |
+| 909 | [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders) | [Golang](solution/snakes-and-ladders) | Medium |
+| 910 | [Smallest Range II](https://leetcode.com/problems/smallest-range-ii) | [Golang](solution/smallest-range-ii) | Medium |
+| 911 | [Online Election](https://leetcode.com/problems/online-election) | [Golang](solution/online-election) | Medium |
+| 913 | [Cat and Mouse](https://leetcode.com/problems/cat-and-mouse) | [Golang](solution/cat-and-mouse) | Hard |
+| 914 | [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | [Golang](solution/x-of-a-kind-in-a-deck-of-cards) | Easy |
+| 915 | [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals) | [Golang](solution/partition-array-into-disjoint-intervals) | Medium |
+| 916 | [Word Subsets](https://leetcode.com/problems/word-subsets) | [Golang](solution/word-subsets) | Medium |
+| 917 | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters) | [Golang](solution/reverse-only-letters) | Easy |
+| 918 | [Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray) | [Golang](solution/maximum-sum-circular-subarray) | Medium |
+| 919 | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter) | [Golang](solution/complete-binary-tree-inserter) | Medium |
+| 920 | [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists) | [Golang](solution/number-of-music-playlists) | Hard |
+| 921 | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid) | [Golang](solution/minimum-add-to-make-parentheses-valid) | Medium |
+| 922 | [Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii) | [Golang](solution/sort-array-by-parity-ii) | Easy |
+| 923 | [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity) | [Golang](solution/3sum-with-multiplicity) | Medium |
+| 924 | [Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread) | [Golang](solution/minimize-malware-spread) | Hard |
+| 925 | [Long Pressed Name](https://leetcode.com/problems/long-pressed-name) | [Golang](solution/long-pressed-name) | Easy |
+| 926 | [Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing) | [Golang](solution/flip-string-to-monotone-increasing) | Medium |
+| 927 | [Three Equal Parts](https://leetcode.com/problems/three-equal-parts) | [Golang](solution/three-equal-parts) | Hard |
+| 928 | [Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii) | [Golang](solution/minimize-malware-spread-ii) | Hard |
+| 929 | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses) | [Golang](solution/unique-email-addresses) | Easy |
+| 930 | [Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum) | [Golang](solution/binary-subarrays-with-sum) | Medium |
+| 931 | [Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum) | [Golang](solution/minimum-falling-path-sum) | Medium |
+| 932 | [Beautiful Array](https://leetcode.com/problems/beautiful-array) | [Golang](solution/beautiful-array) | Medium |
+| 933 | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls) | [Golang](solution/number-of-recent-calls) | Easy |
+| 934 | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge) | [Golang](solution/shortest-bridge) | Medium |
+| 935 | [Knight Dialer](https://leetcode.com/problems/knight-dialer) | [Golang](solution/knight-dialer) | Medium |
+| 936 | [Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence) | [Golang](solution/stamping-the-sequence) | Hard |
+| 937 | [Reorder Log Files](https://leetcode.com/problems/reorder-log-files) | [Golang](solution/reorder-log-files) | Easy |
+| 938 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | [Golang](solution/range-sum-of-bst) | Medium |
+| 939 | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle) | [Golang](solution/minimum-area-rectangle) | Medium |
+| 940 | [Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii) | [Golang](solution/distinct-subsequences-ii) | Hard |
+| 941 | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array) | [Golang](solution/valid-mountain-array) | Easy |
+| 942 | [DI String Match](https://leetcode.com/problems/di-string-match) | [Golang](solution/di-string-match) | Easy |
+| 943 | [Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring) | [Golang](solution/find-the-shortest-superstring) | Hard |
+| 944 | [Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted) | [Golang](solution/delete-columns-to-make-sorted) | Easy |
+| 945 | [Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique) | [Golang](solution/minimum-increment-to-make-array-unique) | Medium |
+| 946 | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences) | [Golang](solution/validate-stack-sequences) | Medium |
+| 947 | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column) | [Golang](solution/most-stones-removed-with-same-row-or-column) | Medium |
+| 948 | [Bag of Tokens](https://leetcode.com/problems/bag-of-tokens) | [Golang](solution/bag-of-tokens) | Medium |
+| 949 | [Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits) | [Golang](solution/largest-time-for-given-digits) | Easy |
+| 950 | [Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order) | [Golang](solution/reveal-cards-in-increasing-order) | Medium |
+| 951 | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees) | [Golang](solution/flip-equivalent-binary-trees) | Medium |
+| 952 | [Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor) | [Golang](solution/largest-component-size-by-common-factor) | Hard |
+| 953 | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary) | [Golang](solution/verifying-an-alien-dictionary) | Easy |
+| 954 | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs) | [Golang](solution/array-of-doubled-pairs) | Medium |
+| 955 | [Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii) | [Golang](solution/delete-columns-to-make-sorted-ii) | Medium |
+| 956 | [Tallest Billboard](https://leetcode.com/problems/tallest-billboard) | [Golang](solution/tallest-billboard) | Hard |

From 2ed36167d66b66a77d9cb3dd831194fecf6dc2d4 Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Fri, 14 Dec 2018 22:21:15 +0800
Subject: [PATCH 02/22] Update: link

---
 index.md | 1898 +++++++++++++++++++++++++++---------------------------
 1 file changed, 949 insertions(+), 949 deletions(-)

diff --git a/index.md b/index.md
index 7078f7841..f7a8915c7 100644
--- a/index.md
+++ b/index.md
@@ -9,952 +9,952 @@ LeetCode Problems' Solutions
 
 | # | Title | Solution | Difficulty |
 | :-: | - | - | :-: |
-| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | [Golang](solution/two-sum) | Easy |
-| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | [Golang](solution/add-two-numbers) | Medium |
-| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [Golang](solution/longest-substring-without-repeating-characters) | Medium |
-| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [Golang](solution/median-of-two-sorted-arrays) | Hard |
-| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [Golang](solution/longest-palindromic-substring) | Medium |
-| 6 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | [Golang](solution/zigzag-conversion) | Medium |
-| 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [Golang](solution/reverse-integer) | Easy |
-| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-(atoi)) | [Golang](solution/string-to-integer-(atoi)) | Medium |
-| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [Golang](solution/palindrome-number) | Easy |
-| 10 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | [Golang](solution/regular-expression-matching) | Hard |
-| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [Golang](solution/container-with-most-water) | Medium |
-| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [Golang](solution/integer-to-roman) | Medium |
-| 13 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | [Golang](solution/roman-to-integer) | Easy |
-| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | [Golang](solution/longest-common-prefix) | Easy |
-| 15 | [3Sum](https://leetcode.com/problems/3sum) | [Golang](solution/3sum) | Medium |
-| 16 | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | [Golang](solution/3sum-closest) | Medium |
-| 17 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [Golang](solution/letter-combinations-of-a-phone-number) | Medium |
-| 18 | [4Sum](https://leetcode.com/problems/4sum) | [Golang](solution/4sum) | Medium |
-| 19 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [Golang](solution/remove-nth-node-from-end-of-list) | Medium |
-| 20 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [Golang](solution/valid-parentheses) | Easy |
-| 21 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [Golang](solution/merge-two-sorted-lists) | Easy |
-| 22 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | [Golang](solution/generate-parentheses) | Medium |
-| 23 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | [Golang](solution/merge-k-sorted-lists) | Hard |
-| 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | [Golang](solution/swap-nodes-in-pairs) | Medium |
-| 25 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [Golang](solution/reverse-nodes-in-k-group) | Hard |
-| 26 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [Golang](solution/remove-duplicates-from-sorted-array) | Easy |
-| 27 | [Remove Element](https://leetcode.com/problems/remove-element) | [Golang](solution/remove-element) | Easy |
-| 28 | [Implement strStr()](https://leetcode.com/problems/implement-strstr()) | [Golang](solution/implement-strstr()) | Easy |
-| 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | [Golang](solution/divide-two-integers) | Medium |
-| 30 | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | [Golang](solution/substring-with-concatenation-of-all-words) | Hard |
-| 31 | [Next Permutation](https://leetcode.com/problems/next-permutation) | [Golang](solution/next-permutation) | Medium |
-| 32 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses) | [Golang](solution/longest-valid-parentheses) | Hard |
-| 33 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [Golang](solution/search-in-rotated-sorted-array) | Medium |
-| 34 | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | [Golang](solution/find-first-and-last-position-of-element-in-sorted-array) | Medium |
-| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | [Golang](solution/search-insert-position) | Easy |
-| 36 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | [Golang](solution/valid-sudoku) | Medium |
-| 37 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | [Golang](solution/sudoku-solver) | Hard |
-| 38 | [Count and Say](https://leetcode.com/problems/count-and-say) | [Golang](solution/count-and-say) | Easy |
-| 39 | [Combination Sum](https://leetcode.com/problems/combination-sum) | [Golang](solution/combination-sum) | Medium |
-| 40 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | [Golang](solution/combination-sum-ii) | Medium |
-| 41 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | [Golang](solution/first-missing-positive) | Hard |
-| 42 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | [Golang](solution/trapping-rain-water) | Hard |
-| 43 | [Multiply Strings](https://leetcode.com/problems/multiply-strings) | [Golang](solution/multiply-strings) | Medium |
-| 44 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | [Golang](solution/wildcard-matching) | Hard |
-| 45 | [Jump Game II](https://leetcode.com/problems/jump-game-ii) | [Golang](solution/jump-game-ii) | Hard |
-| 46 | [Permutations](https://leetcode.com/problems/permutations) | [Golang](solution/permutations) | Medium |
-| 47 | [Permutations II](https://leetcode.com/problems/permutations-ii) | [Golang](solution/permutations-ii) | Medium |
-| 48 | [Rotate Image](https://leetcode.com/problems/rotate-image) | [Golang](solution/rotate-image) | Medium |
-| 49 | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | [Golang](solution/group-anagrams) | Medium |
-| 50 | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [Golang](solution/powx-n) | Medium |
-| 51 | [N-Queens](https://leetcode.com/problems/n-queens) | [Golang](solution/n-queens) | Hard |
-| 52 | [N-Queens II](https://leetcode.com/problems/n-queens-ii) | [Golang](solution/n-queens-ii) | Hard |
-| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [Golang](solution/maximum-subarray) | Easy |
-| 54 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | [Golang](solution/spiral-matrix) | Medium |
-| 55 | [Jump Game](https://leetcode.com/problems/jump-game) | [Golang](solution/jump-game) | Medium |
-| 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [Golang](solution/merge-intervals) | Medium |
-| 57 | [Insert Interval](https://leetcode.com/problems/insert-interval) | [Golang](solution/insert-interval) | Hard |
-| 58 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [Golang](solution/length-of-last-word) | Easy |
-| 59 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) | [Golang](solution/spiral-matrix-ii) | Medium |
-| 60 | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence) | [Golang](solution/permutation-sequence) | Medium |
-| 61 | [Rotate List](https://leetcode.com/problems/rotate-list) | [Golang](solution/rotate-list) | Medium |
-| 62 | [Unique Paths](https://leetcode.com/problems/unique-paths) | [Golang](solution/unique-paths) | Medium |
-| 63 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | [Golang](solution/unique-paths-ii) | Medium |
-| 64 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | [Golang](solution/minimum-path-sum) | Medium |
-| 65 | [Valid Number](https://leetcode.com/problems/valid-number) | [Golang](solution/valid-number) | Hard |
-| 66 | [Plus One](https://leetcode.com/problems/plus-one) | [Golang](solution/plus-one) | Easy |
-| 67 | [Add Binary](https://leetcode.com/problems/add-binary) | [Golang](solution/add-binary) | Easy |
-| 68 | [Text Justification](https://leetcode.com/problems/text-justification) | [Golang](solution/text-justification) | Hard |
-| 69 | [Sqrt(x)](https://leetcode.com/problems/sqrt(x)) | [Golang](solution/sqrt(x)) | Easy |
-| 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Golang](solution/climbing-stairs) | Easy |
-| 71 | [Simplify Path](https://leetcode.com/problems/simplify-path) | [Golang](solution/simplify-path) | Medium |
-| 72 | [Edit Distance](https://leetcode.com/problems/edit-distance) | [Golang](solution/edit-distance) | Hard |
-| 73 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | [Golang](solution/set-matrix-zeroes) | Medium |
-| 74 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | [Golang](solution/search-a-2d-matrix) | Medium |
-| 75 | [Sort Colors](https://leetcode.com/problems/sort-colors) | [Golang](solution/sort-colors) | Medium |
-| 76 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | [Golang](solution/minimum-window-substring) | Hard |
-| 77 | [Combinations](https://leetcode.com/problems/combinations) | [Golang](solution/combinations) | Medium |
-| 78 | [Subsets](https://leetcode.com/problems/subsets) | [Golang](solution/subsets) | Medium |
-| 79 | [Word Search](https://leetcode.com/problems/word-search) | [Golang](solution/word-search) | Medium |
-| 80 | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [Golang](solution/remove-duplicates-from-sorted-array-ii) | Medium |
-| 81 | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | [Golang](solution/search-in-rotated-sorted-array-ii) | Medium |
-| 82 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) | [Golang](solution/remove-duplicates-from-sorted-list-ii) | Medium |
-| 83 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | [Golang](solution/remove-duplicates-from-sorted-list) | Easy |
-| 84 | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) | [Golang](solution/largest-rectangle-in-histogram) | Hard |
-| 85 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | [Golang](solution/maximal-rectangle) | Hard |
-| 86 | [Partition List](https://leetcode.com/problems/partition-list) | [Golang](solution/partition-list) | Medium |
-| 87 | [Scramble String](https://leetcode.com/problems/scramble-string) | [Golang](solution/scramble-string) | Hard |
-| 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | [Golang](solution/merge-sorted-array) | Easy |
-| 89 | [Gray Code](https://leetcode.com/problems/gray-code) | [Golang](solution/gray-code) | Medium |
-| 90 | [Subsets II](https://leetcode.com/problems/subsets-ii) | [Golang](solution/subsets-ii) | Medium |
-| 91 | [Decode Ways](https://leetcode.com/problems/decode-ways) | [Golang](solution/decode-ways) | Medium |
-| 92 | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | [Golang](solution/reverse-linked-list-ii) | Medium |
-| 93 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | [Golang](solution/restore-ip-addresses) | Medium |
-| 94 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | [Golang](solution/binary-tree-inorder-traversal) | Medium |
-| 95 | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii) | [Golang](solution/unique-binary-search-trees-ii) | Medium |
-| 96 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) | [Golang](solution/unique-binary-search-trees) | Medium |
-| 97 | [Interleaving String](https://leetcode.com/problems/interleaving-string) | [Golang](solution/interleaving-string) | Hard |
-| 98 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | [Golang](solution/validate-binary-search-tree) | Medium |
-| 99 | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) | [Golang](solution/recover-binary-search-tree) | Hard |
-| 100 | [Same Tree](https://leetcode.com/problems/same-tree) | [Golang](solution/same-tree) | Easy |
-| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | [Golang](solution/symmetric-tree) | Easy |
-| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [Golang](solution/binary-tree-level-order-traversal) | Medium |
-| 103 | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | [Golang](solution/binary-tree-zigzag-level-order-traversal) | Medium |
-| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [Golang](solution/maximum-depth-of-binary-tree) | Easy |
-| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [Golang](solution/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium |
-| 106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [Golang](solution/construct-binary-tree-from-inorder-and-postorder-traversal) | Medium |
-| 107 | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | [Golang](solution/binary-tree-level-order-traversal-ii) | Easy |
-| 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | [Golang](solution/convert-sorted-array-to-binary-search-tree) | Easy |
-| 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) | [Golang](solution/convert-sorted-list-to-binary-search-tree) | Medium |
-| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | [Golang](solution/balanced-binary-tree) | Easy |
-| 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | [Golang](solution/minimum-depth-of-binary-tree) | Easy |
-| 112 | [Path Sum](https://leetcode.com/problems/path-sum) | [Golang](solution/path-sum) | Easy |
-| 113 | [Path Sum II](https://leetcode.com/problems/path-sum-ii) | [Golang](solution/path-sum-ii) | Medium |
-| 114 | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) | [Golang](solution/flatten-binary-tree-to-linked-list) | Medium |
-| 115 | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences) | [Golang](solution/distinct-subsequences) | Hard |
-| 116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | [Golang](solution/populating-next-right-pointers-in-each-node) | Medium |
-| 117 | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | [Golang](solution/populating-next-right-pointers-in-each-node-ii) | Medium |
-| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascal's-triangle) | [Golang](solution/pascal's-triangle) | Easy |
-| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascal's-triangle-ii) | [Golang](solution/pascal's-triangle-ii) | Easy |
-| 120 | [Triangle](https://leetcode.com/problems/triangle) | [Golang](solution/triangle) | Medium |
-| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [Golang](solution/best-time-to-buy-and-sell-stock) | Easy |
-| 122 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [Golang](solution/best-time-to-buy-and-sell-stock-ii) | Easy |
-| 123 | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | [Golang](solution/best-time-to-buy-and-sell-stock-iii) | Hard |
-| 124 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [Golang](solution/binary-tree-maximum-path-sum) | Hard |
-| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [Golang](solution/valid-palindrome) | Easy |
-| 126 | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii) | [Golang](solution/word-ladder-ii) | Hard |
-| 127 | [Word Ladder](https://leetcode.com/problems/word-ladder) | [Golang](solution/word-ladder) | Medium |
-| 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | [Golang](solution/longest-consecutive-sequence) | Hard |
-| 129 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | [Golang](solution/sum-root-to-leaf-numbers) | Medium |
-| 130 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions) | [Golang](solution/surrounded-regions) | Medium |
-| 131 | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) | [Golang](solution/palindrome-partitioning) | Medium |
-| 132 | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii) | [Golang](solution/palindrome-partitioning-ii) | Hard |
-| 133 | [Clone Graph](https://leetcode.com/problems/clone-graph) | [Golang](solution/clone-graph) | Medium |
-| 134 | [Gas Station](https://leetcode.com/problems/gas-station) | [Golang](solution/gas-station) | Medium |
-| 135 | [Candy](https://leetcode.com/problems/candy) | [Golang](solution/candy) | Hard |
-| 136 | [Single Number](https://leetcode.com/problems/single-number) | [Golang](solution/single-number) | Easy |
-| 137 | [Single Number II](https://leetcode.com/problems/single-number-ii) | [Golang](solution/single-number-ii) | Medium |
-| 138 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | [Golang](solution/copy-list-with-random-pointer) | Medium |
-| 139 | [Word Break](https://leetcode.com/problems/word-break) | [Golang](solution/word-break) | Medium |
-| 140 | [Word Break II](https://leetcode.com/problems/word-break-ii) | [Golang](solution/word-break-ii) | Hard |
-| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [Golang](solution/linked-list-cycle) | Easy |
-| 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) | [Golang](solution/linked-list-cycle-ii) | Medium |
-| 143 | [Reorder List](https://leetcode.com/problems/reorder-list) | [Golang](solution/reorder-list) | Medium |
-| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | [Golang](solution/binary-tree-preorder-traversal) | Medium |
-| 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | [Golang](solution/binary-tree-postorder-traversal) | Hard |
-| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache) | [Golang](solution/lru-cache) | Hard |
-| 147 | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) | [Golang](solution/insertion-sort-list) | Medium |
-| 148 | [Sort List](https://leetcode.com/problems/sort-list) | [Golang](solution/sort-list) | Medium |
-| 149 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | [Golang](solution/max-points-on-a-line) | Hard |
-| 150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | [Golang](solution/evaluate-reverse-polish-notation) | Medium |
-| 151 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | [Golang](solution/reverse-words-in-a-string) | Medium |
-| 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | [Golang](solution/maximum-product-subarray) | Medium |
-| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [Golang](solution/find-minimum-in-rotated-sorted-array) | Medium |
-| 154 | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | [Golang](solution/find-minimum-in-rotated-sorted-array-ii) | Hard |
-| 155 | [Min Stack](https://leetcode.com/problems/min-stack) | [Golang](solution/min-stack) | Easy |
-| 156 | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) | [Golang](solution/binary-tree-upside-down) | Medium |
-| 157 | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) | [Golang](solution/read-n-characters-given-read4) | Easy |
-| 158 | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii---call-multiple-times) | [Golang](solution/read-n-characters-given-read4-ii---call-multiple-times) | Hard |
-| 159 | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) | [Golang](solution/longest-substring-with-at-most-two-distinct-characters) | Hard |
-| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Golang](solution/intersection-of-two-linked-lists) | Easy |
-| 161 | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) | [Golang](solution/one-edit-distance) | Medium |
-| 162 | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [Golang](solution/find-peak-element) | Medium |
-| 163 | [Missing Ranges](https://leetcode.com/problems/missing-ranges) | [Golang](solution/missing-ranges) | Medium |
-| 164 | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [Golang](solution/maximum-gap) | Hard |
-| 165 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [Golang](solution/compare-version-numbers) | Medium |
-| 166 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [Golang](solution/fraction-to-recurring-decimal) | Medium |
-| 167 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii---input-array-is-sorted) | [Golang](solution/two-sum-ii---input-array-is-sorted) | Easy |
-| 168 | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [Golang](solution/excel-sheet-column-title) | Easy |
-| 169 | [Majority Element](https://leetcode.com/problems/majority-element) | [Golang](solution/majority-element) | Easy |
-| 170 | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii---data-structure-design) | [Golang](solution/two-sum-iii---data-structure-design) | Easy |
-| 171 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [Golang](solution/excel-sheet-column-number) | Easy |
-| 172 | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Golang](solution/factorial-trailing-zeroes) | Easy |
-| 173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Golang](solution/binary-search-tree-iterator) | Medium |
-| 174 | [Dungeon Game](https://leetcode.com/problems/dungeon-game) | [Golang](solution/dungeon-game) | Hard |
-| 175 | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | [Golang](solution/combine-two-tables) | Easy |
-| 176 | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | [Golang](solution/second-highest-salary) | Easy |
-| 177 | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary) | [Golang](solution/nth-highest-salary) | Medium |
-| 178 | [Rank Scores](https://leetcode.com/problems/rank-scores) | [Golang](solution/rank-scores) | Medium |
-| 179 | [Largest Number](https://leetcode.com/problems/largest-number) | [Golang](solution/largest-number) | Medium |
-| 180 | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers) | [Golang](solution/consecutive-numbers) | Medium |
-| 181 | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | [Golang](solution/employees-earning-more-than-their-managers) | Easy |
-| 182 | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails) | [Golang](solution/duplicate-emails) | Easy |
-| 183 | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [Golang](solution/customers-who-never-order) | Easy |
-| 184 | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [Golang](solution/department-highest-salary) | Medium |
-| 185 | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [Golang](solution/department-top-three-salaries) | Hard |
-| 186 | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) | [Golang](solution/reverse-words-in-a-string-ii) | Medium |
-| 187 | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [Golang](solution/repeated-dna-sequences) | Medium |
-| 188 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [Golang](solution/best-time-to-buy-and-sell-stock-iv) | Hard |
-| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array) | [Golang](solution/rotate-array) | Easy |
-| 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | [Golang](solution/reverse-bits) | Easy |
-| 191 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | [Golang](solution/number-of-1-bits) | Easy |
-| 192 | [Word Frequency](https://leetcode.com/problems/word-frequency) | [Golang](solution/word-frequency) | Medium |
-| 193 | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Golang](solution/valid-phone-numbers) | Easy |
-| 194 | [Transpose File](https://leetcode.com/problems/transpose-file) | [Golang](solution/transpose-file) | Medium |
-| 195 | [Tenth Line](https://leetcode.com/problems/tenth-line) | [Golang](solution/tenth-line) | Easy |
-| 196 | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | [Golang](solution/delete-duplicate-emails) | Easy |
-| 197 | [Rising Temperature](https://leetcode.com/problems/rising-temperature) | [Golang](solution/rising-temperature) | Easy |
-| 198 | [House Robber](https://leetcode.com/problems/house-robber) | [Golang](solution/house-robber) | Easy |
-| 199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [Golang](solution/binary-tree-right-side-view) | Medium |
-| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | [Golang](solution/number-of-islands) | Medium |
-| 201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | [Golang](solution/bitwise-and-of-numbers-range) | Medium |
-| 202 | [Happy Number](https://leetcode.com/problems/happy-number) | [Golang](solution/happy-number) | Easy |
-| 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | [Golang](solution/remove-linked-list-elements) | Easy |
-| 204 | [Count Primes](https://leetcode.com/problems/count-primes) | [Golang](solution/count-primes) | Easy |
-| 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | [Golang](solution/isomorphic-strings) | Easy |
-| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [Golang](solution/reverse-linked-list) | Easy |
-| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule) | [Golang](solution/course-schedule) | Medium |
-| 208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-(prefix-tree)) | [Golang](solution/implement-trie-(prefix-tree)) | Medium |
-| 209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | [Golang](solution/minimum-size-subarray-sum) | Medium |
-| 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | [Golang](solution/course-schedule-ii) | Medium |
-| 211 | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word---data-structure-design) | [Golang](solution/add-and-search-word---data-structure-design) | Medium |
-| 212 | [Word Search II](https://leetcode.com/problems/word-search-ii) | [Golang](solution/word-search-ii) | Hard |
-| 213 | [House Robber II](https://leetcode.com/problems/house-robber-ii) | [Golang](solution/house-robber-ii) | Medium |
-| 214 | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome) | [Golang](solution/shortest-palindrome) | Hard |
-| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [Golang](solution/kth-largest-element-in-an-array) | Medium |
-| 216 | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii) | [Golang](solution/combination-sum-iii) | Medium |
-| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [Golang](solution/contains-duplicate) | Easy |
-| 218 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | [Golang](solution/the-skyline-problem) | Hard |
-| 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | [Golang](solution/contains-duplicate-ii) | Easy |
-| 220 | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii) | [Golang](solution/contains-duplicate-iii) | Medium |
-| 221 | [Maximal Square](https://leetcode.com/problems/maximal-square) | [Golang](solution/maximal-square) | Medium |
-| 222 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | [Golang](solution/count-complete-tree-nodes) | Medium |
-| 223 | [Rectangle Area](https://leetcode.com/problems/rectangle-area) | [Golang](solution/rectangle-area) | Medium |
-| 224 | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | [Golang](solution/basic-calculator) | Hard |
-| 225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues) | [Golang](solution/implement-stack-using-queues) | Easy |
-| 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | [Golang](solution/invert-binary-tree) | Easy |
-| 227 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii) | [Golang](solution/basic-calculator-ii) | Medium |
-| 228 | [Summary Ranges](https://leetcode.com/problems/summary-ranges) | [Golang](solution/summary-ranges) | Medium |
-| 229 | [Majority Element II](https://leetcode.com/problems/majority-element-ii) | [Golang](solution/majority-element-ii) | Medium |
-| 230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [Golang](solution/kth-smallest-element-in-a-bst) | Medium |
-| 231 | [Power of Two](https://leetcode.com/problems/power-of-two) | [Golang](solution/power-of-two) | Easy |
-| 232 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | [Golang](solution/implement-queue-using-stacks) | Easy |
-| 233 | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one) | [Golang](solution/number-of-digit-one) | Hard |
-| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | [Golang](solution/palindrome-linked-list) | Easy |
-| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [Golang](solution/lowest-common-ancestor-of-a-binary-search-tree) | Easy |
-| 236 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | [Golang](solution/lowest-common-ancestor-of-a-binary-tree) | Medium |
-| 237 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | [Golang](solution/delete-node-in-a-linked-list) | Easy |
-| 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | [Golang](solution/product-of-array-except-self) | Medium |
-| 239 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | [Golang](solution/sliding-window-maximum) | Hard |
-| 240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | [Golang](solution/search-a-2d-matrix-ii) | Medium |
-| 241 | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) | [Golang](solution/different-ways-to-add-parentheses) | Medium |
-| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [Golang](solution/valid-anagram) | Easy |
-| 243 | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) | [Golang](solution/shortest-word-distance) | Easy |
-| 244 | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) | [Golang](solution/shortest-word-distance-ii) | Medium |
-| 245 | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) | [Golang](solution/shortest-word-distance-iii) | Medium |
-| 246 | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) | [Golang](solution/strobogrammatic-number) | Easy |
-| 247 | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) | [Golang](solution/strobogrammatic-number-ii) | Medium |
-| 248 | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) | [Golang](solution/strobogrammatic-number-iii) | Hard |
-| 249 | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) | [Golang](solution/group-shifted-strings) | Medium |
-| 250 | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) | [Golang](solution/count-univalue-subtrees) | Medium |
-| 251 | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) | [Golang](solution/flatten-2d-vector) | Medium |
-| 252 | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) | [Golang](solution/meeting-rooms) | Easy |
-| 253 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) | [Golang](solution/meeting-rooms-ii) | Medium |
-| 254 | [Factor Combinations](https://leetcode.com/problems/factor-combinations) | [Golang](solution/factor-combinations) | Medium |
-| 255 | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) | [Golang](solution/verify-preorder-sequence-in-binary-search-tree) | Medium |
-| 256 | [Paint House](https://leetcode.com/problems/paint-house) | [Golang](solution/paint-house) | Easy |
-| 257 | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | [Golang](solution/binary-tree-paths) | Easy |
-| 258 | [Add Digits](https://leetcode.com/problems/add-digits) | [Golang](solution/add-digits) | Easy |
-| 259 | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) | [Golang](solution/3sum-smaller) | Medium |
-| 260 | [Single Number III](https://leetcode.com/problems/single-number-iii) | [Golang](solution/single-number-iii) | Medium |
-| 261 | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) | [Golang](solution/graph-valid-tree) | Medium |
-| 262 | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [Golang](solution/trips-and-users) | Hard |
-| 263 | [Ugly Number](https://leetcode.com/problems/ugly-number) | [Golang](solution/ugly-number) | Easy |
-| 264 | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [Golang](solution/ugly-number-ii) | Medium |
-| 265 | [Paint House II](https://leetcode.com/problems/paint-house-ii) | [Golang](solution/paint-house-ii) | Hard |
-| 266 | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) | [Golang](solution/palindrome-permutation) | Easy |
-| 267 | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) | [Golang](solution/palindrome-permutation-ii) | Medium |
-| 268 | [Missing Number](https://leetcode.com/problems/missing-number) | [Golang](solution/missing-number) | Easy |
-| 269 | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) | [Golang](solution/alien-dictionary) | Hard |
-| 270 | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) | [Golang](solution/closest-binary-search-tree-value) | Easy |
-| 271 | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) | [Golang](solution/encode-and-decode-strings) | Medium |
-| 272 | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) | [Golang](solution/closest-binary-search-tree-value-ii) | Hard |
-| 273 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | [Golang](solution/integer-to-english-words) | Hard |
-| 274 | [H-Index](https://leetcode.com/problems/h-index) | [Golang](solution/h-index) | Medium |
-| 275 | [H-Index II](https://leetcode.com/problems/h-index-ii) | [Golang](solution/h-index-ii) | Medium |
-| 276 | [Paint Fence](https://leetcode.com/problems/paint-fence) | [Golang](solution/paint-fence) | Easy |
-| 277 | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) | [Golang](solution/find-the-celebrity) | Medium |
-| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version) | [Golang](solution/first-bad-version) | Easy |
-| 279 | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | [Golang](solution/perfect-squares) | Medium |
-| 280 | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) | [Golang](solution/wiggle-sort) | Medium |
-| 281 | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) | [Golang](solution/zigzag-iterator) | Medium |
-| 282 | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | [Golang](solution/expression-add-operators) | Hard |
-| 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [Golang](solution/move-zeroes) | Easy |
-| 284 | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | [Golang](solution/peeking-iterator) | Medium |
-| 285 | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) | [Golang](solution/inorder-successor-in-bst) | Medium |
-| 286 | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) | [Golang](solution/walls-and-gates) | Medium |
-| 287 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | [Golang](solution/find-the-duplicate-number) | Medium |
-| 288 | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) | [Golang](solution/unique-word-abbreviation) | Medium |
-| 289 | [Game of Life](https://leetcode.com/problems/game-of-life) | [Golang](solution/game-of-life) | Medium |
-| 290 | [Word Pattern](https://leetcode.com/problems/word-pattern) | [Golang](solution/word-pattern) | Easy |
-| 291 | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) | [Golang](solution/word-pattern-ii) | Hard |
-| 292 | [Nim Game](https://leetcode.com/problems/nim-game) | [Golang](solution/nim-game) | Easy |
-| 293 | [Flip Game](https://leetcode.com/problems/flip-game) | [Golang](solution/flip-game) | Easy |
-| 294 | [Flip Game II](https://leetcode.com/problems/flip-game-ii) | [Golang](solution/flip-game-ii) | Medium |
-| 295 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [Golang](solution/find-median-from-data-stream) | Hard |
-| 296 | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) | [Golang](solution/best-meeting-point) | Hard |
-| 297 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [Golang](solution/serialize-and-deserialize-binary-tree) | Hard |
-| 298 | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) | [Golang](solution/binary-tree-longest-consecutive-sequence) | Medium |
-| 299 | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | [Golang](solution/bulls-and-cows) | Medium |
-| 300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [Golang](solution/longest-increasing-subsequence) | Medium |
-| 301 | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Golang](solution/remove-invalid-parentheses) | Hard |
-| 302 | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) | [Golang](solution/smallest-rectangle-enclosing-black-pixels) | Hard |
-| 303 | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query---immutable) | [Golang](solution/range-sum-query---immutable) | Easy |
-| 304 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d---immutable) | [Golang](solution/range-sum-query-2d---immutable) | Medium |
-| 305 | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) | [Golang](solution/number-of-islands-ii) | Hard |
-| 306 | [Additive Number](https://leetcode.com/problems/additive-number) | [Golang](solution/additive-number) | Medium |
-| 307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query---mutable) | [Golang](solution/range-sum-query---mutable) | Medium |
-| 308 | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d---mutable) | [Golang](solution/range-sum-query-2d---mutable) | Hard |
-| 309 | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [Golang](solution/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
-| 310 | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [Golang](solution/minimum-height-trees) | Medium |
-| 311 | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) | [Golang](solution/sparse-matrix-multiplication) | Medium |
-| 312 | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | [Golang](solution/burst-balloons) | Hard |
-| 313 | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number) | [Golang](solution/super-ugly-number) | Medium |
-| 314 | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) | [Golang](solution/binary-tree-vertical-order-traversal) | Medium |
-| 315 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | [Golang](solution/count-of-smaller-numbers-after-self) | Hard |
-| 316 | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | [Golang](solution/remove-duplicate-letters) | Hard |
-| 317 | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) | [Golang](solution/shortest-distance-from-all-buildings) | Hard |
-| 318 | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | [Golang](solution/maximum-product-of-word-lengths) | Medium |
-| 319 | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [Golang](solution/bulb-switcher) | Medium |
-| 320 | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) | [Golang](solution/generalized-abbreviation) | Medium |
-| 321 | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | [Golang](solution/create-maximum-number) | Hard |
-| 322 | [Coin Change](https://leetcode.com/problems/coin-change) | [Golang](solution/coin-change) | Medium |
-| 323 | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) | [Golang](solution/number-of-connected-components-in-an-undirected-graph) | Medium |
-| 324 | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | [Golang](solution/wiggle-sort-ii) | Medium |
-| 325 | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) | [Golang](solution/maximum-size-subarray-sum-equals-k) | Medium |
-| 326 | [Power of Three](https://leetcode.com/problems/power-of-three) | [Golang](solution/power-of-three) | Easy |
-| 327 | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | [Golang](solution/count-of-range-sum) | Hard |
-| 328 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | [Golang](solution/odd-even-linked-list) | Medium |
-| 329 | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | [Golang](solution/longest-increasing-path-in-a-matrix) | Hard |
-| 330 | [Patching Array](https://leetcode.com/problems/patching-array) | [Golang](solution/patching-array) | Hard |
-| 331 | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | [Golang](solution/verify-preorder-serialization-of-a-binary-tree) | Medium |
-| 332 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | [Golang](solution/reconstruct-itinerary) | Medium |
-| 333 | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) | [Golang](solution/largest-bst-subtree) | Medium |
-| 334 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | [Golang](solution/increasing-triplet-subsequence) | Medium |
-| 335 | [Self Crossing](https://leetcode.com/problems/self-crossing) | [Golang](solution/self-crossing) | Hard |
-| 336 | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs) | [Golang](solution/palindrome-pairs) | Hard |
-| 337 | [House Robber III](https://leetcode.com/problems/house-robber-iii) | [Golang](solution/house-robber-iii) | Medium |
-| 338 | [Counting Bits](https://leetcode.com/problems/counting-bits) | [Golang](solution/counting-bits) | Medium |
-| 339 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) | [Golang](solution/nested-list-weight-sum) | Easy |
-| 340 | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) | [Golang](solution/longest-substring-with-at-most-k-distinct-characters) | Hard |
-| 341 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | [Golang](solution/flatten-nested-list-iterator) | Medium |
-| 342 | [Power of Four](https://leetcode.com/problems/power-of-four) | [Golang](solution/power-of-four) | Easy |
-| 343 | [Integer Break](https://leetcode.com/problems/integer-break) | [Golang](solution/integer-break) | Medium |
-| 344 | [Reverse String](https://leetcode.com/problems/reverse-string) | [Golang](solution/reverse-string) | Easy |
-| 345 | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [Golang](solution/reverse-vowels-of-a-string) | Easy |
-| 346 | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) | [Golang](solution/moving-average-from-data-stream) | Easy |
-| 347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [Golang](solution/top-k-frequent-elements) | Medium |
-| 348 | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) | [Golang](solution/design-tic-tac-toe) | Medium |
-| 349 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | [Golang](solution/intersection-of-two-arrays) | Easy |
-| 350 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | [Golang](solution/intersection-of-two-arrays-ii) | Easy |
-| 351 | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) | [Golang](solution/android-unlock-patterns) | Medium |
-| 352 | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals) | [Golang](solution/data-stream-as-disjoint-intervals) | Hard |
-| 353 | [Design Snake Game](https://leetcode.com/problems/design-snake-game) | [Golang](solution/design-snake-game) | Medium |
-| 354 | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | [Golang](solution/russian-doll-envelopes) | Hard |
-| 355 | [Design Twitter](https://leetcode.com/problems/design-twitter) | [Golang](solution/design-twitter) | Medium |
-| 356 | [Line Reflection](https://leetcode.com/problems/line-reflection) | [Golang](solution/line-reflection) | Medium |
-| 357 | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | [Golang](solution/count-numbers-with-unique-digits) | Medium |
-| 358 | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) | [Golang](solution/rearrange-string-k-distance-apart) | Hard |
-| 359 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) | [Golang](solution/logger-rate-limiter) | Easy |
-| 360 | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) | [Golang](solution/sort-transformed-array) | Medium |
-| 361 | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) | [Golang](solution/bomb-enemy) | Medium |
-| 362 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) | [Golang](solution/design-hit-counter) | Medium |
-| 363 | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | [Golang](solution/max-sum-of-rectangle-no-larger-than-k) | Hard |
-| 364 | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) | [Golang](solution/nested-list-weight-sum-ii) | Medium |
-| 365 | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem) | [Golang](solution/water-and-jug-problem) | Medium |
-| 366 | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) | [Golang](solution/find-leaves-of-binary-tree) | Medium |
-| 367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | [Golang](solution/valid-perfect-square) | Easy |
-| 368 | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | [Golang](solution/largest-divisible-subset) | Medium |
-| 369 | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) | [Golang](solution/plus-one-linked-list) | Medium |
-| 370 | [Range Addition](https://leetcode.com/problems/range-addition) | [Golang](solution/range-addition) | Medium |
-| 371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | [Golang](solution/sum-of-two-integers) | Easy |
-| 372 | [Super Pow](https://leetcode.com/problems/super-pow) | [Golang](solution/super-pow) | Medium |
-| 373 | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | [Golang](solution/find-k-pairs-with-smallest-sums) | Medium |
-| 374 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | [Golang](solution/guess-number-higher-or-lower) | Easy |
-| 375 | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii) | [Golang](solution/guess-number-higher-or-lower-ii) | Medium |
-| 376 | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence) | [Golang](solution/wiggle-subsequence) | Medium |
-| 377 | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [Golang](solution/combination-sum-iv) | Medium |
-| 378 | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [Golang](solution/kth-smallest-element-in-a-sorted-matrix) | Medium |
-| 379 | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) | [Golang](solution/design-phone-directory) | Medium |
-| 380 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o(1)) | [Golang](solution/insert-delete-getrandom-o(1)) | Medium |
-| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o(1)---duplicates-allowed) | [Golang](solution/insert-delete-getrandom-o(1)---duplicates-allowed) | Hard |
-| 382 | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [Golang](solution/linked-list-random-node) | Medium |
-| 383 | [Ransom Note](https://leetcode.com/problems/ransom-note) | [Golang](solution/ransom-note) | Easy |
-| 384 | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | [Golang](solution/shuffle-an-array) | Medium |
-| 385 | [Mini Parser](https://leetcode.com/problems/mini-parser) | [Golang](solution/mini-parser) | Medium |
-| 386 | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers) | [Golang](solution/lexicographical-numbers) | Medium |
-| 387 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | [Golang](solution/first-unique-character-in-a-string) | Easy |
-| 388 | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path) | [Golang](solution/longest-absolute-file-path) | Medium |
-| 389 | [Find the Difference](https://leetcode.com/problems/find-the-difference) | [Golang](solution/find-the-difference) | Easy |
-| 390 | [Elimination Game](https://leetcode.com/problems/elimination-game) | [Golang](solution/elimination-game) | Medium |
-| 391 | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle) | [Golang](solution/perfect-rectangle) | Hard |
-| 392 | [Is Subsequence](https://leetcode.com/problems/is-subsequence) | [Golang](solution/is-subsequence) | Medium |
-| 393 | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation) | [Golang](solution/utf-8-validation) | Medium |
-| 394 | [Decode String](https://leetcode.com/problems/decode-string) | [Golang](solution/decode-string) | Medium |
-| 395 | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters) | [Golang](solution/longest-substring-with-at-least-k-repeating-characters) | Medium |
-| 396 | [Rotate Function](https://leetcode.com/problems/rotate-function) | [Golang](solution/rotate-function) | Medium |
-| 397 | [Integer Replacement](https://leetcode.com/problems/integer-replacement) | [Golang](solution/integer-replacement) | Medium |
-| 398 | [Random Pick Index](https://leetcode.com/problems/random-pick-index) | [Golang](solution/random-pick-index) | Medium |
-| 399 | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | [Golang](solution/evaluate-division) | Medium |
-| 400 | [Nth Digit](https://leetcode.com/problems/nth-digit) | [Golang](solution/nth-digit) | Easy |
-| 401 | [Binary Watch](https://leetcode.com/problems/binary-watch) | [Golang](solution/binary-watch) | Easy |
-| 402 | [Remove K Digits](https://leetcode.com/problems/remove-k-digits) | [Golang](solution/remove-k-digits) | Medium |
-| 403 | [Frog Jump](https://leetcode.com/problems/frog-jump) | [Golang](solution/frog-jump) | Hard |
-| 404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves) | [Golang](solution/sum-of-left-leaves) | Easy |
-| 405 | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [Golang](solution/convert-a-number-to-hexadecimal) | Easy |
-| 406 | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | [Golang](solution/queue-reconstruction-by-height) | Medium |
-| 407 | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | [Golang](solution/trapping-rain-water-ii) | Hard |
-| 408 | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) | [Golang](solution/valid-word-abbreviation) | Easy |
-| 409 | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [Golang](solution/longest-palindrome) | Easy |
-| 410 | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | [Golang](solution/split-array-largest-sum) | Hard |
-| 411 | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) | [Golang](solution/minimum-unique-word-abbreviation) | Hard |
-| 412 | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [Golang](solution/fizz-buzz) | Easy |
-| 413 | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | [Golang](solution/arithmetic-slices) | Medium |
-| 414 | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | [Golang](solution/third-maximum-number) | Easy |
-| 415 | [Add Strings](https://leetcode.com/problems/add-strings) | [Golang](solution/add-strings) | Easy |
-| 416 | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Golang](solution/partition-equal-subset-sum) | Medium |
-| 417 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [Golang](solution/pacific-atlantic-water-flow) | Medium |
-| 418 | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) | [Golang](solution/sentence-screen-fitting) | Medium |
-| 419 | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | [Golang](solution/battleships-in-a-board) | Medium |
-| 420 | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker) | [Golang](solution/strong-password-checker) | Hard |
-| 421 | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | [Golang](solution/maximum-xor-of-two-numbers-in-an-array) | Medium |
-| 422 | [Valid Word Square](https://leetcode.com/problems/valid-word-square) | [Golang](solution/valid-word-square) | Easy |
-| 423 | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english) | [Golang](solution/reconstruct-original-digits-from-english) | Medium |
-| 424 | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [Golang](solution/longest-repeating-character-replacement) | Medium |
-| 425 | [Word Squares](https://leetcode.com/problems/word-squares) | [Golang](solution/word-squares) | Hard |
-| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) | [Golang](solution/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
-| 427 | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree) | [Golang](solution/construct-quad-tree) | Easy |
-| 428 | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) | [Golang](solution/serialize-and-deserialize-n-ary-tree) | Hard |
-| 429 | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [Golang](solution/n-ary-tree-level-order-traversal) | Easy |
-| 430 | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [Golang](solution/flatten-a-multilevel-doubly-linked-list) | Medium |
-| 431 | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) | [Golang](solution/encode-n-ary-tree-to-binary-tree) | Hard |
-| 432 | [All O`one Data Structure](https://leetcode.com/problems/all-o`one-data-structure) | [Golang](solution/all-o`one-data-structure) | Hard |
-| 433 | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [Golang](solution/minimum-genetic-mutation) | Medium |
-| 434 | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [Golang](solution/number-of-segments-in-a-string) | Easy |
-| 435 | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | [Golang](solution/non-overlapping-intervals) | Medium |
-| 436 | [Find Right Interval](https://leetcode.com/problems/find-right-interval) | [Golang](solution/find-right-interval) | Medium |
-| 437 | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | [Golang](solution/path-sum-iii) | Easy |
-| 438 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [Golang](solution/find-all-anagrams-in-a-string) | Easy |
-| 439 | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) | [Golang](solution/ternary-expression-parser) | Medium |
-| 440 | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order) | [Golang](solution/k-th-smallest-in-lexicographical-order) | Hard |
-| 441 | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | [Golang](solution/arranging-coins) | Easy |
-| 442 | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [Golang](solution/find-all-duplicates-in-an-array) | Medium |
-| 443 | [String Compression](https://leetcode.com/problems/string-compression) | [Golang](solution/string-compression) | Easy |
-| 444 | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) | [Golang](solution/sequence-reconstruction) | Medium |
-| 445 | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [Golang](solution/add-two-numbers-ii) | Medium |
-| 446 | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii---subsequence) | [Golang](solution/arithmetic-slices-ii---subsequence) | Hard |
-| 447 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Golang](solution/number-of-boomerangs) | Easy |
-| 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | [Golang](solution/find-all-numbers-disappeared-in-an-array) | Easy |
-| 449 | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | [Golang](solution/serialize-and-deserialize-bst) | Medium |
-| 450 | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst) | [Golang](solution/delete-node-in-a-bst) | Medium |
-| 451 | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency) | [Golang](solution/sort-characters-by-frequency) | Medium |
-| 452 | [Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons) | [Golang](solution/minimum-number-of-arrows-to-burst-balloons) | Medium |
-| 453 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | [Golang](solution/minimum-moves-to-equal-array-elements) | Easy |
-| 454 | [4Sum II](https://leetcode.com/problems/4sum-ii) | [Golang](solution/4sum-ii) | Medium |
-| 455 | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | [Golang](solution/assign-cookies) | Easy |
-| 456 | [132 Pattern](https://leetcode.com/problems/132-pattern) | [Golang](solution/132-pattern) | Medium |
-| 457 | [Circular Array Loop](https://leetcode.com/problems/circular-array-loop) | [Golang](solution/circular-array-loop) | Medium |
-| 458 | [Poor Pigs](https://leetcode.com/problems/poor-pigs) | [Golang](solution/poor-pigs) | Easy |
-| 459 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | [Golang](solution/repeated-substring-pattern) | Easy |
-| 460 | [LFU Cache](https://leetcode.com/problems/lfu-cache) | [Golang](solution/lfu-cache) | Hard |
-| 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance) | [Golang](solution/hamming-distance) | Easy |
-| 462 | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | [Golang](solution/minimum-moves-to-equal-array-elements-ii) | Medium |
-| 463 | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | [Golang](solution/island-perimeter) | Easy |
-| 464 | [Can I Win](https://leetcode.com/problems/can-i-win) | [Golang](solution/can-i-win) | Medium |
-| 465 | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) | [Golang](solution/optimal-account-balancing) | Hard |
-| 466 | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions) | [Golang](solution/count-the-repetitions) | Hard |
-| 467 | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [Golang](solution/unique-substrings-in-wraparound-string) | Medium |
-| 468 | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [Golang](solution/validate-ip-address) | Medium |
-| 469 | [Convex Polygon](https://leetcode.com/problems/convex-polygon) | [Golang](solution/convex-polygon) | Medium |
-| 470 | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10()-using-rand7()) | [Golang](solution/implement-rand10()-using-rand7()) | Medium |
-| 471 | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) | [Golang](solution/encode-string-with-shortest-length) | Hard |
-| 472 | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [Golang](solution/concatenated-words) | Hard |
-| 473 | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [Golang](solution/matchsticks-to-square) | Medium |
-| 474 | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | [Golang](solution/ones-and-zeroes) | Medium |
-| 475 | [Heaters](https://leetcode.com/problems/heaters) | [Golang](solution/heaters) | Easy |
-| 476 | [Number Complement](https://leetcode.com/problems/number-complement) | [Golang](solution/number-complement) | Easy |
-| 477 | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance) | [Golang](solution/total-hamming-distance) | Medium |
-| 478 | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle) | [Golang](solution/generate-random-point-in-a-circle) | Medium |
-| 479 | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product) | [Golang](solution/largest-palindrome-product) | Easy |
-| 480 | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median) | [Golang](solution/sliding-window-median) | Hard |
-| 481 | [Magical String](https://leetcode.com/problems/magical-string) | [Golang](solution/magical-string) | Medium |
-| 482 | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [Golang](solution/license-key-formatting) | Easy |
-| 483 | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | [Golang](solution/smallest-good-base) | Hard |
-| 484 | [Find Permutation](https://leetcode.com/problems/find-permutation) | [Golang](solution/find-permutation) | Medium |
-| 485 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | [Golang](solution/max-consecutive-ones) | Easy |
-| 486 | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | [Golang](solution/predict-the-winner) | Medium |
-| 487 | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) | [Golang](solution/max-consecutive-ones-ii) | Medium |
-| 488 | [Zuma Game](https://leetcode.com/problems/zuma-game) | [Golang](solution/zuma-game) | Hard |
-| 489 | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) | [Golang](solution/robot-room-cleaner) | Hard |
-| 490 | [The Maze](https://leetcode.com/problems/the-maze) | [Golang](solution/the-maze) | Medium |
-| 491 | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences) | [Golang](solution/increasing-subsequences) | Medium |
-| 492 | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | [Golang](solution/construct-the-rectangle) | Easy |
-| 493 | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | [Golang](solution/reverse-pairs) | Hard |
-| 494 | [Target Sum](https://leetcode.com/problems/target-sum) | [Golang](solution/target-sum) | Medium |
-| 495 | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking) | [Golang](solution/teemo-attacking) | Medium |
-| 496 | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [Golang](solution/next-greater-element-i) | Easy |
-| 497 | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles) | [Golang](solution/random-point-in-non-overlapping-rectangles) | Medium |
-| 498 | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | [Golang](solution/diagonal-traverse) | Medium |
-| 499 | [The Maze III](https://leetcode.com/problems/the-maze-iii) | [Golang](solution/the-maze-iii) | Hard |
-| 500 | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | [Golang](solution/keyboard-row) | Easy |
-| 501 | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | [Golang](solution/find-mode-in-binary-search-tree) | Easy |
-| 502 | [IPO](https://leetcode.com/problems/ipo) | [Golang](solution/ipo) | Hard |
-| 503 | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | [Golang](solution/next-greater-element-ii) | Medium |
-| 504 | [Base 7](https://leetcode.com/problems/base-7) | [Golang](solution/base-7) | Easy |
-| 505 | [The Maze II](https://leetcode.com/problems/the-maze-ii) | [Golang](solution/the-maze-ii) | Medium |
-| 506 | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | [Golang](solution/relative-ranks) | Easy |
-| 507 | [Perfect Number](https://leetcode.com/problems/perfect-number) | [Golang](solution/perfect-number) | Easy |
-| 508 | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [Golang](solution/most-frequent-subtree-sum) | Medium |
-| 513 | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value) | [Golang](solution/find-bottom-left-tree-value) | Medium |
-| 514 | [Freedom Trail](https://leetcode.com/problems/freedom-trail) | [Golang](solution/freedom-trail) | Hard |
-| 515 | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row) | [Golang](solution/find-largest-value-in-each-tree-row) | Medium |
-| 516 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | [Golang](solution/longest-palindromic-subsequence) | Medium |
-| 517 | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines) | [Golang](solution/super-washing-machines) | Hard |
-| 518 | [Coin Change 2](https://leetcode.com/problems/coin-change-2) | [Golang](solution/coin-change-2) | Medium |
-| 519 | [Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix) | [Golang](solution/random-flip-matrix) | Medium |
-| 520 | [Detect Capital](https://leetcode.com/problems/detect-capital) | [Golang](solution/detect-capital) | Easy |
-| 521 | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | [Golang](solution/longest-uncommon-subsequence-i) | Easy |
-| 522 | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii) | [Golang](solution/longest-uncommon-subsequence-ii) | Medium |
-| 523 | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | [Golang](solution/continuous-subarray-sum) | Medium |
-| 524 | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [Golang](solution/longest-word-in-dictionary-through-deleting) | Medium |
-| 525 | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | [Golang](solution/contiguous-array) | Medium |
-| 526 | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | [Golang](solution/beautiful-arrangement) | Medium |
-| 527 | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) | [Golang](solution/word-abbreviation) | Hard |
-| 528 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | [Golang](solution/random-pick-with-weight) | Medium |
-| 529 | [Minesweeper](https://leetcode.com/problems/minesweeper) | [Golang](solution/minesweeper) | Medium |
-| 530 | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [Golang](solution/minimum-absolute-difference-in-bst) | Easy |
-| 531 | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) | [Golang](solution/lonely-pixel-i) | Medium |
-| 532 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [Golang](solution/k-diff-pairs-in-an-array) | Easy |
-| 533 | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) | [Golang](solution/lonely-pixel-ii) | Medium |
-| 535 | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | [Golang](solution/encode-and-decode-tinyurl) | Medium |
-| 536 | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) | [Golang](solution/construct-binary-tree-from-string) | Medium |
-| 537 | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | [Golang](solution/complex-number-multiplication) | Medium |
-| 538 | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | [Golang](solution/convert-bst-to-greater-tree) | Easy |
-| 539 | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [Golang](solution/minimum-time-difference) | Medium |
-| 540 | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array) | [Golang](solution/single-element-in-a-sorted-array) | Medium |
-| 541 | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [Golang](solution/reverse-string-ii) | Easy |
-| 542 | [01 Matrix](https://leetcode.com/problems/01-matrix) | [Golang](solution/01-matrix) | Medium |
-| 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [Golang](solution/diameter-of-binary-tree) | Easy |
-| 544 | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) | [Golang](solution/output-contest-matches) | Medium |
-| 545 | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) | [Golang](solution/boundary-of-binary-tree) | Medium |
-| 546 | [Remove Boxes](https://leetcode.com/problems/remove-boxes) | [Golang](solution/remove-boxes) | Hard |
-| 547 | [Friend Circles](https://leetcode.com/problems/friend-circles) | [Golang](solution/friend-circles) | Medium |
-| 548 | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) | [Golang](solution/split-array-with-equal-sum) | Medium |
-| 549 | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) | [Golang](solution/binary-tree-longest-consecutive-sequence-ii) | Medium |
-| 551 | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [Golang](solution/student-attendance-record-i) | Easy |
-| 552 | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | [Golang](solution/student-attendance-record-ii) | Hard |
-| 553 | [Optimal Division](https://leetcode.com/problems/optimal-division) | [Golang](solution/optimal-division) | Medium |
-| 554 | [Brick Wall](https://leetcode.com/problems/brick-wall) | [Golang](solution/brick-wall) | Medium |
-| 555 | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) | [Golang](solution/split-concatenated-strings) | Medium |
-| 556 | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii) | [Golang](solution/next-greater-element-iii) | Medium |
-| 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [Golang](solution/reverse-words-in-a-string-iii) | Easy |
-| 558 | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection) | [Golang](solution/quad-tree-intersection) | Easy |
-| 559 | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [Golang](solution/maximum-depth-of-n-ary-tree) | Easy |
-| 560 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | [Golang](solution/subarray-sum-equals-k) | Medium |
-| 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i) | [Golang](solution/array-partition-i) | Easy |
-| 562 | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) | [Golang](solution/longest-line-of-consecutive-one-in-matrix) | Medium |
-| 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [Golang](solution/binary-tree-tilt) | Easy |
-| 564 | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome) | [Golang](solution/find-the-closest-palindrome) | Hard |
-| 565 | [Array Nesting](https://leetcode.com/problems/array-nesting) | [Golang](solution/array-nesting) | Medium |
-| 566 | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix) | [Golang](solution/reshape-the-matrix) | Easy |
-| 567 | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | [Golang](solution/permutation-in-string) | Medium |
-| 568 | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) | [Golang](solution/maximum-vacation-days) | Hard |
-| 569 | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) | [Golang](solution/median-employee-salary) | Hard |
-| 570 | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) | [Golang](solution/managers-with-at-least-5-direct-reports) | Medium |
-| 571 | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) | [Golang](solution/find-median-given-frequency-of-numbers) | Hard |
-| 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [Golang](solution/subtree-of-another-tree) | Easy |
-| 573 | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) | [Golang](solution/squirrel-simulation) | Medium |
-| 574 | [Winning Candidate](https://leetcode.com/problems/winning-candidate) | [Golang](solution/winning-candidate) | Medium |
-| 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | [Golang](solution/distribute-candies) | Easy |
-| 576 | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [Golang](solution/out-of-boundary-paths) | Medium |
-| 577 | [Employee Bonus](https://leetcode.com/problems/employee-bonus) | [Golang](solution/employee-bonus) | Easy |
-| 578 | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) | [Golang](solution/get-highest-answer-rate-question) | Medium |
-| 579 | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) | [Golang](solution/find-cumulative-salary-of-an-employee) | Hard |
-| 580 | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) | [Golang](solution/count-student-number-in-departments) | Medium |
-| 581 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Golang](solution/shortest-unsorted-continuous-subarray) | Easy |
-| 582 | [Kill Process](https://leetcode.com/problems/kill-process) | [Golang](solution/kill-process) | Medium |
-| 583 | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [Golang](solution/delete-operation-for-two-strings) | Medium |
-| 584 | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) | [Golang](solution/find-customer-referee) | Easy |
-| 585 | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) | [Golang](solution/investments-in-2016) | Medium |
-| 586 | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) | [Golang](solution/customer-placing-the-largest-number-of-orders) | Easy |
-| 587 | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | [Golang](solution/erect-the-fence) | Hard |
-| 588 | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) | [Golang](solution/design-in-memory-file-system) | Hard |
-| 589 | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | [Golang](solution/n-ary-tree-preorder-traversal) | Easy |
-| 590 | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | [Golang](solution/n-ary-tree-postorder-traversal) | Easy |
-| 591 | [Tag Validator](https://leetcode.com/problems/tag-validator) | [Golang](solution/tag-validator) | Hard |
-| 592 | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction) | [Golang](solution/fraction-addition-and-subtraction) | Medium |
-| 593 | [Valid Square](https://leetcode.com/problems/valid-square) | [Golang](solution/valid-square) | Medium |
-| 594 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Golang](solution/longest-harmonious-subsequence) | Easy |
-| 595 | [Big Countries](https://leetcode.com/problems/big-countries) | [Golang](solution/big-countries) | Easy |
-| 596 | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [Golang](solution/classes-more-than-5-students) | Easy |
-| 597 | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i:-overall-acceptance-rate) | [Golang](solution/friend-requests-i:-overall-acceptance-rate) | Easy |
-| 598 | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Golang](solution/range-addition-ii) | Easy |
-| 599 | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Golang](solution/minimum-index-sum-of-two-lists) | Easy |
-| 600 | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Golang](solution/non-negative-integers-without-consecutive-ones) | Hard |
-| 601 | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [Golang](solution/human-traffic-of-stadium) | Hard |
-| 602 | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii:-who-has-the-most-friends) | [Golang](solution/friend-requests-ii:-who-has-the-most-friends) | Medium |
-| 603 | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) | [Golang](solution/consecutive-available-seats) | Easy |
-| 604 | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) | [Golang](solution/design-compressed-string-iterator) | Easy |
-| 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [Golang](solution/can-place-flowers) | Easy |
-| 606 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [Golang](solution/construct-string-from-binary-tree) | Easy |
-| 607 | [Sales Person](https://leetcode.com/problems/sales-person) | [Golang](solution/sales-person) | Easy |
-| 608 | [Tree Node](https://leetcode.com/problems/tree-node) | [Golang](solution/tree-node) | Medium |
-| 609 | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [Golang](solution/find-duplicate-file-in-system) | Medium |
-| 610 | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) | [Golang](solution/triangle-judgement) | Easy |
-| 611 | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | [Golang](solution/valid-triangle-number) | Medium |
-| 612 | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) | [Golang](solution/shortest-distance-in-a-plane) | Medium |
-| 613 | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) | [Golang](solution/shortest-distance-in-a-line) | Easy |
-| 614 | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) | [Golang](solution/second-degree-follower) | Medium |
-| 615 | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary:-departments-vs-company) | [Golang](solution/average-salary:-departments-vs-company) | Hard |
-| 616 | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) | [Golang](solution/add-bold-tag-in-string) | Medium |
-| 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Golang](solution/merge-two-binary-trees) | Easy |
-| 618 | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) | [Golang](solution/students-report-by-geography) | Hard |
-| 619 | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) | [Golang](solution/biggest-single-number) | Easy |
-| 620 | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [Golang](solution/not-boring-movies) | Easy |
-| 621 | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [Golang](solution/task-scheduler) | Medium |
-| 622 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [Golang](solution/design-circular-queue) | Medium |
-| 623 | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [Golang](solution/add-one-row-to-tree) | Medium |
-| 624 | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) | [Golang](solution/maximum-distance-in-arrays) | Easy |
-| 625 | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) | [Golang](solution/minimum-factorization) | Medium |
-| 626 | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [Golang](solution/exchange-seats) | Medium |
-| 627 | [Swap Salary](https://leetcode.com/problems/swap-salary) | [Golang](solution/swap-salary) | Easy |
-| 628 | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [Golang](solution/maximum-product-of-three-numbers) | Easy |
-| 629 | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [Golang](solution/k-inverse-pairs-array) | Hard |
-| 630 | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [Golang](solution/course-schedule-iii) | Hard |
-| 631 | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) | [Golang](solution/design-excel-sum-formula) | Hard |
-| 632 | [Smallest Range](https://leetcode.com/problems/smallest-range) | [Golang](solution/smallest-range) | Hard |
-| 633 | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [Golang](solution/sum-of-square-numbers) | Easy |
-| 634 | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) | [Golang](solution/find-the-derangement-of-an-array) | Medium |
-| 635 | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) | [Golang](solution/design-log-storage-system) | Medium |
-| 636 | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | [Golang](solution/exclusive-time-of-functions) | Medium |
-| 637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [Golang](solution/average-of-levels-in-binary-tree) | Easy |
-| 638 | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | [Golang](solution/shopping-offers) | Medium |
-| 639 | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii) | [Golang](solution/decode-ways-ii) | Hard |
-| 640 | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | [Golang](solution/solve-the-equation) | Medium |
-| 641 | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | [Golang](solution/design-circular-deque) | Medium |
-| 642 | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) | [Golang](solution/design-search-autocomplete-system) | Hard |
-| 643 | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [Golang](solution/maximum-average-subarray-i) | Easy |
-| 644 | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) | [Golang](solution/maximum-average-subarray-ii) | Hard |
-| 645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [Golang](solution/set-mismatch) | Easy |
-| 646 | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | [Golang](solution/maximum-length-of-pair-chain) | Medium |
-| 647 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | [Golang](solution/palindromic-substrings) | Medium |
-| 648 | [Replace Words](https://leetcode.com/problems/replace-words) | [Golang](solution/replace-words) | Medium |
-| 649 | [Dota2 Senate](https://leetcode.com/problems/dota2-senate) | [Golang](solution/dota2-senate) | Medium |
-| 650 | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [Golang](solution/2-keys-keyboard) | Medium |
-| 651 | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) | [Golang](solution/4-keys-keyboard) | Medium |
-| 652 | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [Golang](solution/find-duplicate-subtrees) | Medium |
-| 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv---input-is-a-bst) | [Golang](solution/two-sum-iv---input-is-a-bst) | Easy |
-| 654 | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [Golang](solution/maximum-binary-tree) | Medium |
-| 655 | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [Golang](solution/print-binary-tree) | Medium |
-| 656 | [Coin Path](https://leetcode.com/problems/coin-path) | [Golang](solution/coin-path) | Hard |
-| 657 | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [Golang](solution/robot-return-to-origin) | Easy |
-| 658 | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | [Golang](solution/find-k-closest-elements) | Medium |
-| 659 | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [Golang](solution/split-array-into-consecutive-subsequences) | Medium |
-| 660 | [Remove 9](https://leetcode.com/problems/remove-9) | [Golang](solution/remove-9) | Hard |
-| 661 | [Image Smoother](https://leetcode.com/problems/image-smoother) | [Golang](solution/image-smoother) | Easy |
-| 662 | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | [Golang](solution/maximum-width-of-binary-tree) | Medium |
-| 663 | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) | [Golang](solution/equal-tree-partition) | Medium |
-| 664 | [Strange Printer](https://leetcode.com/problems/strange-printer) | [Golang](solution/strange-printer) | Hard |
-| 665 | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | [Golang](solution/non-decreasing-array) | Easy |
-| 666 | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) | [Golang](solution/path-sum-iv) | Medium |
-| 667 | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | [Golang](solution/beautiful-arrangement-ii) | Medium |
-| 668 | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | [Golang](solution/kth-smallest-number-in-multiplication-table) | Hard |
-| 669 | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [Golang](solution/trim-a-binary-search-tree) | Easy |
-| 670 | [Maximum Swap](https://leetcode.com/problems/maximum-swap) | [Golang](solution/maximum-swap) | Medium |
-| 671 | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | [Golang](solution/second-minimum-node-in-a-binary-tree) | Easy |
-| 672 | [Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii) | [Golang](solution/bulb-switcher-ii) | Medium |
-| 673 | [Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence) | [Golang](solution/number-of-longest-increasing-subsequence) | Medium |
-| 674 | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | [Golang](solution/longest-continuous-increasing-subsequence) | Easy |
-| 675 | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event) | [Golang](solution/cut-off-trees-for-golf-event) | Hard |
-| 676 | [Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary) | [Golang](solution/implement-magic-dictionary) | Medium |
-| 677 | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs) | [Golang](solution/map-sum-pairs) | Medium |
-| 678 | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | [Golang](solution/valid-parenthesis-string) | Medium |
-| 679 | [24 Game](https://leetcode.com/problems/24-game) | [Golang](solution/24-game) | Hard |
-| 680 | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | [Golang](solution/valid-palindrome-ii) | Easy |
-| 681 | [Next Closest Time](https://leetcode.com/problems/next-closest-time) | [Golang](solution/next-closest-time) | Medium |
-| 682 | [Baseball Game](https://leetcode.com/problems/baseball-game) | [Golang](solution/baseball-game) | Easy |
-| 683 | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) | [Golang](solution/k-empty-slots) | Hard |
-| 684 | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | [Golang](solution/redundant-connection) | Medium |
-| 685 | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | [Golang](solution/redundant-connection-ii) | Hard |
-| 686 | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | [Golang](solution/repeated-string-match) | Easy |
-| 687 | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path) | [Golang](solution/longest-univalue-path) | Easy |
-| 688 | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard) | [Golang](solution/knight-probability-in-chessboard) | Medium |
-| 689 | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) | [Golang](solution/maximum-sum-of-3-non-overlapping-subarrays) | Hard |
-| 690 | [Employee Importance](https://leetcode.com/problems/employee-importance) | [Golang](solution/employee-importance) | Easy |
-| 691 | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word) | [Golang](solution/stickers-to-spell-word) | Hard |
-| 692 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | [Golang](solution/top-k-frequent-words) | Medium |
-| 693 | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [Golang](solution/binary-number-with-alternating-bits) | Easy |
-| 694 | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) | [Golang](solution/number-of-distinct-islands) | Medium |
-| 695 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | [Golang](solution/max-area-of-island) | Medium |
-| 696 | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [Golang](solution/count-binary-substrings) | Easy |
-| 697 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Golang](solution/degree-of-an-array) | Easy |
-| 698 | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) | [Golang](solution/partition-to-k-equal-sum-subsets) | Medium |
-| 699 | [Falling Squares](https://leetcode.com/problems/falling-squares) | [Golang](solution/falling-squares) | Hard |
-| 700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [Golang](solution/search-in-a-binary-search-tree) | Easy |
-| 701 | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree) | [Golang](solution/insert-into-a-binary-search-tree) | Medium |
-| 702 | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) | [Golang](solution/search-in-a-sorted-array-of-unknown-size) | Medium |
-| 703 | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [Golang](solution/kth-largest-element-in-a-stream) | Easy |
-| 704 | [Binary Search](https://leetcode.com/problems/binary-search) | [Golang](solution/binary-search) | Easy |
-| 705 | [Design HashSet](https://leetcode.com/problems/design-hashset) | [Golang](solution/design-hashset) | Easy |
-| 706 | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [Golang](solution/design-hashmap) | Easy |
-| 707 | [Design Linked List](https://leetcode.com/problems/design-linked-list) | [Golang](solution/design-linked-list) | Easy |
-| 708 | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) | [Golang](solution/insert-into-a-cyclic-sorted-list) | Medium |
-| 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [Golang](solution/to-lower-case) | Easy |
-| 710 | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist) | [Golang](solution/random-pick-with-blacklist) | Hard |
-| 711 | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) | [Golang](solution/number-of-distinct-islands-ii) | Hard |
-| 712 | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | [Golang](solution/minimum-ascii-delete-sum-for-two-strings) | Medium |
-| 713 | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | [Golang](solution/subarray-product-less-than-k) | Medium |
-| 714 | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [Golang](solution/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
-| 715 | [Range Module](https://leetcode.com/problems/range-module) | [Golang](solution/range-module) | Hard |
-| 716 | [Max Stack](https://leetcode.com/problems/max-stack) | [Golang](solution/max-stack) | Easy |
-| 717 | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | [Golang](solution/1-bit-and-2-bit-characters) | Easy |
-| 718 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | [Golang](solution/maximum-length-of-repeated-subarray) | Medium |
-| 719 | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [Golang](solution/find-k-th-smallest-pair-distance) | Hard |
-| 720 | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | [Golang](solution/longest-word-in-dictionary) | Easy |
-| 721 | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | [Golang](solution/accounts-merge) | Medium |
-| 722 | [Remove Comments](https://leetcode.com/problems/remove-comments) | [Golang](solution/remove-comments) | Medium |
-| 723 | [Candy Crush](https://leetcode.com/problems/candy-crush) | [Golang](solution/candy-crush) | Medium |
-| 724 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | [Golang](solution/find-pivot-index) | Easy |
-| 725 | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [Golang](solution/split-linked-list-in-parts) | Medium |
-| 726 | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | [Golang](solution/number-of-atoms) | Hard |
-| 727 | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) | [Golang](solution/minimum-window-subsequence) | Hard |
-| 728 | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers) | [Golang](solution/self-dividing-numbers) | Easy |
-| 729 | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | [Golang](solution/my-calendar-i) | Medium |
-| 730 | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | [Golang](solution/count-different-palindromic-subsequences) | Hard |
-| 731 | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | [Golang](solution/my-calendar-ii) | Medium |
-| 732 | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | [Golang](solution/my-calendar-iii) | Hard |
-| 733 | [Flood Fill](https://leetcode.com/problems/flood-fill) | [Golang](solution/flood-fill) | Easy |
-| 734 | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) | [Golang](solution/sentence-similarity) | Easy |
-| 735 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [Golang](solution/asteroid-collision) | Medium |
-| 736 | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression) | [Golang](solution/parse-lisp-expression) | Hard |
-| 737 | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) | [Golang](solution/sentence-similarity-ii) | Medium |
-| 738 | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | [Golang](solution/monotone-increasing-digits) | Medium |
-| 739 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [Golang](solution/daily-temperatures) | Medium |
-| 740 | [Delete and Earn](https://leetcode.com/problems/delete-and-earn) | [Golang](solution/delete-and-earn) | Medium |
-| 741 | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup) | [Golang](solution/cherry-pickup) | Hard |
-| 742 | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) | [Golang](solution/closest-leaf-in-a-binary-tree) | Medium |
-| 743 | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | [Golang](solution/network-delay-time) | Easy |
-| 744 | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [Golang](solution/find-smallest-letter-greater-than-target) | Easy |
-| 745 | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search) | [Golang](solution/prefix-and-suffix-search) | Hard |
-| 746 | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | [Golang](solution/min-cost-climbing-stairs) | Easy |
-| 747 | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [Golang](solution/largest-number-at-least-twice-of-others) | Easy |
-| 748 | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [Golang](solution/shortest-completing-word) | Easy |
-| 749 | [Contain Virus](https://leetcode.com/problems/contain-virus) | [Golang](solution/contain-virus) | Hard |
-| 750 | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) | [Golang](solution/number-of-corner-rectangles) | Medium |
-| 751 | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) | [Golang](solution/ip-to-cidr) | Easy |
-| 752 | [Open the Lock](https://leetcode.com/problems/open-the-lock) | [Golang](solution/open-the-lock) | Medium |
-| 753 | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | [Golang](solution/cracking-the-safe) | Hard |
-| 754 | [Reach a Number](https://leetcode.com/problems/reach-a-number) | [Golang](solution/reach-a-number) | Easy |
-| 755 | [Pour Water](https://leetcode.com/problems/pour-water) | [Golang](solution/pour-water) | Medium |
-| 756 | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | [Golang](solution/pyramid-transition-matrix) | Medium |
-| 757 | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two) | [Golang](solution/set-intersection-size-at-least-two) | Hard |
-| 758 | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) | [Golang](solution/bold-words-in-string) | Easy |
-| 759 | [Employee Free Time](https://leetcode.com/problems/employee-free-time) | [Golang](solution/employee-free-time) | Hard |
-| 760 | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) | [Golang](solution/find-anagram-mappings) | Easy |
-| 761 | [Special Binary String](https://leetcode.com/problems/special-binary-string) | [Golang](solution/special-binary-string) | Hard |
-| 762 | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [Golang](solution/prime-number-of-set-bits-in-binary-representation) | Easy |
-| 763 | [Partition Labels](https://leetcode.com/problems/partition-labels) | [Golang](solution/partition-labels) | Medium |
-| 764 | [Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign) | [Golang](solution/largest-plus-sign) | Medium |
-| 765 | [Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands) | [Golang](solution/couples-holding-hands) | Hard |
-| 766 | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | [Golang](solution/toeplitz-matrix) | Easy |
-| 767 | [Reorganize String](https://leetcode.com/problems/reorganize-string) | [Golang](solution/reorganize-string) | Medium |
-| 768 | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii) | [Golang](solution/max-chunks-to-make-sorted-ii) | Hard |
-| 769 | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | [Golang](solution/max-chunks-to-make-sorted) | Medium |
-| 770 | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv) | [Golang](solution/basic-calculator-iv) | Hard |
-| 771 | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | [Golang](solution/jewels-and-stones) | Easy |
-| 772 | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) | [Golang](solution/basic-calculator-iii) | Hard |
-| 773 | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle) | [Golang](solution/sliding-puzzle) | Hard |
-| 774 | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) | [Golang](solution/minimize-max-distance-to-gas-station) | Hard |
-| 775 | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | [Golang](solution/global-and-local-inversions) | Medium |
-| 776 | [Split BST](https://leetcode.com/problems/split-bst) | [Golang](solution/split-bst) | Medium |
-| 777 | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string) | [Golang](solution/swap-adjacent-in-lr-string) | Medium |
-| 778 | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water) | [Golang](solution/swim-in-rising-water) | Hard |
-| 779 | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | [Golang](solution/k-th-symbol-in-grammar) | Medium |
-| 780 | [Reaching Points](https://leetcode.com/problems/reaching-points) | [Golang](solution/reaching-points) | Hard |
-| 781 | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest) | [Golang](solution/rabbits-in-forest) | Medium |
-| 782 | [Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard) | [Golang](solution/transform-to-chessboard) | Hard |
-| 783 | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | [Golang](solution/minimum-distance-between-bst-nodes) | Easy |
-| 784 | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation) | [Golang](solution/letter-case-permutation) | Easy |
-| 785 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite?) | [Golang](solution/is-graph-bipartite?) | Medium |
-| 786 | [K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction) | [Golang](solution/k-th-smallest-prime-fraction) | Hard |
-| 787 | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops) | [Golang](solution/cheapest-flights-within-k-stops) | Medium |
-| 788 | [Rotated Digits](https://leetcode.com/problems/rotated-digits) | [Golang](solution/rotated-digits) | Easy |
-| 789 | [Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts) | [Golang](solution/escape-the-ghosts) | Medium |
-| 790 | [Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling) | [Golang](solution/domino-and-tromino-tiling) | Medium |
-| 791 | [Custom Sort String](https://leetcode.com/problems/custom-sort-string) | [Golang](solution/custom-sort-string) | Medium |
-| 792 | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences) | [Golang](solution/number-of-matching-subsequences) | Medium |
-| 793 | [Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function) | [Golang](solution/preimage-size-of-factorial-zeroes-function) | Hard |
-| 794 | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state) | [Golang](solution/valid-tic-tac-toe-state) | Medium |
-| 795 | [Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum) | [Golang](solution/number-of-subarrays-with-bounded-maximum) | Medium |
-| 796 | [Rotate String](https://leetcode.com/problems/rotate-string) | [Golang](solution/rotate-string) | Easy |
-| 797 | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | [Golang](solution/all-paths-from-source-to-target) | Medium |
-| 798 | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score) | [Golang](solution/smallest-rotation-with-highest-score) | Hard |
-| 799 | [Champagne Tower](https://leetcode.com/problems/champagne-tower) | [Golang](solution/champagne-tower) | Medium |
-| 800 | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) | [Golang](solution/similar-rgb-color) | Easy |
-| 801 | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | [Golang](solution/minimum-swaps-to-make-sequences-increasing) | Medium |
-| 802 | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states) | [Golang](solution/find-eventual-safe-states) | Medium |
-| 803 | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit) | [Golang](solution/bricks-falling-when-hit) | Hard |
-| 804 | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words) | [Golang](solution/unique-morse-code-words) | Easy |
-| 805 | [Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average) | [Golang](solution/split-array-with-same-average) | Hard |
-| 806 | [Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string) | [Golang](solution/number-of-lines-to-write-string) | Easy |
-| 807 | [Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline) | [Golang](solution/max-increase-to-keep-city-skyline) | Medium |
-| 808 | [Soup Servings](https://leetcode.com/problems/soup-servings) | [Golang](solution/soup-servings) | Medium |
-| 809 | [Expressive Words](https://leetcode.com/problems/expressive-words) | [Golang](solution/expressive-words) | Medium |
-| 810 | [Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game) | [Golang](solution/chalkboard-xor-game) | Hard |
-| 811 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count) | [Golang](solution/subdomain-visit-count) | Easy |
-| 812 | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | [Golang](solution/largest-triangle-area) | Easy |
-| 813 | [Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages) | [Golang](solution/largest-sum-of-averages) | Medium |
-| 814 | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning) | [Golang](solution/binary-tree-pruning) | Medium |
-| 815 | [Bus Routes](https://leetcode.com/problems/bus-routes) | [Golang](solution/bus-routes) | Hard |
-| 816 | [Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates) | [Golang](solution/ambiguous-coordinates) | Medium |
-| 817 | [Linked List Components](https://leetcode.com/problems/linked-list-components) | [Golang](solution/linked-list-components) | Medium |
-| 818 | [Race Car](https://leetcode.com/problems/race-car) | [Golang](solution/race-car) | Hard |
-| 819 | [Most Common Word](https://leetcode.com/problems/most-common-word) | [Golang](solution/most-common-word) | Easy |
-| 820 | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words) | [Golang](solution/short-encoding-of-words) | Medium |
-| 821 | [Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character) | [Golang](solution/shortest-distance-to-a-character) | Easy |
-| 822 | [Card Flipping Game](https://leetcode.com/problems/card-flipping-game) | [Golang](solution/card-flipping-game) | Medium |
-| 823 | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors) | [Golang](solution/binary-trees-with-factors) | Medium |
-| 824 | [Goat Latin](https://leetcode.com/problems/goat-latin) | [Golang](solution/goat-latin) | Easy |
-| 825 | [Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages) | [Golang](solution/friends-of-appropriate-ages) | Medium |
-| 826 | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work) | [Golang](solution/most-profit-assigning-work) | Medium |
-| 827 | [Making A Large Island](https://leetcode.com/problems/making-a-large-island) | [Golang](solution/making-a-large-island) | Hard |
-| 828 | [Unique Letter String](https://leetcode.com/problems/unique-letter-string) | [Golang](solution/unique-letter-string) | Hard |
-| 829 | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum) | [Golang](solution/consecutive-numbers-sum) | Hard |
-| 830 | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups) | [Golang](solution/positions-of-large-groups) | Easy |
-| 831 | [Masking Personal Information](https://leetcode.com/problems/masking-personal-information) | [Golang](solution/masking-personal-information) | Medium |
-| 832 | [Flipping an Image](https://leetcode.com/problems/flipping-an-image) | [Golang](solution/flipping-an-image) | Easy |
-| 833 | [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string) | [Golang](solution/find-and-replace-in-string) | Medium |
-| 834 | [Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree) | [Golang](solution/sum-of-distances-in-tree) | Hard |
-| 835 | [Image Overlap](https://leetcode.com/problems/image-overlap) | [Golang](solution/image-overlap) | Medium |
-| 836 | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | [Golang](solution/rectangle-overlap) | Easy |
-| 837 | [New 21 Game](https://leetcode.com/problems/new-21-game) | [Golang](solution/new-21-game) | Medium |
-| 838 | [Push Dominoes](https://leetcode.com/problems/push-dominoes) | [Golang](solution/push-dominoes) | Medium |
-| 839 | [Similar String Groups](https://leetcode.com/problems/similar-string-groups) | [Golang](solution/similar-string-groups) | Hard |
-| 840 | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid) | [Golang](solution/magic-squares-in-grid) | Easy |
-| 841 | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms) | [Golang](solution/keys-and-rooms) | Medium |
-| 842 | [Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence) | [Golang](solution/split-array-into-fibonacci-sequence) | Medium |
-| 843 | [Guess the Word](https://leetcode.com/problems/guess-the-word) | [Golang](solution/guess-the-word) | Hard |
-| 844 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | [Golang](solution/backspace-string-compare) | Easy |
-| 845 | [Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array) | [Golang](solution/longest-mountain-in-array) | Medium |
-| 846 | [Hand of Straights](https://leetcode.com/problems/hand-of-straights) | [Golang](solution/hand-of-straights) | Medium |
-| 847 | [Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes) | [Golang](solution/shortest-path-visiting-all-nodes) | Hard |
-| 848 | [Shifting Letters](https://leetcode.com/problems/shifting-letters) | [Golang](solution/shifting-letters) | Medium |
-| 849 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | [Golang](solution/maximize-distance-to-closest-person) | Easy |
-| 850 | [Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii) | [Golang](solution/rectangle-area-ii) | Hard |
-| 851 | [Loud and Rich](https://leetcode.com/problems/loud-and-rich) | [Golang](solution/loud-and-rich) | Medium |
-| 852 | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array) | [Golang](solution/peak-index-in-a-mountain-array) | Easy |
-| 853 | [Car Fleet](https://leetcode.com/problems/car-fleet) | [Golang](solution/car-fleet) | Medium |
-| 854 | [K-Similar Strings](https://leetcode.com/problems/k-similar-strings) | [Golang](solution/k-similar-strings) | Hard |
-| 855 | [Exam Room](https://leetcode.com/problems/exam-room) | [Golang](solution/exam-room) | Medium |
-| 856 | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses) | [Golang](solution/score-of-parentheses) | Medium |
-| 857 | [Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers) | [Golang](solution/minimum-cost-to-hire-k-workers) | Hard |
-| 858 | [Mirror Reflection](https://leetcode.com/problems/mirror-reflection) | [Golang](solution/mirror-reflection) | Medium |
-| 859 | [Buddy Strings](https://leetcode.com/problems/buddy-strings) | [Golang](solution/buddy-strings) | Easy |
-| 860 | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [Golang](solution/lemonade-change) | Easy |
-| 861 | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix) | [Golang](solution/score-after-flipping-matrix) | Medium |
-| 862 | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | [Golang](solution/shortest-subarray-with-sum-at-least-k) | Hard |
-| 863 | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree) | [Golang](solution/all-nodes-distance-k-in-binary-tree) | Medium |
-| 864 | [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys) | [Golang](solution/shortest-path-to-get-all-keys) | Hard |
-| 865 | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes) | [Golang](solution/smallest-subtree-with-all-the-deepest-nodes) | Medium |
-| 866 | [Prime Palindrome](https://leetcode.com/problems/prime-palindrome) | [Golang](solution/prime-palindrome) | Medium |
-| 867 | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | [Golang](solution/transpose-matrix) | Easy |
-| 868 | [Binary Gap](https://leetcode.com/problems/binary-gap) | [Golang](solution/binary-gap) | Easy |
-| 869 | [Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2) | [Golang](solution/reordered-power-of-2) | Medium |
-| 870 | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle) | [Golang](solution/advantage-shuffle) | Medium |
-| 871 | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops) | [Golang](solution/minimum-number-of-refueling-stops) | Hard |
-| 872 | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | [Golang](solution/leaf-similar-trees) | Easy |
-| 873 | [Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) | [Golang](solution/length-of-longest-fibonacci-subsequence) | Medium |
-| 874 | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation) | [Golang](solution/walking-robot-simulation) | Easy |
-| 875 | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas) | [Golang](solution/koko-eating-bananas) | Medium |
-| 876 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | [Golang](solution/middle-of-the-linked-list) | Easy |
-| 877 | [Stone Game](https://leetcode.com/problems/stone-game) | [Golang](solution/stone-game) | Medium |
-| 878 | [Nth Magical Number](https://leetcode.com/problems/nth-magical-number) | [Golang](solution/nth-magical-number) | Hard |
-| 879 | [Profitable Schemes](https://leetcode.com/problems/profitable-schemes) | [Golang](solution/profitable-schemes) | Hard |
-| 880 | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index) | [Golang](solution/decoded-string-at-index) | Medium |
-| 881 | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people) | [Golang](solution/boats-to-save-people) | Medium |
-| 882 | [Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph) | [Golang](solution/reachable-nodes-in-subdivided-graph) | Hard |
-| 883 | [Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes) | [Golang](solution/projection-area-of-3d-shapes) | Easy |
-| 884 | [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences) | [Golang](solution/uncommon-words-from-two-sentences) | Easy |
-| 885 | [Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii) | [Golang](solution/spiral-matrix-iii) | Medium |
-| 886 | [Possible Bipartition](https://leetcode.com/problems/possible-bipartition) | [Golang](solution/possible-bipartition) | Medium |
-| 887 | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop) | [Golang](solution/super-egg-drop) | Hard |
-| 888 | [Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap) | [Golang](solution/fair-candy-swap) | Easy |
-| 889 | [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | [Golang](solution/construct-binary-tree-from-preorder-and-postorder-traversal) | Medium |
-| 890 | [Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern) | [Golang](solution/find-and-replace-pattern) | Medium |
-| 891 | [Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths) | [Golang](solution/sum-of-subsequence-widths) | Hard |
-| 892 | [Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes) | [Golang](solution/surface-area-of-3d-shapes) | Easy |
-| 893 | [Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings) | [Golang](solution/groups-of-special-equivalent-strings) | Easy |
-| 894 | [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees) | [Golang](solution/all-possible-full-binary-trees) | Medium |
-| 895 | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack) | [Golang](solution/maximum-frequency-stack) | Hard |
-| 896 | [Monotonic Array](https://leetcode.com/problems/monotonic-array) | [Golang](solution/monotonic-array) | Easy |
-| 897 | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree) | [Golang](solution/increasing-order-search-tree) | Easy |
-| 898 | [Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays) | [Golang](solution/bitwise-ors-of-subarrays) | Medium |
-| 899 | [Orderly Queue](https://leetcode.com/problems/orderly-queue) | [Golang](solution/orderly-queue) | Hard |
-| 900 | [RLE Iterator](https://leetcode.com/problems/rle-iterator) | [Golang](solution/rle-iterator) | Medium |
-| 901 | [Online Stock Span](https://leetcode.com/problems/online-stock-span) | [Golang](solution/online-stock-span) | Medium |
-| 902 | [Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set) | [Golang](solution/numbers-at-most-n-given-digit-set) | Hard |
-| 903 | [Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence) | [Golang](solution/valid-permutations-for-di-sequence) | Hard |
-| 904 | [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets) | [Golang](solution/fruit-into-baskets) | Medium |
-| 905 | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity) | [Golang](solution/sort-array-by-parity) | Easy |
-| 906 | [Super Palindromes](https://leetcode.com/problems/super-palindromes) | [Golang](solution/super-palindromes) | Hard |
-| 907 | [Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums) | [Golang](solution/sum-of-subarray-minimums) | Medium |
-| 908 | [Smallest Range I](https://leetcode.com/problems/smallest-range-i) | [Golang](solution/smallest-range-i) | Easy |
-| 909 | [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders) | [Golang](solution/snakes-and-ladders) | Medium |
-| 910 | [Smallest Range II](https://leetcode.com/problems/smallest-range-ii) | [Golang](solution/smallest-range-ii) | Medium |
-| 911 | [Online Election](https://leetcode.com/problems/online-election) | [Golang](solution/online-election) | Medium |
-| 913 | [Cat and Mouse](https://leetcode.com/problems/cat-and-mouse) | [Golang](solution/cat-and-mouse) | Hard |
-| 914 | [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | [Golang](solution/x-of-a-kind-in-a-deck-of-cards) | Easy |
-| 915 | [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals) | [Golang](solution/partition-array-into-disjoint-intervals) | Medium |
-| 916 | [Word Subsets](https://leetcode.com/problems/word-subsets) | [Golang](solution/word-subsets) | Medium |
-| 917 | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters) | [Golang](solution/reverse-only-letters) | Easy |
-| 918 | [Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray) | [Golang](solution/maximum-sum-circular-subarray) | Medium |
-| 919 | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter) | [Golang](solution/complete-binary-tree-inserter) | Medium |
-| 920 | [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists) | [Golang](solution/number-of-music-playlists) | Hard |
-| 921 | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid) | [Golang](solution/minimum-add-to-make-parentheses-valid) | Medium |
-| 922 | [Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii) | [Golang](solution/sort-array-by-parity-ii) | Easy |
-| 923 | [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity) | [Golang](solution/3sum-with-multiplicity) | Medium |
-| 924 | [Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread) | [Golang](solution/minimize-malware-spread) | Hard |
-| 925 | [Long Pressed Name](https://leetcode.com/problems/long-pressed-name) | [Golang](solution/long-pressed-name) | Easy |
-| 926 | [Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing) | [Golang](solution/flip-string-to-monotone-increasing) | Medium |
-| 927 | [Three Equal Parts](https://leetcode.com/problems/three-equal-parts) | [Golang](solution/three-equal-parts) | Hard |
-| 928 | [Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii) | [Golang](solution/minimize-malware-spread-ii) | Hard |
-| 929 | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses) | [Golang](solution/unique-email-addresses) | Easy |
-| 930 | [Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum) | [Golang](solution/binary-subarrays-with-sum) | Medium |
-| 931 | [Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum) | [Golang](solution/minimum-falling-path-sum) | Medium |
-| 932 | [Beautiful Array](https://leetcode.com/problems/beautiful-array) | [Golang](solution/beautiful-array) | Medium |
-| 933 | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls) | [Golang](solution/number-of-recent-calls) | Easy |
-| 934 | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge) | [Golang](solution/shortest-bridge) | Medium |
-| 935 | [Knight Dialer](https://leetcode.com/problems/knight-dialer) | [Golang](solution/knight-dialer) | Medium |
-| 936 | [Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence) | [Golang](solution/stamping-the-sequence) | Hard |
-| 937 | [Reorder Log Files](https://leetcode.com/problems/reorder-log-files) | [Golang](solution/reorder-log-files) | Easy |
-| 938 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | [Golang](solution/range-sum-of-bst) | Medium |
-| 939 | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle) | [Golang](solution/minimum-area-rectangle) | Medium |
-| 940 | [Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii) | [Golang](solution/distinct-subsequences-ii) | Hard |
-| 941 | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array) | [Golang](solution/valid-mountain-array) | Easy |
-| 942 | [DI String Match](https://leetcode.com/problems/di-string-match) | [Golang](solution/di-string-match) | Easy |
-| 943 | [Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring) | [Golang](solution/find-the-shortest-superstring) | Hard |
-| 944 | [Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted) | [Golang](solution/delete-columns-to-make-sorted) | Easy |
-| 945 | [Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique) | [Golang](solution/minimum-increment-to-make-array-unique) | Medium |
-| 946 | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences) | [Golang](solution/validate-stack-sequences) | Medium |
-| 947 | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column) | [Golang](solution/most-stones-removed-with-same-row-or-column) | Medium |
-| 948 | [Bag of Tokens](https://leetcode.com/problems/bag-of-tokens) | [Golang](solution/bag-of-tokens) | Medium |
-| 949 | [Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits) | [Golang](solution/largest-time-for-given-digits) | Easy |
-| 950 | [Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order) | [Golang](solution/reveal-cards-in-increasing-order) | Medium |
-| 951 | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees) | [Golang](solution/flip-equivalent-binary-trees) | Medium |
-| 952 | [Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor) | [Golang](solution/largest-component-size-by-common-factor) | Hard |
-| 953 | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary) | [Golang](solution/verifying-an-alien-dictionary) | Easy |
-| 954 | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs) | [Golang](solution/array-of-doubled-pairs) | Medium |
-| 955 | [Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii) | [Golang](solution/delete-columns-to-make-sorted-ii) | Medium |
-| 956 | [Tallest Billboard](https://leetcode.com/problems/tallest-billboard) | [Golang](solution/tallest-billboard) | Hard |
+| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/two-sum) | Easy |
+| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers) | Medium |
+| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-substring-without-repeating-characters) | Medium |
+| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [Golang](https://github.com/openset/leetcode/tree/master/solution/median-of-two-sorted-arrays) | Hard |
+| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-palindromic-substring) | Medium |
+| 6 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | [Golang](https://github.com/openset/leetcode/tree/master/solution/zigzag-conversion) | Medium |
+| 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-integer) | Easy |
+| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-(atoi)) | [Golang](https://github.com/openset/leetcode/tree/master/solution/string-to-integer-(atoi)) | Medium |
+| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindrome-number) | Easy |
+| 10 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | [Golang](https://github.com/openset/leetcode/tree/master/solution/regular-expression-matching) | Hard |
+| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [Golang](https://github.com/openset/leetcode/tree/master/solution/container-with-most-water) | Medium |
+| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [Golang](https://github.com/openset/leetcode/tree/master/solution/integer-to-roman) | Medium |
+| 13 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | [Golang](https://github.com/openset/leetcode/tree/master/solution/roman-to-integer) | Easy |
+| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-common-prefix) | Easy |
+| 15 | [3Sum](https://leetcode.com/problems/3sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/3sum) | Medium |
+| 16 | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | [Golang](https://github.com/openset/leetcode/tree/master/solution/3sum-closest) | Medium |
+| 17 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/letter-combinations-of-a-phone-number) | Medium |
+| 18 | [4Sum](https://leetcode.com/problems/4sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/4sum) | Medium |
+| 19 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-nth-node-from-end-of-list) | Medium |
+| 20 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-parentheses) | Easy |
+| 21 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [Golang](https://github.com/openset/leetcode/tree/master/solution/merge-two-sorted-lists) | Easy |
+| 22 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/generate-parentheses) | Medium |
+| 23 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | [Golang](https://github.com/openset/leetcode/tree/master/solution/merge-k-sorted-lists) | Hard |
+| 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/swap-nodes-in-pairs) | Medium |
+| 25 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-nodes-in-k-group) | Hard |
+| 26 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-array) | Easy |
+| 27 | [Remove Element](https://leetcode.com/problems/remove-element) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-element) | Easy |
+| 28 | [Implement strStr()](https://leetcode.com/problems/implement-strstr()) | [Golang](https://github.com/openset/leetcode/tree/master/solution/implement-strstr()) | Easy |
+| 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/divide-two-integers) | Medium |
+| 30 | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/substring-with-concatenation-of-all-words) | Hard |
+| 31 | [Next Permutation](https://leetcode.com/problems/next-permutation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/next-permutation) | Medium |
+| 32 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-valid-parentheses) | Hard |
+| 33 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/search-in-rotated-sorted-array) | Medium |
+| 34 | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-first-and-last-position-of-element-in-sorted-array) | Medium |
+| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | [Golang](https://github.com/openset/leetcode/tree/master/solution/search-insert-position) | Easy |
+| 36 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-sudoku) | Medium |
+| 37 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sudoku-solver) | Hard |
+| 38 | [Count and Say](https://leetcode.com/problems/count-and-say) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-and-say) | Easy |
+| 39 | [Combination Sum](https://leetcode.com/problems/combination-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/combination-sum) | Medium |
+| 40 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/combination-sum-ii) | Medium |
+| 41 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | [Golang](https://github.com/openset/leetcode/tree/master/solution/first-missing-positive) | Hard |
+| 42 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | [Golang](https://github.com/openset/leetcode/tree/master/solution/trapping-rain-water) | Hard |
+| 43 | [Multiply Strings](https://leetcode.com/problems/multiply-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/multiply-strings) | Medium |
+| 44 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | [Golang](https://github.com/openset/leetcode/tree/master/solution/wildcard-matching) | Hard |
+| 45 | [Jump Game II](https://leetcode.com/problems/jump-game-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/jump-game-ii) | Hard |
+| 46 | [Permutations](https://leetcode.com/problems/permutations) | [Golang](https://github.com/openset/leetcode/tree/master/solution/permutations) | Medium |
+| 47 | [Permutations II](https://leetcode.com/problems/permutations-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/permutations-ii) | Medium |
+| 48 | [Rotate Image](https://leetcode.com/problems/rotate-image) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rotate-image) | Medium |
+| 49 | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | [Golang](https://github.com/openset/leetcode/tree/master/solution/group-anagrams) | Medium |
+| 50 | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [Golang](https://github.com/openset/leetcode/tree/master/solution/powx-n) | Medium |
+| 51 | [N-Queens](https://leetcode.com/problems/n-queens) | [Golang](https://github.com/openset/leetcode/tree/master/solution/n-queens) | Hard |
+| 52 | [N-Queens II](https://leetcode.com/problems/n-queens-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/n-queens-ii) | Hard |
+| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-subarray) | Easy |
+| 54 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix) | Medium |
+| 55 | [Jump Game](https://leetcode.com/problems/jump-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/jump-game) | Medium |
+| 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [Golang](https://github.com/openset/leetcode/tree/master/solution/merge-intervals) | Medium |
+| 57 | [Insert Interval](https://leetcode.com/problems/insert-interval) | [Golang](https://github.com/openset/leetcode/tree/master/solution/insert-interval) | Hard |
+| 58 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [Golang](https://github.com/openset/leetcode/tree/master/solution/length-of-last-word) | Easy |
+| 59 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix-ii) | Medium |
+| 60 | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/permutation-sequence) | Medium |
+| 61 | [Rotate List](https://leetcode.com/problems/rotate-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rotate-list) | Medium |
+| 62 | [Unique Paths](https://leetcode.com/problems/unique-paths) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-paths) | Medium |
+| 63 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-paths-ii) | Medium |
+| 64 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-path-sum) | Medium |
+| 65 | [Valid Number](https://leetcode.com/problems/valid-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-number) | Hard |
+| 66 | [Plus One](https://leetcode.com/problems/plus-one) | [Golang](https://github.com/openset/leetcode/tree/master/solution/plus-one) | Easy |
+| 67 | [Add Binary](https://leetcode.com/problems/add-binary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-binary) | Easy |
+| 68 | [Text Justification](https://leetcode.com/problems/text-justification) | [Golang](https://github.com/openset/leetcode/tree/master/solution/text-justification) | Hard |
+| 69 | [Sqrt(x)](https://leetcode.com/problems/sqrt(x)) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sqrt(x)) | Easy |
+| 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/climbing-stairs) | Easy |
+| 71 | [Simplify Path](https://leetcode.com/problems/simplify-path) | [Golang](https://github.com/openset/leetcode/tree/master/solution/simplify-path) | Medium |
+| 72 | [Edit Distance](https://leetcode.com/problems/edit-distance) | [Golang](https://github.com/openset/leetcode/tree/master/solution/edit-distance) | Hard |
+| 73 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/set-matrix-zeroes) | Medium |
+| 74 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/search-a-2d-matrix) | Medium |
+| 75 | [Sort Colors](https://leetcode.com/problems/sort-colors) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sort-colors) | Medium |
+| 76 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-window-substring) | Hard |
+| 77 | [Combinations](https://leetcode.com/problems/combinations) | [Golang](https://github.com/openset/leetcode/tree/master/solution/combinations) | Medium |
+| 78 | [Subsets](https://leetcode.com/problems/subsets) | [Golang](https://github.com/openset/leetcode/tree/master/solution/subsets) | Medium |
+| 79 | [Word Search](https://leetcode.com/problems/word-search) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-search) | Medium |
+| 80 | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-array-ii) | Medium |
+| 81 | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/search-in-rotated-sorted-array-ii) | Medium |
+| 82 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-list-ii) | Medium |
+| 83 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-list) | Easy |
+| 84 | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-rectangle-in-histogram) | Hard |
+| 85 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximal-rectangle) | Hard |
+| 86 | [Partition List](https://leetcode.com/problems/partition-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/partition-list) | Medium |
+| 87 | [Scramble String](https://leetcode.com/problems/scramble-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/scramble-string) | Hard |
+| 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/merge-sorted-array) | Easy |
+| 89 | [Gray Code](https://leetcode.com/problems/gray-code) | [Golang](https://github.com/openset/leetcode/tree/master/solution/gray-code) | Medium |
+| 90 | [Subsets II](https://leetcode.com/problems/subsets-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/subsets-ii) | Medium |
+| 91 | [Decode Ways](https://leetcode.com/problems/decode-ways) | [Golang](https://github.com/openset/leetcode/tree/master/solution/decode-ways) | Medium |
+| 92 | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-linked-list-ii) | Medium |
+| 93 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/restore-ip-addresses) | Medium |
+| 94 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-inorder-traversal) | Medium |
+| 95 | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-binary-search-trees-ii) | Medium |
+| 96 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-binary-search-trees) | Medium |
+| 97 | [Interleaving String](https://leetcode.com/problems/interleaving-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/interleaving-string) | Hard |
+| 98 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/validate-binary-search-tree) | Medium |
+| 99 | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/recover-binary-search-tree) | Hard |
+| 100 | [Same Tree](https://leetcode.com/problems/same-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/same-tree) | Easy |
+| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/symmetric-tree) | Easy |
+| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-level-order-traversal) | Medium |
+| 103 | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-zigzag-level-order-traversal) | Medium |
+| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-depth-of-binary-tree) | Easy |
+| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium |
+| 106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-inorder-and-postorder-traversal) | Medium |
+| 107 | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-level-order-traversal-ii) | Easy |
+| 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/convert-sorted-array-to-binary-search-tree) | Easy |
+| 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/convert-sorted-list-to-binary-search-tree) | Medium |
+| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/balanced-binary-tree) | Easy |
+| 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-depth-of-binary-tree) | Easy |
+| 112 | [Path Sum](https://leetcode.com/problems/path-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/path-sum) | Easy |
+| 113 | [Path Sum II](https://leetcode.com/problems/path-sum-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/path-sum-ii) | Medium |
+| 114 | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flatten-binary-tree-to-linked-list) | Medium |
+| 115 | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/distinct-subsequences) | Hard |
+| 116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | [Golang](https://github.com/openset/leetcode/tree/master/solution/populating-next-right-pointers-in-each-node) | Medium |
+| 117 | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/populating-next-right-pointers-in-each-node-ii) | Medium |
+| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascal's-triangle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/pascal's-triangle) | Easy |
+| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascal's-triangle-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/pascal's-triangle-ii) | Easy |
+| 120 | [Triangle](https://leetcode.com/problems/triangle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/triangle) | Medium |
+| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [Golang](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock) | Easy |
+| 122 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-ii) | Easy |
+| 123 | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iii) | Hard |
+| 124 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-maximum-path-sum) | Hard |
+| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-palindrome) | Easy |
+| 126 | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-ladder-ii) | Hard |
+| 127 | [Word Ladder](https://leetcode.com/problems/word-ladder) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-ladder) | Medium |
+| 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-consecutive-sequence) | Hard |
+| 129 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sum-root-to-leaf-numbers) | Medium |
+| 130 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions) | [Golang](https://github.com/openset/leetcode/tree/master/solution/surrounded-regions) | Medium |
+| 131 | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindrome-partitioning) | Medium |
+| 132 | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindrome-partitioning-ii) | Hard |
+| 133 | [Clone Graph](https://leetcode.com/problems/clone-graph) | [Golang](https://github.com/openset/leetcode/tree/master/solution/clone-graph) | Medium |
+| 134 | [Gas Station](https://leetcode.com/problems/gas-station) | [Golang](https://github.com/openset/leetcode/tree/master/solution/gas-station) | Medium |
+| 135 | [Candy](https://leetcode.com/problems/candy) | [Golang](https://github.com/openset/leetcode/tree/master/solution/candy) | Hard |
+| 136 | [Single Number](https://leetcode.com/problems/single-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/single-number) | Easy |
+| 137 | [Single Number II](https://leetcode.com/problems/single-number-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/single-number-ii) | Medium |
+| 138 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | [Golang](https://github.com/openset/leetcode/tree/master/solution/copy-list-with-random-pointer) | Medium |
+| 139 | [Word Break](https://leetcode.com/problems/word-break) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-break) | Medium |
+| 140 | [Word Break II](https://leetcode.com/problems/word-break-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-break-ii) | Hard |
+| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/linked-list-cycle) | Easy |
+| 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/linked-list-cycle-ii) | Medium |
+| 143 | [Reorder List](https://leetcode.com/problems/reorder-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reorder-list) | Medium |
+| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-preorder-traversal) | Medium |
+| 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-postorder-traversal) | Hard |
+| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lru-cache) | Hard |
+| 147 | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/insertion-sort-list) | Medium |
+| 148 | [Sort List](https://leetcode.com/problems/sort-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sort-list) | Medium |
+| 149 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-points-on-a-line) | Hard |
+| 150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/evaluate-reverse-polish-notation) | Medium |
+| 151 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string) | Medium |
+| 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-product-subarray) | Medium |
+| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array) | Medium |
+| 154 | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array-ii) | Hard |
+| 155 | [Min Stack](https://leetcode.com/problems/min-stack) | [Golang](https://github.com/openset/leetcode/tree/master/solution/min-stack) | Easy |
+| 156 | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-upside-down) | Medium |
+| 157 | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) | [Golang](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4) | Easy |
+| 158 | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii---call-multiple-times) | [Golang](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4-ii---call-multiple-times) | Hard |
+| 159 | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-two-distinct-characters) | Hard |
+| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Golang](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-linked-lists) | Easy |
+| 161 | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) | [Golang](https://github.com/openset/leetcode/tree/master/solution/one-edit-distance) | Medium |
+| 162 | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-peak-element) | Medium |
+| 163 | [Missing Ranges](https://leetcode.com/problems/missing-ranges) | [Golang](https://github.com/openset/leetcode/tree/master/solution/missing-ranges) | Medium |
+| 164 | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-gap) | Hard |
+| 165 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/compare-version-numbers) | Medium |
+| 166 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/fraction-to-recurring-decimal) | Medium |
+| 167 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii---input-array-is-sorted) | [Golang](https://github.com/openset/leetcode/tree/master/solution/two-sum-ii---input-array-is-sorted) | Easy |
+| 168 | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [Golang](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-title) | Easy |
+| 169 | [Majority Element](https://leetcode.com/problems/majority-element) | [Golang](https://github.com/openset/leetcode/tree/master/solution/majority-element) | Easy |
+| 170 | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii---data-structure-design) | [Golang](https://github.com/openset/leetcode/tree/master/solution/two-sum-iii---data-structure-design) | Easy |
+| 171 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-number) | Easy |
+| 172 | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/factorial-trailing-zeroes) | Easy |
+| 173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-search-tree-iterator) | Medium |
+| 174 | [Dungeon Game](https://leetcode.com/problems/dungeon-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/dungeon-game) | Hard |
+| 175 | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | [Golang](https://github.com/openset/leetcode/tree/master/solution/combine-two-tables) | Easy |
+| 176 | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/second-highest-salary) | Easy |
+| 177 | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/nth-highest-salary) | Medium |
+| 178 | [Rank Scores](https://leetcode.com/problems/rank-scores) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rank-scores) | Medium |
+| 179 | [Largest Number](https://leetcode.com/problems/largest-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-number) | Medium |
+| 180 | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/consecutive-numbers) | Medium |
+| 181 | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/employees-earning-more-than-their-managers) | Easy |
+| 182 | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails) | [Golang](https://github.com/openset/leetcode/tree/master/solution/duplicate-emails) | Easy |
+| 183 | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [Golang](https://github.com/openset/leetcode/tree/master/solution/customers-who-never-order) | Easy |
+| 184 | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/department-highest-salary) | Medium |
+| 185 | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [Golang](https://github.com/openset/leetcode/tree/master/solution/department-top-three-salaries) | Hard |
+| 186 | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-ii) | Medium |
+| 187 | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/repeated-dna-sequences) | Medium |
+| 188 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [Golang](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iv) | Hard |
+| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rotate-array) | Easy |
+| 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-bits) | Easy |
+| 191 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-1-bits) | Easy |
+| 192 | [Word Frequency](https://leetcode.com/problems/word-frequency) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-frequency) | Medium |
+| 193 | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-phone-numbers) | Easy |
+| 194 | [Transpose File](https://leetcode.com/problems/transpose-file) | [Golang](https://github.com/openset/leetcode/tree/master/solution/transpose-file) | Medium |
+| 195 | [Tenth Line](https://leetcode.com/problems/tenth-line) | [Golang](https://github.com/openset/leetcode/tree/master/solution/tenth-line) | Easy |
+| 196 | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | [Golang](https://github.com/openset/leetcode/tree/master/solution/delete-duplicate-emails) | Easy |
+| 197 | [Rising Temperature](https://leetcode.com/problems/rising-temperature) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rising-temperature) | Easy |
+| 198 | [House Robber](https://leetcode.com/problems/house-robber) | [Golang](https://github.com/openset/leetcode/tree/master/solution/house-robber) | Easy |
+| 199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-right-side-view) | Medium |
+| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-islands) | Medium |
+| 201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bitwise-and-of-numbers-range) | Medium |
+| 202 | [Happy Number](https://leetcode.com/problems/happy-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/happy-number) | Easy |
+| 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-linked-list-elements) | Easy |
+| 204 | [Count Primes](https://leetcode.com/problems/count-primes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-primes) | Easy |
+| 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/isomorphic-strings) | Easy |
+| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-linked-list) | Easy |
+| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule) | [Golang](https://github.com/openset/leetcode/tree/master/solution/course-schedule) | Medium |
+| 208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-(prefix-tree)) | [Golang](https://github.com/openset/leetcode/tree/master/solution/implement-trie-(prefix-tree)) | Medium |
+| 209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-size-subarray-sum) | Medium |
+| 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/course-schedule-ii) | Medium |
+| 211 | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word---data-structure-design) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-and-search-word---data-structure-design) | Medium |
+| 212 | [Word Search II](https://leetcode.com/problems/word-search-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-search-ii) | Hard |
+| 213 | [House Robber II](https://leetcode.com/problems/house-robber-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/house-robber-ii) | Medium |
+| 214 | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-palindrome) | Hard |
+| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/kth-largest-element-in-an-array) | Medium |
+| 216 | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/combination-sum-iii) | Medium |
+| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [Golang](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate) | Easy |
+| 218 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | [Golang](https://github.com/openset/leetcode/tree/master/solution/the-skyline-problem) | Hard |
+| 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate-ii) | Easy |
+| 220 | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate-iii) | Medium |
+| 221 | [Maximal Square](https://leetcode.com/problems/maximal-square) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximal-square) | Medium |
+| 222 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-complete-tree-nodes) | Medium |
+| 223 | [Rectangle Area](https://leetcode.com/problems/rectangle-area) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rectangle-area) | Medium |
+| 224 | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/basic-calculator) | Hard |
+| 225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues) | [Golang](https://github.com/openset/leetcode/tree/master/solution/implement-stack-using-queues) | Easy |
+| 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/invert-binary-tree) | Easy |
+| 227 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-ii) | Medium |
+| 228 | [Summary Ranges](https://leetcode.com/problems/summary-ranges) | [Golang](https://github.com/openset/leetcode/tree/master/solution/summary-ranges) | Medium |
+| 229 | [Majority Element II](https://leetcode.com/problems/majority-element-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/majority-element-ii) | Medium |
+| 230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-element-in-a-bst) | Medium |
+| 231 | [Power of Two](https://leetcode.com/problems/power-of-two) | [Golang](https://github.com/openset/leetcode/tree/master/solution/power-of-two) | Easy |
+| 232 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | [Golang](https://github.com/openset/leetcode/tree/master/solution/implement-queue-using-stacks) | Easy |
+| 233 | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-digit-one) | Hard |
+| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindrome-linked-list) | Easy |
+| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lowest-common-ancestor-of-a-binary-search-tree) | Easy |
+| 236 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lowest-common-ancestor-of-a-binary-tree) | Medium |
+| 237 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/delete-node-in-a-linked-list) | Easy |
+| 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | [Golang](https://github.com/openset/leetcode/tree/master/solution/product-of-array-except-self) | Medium |
+| 239 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sliding-window-maximum) | Hard |
+| 240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/search-a-2d-matrix-ii) | Medium |
+| 241 | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/different-ways-to-add-parentheses) | Medium |
+| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-anagram) | Easy |
+| 243 | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance) | Easy |
+| 244 | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-ii) | Medium |
+| 245 | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-iii) | Medium |
+| 246 | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number) | Easy |
+| 247 | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-ii) | Medium |
+| 248 | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-iii) | Hard |
+| 249 | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/group-shifted-strings) | Medium |
+| 250 | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-univalue-subtrees) | Medium |
+| 251 | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flatten-2d-vector) | Medium |
+| 252 | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) | [Golang](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms) | Easy |
+| 253 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms-ii) | Medium |
+| 254 | [Factor Combinations](https://leetcode.com/problems/factor-combinations) | [Golang](https://github.com/openset/leetcode/tree/master/solution/factor-combinations) | Medium |
+| 255 | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-sequence-in-binary-search-tree) | Medium |
+| 256 | [Paint House](https://leetcode.com/problems/paint-house) | [Golang](https://github.com/openset/leetcode/tree/master/solution/paint-house) | Easy |
+| 257 | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-paths) | Easy |
+| 258 | [Add Digits](https://leetcode.com/problems/add-digits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-digits) | Easy |
+| 259 | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) | [Golang](https://github.com/openset/leetcode/tree/master/solution/3sum-smaller) | Medium |
+| 260 | [Single Number III](https://leetcode.com/problems/single-number-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/single-number-iii) | Medium |
+| 261 | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/graph-valid-tree) | Medium |
+| 262 | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [Golang](https://github.com/openset/leetcode/tree/master/solution/trips-and-users) | Hard |
+| 263 | [Ugly Number](https://leetcode.com/problems/ugly-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ugly-number) | Easy |
+| 264 | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ugly-number-ii) | Medium |
+| 265 | [Paint House II](https://leetcode.com/problems/paint-house-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/paint-house-ii) | Hard |
+| 266 | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation) | Easy |
+| 267 | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation-ii) | Medium |
+| 268 | [Missing Number](https://leetcode.com/problems/missing-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/missing-number) | Easy |
+| 269 | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/alien-dictionary) | Hard |
+| 270 | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) | [Golang](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value) | Easy |
+| 271 | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-strings) | Medium |
+| 272 | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value-ii) | Hard |
+| 273 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/integer-to-english-words) | Hard |
+| 274 | [H-Index](https://leetcode.com/problems/h-index) | [Golang](https://github.com/openset/leetcode/tree/master/solution/h-index) | Medium |
+| 275 | [H-Index II](https://leetcode.com/problems/h-index-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/h-index-ii) | Medium |
+| 276 | [Paint Fence](https://leetcode.com/problems/paint-fence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/paint-fence) | Easy |
+| 277 | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-the-celebrity) | Medium |
+| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version) | [Golang](https://github.com/openset/leetcode/tree/master/solution/first-bad-version) | Easy |
+| 279 | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | [Golang](https://github.com/openset/leetcode/tree/master/solution/perfect-squares) | Medium |
+| 280 | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) | [Golang](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort) | Medium |
+| 281 | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/zigzag-iterator) | Medium |
+| 282 | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | [Golang](https://github.com/openset/leetcode/tree/master/solution/expression-add-operators) | Hard |
+| 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/move-zeroes) | Easy |
+| 284 | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/peeking-iterator) | Medium |
+| 285 | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/inorder-successor-in-bst) | Medium |
+| 286 | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) | [Golang](https://github.com/openset/leetcode/tree/master/solution/walls-and-gates) | Medium |
+| 287 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-the-duplicate-number) | Medium |
+| 288 | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-word-abbreviation) | Medium |
+| 289 | [Game of Life](https://leetcode.com/problems/game-of-life) | [Golang](https://github.com/openset/leetcode/tree/master/solution/game-of-life) | Medium |
+| 290 | [Word Pattern](https://leetcode.com/problems/word-pattern) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-pattern) | Easy |
+| 291 | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-pattern-ii) | Hard |
+| 292 | [Nim Game](https://leetcode.com/problems/nim-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/nim-game) | Easy |
+| 293 | [Flip Game](https://leetcode.com/problems/flip-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flip-game) | Easy |
+| 294 | [Flip Game II](https://leetcode.com/problems/flip-game-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flip-game-ii) | Medium |
+| 295 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-median-from-data-stream) | Hard |
+| 296 | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) | [Golang](https://github.com/openset/leetcode/tree/master/solution/best-meeting-point) | Hard |
+| 297 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-binary-tree) | Hard |
+| 298 | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence) | Medium |
+| 299 | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bulls-and-cows) | Medium |
+| 300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-increasing-subsequence) | Medium |
+| 301 | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-invalid-parentheses) | Hard |
+| 302 | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) | [Golang](https://github.com/openset/leetcode/tree/master/solution/smallest-rectangle-enclosing-black-pixels) | Hard |
+| 303 | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query---immutable) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-sum-query---immutable) | Easy |
+| 304 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d---immutable) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d---immutable) | Medium |
+| 305 | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-islands-ii) | Hard |
+| 306 | [Additive Number](https://leetcode.com/problems/additive-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/additive-number) | Medium |
+| 307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query---mutable) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-sum-query---mutable) | Medium |
+| 308 | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d---mutable) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d---mutable) | Hard |
+| 309 | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [Golang](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
+| 310 | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-height-trees) | Medium |
+| 311 | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sparse-matrix-multiplication) | Medium |
+| 312 | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | [Golang](https://github.com/openset/leetcode/tree/master/solution/burst-balloons) | Hard |
+| 313 | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/super-ugly-number) | Medium |
+| 314 | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-vertical-order-traversal) | Medium |
+| 315 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-of-smaller-numbers-after-self) | Hard |
+| 316 | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-duplicate-letters) | Hard |
+| 317 | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-from-all-buildings) | Hard |
+| 318 | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-word-lengths) | Medium |
+| 319 | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bulb-switcher) | Medium |
+| 320 | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/generalized-abbreviation) | Medium |
+| 321 | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/create-maximum-number) | Hard |
+| 322 | [Coin Change](https://leetcode.com/problems/coin-change) | [Golang](https://github.com/openset/leetcode/tree/master/solution/coin-change) | Medium |
+| 323 | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-connected-components-in-an-undirected-graph) | Medium |
+| 324 | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort-ii) | Medium |
+| 325 | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-size-subarray-sum-equals-k) | Medium |
+| 326 | [Power of Three](https://leetcode.com/problems/power-of-three) | [Golang](https://github.com/openset/leetcode/tree/master/solution/power-of-three) | Easy |
+| 327 | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-of-range-sum) | Hard |
+| 328 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/odd-even-linked-list) | Medium |
+| 329 | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-increasing-path-in-a-matrix) | Hard |
+| 330 | [Patching Array](https://leetcode.com/problems/patching-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/patching-array) | Hard |
+| 331 | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-serialization-of-a-binary-tree) | Medium |
+| 332 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reconstruct-itinerary) | Medium |
+| 333 | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-bst-subtree) | Medium |
+| 334 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/increasing-triplet-subsequence) | Medium |
+| 335 | [Self Crossing](https://leetcode.com/problems/self-crossing) | [Golang](https://github.com/openset/leetcode/tree/master/solution/self-crossing) | Hard |
+| 336 | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindrome-pairs) | Hard |
+| 337 | [House Robber III](https://leetcode.com/problems/house-robber-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/house-robber-iii) | Medium |
+| 338 | [Counting Bits](https://leetcode.com/problems/counting-bits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/counting-bits) | Medium |
+| 339 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum) | Easy |
+| 340 | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-k-distinct-characters) | Hard |
+| 341 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flatten-nested-list-iterator) | Medium |
+| 342 | [Power of Four](https://leetcode.com/problems/power-of-four) | [Golang](https://github.com/openset/leetcode/tree/master/solution/power-of-four) | Easy |
+| 343 | [Integer Break](https://leetcode.com/problems/integer-break) | [Golang](https://github.com/openset/leetcode/tree/master/solution/integer-break) | Medium |
+| 344 | [Reverse String](https://leetcode.com/problems/reverse-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-string) | Easy |
+| 345 | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-vowels-of-a-string) | Easy |
+| 346 | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) | [Golang](https://github.com/openset/leetcode/tree/master/solution/moving-average-from-data-stream) | Easy |
+| 347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [Golang](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-elements) | Medium |
+| 348 | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-tic-tac-toe) | Medium |
+| 349 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | [Golang](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays) | Easy |
+| 350 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays-ii) | Easy |
+| 351 | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) | [Golang](https://github.com/openset/leetcode/tree/master/solution/android-unlock-patterns) | Medium |
+| 352 | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals) | [Golang](https://github.com/openset/leetcode/tree/master/solution/data-stream-as-disjoint-intervals) | Hard |
+| 353 | [Design Snake Game](https://leetcode.com/problems/design-snake-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-snake-game) | Medium |
+| 354 | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/russian-doll-envelopes) | Hard |
+| 355 | [Design Twitter](https://leetcode.com/problems/design-twitter) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-twitter) | Medium |
+| 356 | [Line Reflection](https://leetcode.com/problems/line-reflection) | [Golang](https://github.com/openset/leetcode/tree/master/solution/line-reflection) | Medium |
+| 357 | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-numbers-with-unique-digits) | Medium |
+| 358 | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rearrange-string-k-distance-apart) | Hard |
+| 359 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) | [Golang](https://github.com/openset/leetcode/tree/master/solution/logger-rate-limiter) | Easy |
+| 360 | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sort-transformed-array) | Medium |
+| 361 | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bomb-enemy) | Medium |
+| 362 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-hit-counter) | Medium |
+| 363 | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-sum-of-rectangle-no-larger-than-k) | Hard |
+| 364 | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum-ii) | Medium |
+| 365 | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem) | [Golang](https://github.com/openset/leetcode/tree/master/solution/water-and-jug-problem) | Medium |
+| 366 | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-leaves-of-binary-tree) | Medium |
+| 367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-perfect-square) | Easy |
+| 368 | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-divisible-subset) | Medium |
+| 369 | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/plus-one-linked-list) | Medium |
+| 370 | [Range Addition](https://leetcode.com/problems/range-addition) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-addition) | Medium |
+| 371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sum-of-two-integers) | Easy |
+| 372 | [Super Pow](https://leetcode.com/problems/super-pow) | [Golang](https://github.com/openset/leetcode/tree/master/solution/super-pow) | Medium |
+| 373 | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-k-pairs-with-smallest-sums) | Medium |
+| 374 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | [Golang](https://github.com/openset/leetcode/tree/master/solution/guess-number-higher-or-lower) | Easy |
+| 375 | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/guess-number-higher-or-lower-ii) | Medium |
+| 376 | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/wiggle-subsequence) | Medium |
+| 377 | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [Golang](https://github.com/openset/leetcode/tree/master/solution/combination-sum-iv) | Medium |
+| 378 | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-element-in-a-sorted-matrix) | Medium |
+| 379 | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-phone-directory) | Medium |
+| 380 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o(1)) | [Golang](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o(1)) | Medium |
+| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o(1)---duplicates-allowed) | [Golang](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o(1)---duplicates-allowed) | Hard |
+| 382 | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [Golang](https://github.com/openset/leetcode/tree/master/solution/linked-list-random-node) | Medium |
+| 383 | [Ransom Note](https://leetcode.com/problems/ransom-note) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ransom-note) | Easy |
+| 384 | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shuffle-an-array) | Medium |
+| 385 | [Mini Parser](https://leetcode.com/problems/mini-parser) | [Golang](https://github.com/openset/leetcode/tree/master/solution/mini-parser) | Medium |
+| 386 | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lexicographical-numbers) | Medium |
+| 387 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/first-unique-character-in-a-string) | Easy |
+| 388 | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-absolute-file-path) | Medium |
+| 389 | [Find the Difference](https://leetcode.com/problems/find-the-difference) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-the-difference) | Easy |
+| 390 | [Elimination Game](https://leetcode.com/problems/elimination-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/elimination-game) | Medium |
+| 391 | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/perfect-rectangle) | Hard |
+| 392 | [Is Subsequence](https://leetcode.com/problems/is-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/is-subsequence) | Medium |
+| 393 | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/utf-8-validation) | Medium |
+| 394 | [Decode String](https://leetcode.com/problems/decode-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/decode-string) | Medium |
+| 395 | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-least-k-repeating-characters) | Medium |
+| 396 | [Rotate Function](https://leetcode.com/problems/rotate-function) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rotate-function) | Medium |
+| 397 | [Integer Replacement](https://leetcode.com/problems/integer-replacement) | [Golang](https://github.com/openset/leetcode/tree/master/solution/integer-replacement) | Medium |
+| 398 | [Random Pick Index](https://leetcode.com/problems/random-pick-index) | [Golang](https://github.com/openset/leetcode/tree/master/solution/random-pick-index) | Medium |
+| 399 | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | [Golang](https://github.com/openset/leetcode/tree/master/solution/evaluate-division) | Medium |
+| 400 | [Nth Digit](https://leetcode.com/problems/nth-digit) | [Golang](https://github.com/openset/leetcode/tree/master/solution/nth-digit) | Easy |
+| 401 | [Binary Watch](https://leetcode.com/problems/binary-watch) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-watch) | Easy |
+| 402 | [Remove K Digits](https://leetcode.com/problems/remove-k-digits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-k-digits) | Medium |
+| 403 | [Frog Jump](https://leetcode.com/problems/frog-jump) | [Golang](https://github.com/openset/leetcode/tree/master/solution/frog-jump) | Hard |
+| 404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sum-of-left-leaves) | Easy |
+| 405 | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/convert-a-number-to-hexadecimal) | Easy |
+| 406 | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | [Golang](https://github.com/openset/leetcode/tree/master/solution/queue-reconstruction-by-height) | Medium |
+| 407 | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/trapping-rain-water-ii) | Hard |
+| 408 | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-word-abbreviation) | Easy |
+| 409 | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-palindrome) | Easy |
+| 410 | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-array-largest-sum) | Hard |
+| 411 | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-unique-word-abbreviation) | Hard |
+| 412 | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [Golang](https://github.com/openset/leetcode/tree/master/solution/fizz-buzz) | Easy |
+| 413 | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | [Golang](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices) | Medium |
+| 414 | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/third-maximum-number) | Easy |
+| 415 | [Add Strings](https://leetcode.com/problems/add-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-strings) | Easy |
+| 416 | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/partition-equal-subset-sum) | Medium |
+| 417 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [Golang](https://github.com/openset/leetcode/tree/master/solution/pacific-atlantic-water-flow) | Medium |
+| 418 | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sentence-screen-fitting) | Medium |
+| 419 | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | [Golang](https://github.com/openset/leetcode/tree/master/solution/battleships-in-a-board) | Medium |
+| 420 | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker) | [Golang](https://github.com/openset/leetcode/tree/master/solution/strong-password-checker) | Hard |
+| 421 | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-xor-of-two-numbers-in-an-array) | Medium |
+| 422 | [Valid Word Square](https://leetcode.com/problems/valid-word-square) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-word-square) | Easy |
+| 423 | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reconstruct-original-digits-from-english) | Medium |
+| 424 | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-repeating-character-replacement) | Medium |
+| 425 | [Word Squares](https://leetcode.com/problems/word-squares) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-squares) | Hard |
+| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
+| 427 | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/construct-quad-tree) | Easy |
+| 428 | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-n-ary-tree) | Hard |
+| 429 | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-level-order-traversal) | Easy |
+| 430 | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flatten-a-multilevel-doubly-linked-list) | Medium |
+| 431 | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/encode-n-ary-tree-to-binary-tree) | Hard |
+| 432 | [All O`one Data Structure](https://leetcode.com/problems/all-o`one-data-structure) | [Golang](https://github.com/openset/leetcode/tree/master/solution/all-o`one-data-structure) | Hard |
+| 433 | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-genetic-mutation) | Medium |
+| 434 | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-segments-in-a-string) | Easy |
+| 435 | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | [Golang](https://github.com/openset/leetcode/tree/master/solution/non-overlapping-intervals) | Medium |
+| 436 | [Find Right Interval](https://leetcode.com/problems/find-right-interval) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-right-interval) | Medium |
+| 437 | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/path-sum-iii) | Easy |
+| 438 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-all-anagrams-in-a-string) | Easy |
+| 439 | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ternary-expression-parser) | Medium |
+| 440 | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order) | [Golang](https://github.com/openset/leetcode/tree/master/solution/k-th-smallest-in-lexicographical-order) | Hard |
+| 441 | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | [Golang](https://github.com/openset/leetcode/tree/master/solution/arranging-coins) | Easy |
+| 442 | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-all-duplicates-in-an-array) | Medium |
+| 443 | [String Compression](https://leetcode.com/problems/string-compression) | [Golang](https://github.com/openset/leetcode/tree/master/solution/string-compression) | Easy |
+| 444 | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sequence-reconstruction) | Medium |
+| 445 | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers-ii) | Medium |
+| 446 | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii---subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices-ii---subsequence) | Hard |
+| 447 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-boomerangs) | Easy |
+| 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-all-numbers-disappeared-in-an-array) | Easy |
+| 449 | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-bst) | Medium |
+| 450 | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/delete-node-in-a-bst) | Medium |
+| 451 | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sort-characters-by-frequency) | Medium |
+| 452 | [Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-number-of-arrows-to-burst-balloons) | Medium |
+| 453 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-moves-to-equal-array-elements) | Easy |
+| 454 | [4Sum II](https://leetcode.com/problems/4sum-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/4sum-ii) | Medium |
+| 455 | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | [Golang](https://github.com/openset/leetcode/tree/master/solution/assign-cookies) | Easy |
+| 456 | [132 Pattern](https://leetcode.com/problems/132-pattern) | [Golang](https://github.com/openset/leetcode/tree/master/solution/132-pattern) | Medium |
+| 457 | [Circular Array Loop](https://leetcode.com/problems/circular-array-loop) | [Golang](https://github.com/openset/leetcode/tree/master/solution/circular-array-loop) | Medium |
+| 458 | [Poor Pigs](https://leetcode.com/problems/poor-pigs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/poor-pigs) | Easy |
+| 459 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | [Golang](https://github.com/openset/leetcode/tree/master/solution/repeated-substring-pattern) | Easy |
+| 460 | [LFU Cache](https://leetcode.com/problems/lfu-cache) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lfu-cache) | Hard |
+| 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance) | [Golang](https://github.com/openset/leetcode/tree/master/solution/hamming-distance) | Easy |
+| 462 | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-moves-to-equal-array-elements-ii) | Medium |
+| 463 | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | [Golang](https://github.com/openset/leetcode/tree/master/solution/island-perimeter) | Easy |
+| 464 | [Can I Win](https://leetcode.com/problems/can-i-win) | [Golang](https://github.com/openset/leetcode/tree/master/solution/can-i-win) | Medium |
+| 465 | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) | [Golang](https://github.com/openset/leetcode/tree/master/solution/optimal-account-balancing) | Hard |
+| 466 | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-the-repetitions) | Hard |
+| 467 | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-substrings-in-wraparound-string) | Medium |
+| 468 | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [Golang](https://github.com/openset/leetcode/tree/master/solution/validate-ip-address) | Medium |
+| 469 | [Convex Polygon](https://leetcode.com/problems/convex-polygon) | [Golang](https://github.com/openset/leetcode/tree/master/solution/convex-polygon) | Medium |
+| 470 | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10()-using-rand7()) | [Golang](https://github.com/openset/leetcode/tree/master/solution/implement-rand10()-using-rand7()) | Medium |
+| 471 | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) | [Golang](https://github.com/openset/leetcode/tree/master/solution/encode-string-with-shortest-length) | Hard |
+| 472 | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/concatenated-words) | Hard |
+| 473 | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [Golang](https://github.com/openset/leetcode/tree/master/solution/matchsticks-to-square) | Medium |
+| 474 | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ones-and-zeroes) | Medium |
+| 475 | [Heaters](https://leetcode.com/problems/heaters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/heaters) | Easy |
+| 476 | [Number Complement](https://leetcode.com/problems/number-complement) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-complement) | Easy |
+| 477 | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance) | [Golang](https://github.com/openset/leetcode/tree/master/solution/total-hamming-distance) | Medium |
+| 478 | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/generate-random-point-in-a-circle) | Medium |
+| 479 | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-palindrome-product) | Easy |
+| 480 | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sliding-window-median) | Hard |
+| 481 | [Magical String](https://leetcode.com/problems/magical-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/magical-string) | Medium |
+| 482 | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [Golang](https://github.com/openset/leetcode/tree/master/solution/license-key-formatting) | Easy |
+| 483 | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | [Golang](https://github.com/openset/leetcode/tree/master/solution/smallest-good-base) | Hard |
+| 484 | [Find Permutation](https://leetcode.com/problems/find-permutation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-permutation) | Medium |
+| 485 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones) | Easy |
+| 486 | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | [Golang](https://github.com/openset/leetcode/tree/master/solution/predict-the-winner) | Medium |
+| 487 | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones-ii) | Medium |
+| 488 | [Zuma Game](https://leetcode.com/problems/zuma-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/zuma-game) | Hard |
+| 489 | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) | [Golang](https://github.com/openset/leetcode/tree/master/solution/robot-room-cleaner) | Hard |
+| 490 | [The Maze](https://leetcode.com/problems/the-maze) | [Golang](https://github.com/openset/leetcode/tree/master/solution/the-maze) | Medium |
+| 491 | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/increasing-subsequences) | Medium |
+| 492 | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/construct-the-rectangle) | Easy |
+| 493 | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-pairs) | Hard |
+| 494 | [Target Sum](https://leetcode.com/problems/target-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/target-sum) | Medium |
+| 495 | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking) | [Golang](https://github.com/openset/leetcode/tree/master/solution/teemo-attacking) | Medium |
+| 496 | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-i) | Easy |
+| 497 | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles) | [Golang](https://github.com/openset/leetcode/tree/master/solution/random-point-in-non-overlapping-rectangles) | Medium |
+| 498 | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | [Golang](https://github.com/openset/leetcode/tree/master/solution/diagonal-traverse) | Medium |
+| 499 | [The Maze III](https://leetcode.com/problems/the-maze-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/the-maze-iii) | Hard |
+| 500 | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | [Golang](https://github.com/openset/leetcode/tree/master/solution/keyboard-row) | Easy |
+| 501 | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-mode-in-binary-search-tree) | Easy |
+| 502 | [IPO](https://leetcode.com/problems/ipo) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ipo) | Hard |
+| 503 | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-ii) | Medium |
+| 504 | [Base 7](https://leetcode.com/problems/base-7) | [Golang](https://github.com/openset/leetcode/tree/master/solution/base-7) | Easy |
+| 505 | [The Maze II](https://leetcode.com/problems/the-maze-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/the-maze-ii) | Medium |
+| 506 | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | [Golang](https://github.com/openset/leetcode/tree/master/solution/relative-ranks) | Easy |
+| 507 | [Perfect Number](https://leetcode.com/problems/perfect-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/perfect-number) | Easy |
+| 508 | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/most-frequent-subtree-sum) | Medium |
+| 513 | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-bottom-left-tree-value) | Medium |
+| 514 | [Freedom Trail](https://leetcode.com/problems/freedom-trail) | [Golang](https://github.com/openset/leetcode/tree/master/solution/freedom-trail) | Hard |
+| 515 | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-largest-value-in-each-tree-row) | Medium |
+| 516 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-palindromic-subsequence) | Medium |
+| 517 | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines) | [Golang](https://github.com/openset/leetcode/tree/master/solution/super-washing-machines) | Hard |
+| 518 | [Coin Change 2](https://leetcode.com/problems/coin-change-2) | [Golang](https://github.com/openset/leetcode/tree/master/solution/coin-change-2) | Medium |
+| 519 | [Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/random-flip-matrix) | Medium |
+| 520 | [Detect Capital](https://leetcode.com/problems/detect-capital) | [Golang](https://github.com/openset/leetcode/tree/master/solution/detect-capital) | Easy |
+| 521 | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-uncommon-subsequence-i) | Easy |
+| 522 | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-uncommon-subsequence-ii) | Medium |
+| 523 | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/continuous-subarray-sum) | Medium |
+| 524 | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary-through-deleting) | Medium |
+| 525 | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/contiguous-array) | Medium |
+| 526 | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | [Golang](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement) | Medium |
+| 527 | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-abbreviation) | Hard |
+| 528 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | [Golang](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-weight) | Medium |
+| 529 | [Minesweeper](https://leetcode.com/problems/minesweeper) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minesweeper) | Medium |
+| 530 | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-absolute-difference-in-bst) | Easy |
+| 531 | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-i) | Medium |
+| 532 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/k-diff-pairs-in-an-array) | Easy |
+| 533 | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-ii) | Medium |
+| 535 | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | [Golang](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-tinyurl) | Medium |
+| 536 | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-string) | Medium |
+| 537 | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | [Golang](https://github.com/openset/leetcode/tree/master/solution/complex-number-multiplication) | Medium |
+| 538 | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/convert-bst-to-greater-tree) | Easy |
+| 539 | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-time-difference) | Medium |
+| 540 | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/single-element-in-a-sorted-array) | Medium |
+| 541 | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-string-ii) | Easy |
+| 542 | [01 Matrix](https://leetcode.com/problems/01-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/01-matrix) | Medium |
+| 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/diameter-of-binary-tree) | Easy |
+| 544 | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) | [Golang](https://github.com/openset/leetcode/tree/master/solution/output-contest-matches) | Medium |
+| 545 | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/boundary-of-binary-tree) | Medium |
+| 546 | [Remove Boxes](https://leetcode.com/problems/remove-boxes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-boxes) | Hard |
+| 547 | [Friend Circles](https://leetcode.com/problems/friend-circles) | [Golang](https://github.com/openset/leetcode/tree/master/solution/friend-circles) | Medium |
+| 548 | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-array-with-equal-sum) | Medium |
+| 549 | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence-ii) | Medium |
+| 551 | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-i) | Easy |
+| 552 | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-ii) | Hard |
+| 553 | [Optimal Division](https://leetcode.com/problems/optimal-division) | [Golang](https://github.com/openset/leetcode/tree/master/solution/optimal-division) | Medium |
+| 554 | [Brick Wall](https://leetcode.com/problems/brick-wall) | [Golang](https://github.com/openset/leetcode/tree/master/solution/brick-wall) | Medium |
+| 555 | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-concatenated-strings) | Medium |
+| 556 | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-iii) | Medium |
+| 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-iii) | Easy |
+| 558 | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection) | [Golang](https://github.com/openset/leetcode/tree/master/solution/quad-tree-intersection) | Easy |
+| 559 | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-depth-of-n-ary-tree) | Easy |
+| 560 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | [Golang](https://github.com/openset/leetcode/tree/master/solution/subarray-sum-equals-k) | Medium |
+| 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/array-partition-i) | Easy |
+| 562 | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-line-of-consecutive-one-in-matrix) | Medium |
+| 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-tilt) | Easy |
+| 564 | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-the-closest-palindrome) | Hard |
+| 565 | [Array Nesting](https://leetcode.com/problems/array-nesting) | [Golang](https://github.com/openset/leetcode/tree/master/solution/array-nesting) | Medium |
+| 566 | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reshape-the-matrix) | Easy |
+| 567 | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/permutation-in-string) | Medium |
+| 568 | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-vacation-days) | Hard |
+| 569 | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/median-employee-salary) | Hard |
+| 570 | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) | [Golang](https://github.com/openset/leetcode/tree/master/solution/managers-with-at-least-5-direct-reports) | Medium |
+| 571 | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-median-given-frequency-of-numbers) | Hard |
+| 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/subtree-of-another-tree) | Easy |
+| 573 | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/squirrel-simulation) | Medium |
+| 574 | [Winning Candidate](https://leetcode.com/problems/winning-candidate) | [Golang](https://github.com/openset/leetcode/tree/master/solution/winning-candidate) | Medium |
+| 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | [Golang](https://github.com/openset/leetcode/tree/master/solution/distribute-candies) | Easy |
+| 576 | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [Golang](https://github.com/openset/leetcode/tree/master/solution/out-of-boundary-paths) | Medium |
+| 577 | [Employee Bonus](https://leetcode.com/problems/employee-bonus) | [Golang](https://github.com/openset/leetcode/tree/master/solution/employee-bonus) | Easy |
+| 578 | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) | [Golang](https://github.com/openset/leetcode/tree/master/solution/get-highest-answer-rate-question) | Medium |
+| 579 | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-cumulative-salary-of-an-employee) | Hard |
+| 580 | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-student-number-in-departments) | Medium |
+| 581 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-unsorted-continuous-subarray) | Easy |
+| 582 | [Kill Process](https://leetcode.com/problems/kill-process) | [Golang](https://github.com/openset/leetcode/tree/master/solution/kill-process) | Medium |
+| 583 | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/delete-operation-for-two-strings) | Medium |
+| 584 | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-customer-referee) | Easy |
+| 585 | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) | [Golang](https://github.com/openset/leetcode/tree/master/solution/investments-in-2016) | Medium |
+| 586 | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) | [Golang](https://github.com/openset/leetcode/tree/master/solution/customer-placing-the-largest-number-of-orders) | Easy |
+| 587 | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/erect-the-fence) | Hard |
+| 588 | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-in-memory-file-system) | Hard |
+| 589 | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-preorder-traversal) | Easy |
+| 590 | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-postorder-traversal) | Easy |
+| 591 | [Tag Validator](https://leetcode.com/problems/tag-validator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/tag-validator) | Hard |
+| 592 | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction) | [Golang](https://github.com/openset/leetcode/tree/master/solution/fraction-addition-and-subtraction) | Medium |
+| 593 | [Valid Square](https://leetcode.com/problems/valid-square) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-square) | Medium |
+| 594 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-harmonious-subsequence) | Easy |
+| 595 | [Big Countries](https://leetcode.com/problems/big-countries) | [Golang](https://github.com/openset/leetcode/tree/master/solution/big-countries) | Easy |
+| 596 | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [Golang](https://github.com/openset/leetcode/tree/master/solution/classes-more-than-5-students) | Easy |
+| 597 | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i:-overall-acceptance-rate) | [Golang](https://github.com/openset/leetcode/tree/master/solution/friend-requests-i:-overall-acceptance-rate) | Easy |
+| 598 | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-addition-ii) | Easy |
+| 599 | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-index-sum-of-two-lists) | Easy |
+| 600 | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Golang](https://github.com/openset/leetcode/tree/master/solution/non-negative-integers-without-consecutive-ones) | Hard |
+| 601 | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [Golang](https://github.com/openset/leetcode/tree/master/solution/human-traffic-of-stadium) | Hard |
+| 602 | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii:-who-has-the-most-friends) | [Golang](https://github.com/openset/leetcode/tree/master/solution/friend-requests-ii:-who-has-the-most-friends) | Medium |
+| 603 | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) | [Golang](https://github.com/openset/leetcode/tree/master/solution/consecutive-available-seats) | Easy |
+| 604 | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-compressed-string-iterator) | Easy |
+| 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/can-place-flowers) | Easy |
+| 606 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/construct-string-from-binary-tree) | Easy |
+| 607 | [Sales Person](https://leetcode.com/problems/sales-person) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sales-person) | Easy |
+| 608 | [Tree Node](https://leetcode.com/problems/tree-node) | [Golang](https://github.com/openset/leetcode/tree/master/solution/tree-node) | Medium |
+| 609 | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-file-in-system) | Medium |
+| 610 | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) | [Golang](https://github.com/openset/leetcode/tree/master/solution/triangle-judgement) | Easy |
+| 611 | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-triangle-number) | Medium |
+| 612 | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-plane) | Medium |
+| 613 | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-line) | Easy |
+| 614 | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) | [Golang](https://github.com/openset/leetcode/tree/master/solution/second-degree-follower) | Medium |
+| 615 | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary:-departments-vs-company) | [Golang](https://github.com/openset/leetcode/tree/master/solution/average-salary:-departments-vs-company) | Hard |
+| 616 | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-bold-tag-in-string) | Medium |
+| 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/merge-two-binary-trees) | Easy |
+| 618 | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) | [Golang](https://github.com/openset/leetcode/tree/master/solution/students-report-by-geography) | Hard |
+| 619 | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/biggest-single-number) | Easy |
+| 620 | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [Golang](https://github.com/openset/leetcode/tree/master/solution/not-boring-movies) | Easy |
+| 621 | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [Golang](https://github.com/openset/leetcode/tree/master/solution/task-scheduler) | Medium |
+| 622 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-circular-queue) | Medium |
+| 623 | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-one-row-to-tree) | Medium |
+| 624 | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-distance-in-arrays) | Easy |
+| 625 | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-factorization) | Medium |
+| 626 | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [Golang](https://github.com/openset/leetcode/tree/master/solution/exchange-seats) | Medium |
+| 627 | [Swap Salary](https://leetcode.com/problems/swap-salary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/swap-salary) | Easy |
+| 628 | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-three-numbers) | Easy |
+| 629 | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/k-inverse-pairs-array) | Hard |
+| 630 | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/course-schedule-iii) | Hard |
+| 631 | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-excel-sum-formula) | Hard |
+| 632 | [Smallest Range](https://leetcode.com/problems/smallest-range) | [Golang](https://github.com/openset/leetcode/tree/master/solution/smallest-range) | Hard |
+| 633 | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sum-of-square-numbers) | Easy |
+| 634 | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-the-derangement-of-an-array) | Medium |
+| 635 | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-log-storage-system) | Medium |
+| 636 | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | [Golang](https://github.com/openset/leetcode/tree/master/solution/exclusive-time-of-functions) | Medium |
+| 637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/average-of-levels-in-binary-tree) | Easy |
+| 638 | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shopping-offers) | Medium |
+| 639 | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/decode-ways-ii) | Hard |
+| 640 | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/solve-the-equation) | Medium |
+| 641 | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-circular-deque) | Medium |
+| 642 | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-search-autocomplete-system) | Hard |
+| 643 | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-i) | Easy |
+| 644 | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-ii) | Hard |
+| 645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [Golang](https://github.com/openset/leetcode/tree/master/solution/set-mismatch) | Easy |
+| 646 | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-pair-chain) | Medium |
+| 647 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindromic-substrings) | Medium |
+| 648 | [Replace Words](https://leetcode.com/problems/replace-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/replace-words) | Medium |
+| 649 | [Dota2 Senate](https://leetcode.com/problems/dota2-senate) | [Golang](https://github.com/openset/leetcode/tree/master/solution/dota2-senate) | Medium |
+| 650 | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [Golang](https://github.com/openset/leetcode/tree/master/solution/2-keys-keyboard) | Medium |
+| 651 | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) | [Golang](https://github.com/openset/leetcode/tree/master/solution/4-keys-keyboard) | Medium |
+| 652 | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-subtrees) | Medium |
+| 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv---input-is-a-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/two-sum-iv---input-is-a-bst) | Easy |
+| 654 | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-binary-tree) | Medium |
+| 655 | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/print-binary-tree) | Medium |
+| 656 | [Coin Path](https://leetcode.com/problems/coin-path) | [Golang](https://github.com/openset/leetcode/tree/master/solution/coin-path) | Hard |
+| 657 | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [Golang](https://github.com/openset/leetcode/tree/master/solution/robot-return-to-origin) | Easy |
+| 658 | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-k-closest-elements) | Medium |
+| 659 | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-array-into-consecutive-subsequences) | Medium |
+| 660 | [Remove 9](https://leetcode.com/problems/remove-9) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-9) | Hard |
+| 661 | [Image Smoother](https://leetcode.com/problems/image-smoother) | [Golang](https://github.com/openset/leetcode/tree/master/solution/image-smoother) | Easy |
+| 662 | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-width-of-binary-tree) | Medium |
+| 663 | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) | [Golang](https://github.com/openset/leetcode/tree/master/solution/equal-tree-partition) | Medium |
+| 664 | [Strange Printer](https://leetcode.com/problems/strange-printer) | [Golang](https://github.com/openset/leetcode/tree/master/solution/strange-printer) | Hard |
+| 665 | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/non-decreasing-array) | Easy |
+| 666 | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) | [Golang](https://github.com/openset/leetcode/tree/master/solution/path-sum-iv) | Medium |
+| 667 | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement-ii) | Medium |
+| 668 | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | [Golang](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-number-in-multiplication-table) | Hard |
+| 669 | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/trim-a-binary-search-tree) | Easy |
+| 670 | [Maximum Swap](https://leetcode.com/problems/maximum-swap) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-swap) | Medium |
+| 671 | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/second-minimum-node-in-a-binary-tree) | Easy |
+| 672 | [Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bulb-switcher-ii) | Medium |
+| 673 | [Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-longest-increasing-subsequence) | Medium |
+| 674 | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-continuous-increasing-subsequence) | Easy |
+| 675 | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event) | [Golang](https://github.com/openset/leetcode/tree/master/solution/cut-off-trees-for-golf-event) | Hard |
+| 676 | [Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/implement-magic-dictionary) | Medium |
+| 677 | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/map-sum-pairs) | Medium |
+| 678 | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-parenthesis-string) | Medium |
+| 679 | [24 Game](https://leetcode.com/problems/24-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/24-game) | Hard |
+| 680 | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-palindrome-ii) | Easy |
+| 681 | [Next Closest Time](https://leetcode.com/problems/next-closest-time) | [Golang](https://github.com/openset/leetcode/tree/master/solution/next-closest-time) | Medium |
+| 682 | [Baseball Game](https://leetcode.com/problems/baseball-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/baseball-game) | Easy |
+| 683 | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) | [Golang](https://github.com/openset/leetcode/tree/master/solution/k-empty-slots) | Hard |
+| 684 | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | [Golang](https://github.com/openset/leetcode/tree/master/solution/redundant-connection) | Medium |
+| 685 | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/redundant-connection-ii) | Hard |
+| 686 | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | [Golang](https://github.com/openset/leetcode/tree/master/solution/repeated-string-match) | Easy |
+| 687 | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-univalue-path) | Easy |
+| 688 | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard) | [Golang](https://github.com/openset/leetcode/tree/master/solution/knight-probability-in-chessboard) | Medium |
+| 689 | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-sum-of-3-non-overlapping-subarrays) | Hard |
+| 690 | [Employee Importance](https://leetcode.com/problems/employee-importance) | [Golang](https://github.com/openset/leetcode/tree/master/solution/employee-importance) | Easy |
+| 691 | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word) | [Golang](https://github.com/openset/leetcode/tree/master/solution/stickers-to-spell-word) | Hard |
+| 692 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-words) | Medium |
+| 693 | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-number-with-alternating-bits) | Easy |
+| 694 | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands) | Medium |
+| 695 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-area-of-island) | Medium |
+| 696 | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-binary-substrings) | Easy |
+| 697 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/degree-of-an-array) | Easy |
+| 698 | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) | [Golang](https://github.com/openset/leetcode/tree/master/solution/partition-to-k-equal-sum-subsets) | Medium |
+| 699 | [Falling Squares](https://leetcode.com/problems/falling-squares) | [Golang](https://github.com/openset/leetcode/tree/master/solution/falling-squares) | Hard |
+| 700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/search-in-a-binary-search-tree) | Easy |
+| 701 | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-binary-search-tree) | Medium |
+| 702 | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) | [Golang](https://github.com/openset/leetcode/tree/master/solution/search-in-a-sorted-array-of-unknown-size) | Medium |
+| 703 | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [Golang](https://github.com/openset/leetcode/tree/master/solution/kth-largest-element-in-a-stream) | Easy |
+| 704 | [Binary Search](https://leetcode.com/problems/binary-search) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-search) | Easy |
+| 705 | [Design HashSet](https://leetcode.com/problems/design-hashset) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-hashset) | Easy |
+| 706 | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-hashmap) | Easy |
+| 707 | [Design Linked List](https://leetcode.com/problems/design-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-linked-list) | Easy |
+| 708 | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-cyclic-sorted-list) | Medium |
+| 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [Golang](https://github.com/openset/leetcode/tree/master/solution/to-lower-case) | Easy |
+| 710 | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist) | [Golang](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-blacklist) | Hard |
+| 711 | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands-ii) | Hard |
+| 712 | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-ascii-delete-sum-for-two-strings) | Medium |
+| 713 | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | [Golang](https://github.com/openset/leetcode/tree/master/solution/subarray-product-less-than-k) | Medium |
+| 714 | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [Golang](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
+| 715 | [Range Module](https://leetcode.com/problems/range-module) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-module) | Hard |
+| 716 | [Max Stack](https://leetcode.com/problems/max-stack) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-stack) | Easy |
+| 717 | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/1-bit-and-2-bit-characters) | Easy |
+| 718 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-repeated-subarray) | Medium |
+| 719 | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-k-th-smallest-pair-distance) | Hard |
+| 720 | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary) | Easy |
+| 721 | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | [Golang](https://github.com/openset/leetcode/tree/master/solution/accounts-merge) | Medium |
+| 722 | [Remove Comments](https://leetcode.com/problems/remove-comments) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-comments) | Medium |
+| 723 | [Candy Crush](https://leetcode.com/problems/candy-crush) | [Golang](https://github.com/openset/leetcode/tree/master/solution/candy-crush) | Medium |
+| 724 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-pivot-index) | Easy |
+| 725 | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-linked-list-in-parts) | Medium |
+| 726 | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-atoms) | Hard |
+| 727 | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-window-subsequence) | Hard |
+| 728 | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/self-dividing-numbers) | Easy |
+| 729 | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/my-calendar-i) | Medium |
+| 730 | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-different-palindromic-subsequences) | Hard |
+| 731 | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/my-calendar-ii) | Medium |
+| 732 | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/my-calendar-iii) | Hard |
+| 733 | [Flood Fill](https://leetcode.com/problems/flood-fill) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flood-fill) | Easy |
+| 734 | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity) | Easy |
+| 735 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [Golang](https://github.com/openset/leetcode/tree/master/solution/asteroid-collision) | Medium |
+| 736 | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression) | [Golang](https://github.com/openset/leetcode/tree/master/solution/parse-lisp-expression) | Hard |
+| 737 | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity-ii) | Medium |
+| 738 | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/monotone-increasing-digits) | Medium |
+| 739 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [Golang](https://github.com/openset/leetcode/tree/master/solution/daily-temperatures) | Medium |
+| 740 | [Delete and Earn](https://leetcode.com/problems/delete-and-earn) | [Golang](https://github.com/openset/leetcode/tree/master/solution/delete-and-earn) | Medium |
+| 741 | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup) | [Golang](https://github.com/openset/leetcode/tree/master/solution/cherry-pickup) | Hard |
+| 742 | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/closest-leaf-in-a-binary-tree) | Medium |
+| 743 | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | [Golang](https://github.com/openset/leetcode/tree/master/solution/network-delay-time) | Easy |
+| 744 | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-smallest-letter-greater-than-target) | Easy |
+| 745 | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search) | [Golang](https://github.com/openset/leetcode/tree/master/solution/prefix-and-suffix-search) | Hard |
+| 746 | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/min-cost-climbing-stairs) | Easy |
+| 747 | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-number-at-least-twice-of-others) | Easy |
+| 748 | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-completing-word) | Easy |
+| 749 | [Contain Virus](https://leetcode.com/problems/contain-virus) | [Golang](https://github.com/openset/leetcode/tree/master/solution/contain-virus) | Hard |
+| 750 | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-corner-rectangles) | Medium |
+| 751 | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ip-to-cidr) | Easy |
+| 752 | [Open the Lock](https://leetcode.com/problems/open-the-lock) | [Golang](https://github.com/openset/leetcode/tree/master/solution/open-the-lock) | Medium |
+| 753 | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | [Golang](https://github.com/openset/leetcode/tree/master/solution/cracking-the-safe) | Hard |
+| 754 | [Reach a Number](https://leetcode.com/problems/reach-a-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reach-a-number) | Easy |
+| 755 | [Pour Water](https://leetcode.com/problems/pour-water) | [Golang](https://github.com/openset/leetcode/tree/master/solution/pour-water) | Medium |
+| 756 | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/pyramid-transition-matrix) | Medium |
+| 757 | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two) | [Golang](https://github.com/openset/leetcode/tree/master/solution/set-intersection-size-at-least-two) | Hard |
+| 758 | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bold-words-in-string) | Easy |
+| 759 | [Employee Free Time](https://leetcode.com/problems/employee-free-time) | [Golang](https://github.com/openset/leetcode/tree/master/solution/employee-free-time) | Hard |
+| 760 | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-anagram-mappings) | Easy |
+| 761 | [Special Binary String](https://leetcode.com/problems/special-binary-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/special-binary-string) | Hard |
+| 762 | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/prime-number-of-set-bits-in-binary-representation) | Easy |
+| 763 | [Partition Labels](https://leetcode.com/problems/partition-labels) | [Golang](https://github.com/openset/leetcode/tree/master/solution/partition-labels) | Medium |
+| 764 | [Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-plus-sign) | Medium |
+| 765 | [Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands) | [Golang](https://github.com/openset/leetcode/tree/master/solution/couples-holding-hands) | Hard |
+| 766 | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/toeplitz-matrix) | Easy |
+| 767 | [Reorganize String](https://leetcode.com/problems/reorganize-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reorganize-string) | Medium |
+| 768 | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-chunks-to-make-sorted-ii) | Hard |
+| 769 | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-chunks-to-make-sorted) | Medium |
+| 770 | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv) | [Golang](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iv) | Hard |
+| 771 | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | [Golang](https://github.com/openset/leetcode/tree/master/solution/jewels-and-stones) | Easy |
+| 772 | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iii) | Hard |
+| 773 | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sliding-puzzle) | Hard |
+| 774 | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimize-max-distance-to-gas-station) | Hard |
+| 775 | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | [Golang](https://github.com/openset/leetcode/tree/master/solution/global-and-local-inversions) | Medium |
+| 776 | [Split BST](https://leetcode.com/problems/split-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-bst) | Medium |
+| 777 | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/swap-adjacent-in-lr-string) | Medium |
+| 778 | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water) | [Golang](https://github.com/openset/leetcode/tree/master/solution/swim-in-rising-water) | Hard |
+| 779 | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | [Golang](https://github.com/openset/leetcode/tree/master/solution/k-th-symbol-in-grammar) | Medium |
+| 780 | [Reaching Points](https://leetcode.com/problems/reaching-points) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reaching-points) | Hard |
+| 781 | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rabbits-in-forest) | Medium |
+| 782 | [Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard) | [Golang](https://github.com/openset/leetcode/tree/master/solution/transform-to-chessboard) | Hard |
+| 783 | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-distance-between-bst-nodes) | Easy |
+| 784 | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/letter-case-permutation) | Easy |
+| 785 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite?) | [Golang](https://github.com/openset/leetcode/tree/master/solution/is-graph-bipartite?) | Medium |
+| 786 | [K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction) | [Golang](https://github.com/openset/leetcode/tree/master/solution/k-th-smallest-prime-fraction) | Hard |
+| 787 | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops) | [Golang](https://github.com/openset/leetcode/tree/master/solution/cheapest-flights-within-k-stops) | Medium |
+| 788 | [Rotated Digits](https://leetcode.com/problems/rotated-digits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rotated-digits) | Easy |
+| 789 | [Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts) | [Golang](https://github.com/openset/leetcode/tree/master/solution/escape-the-ghosts) | Medium |
+| 790 | [Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling) | [Golang](https://github.com/openset/leetcode/tree/master/solution/domino-and-tromino-tiling) | Medium |
+| 791 | [Custom Sort String](https://leetcode.com/problems/custom-sort-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/custom-sort-string) | Medium |
+| 792 | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-matching-subsequences) | Medium |
+| 793 | [Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function) | [Golang](https://github.com/openset/leetcode/tree/master/solution/preimage-size-of-factorial-zeroes-function) | Hard |
+| 794 | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-tic-tac-toe-state) | Medium |
+| 795 | [Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-subarrays-with-bounded-maximum) | Medium |
+| 796 | [Rotate String](https://leetcode.com/problems/rotate-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rotate-string) | Easy |
+| 797 | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | [Golang](https://github.com/openset/leetcode/tree/master/solution/all-paths-from-source-to-target) | Medium |
+| 798 | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score) | [Golang](https://github.com/openset/leetcode/tree/master/solution/smallest-rotation-with-highest-score) | Hard |
+| 799 | [Champagne Tower](https://leetcode.com/problems/champagne-tower) | [Golang](https://github.com/openset/leetcode/tree/master/solution/champagne-tower) | Medium |
+| 800 | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) | [Golang](https://github.com/openset/leetcode/tree/master/solution/similar-rgb-color) | Easy |
+| 801 | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-swaps-to-make-sequences-increasing) | Medium |
+| 802 | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-eventual-safe-states) | Medium |
+| 803 | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bricks-falling-when-hit) | Hard |
+| 804 | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-morse-code-words) | Easy |
+| 805 | [Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-array-with-same-average) | Hard |
+| 806 | [Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-lines-to-write-string) | Easy |
+| 807 | [Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-increase-to-keep-city-skyline) | Medium |
+| 808 | [Soup Servings](https://leetcode.com/problems/soup-servings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/soup-servings) | Medium |
+| 809 | [Expressive Words](https://leetcode.com/problems/expressive-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/expressive-words) | Medium |
+| 810 | [Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/chalkboard-xor-game) | Hard |
+| 811 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count) | [Golang](https://github.com/openset/leetcode/tree/master/solution/subdomain-visit-count) | Easy |
+| 812 | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-triangle-area) | Easy |
+| 813 | [Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-sum-of-averages) | Medium |
+| 814 | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-pruning) | Medium |
+| 815 | [Bus Routes](https://leetcode.com/problems/bus-routes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bus-routes) | Hard |
+| 816 | [Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ambiguous-coordinates) | Medium |
+| 817 | [Linked List Components](https://leetcode.com/problems/linked-list-components) | [Golang](https://github.com/openset/leetcode/tree/master/solution/linked-list-components) | Medium |
+| 818 | [Race Car](https://leetcode.com/problems/race-car) | [Golang](https://github.com/openset/leetcode/tree/master/solution/race-car) | Hard |
+| 819 | [Most Common Word](https://leetcode.com/problems/most-common-word) | [Golang](https://github.com/openset/leetcode/tree/master/solution/most-common-word) | Easy |
+| 820 | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/short-encoding-of-words) | Medium |
+| 821 | [Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-to-a-character) | Easy |
+| 822 | [Card Flipping Game](https://leetcode.com/problems/card-flipping-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/card-flipping-game) | Medium |
+| 823 | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-trees-with-factors) | Medium |
+| 824 | [Goat Latin](https://leetcode.com/problems/goat-latin) | [Golang](https://github.com/openset/leetcode/tree/master/solution/goat-latin) | Easy |
+| 825 | [Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages) | [Golang](https://github.com/openset/leetcode/tree/master/solution/friends-of-appropriate-ages) | Medium |
+| 826 | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work) | [Golang](https://github.com/openset/leetcode/tree/master/solution/most-profit-assigning-work) | Medium |
+| 827 | [Making A Large Island](https://leetcode.com/problems/making-a-large-island) | [Golang](https://github.com/openset/leetcode/tree/master/solution/making-a-large-island) | Hard |
+| 828 | [Unique Letter String](https://leetcode.com/problems/unique-letter-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-letter-string) | Hard |
+| 829 | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/consecutive-numbers-sum) | Hard |
+| 830 | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups) | [Golang](https://github.com/openset/leetcode/tree/master/solution/positions-of-large-groups) | Easy |
+| 831 | [Masking Personal Information](https://leetcode.com/problems/masking-personal-information) | [Golang](https://github.com/openset/leetcode/tree/master/solution/masking-personal-information) | Medium |
+| 832 | [Flipping an Image](https://leetcode.com/problems/flipping-an-image) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flipping-an-image) | Easy |
+| 833 | [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-and-replace-in-string) | Medium |
+| 834 | [Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sum-of-distances-in-tree) | Hard |
+| 835 | [Image Overlap](https://leetcode.com/problems/image-overlap) | [Golang](https://github.com/openset/leetcode/tree/master/solution/image-overlap) | Medium |
+| 836 | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rectangle-overlap) | Easy |
+| 837 | [New 21 Game](https://leetcode.com/problems/new-21-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/new-21-game) | Medium |
+| 838 | [Push Dominoes](https://leetcode.com/problems/push-dominoes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/push-dominoes) | Medium |
+| 839 | [Similar String Groups](https://leetcode.com/problems/similar-string-groups) | [Golang](https://github.com/openset/leetcode/tree/master/solution/similar-string-groups) | Hard |
+| 840 | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid) | [Golang](https://github.com/openset/leetcode/tree/master/solution/magic-squares-in-grid) | Easy |
+| 841 | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms) | [Golang](https://github.com/openset/leetcode/tree/master/solution/keys-and-rooms) | Medium |
+| 842 | [Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-array-into-fibonacci-sequence) | Medium |
+| 843 | [Guess the Word](https://leetcode.com/problems/guess-the-word) | [Golang](https://github.com/openset/leetcode/tree/master/solution/guess-the-word) | Hard |
+| 844 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | [Golang](https://github.com/openset/leetcode/tree/master/solution/backspace-string-compare) | Easy |
+| 845 | [Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-mountain-in-array) | Medium |
+| 846 | [Hand of Straights](https://leetcode.com/problems/hand-of-straights) | [Golang](https://github.com/openset/leetcode/tree/master/solution/hand-of-straights) | Medium |
+| 847 | [Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-path-visiting-all-nodes) | Hard |
+| 848 | [Shifting Letters](https://leetcode.com/problems/shifting-letters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shifting-letters) | Medium |
+| 849 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximize-distance-to-closest-person) | Easy |
+| 850 | [Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rectangle-area-ii) | Hard |
+| 851 | [Loud and Rich](https://leetcode.com/problems/loud-and-rich) | [Golang](https://github.com/openset/leetcode/tree/master/solution/loud-and-rich) | Medium |
+| 852 | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/peak-index-in-a-mountain-array) | Easy |
+| 853 | [Car Fleet](https://leetcode.com/problems/car-fleet) | [Golang](https://github.com/openset/leetcode/tree/master/solution/car-fleet) | Medium |
+| 854 | [K-Similar Strings](https://leetcode.com/problems/k-similar-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/k-similar-strings) | Hard |
+| 855 | [Exam Room](https://leetcode.com/problems/exam-room) | [Golang](https://github.com/openset/leetcode/tree/master/solution/exam-room) | Medium |
+| 856 | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/score-of-parentheses) | Medium |
+| 857 | [Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-cost-to-hire-k-workers) | Hard |
+| 858 | [Mirror Reflection](https://leetcode.com/problems/mirror-reflection) | [Golang](https://github.com/openset/leetcode/tree/master/solution/mirror-reflection) | Medium |
+| 859 | [Buddy Strings](https://leetcode.com/problems/buddy-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/buddy-strings) | Easy |
+| 860 | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lemonade-change) | Easy |
+| 861 | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/score-after-flipping-matrix) | Medium |
+| 862 | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-subarray-with-sum-at-least-k) | Hard |
+| 863 | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/all-nodes-distance-k-in-binary-tree) | Medium |
+| 864 | [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-path-to-get-all-keys) | Hard |
+| 865 | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/smallest-subtree-with-all-the-deepest-nodes) | Medium |
+| 866 | [Prime Palindrome](https://leetcode.com/problems/prime-palindrome) | [Golang](https://github.com/openset/leetcode/tree/master/solution/prime-palindrome) | Medium |
+| 867 | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/transpose-matrix) | Easy |
+| 868 | [Binary Gap](https://leetcode.com/problems/binary-gap) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-gap) | Easy |
+| 869 | [Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reordered-power-of-2) | Medium |
+| 870 | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/advantage-shuffle) | Medium |
+| 871 | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-number-of-refueling-stops) | Hard |
+| 872 | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/leaf-similar-trees) | Easy |
+| 873 | [Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/length-of-longest-fibonacci-subsequence) | Medium |
+| 874 | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/walking-robot-simulation) | Easy |
+| 875 | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas) | [Golang](https://github.com/openset/leetcode/tree/master/solution/koko-eating-bananas) | Medium |
+| 876 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/middle-of-the-linked-list) | Easy |
+| 877 | [Stone Game](https://leetcode.com/problems/stone-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/stone-game) | Medium |
+| 878 | [Nth Magical Number](https://leetcode.com/problems/nth-magical-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/nth-magical-number) | Hard |
+| 879 | [Profitable Schemes](https://leetcode.com/problems/profitable-schemes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/profitable-schemes) | Hard |
+| 880 | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index) | [Golang](https://github.com/openset/leetcode/tree/master/solution/decoded-string-at-index) | Medium |
+| 881 | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people) | [Golang](https://github.com/openset/leetcode/tree/master/solution/boats-to-save-people) | Medium |
+| 882 | [Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reachable-nodes-in-subdivided-graph) | Hard |
+| 883 | [Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/projection-area-of-3d-shapes) | Easy |
+| 884 | [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/uncommon-words-from-two-sentences) | Easy |
+| 885 | [Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix-iii) | Medium |
+| 886 | [Possible Bipartition](https://leetcode.com/problems/possible-bipartition) | [Golang](https://github.com/openset/leetcode/tree/master/solution/possible-bipartition) | Medium |
+| 887 | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop) | [Golang](https://github.com/openset/leetcode/tree/master/solution/super-egg-drop) | Hard |
+| 888 | [Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap) | [Golang](https://github.com/openset/leetcode/tree/master/solution/fair-candy-swap) | Easy |
+| 889 | [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-preorder-and-postorder-traversal) | Medium |
+| 890 | [Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-and-replace-pattern) | Medium |
+| 891 | [Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sum-of-subsequence-widths) | Hard |
+| 892 | [Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/surface-area-of-3d-shapes) | Easy |
+| 893 | [Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/groups-of-special-equivalent-strings) | Easy |
+| 894 | [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/all-possible-full-binary-trees) | Medium |
+| 895 | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-frequency-stack) | Hard |
+| 896 | [Monotonic Array](https://leetcode.com/problems/monotonic-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/monotonic-array) | Easy |
+| 897 | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/increasing-order-search-tree) | Easy |
+| 898 | [Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bitwise-ors-of-subarrays) | Medium |
+| 899 | [Orderly Queue](https://leetcode.com/problems/orderly-queue) | [Golang](https://github.com/openset/leetcode/tree/master/solution/orderly-queue) | Hard |
+| 900 | [RLE Iterator](https://leetcode.com/problems/rle-iterator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rle-iterator) | Medium |
+| 901 | [Online Stock Span](https://leetcode.com/problems/online-stock-span) | [Golang](https://github.com/openset/leetcode/tree/master/solution/online-stock-span) | Medium |
+| 902 | [Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set) | [Golang](https://github.com/openset/leetcode/tree/master/solution/numbers-at-most-n-given-digit-set) | Hard |
+| 903 | [Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-permutations-for-di-sequence) | Hard |
+| 904 | [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets) | [Golang](https://github.com/openset/leetcode/tree/master/solution/fruit-into-baskets) | Medium |
+| 905 | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sort-array-by-parity) | Easy |
+| 906 | [Super Palindromes](https://leetcode.com/problems/super-palindromes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/super-palindromes) | Hard |
+| 907 | [Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sum-of-subarray-minimums) | Medium |
+| 908 | [Smallest Range I](https://leetcode.com/problems/smallest-range-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/smallest-range-i) | Easy |
+| 909 | [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders) | [Golang](https://github.com/openset/leetcode/tree/master/solution/snakes-and-ladders) | Medium |
+| 910 | [Smallest Range II](https://leetcode.com/problems/smallest-range-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/smallest-range-ii) | Medium |
+| 911 | [Online Election](https://leetcode.com/problems/online-election) | [Golang](https://github.com/openset/leetcode/tree/master/solution/online-election) | Medium |
+| 913 | [Cat and Mouse](https://leetcode.com/problems/cat-and-mouse) | [Golang](https://github.com/openset/leetcode/tree/master/solution/cat-and-mouse) | Hard |
+| 914 | [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | [Golang](https://github.com/openset/leetcode/tree/master/solution/x-of-a-kind-in-a-deck-of-cards) | Easy |
+| 915 | [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals) | [Golang](https://github.com/openset/leetcode/tree/master/solution/partition-array-into-disjoint-intervals) | Medium |
+| 916 | [Word Subsets](https://leetcode.com/problems/word-subsets) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-subsets) | Medium |
+| 917 | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-only-letters) | Easy |
+| 918 | [Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-sum-circular-subarray) | Medium |
+| 919 | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter) | [Golang](https://github.com/openset/leetcode/tree/master/solution/complete-binary-tree-inserter) | Medium |
+| 920 | [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-music-playlists) | Hard |
+| 921 | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-add-to-make-parentheses-valid) | Medium |
+| 922 | [Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sort-array-by-parity-ii) | Easy |
+| 923 | [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity) | [Golang](https://github.com/openset/leetcode/tree/master/solution/3sum-with-multiplicity) | Medium |
+| 924 | [Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimize-malware-spread) | Hard |
+| 925 | [Long Pressed Name](https://leetcode.com/problems/long-pressed-name) | [Golang](https://github.com/openset/leetcode/tree/master/solution/long-pressed-name) | Easy |
+| 926 | [Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flip-string-to-monotone-increasing) | Medium |
+| 927 | [Three Equal Parts](https://leetcode.com/problems/three-equal-parts) | [Golang](https://github.com/openset/leetcode/tree/master/solution/three-equal-parts) | Hard |
+| 928 | [Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimize-malware-spread-ii) | Hard |
+| 929 | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-email-addresses) | Easy |
+| 930 | [Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-subarrays-with-sum) | Medium |
+| 931 | [Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-falling-path-sum) | Medium |
+| 932 | [Beautiful Array](https://leetcode.com/problems/beautiful-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/beautiful-array) | Medium |
+| 933 | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-recent-calls) | Easy |
+| 934 | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-bridge) | Medium |
+| 935 | [Knight Dialer](https://leetcode.com/problems/knight-dialer) | [Golang](https://github.com/openset/leetcode/tree/master/solution/knight-dialer) | Medium |
+| 936 | [Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/stamping-the-sequence) | Hard |
+| 937 | [Reorder Log Files](https://leetcode.com/problems/reorder-log-files) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reorder-log-files) | Easy |
+| 938 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-sum-of-bst) | Medium |
+| 939 | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-area-rectangle) | Medium |
+| 940 | [Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/distinct-subsequences-ii) | Hard |
+| 941 | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-mountain-array) | Easy |
+| 942 | [DI String Match](https://leetcode.com/problems/di-string-match) | [Golang](https://github.com/openset/leetcode/tree/master/solution/di-string-match) | Easy |
+| 943 | [Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-the-shortest-superstring) | Hard |
+| 944 | [Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted) | [Golang](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted) | Easy |
+| 945 | [Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-increment-to-make-array-unique) | Medium |
+| 946 | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/validate-stack-sequences) | Medium |
+| 947 | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column) | [Golang](https://github.com/openset/leetcode/tree/master/solution/most-stones-removed-with-same-row-or-column) | Medium |
+| 948 | [Bag of Tokens](https://leetcode.com/problems/bag-of-tokens) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bag-of-tokens) | Medium |
+| 949 | [Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-time-for-given-digits) | Easy |
+| 950 | [Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reveal-cards-in-increasing-order) | Medium |
+| 951 | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flip-equivalent-binary-trees) | Medium |
+| 952 | [Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-component-size-by-common-factor) | Hard |
+| 953 | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/verifying-an-alien-dictionary) | Easy |
+| 954 | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/array-of-doubled-pairs) | Medium |
+| 955 | [Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted-ii) | Medium |
+| 956 | [Tallest Billboard](https://leetcode.com/problems/tallest-billboard) | [Golang](https://github.com/openset/leetcode/tree/master/solution/tallest-billboard) | Hard |

From 8381cb44f9bcc1b8750b303bbd2898be69b84f0e Mon Sep 17 00:00:00 2001
From: Sandy <openset.wang@gmail.com>
Date: Fri, 14 Dec 2018 22:25:06 +0800
Subject: [PATCH 03/22] Create CNAME

---
 CNAME | 1 +
 1 file changed, 1 insertion(+)
 create mode 100644 CNAME

diff --git a/CNAME b/CNAME
new file mode 100644
index 000000000..c28f2028f
--- /dev/null
+++ b/CNAME
@@ -0,0 +1 @@
+leetcode.openset.wang
\ No newline at end of file

From aa20e614a1fe862f82df50e92710ba63acb98f23 Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Fri, 14 Dec 2018 22:32:06 +0800
Subject: [PATCH 04/22] Add: LeetCode link

---
 index.md | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/index.md b/index.md
index f7a8915c7..6fccb75a6 100644
--- a/index.md
+++ b/index.md
@@ -1,4 +1,5 @@
-# LeetCode
+# [LeetCode](https://openset.github.io/leetcode)
+
 LeetCode Problems' Solutions
 
 [![Build Status](https://travis-ci.org/openset/leetcode.svg?branch=master)](https://travis-ci.org/openset/leetcode)

From 438986dc35ad281a41a1ce2abbe87cee6af00380 Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Fri, 14 Dec 2018 22:51:08 +0800
Subject: [PATCH 05/22] Update: go

---
 index.md | 1898 +++++++++++++++++++++++++++---------------------------
 1 file changed, 949 insertions(+), 949 deletions(-)

diff --git a/index.md b/index.md
index 6fccb75a6..7194cd586 100644
--- a/index.md
+++ b/index.md
@@ -10,952 +10,952 @@ LeetCode Problems' Solutions
 
 | # | Title | Solution | Difficulty |
 | :-: | - | - | :-: |
-| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/two-sum) | Easy |
-| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers) | Medium |
-| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-substring-without-repeating-characters) | Medium |
-| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [Golang](https://github.com/openset/leetcode/tree/master/solution/median-of-two-sorted-arrays) | Hard |
-| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-palindromic-substring) | Medium |
-| 6 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | [Golang](https://github.com/openset/leetcode/tree/master/solution/zigzag-conversion) | Medium |
-| 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-integer) | Easy |
-| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-(atoi)) | [Golang](https://github.com/openset/leetcode/tree/master/solution/string-to-integer-(atoi)) | Medium |
-| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindrome-number) | Easy |
-| 10 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | [Golang](https://github.com/openset/leetcode/tree/master/solution/regular-expression-matching) | Hard |
-| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [Golang](https://github.com/openset/leetcode/tree/master/solution/container-with-most-water) | Medium |
-| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [Golang](https://github.com/openset/leetcode/tree/master/solution/integer-to-roman) | Medium |
-| 13 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | [Golang](https://github.com/openset/leetcode/tree/master/solution/roman-to-integer) | Easy |
-| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-common-prefix) | Easy |
-| 15 | [3Sum](https://leetcode.com/problems/3sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/3sum) | Medium |
-| 16 | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | [Golang](https://github.com/openset/leetcode/tree/master/solution/3sum-closest) | Medium |
-| 17 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/letter-combinations-of-a-phone-number) | Medium |
-| 18 | [4Sum](https://leetcode.com/problems/4sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/4sum) | Medium |
-| 19 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-nth-node-from-end-of-list) | Medium |
-| 20 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-parentheses) | Easy |
-| 21 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [Golang](https://github.com/openset/leetcode/tree/master/solution/merge-two-sorted-lists) | Easy |
-| 22 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/generate-parentheses) | Medium |
-| 23 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | [Golang](https://github.com/openset/leetcode/tree/master/solution/merge-k-sorted-lists) | Hard |
-| 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/swap-nodes-in-pairs) | Medium |
-| 25 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-nodes-in-k-group) | Hard |
-| 26 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-array) | Easy |
-| 27 | [Remove Element](https://leetcode.com/problems/remove-element) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-element) | Easy |
-| 28 | [Implement strStr()](https://leetcode.com/problems/implement-strstr()) | [Golang](https://github.com/openset/leetcode/tree/master/solution/implement-strstr()) | Easy |
-| 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/divide-two-integers) | Medium |
-| 30 | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/substring-with-concatenation-of-all-words) | Hard |
-| 31 | [Next Permutation](https://leetcode.com/problems/next-permutation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/next-permutation) | Medium |
-| 32 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-valid-parentheses) | Hard |
-| 33 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/search-in-rotated-sorted-array) | Medium |
-| 34 | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-first-and-last-position-of-element-in-sorted-array) | Medium |
-| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | [Golang](https://github.com/openset/leetcode/tree/master/solution/search-insert-position) | Easy |
-| 36 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-sudoku) | Medium |
-| 37 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sudoku-solver) | Hard |
-| 38 | [Count and Say](https://leetcode.com/problems/count-and-say) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-and-say) | Easy |
-| 39 | [Combination Sum](https://leetcode.com/problems/combination-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/combination-sum) | Medium |
-| 40 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/combination-sum-ii) | Medium |
-| 41 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | [Golang](https://github.com/openset/leetcode/tree/master/solution/first-missing-positive) | Hard |
-| 42 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | [Golang](https://github.com/openset/leetcode/tree/master/solution/trapping-rain-water) | Hard |
-| 43 | [Multiply Strings](https://leetcode.com/problems/multiply-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/multiply-strings) | Medium |
-| 44 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | [Golang](https://github.com/openset/leetcode/tree/master/solution/wildcard-matching) | Hard |
-| 45 | [Jump Game II](https://leetcode.com/problems/jump-game-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/jump-game-ii) | Hard |
-| 46 | [Permutations](https://leetcode.com/problems/permutations) | [Golang](https://github.com/openset/leetcode/tree/master/solution/permutations) | Medium |
-| 47 | [Permutations II](https://leetcode.com/problems/permutations-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/permutations-ii) | Medium |
-| 48 | [Rotate Image](https://leetcode.com/problems/rotate-image) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rotate-image) | Medium |
-| 49 | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | [Golang](https://github.com/openset/leetcode/tree/master/solution/group-anagrams) | Medium |
-| 50 | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [Golang](https://github.com/openset/leetcode/tree/master/solution/powx-n) | Medium |
-| 51 | [N-Queens](https://leetcode.com/problems/n-queens) | [Golang](https://github.com/openset/leetcode/tree/master/solution/n-queens) | Hard |
-| 52 | [N-Queens II](https://leetcode.com/problems/n-queens-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/n-queens-ii) | Hard |
-| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-subarray) | Easy |
-| 54 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix) | Medium |
-| 55 | [Jump Game](https://leetcode.com/problems/jump-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/jump-game) | Medium |
-| 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [Golang](https://github.com/openset/leetcode/tree/master/solution/merge-intervals) | Medium |
-| 57 | [Insert Interval](https://leetcode.com/problems/insert-interval) | [Golang](https://github.com/openset/leetcode/tree/master/solution/insert-interval) | Hard |
-| 58 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [Golang](https://github.com/openset/leetcode/tree/master/solution/length-of-last-word) | Easy |
-| 59 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix-ii) | Medium |
-| 60 | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/permutation-sequence) | Medium |
-| 61 | [Rotate List](https://leetcode.com/problems/rotate-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rotate-list) | Medium |
-| 62 | [Unique Paths](https://leetcode.com/problems/unique-paths) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-paths) | Medium |
-| 63 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-paths-ii) | Medium |
-| 64 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-path-sum) | Medium |
-| 65 | [Valid Number](https://leetcode.com/problems/valid-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-number) | Hard |
-| 66 | [Plus One](https://leetcode.com/problems/plus-one) | [Golang](https://github.com/openset/leetcode/tree/master/solution/plus-one) | Easy |
-| 67 | [Add Binary](https://leetcode.com/problems/add-binary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-binary) | Easy |
-| 68 | [Text Justification](https://leetcode.com/problems/text-justification) | [Golang](https://github.com/openset/leetcode/tree/master/solution/text-justification) | Hard |
-| 69 | [Sqrt(x)](https://leetcode.com/problems/sqrt(x)) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sqrt(x)) | Easy |
-| 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/climbing-stairs) | Easy |
-| 71 | [Simplify Path](https://leetcode.com/problems/simplify-path) | [Golang](https://github.com/openset/leetcode/tree/master/solution/simplify-path) | Medium |
-| 72 | [Edit Distance](https://leetcode.com/problems/edit-distance) | [Golang](https://github.com/openset/leetcode/tree/master/solution/edit-distance) | Hard |
-| 73 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/set-matrix-zeroes) | Medium |
-| 74 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/search-a-2d-matrix) | Medium |
-| 75 | [Sort Colors](https://leetcode.com/problems/sort-colors) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sort-colors) | Medium |
-| 76 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-window-substring) | Hard |
-| 77 | [Combinations](https://leetcode.com/problems/combinations) | [Golang](https://github.com/openset/leetcode/tree/master/solution/combinations) | Medium |
-| 78 | [Subsets](https://leetcode.com/problems/subsets) | [Golang](https://github.com/openset/leetcode/tree/master/solution/subsets) | Medium |
-| 79 | [Word Search](https://leetcode.com/problems/word-search) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-search) | Medium |
-| 80 | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-array-ii) | Medium |
-| 81 | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/search-in-rotated-sorted-array-ii) | Medium |
-| 82 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-list-ii) | Medium |
-| 83 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-list) | Easy |
-| 84 | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-rectangle-in-histogram) | Hard |
-| 85 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximal-rectangle) | Hard |
-| 86 | [Partition List](https://leetcode.com/problems/partition-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/partition-list) | Medium |
-| 87 | [Scramble String](https://leetcode.com/problems/scramble-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/scramble-string) | Hard |
-| 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/merge-sorted-array) | Easy |
-| 89 | [Gray Code](https://leetcode.com/problems/gray-code) | [Golang](https://github.com/openset/leetcode/tree/master/solution/gray-code) | Medium |
-| 90 | [Subsets II](https://leetcode.com/problems/subsets-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/subsets-ii) | Medium |
-| 91 | [Decode Ways](https://leetcode.com/problems/decode-ways) | [Golang](https://github.com/openset/leetcode/tree/master/solution/decode-ways) | Medium |
-| 92 | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-linked-list-ii) | Medium |
-| 93 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/restore-ip-addresses) | Medium |
-| 94 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-inorder-traversal) | Medium |
-| 95 | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-binary-search-trees-ii) | Medium |
-| 96 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-binary-search-trees) | Medium |
-| 97 | [Interleaving String](https://leetcode.com/problems/interleaving-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/interleaving-string) | Hard |
-| 98 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/validate-binary-search-tree) | Medium |
-| 99 | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/recover-binary-search-tree) | Hard |
-| 100 | [Same Tree](https://leetcode.com/problems/same-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/same-tree) | Easy |
-| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/symmetric-tree) | Easy |
-| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-level-order-traversal) | Medium |
-| 103 | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-zigzag-level-order-traversal) | Medium |
-| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-depth-of-binary-tree) | Easy |
-| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium |
-| 106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-inorder-and-postorder-traversal) | Medium |
-| 107 | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-level-order-traversal-ii) | Easy |
-| 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/convert-sorted-array-to-binary-search-tree) | Easy |
-| 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/convert-sorted-list-to-binary-search-tree) | Medium |
-| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/balanced-binary-tree) | Easy |
-| 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-depth-of-binary-tree) | Easy |
-| 112 | [Path Sum](https://leetcode.com/problems/path-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/path-sum) | Easy |
-| 113 | [Path Sum II](https://leetcode.com/problems/path-sum-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/path-sum-ii) | Medium |
-| 114 | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flatten-binary-tree-to-linked-list) | Medium |
-| 115 | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/distinct-subsequences) | Hard |
-| 116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | [Golang](https://github.com/openset/leetcode/tree/master/solution/populating-next-right-pointers-in-each-node) | Medium |
-| 117 | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/populating-next-right-pointers-in-each-node-ii) | Medium |
-| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascal's-triangle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/pascal's-triangle) | Easy |
-| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascal's-triangle-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/pascal's-triangle-ii) | Easy |
-| 120 | [Triangle](https://leetcode.com/problems/triangle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/triangle) | Medium |
-| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [Golang](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock) | Easy |
-| 122 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-ii) | Easy |
-| 123 | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iii) | Hard |
-| 124 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-maximum-path-sum) | Hard |
-| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-palindrome) | Easy |
-| 126 | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-ladder-ii) | Hard |
-| 127 | [Word Ladder](https://leetcode.com/problems/word-ladder) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-ladder) | Medium |
-| 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-consecutive-sequence) | Hard |
-| 129 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sum-root-to-leaf-numbers) | Medium |
-| 130 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions) | [Golang](https://github.com/openset/leetcode/tree/master/solution/surrounded-regions) | Medium |
-| 131 | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindrome-partitioning) | Medium |
-| 132 | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindrome-partitioning-ii) | Hard |
-| 133 | [Clone Graph](https://leetcode.com/problems/clone-graph) | [Golang](https://github.com/openset/leetcode/tree/master/solution/clone-graph) | Medium |
-| 134 | [Gas Station](https://leetcode.com/problems/gas-station) | [Golang](https://github.com/openset/leetcode/tree/master/solution/gas-station) | Medium |
-| 135 | [Candy](https://leetcode.com/problems/candy) | [Golang](https://github.com/openset/leetcode/tree/master/solution/candy) | Hard |
-| 136 | [Single Number](https://leetcode.com/problems/single-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/single-number) | Easy |
-| 137 | [Single Number II](https://leetcode.com/problems/single-number-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/single-number-ii) | Medium |
-| 138 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | [Golang](https://github.com/openset/leetcode/tree/master/solution/copy-list-with-random-pointer) | Medium |
-| 139 | [Word Break](https://leetcode.com/problems/word-break) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-break) | Medium |
-| 140 | [Word Break II](https://leetcode.com/problems/word-break-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-break-ii) | Hard |
-| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/linked-list-cycle) | Easy |
-| 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/linked-list-cycle-ii) | Medium |
-| 143 | [Reorder List](https://leetcode.com/problems/reorder-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reorder-list) | Medium |
-| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-preorder-traversal) | Medium |
-| 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-postorder-traversal) | Hard |
-| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lru-cache) | Hard |
-| 147 | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/insertion-sort-list) | Medium |
-| 148 | [Sort List](https://leetcode.com/problems/sort-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sort-list) | Medium |
-| 149 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-points-on-a-line) | Hard |
-| 150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/evaluate-reverse-polish-notation) | Medium |
-| 151 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string) | Medium |
-| 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-product-subarray) | Medium |
-| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array) | Medium |
-| 154 | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array-ii) | Hard |
-| 155 | [Min Stack](https://leetcode.com/problems/min-stack) | [Golang](https://github.com/openset/leetcode/tree/master/solution/min-stack) | Easy |
-| 156 | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-upside-down) | Medium |
-| 157 | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) | [Golang](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4) | Easy |
-| 158 | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii---call-multiple-times) | [Golang](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4-ii---call-multiple-times) | Hard |
-| 159 | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-two-distinct-characters) | Hard |
-| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Golang](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-linked-lists) | Easy |
-| 161 | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) | [Golang](https://github.com/openset/leetcode/tree/master/solution/one-edit-distance) | Medium |
-| 162 | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-peak-element) | Medium |
-| 163 | [Missing Ranges](https://leetcode.com/problems/missing-ranges) | [Golang](https://github.com/openset/leetcode/tree/master/solution/missing-ranges) | Medium |
-| 164 | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-gap) | Hard |
-| 165 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/compare-version-numbers) | Medium |
-| 166 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/fraction-to-recurring-decimal) | Medium |
-| 167 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii---input-array-is-sorted) | [Golang](https://github.com/openset/leetcode/tree/master/solution/two-sum-ii---input-array-is-sorted) | Easy |
-| 168 | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [Golang](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-title) | Easy |
-| 169 | [Majority Element](https://leetcode.com/problems/majority-element) | [Golang](https://github.com/openset/leetcode/tree/master/solution/majority-element) | Easy |
-| 170 | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii---data-structure-design) | [Golang](https://github.com/openset/leetcode/tree/master/solution/two-sum-iii---data-structure-design) | Easy |
-| 171 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-number) | Easy |
-| 172 | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/factorial-trailing-zeroes) | Easy |
-| 173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-search-tree-iterator) | Medium |
-| 174 | [Dungeon Game](https://leetcode.com/problems/dungeon-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/dungeon-game) | Hard |
-| 175 | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | [Golang](https://github.com/openset/leetcode/tree/master/solution/combine-two-tables) | Easy |
-| 176 | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/second-highest-salary) | Easy |
-| 177 | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/nth-highest-salary) | Medium |
-| 178 | [Rank Scores](https://leetcode.com/problems/rank-scores) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rank-scores) | Medium |
-| 179 | [Largest Number](https://leetcode.com/problems/largest-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-number) | Medium |
-| 180 | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/consecutive-numbers) | Medium |
-| 181 | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/employees-earning-more-than-their-managers) | Easy |
-| 182 | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails) | [Golang](https://github.com/openset/leetcode/tree/master/solution/duplicate-emails) | Easy |
-| 183 | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [Golang](https://github.com/openset/leetcode/tree/master/solution/customers-who-never-order) | Easy |
-| 184 | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/department-highest-salary) | Medium |
-| 185 | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [Golang](https://github.com/openset/leetcode/tree/master/solution/department-top-three-salaries) | Hard |
-| 186 | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-ii) | Medium |
-| 187 | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/repeated-dna-sequences) | Medium |
-| 188 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [Golang](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iv) | Hard |
-| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rotate-array) | Easy |
-| 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-bits) | Easy |
-| 191 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-1-bits) | Easy |
-| 192 | [Word Frequency](https://leetcode.com/problems/word-frequency) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-frequency) | Medium |
-| 193 | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-phone-numbers) | Easy |
-| 194 | [Transpose File](https://leetcode.com/problems/transpose-file) | [Golang](https://github.com/openset/leetcode/tree/master/solution/transpose-file) | Medium |
-| 195 | [Tenth Line](https://leetcode.com/problems/tenth-line) | [Golang](https://github.com/openset/leetcode/tree/master/solution/tenth-line) | Easy |
-| 196 | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | [Golang](https://github.com/openset/leetcode/tree/master/solution/delete-duplicate-emails) | Easy |
-| 197 | [Rising Temperature](https://leetcode.com/problems/rising-temperature) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rising-temperature) | Easy |
-| 198 | [House Robber](https://leetcode.com/problems/house-robber) | [Golang](https://github.com/openset/leetcode/tree/master/solution/house-robber) | Easy |
-| 199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-right-side-view) | Medium |
-| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-islands) | Medium |
-| 201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bitwise-and-of-numbers-range) | Medium |
-| 202 | [Happy Number](https://leetcode.com/problems/happy-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/happy-number) | Easy |
-| 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-linked-list-elements) | Easy |
-| 204 | [Count Primes](https://leetcode.com/problems/count-primes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-primes) | Easy |
-| 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/isomorphic-strings) | Easy |
-| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-linked-list) | Easy |
-| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule) | [Golang](https://github.com/openset/leetcode/tree/master/solution/course-schedule) | Medium |
-| 208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-(prefix-tree)) | [Golang](https://github.com/openset/leetcode/tree/master/solution/implement-trie-(prefix-tree)) | Medium |
-| 209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-size-subarray-sum) | Medium |
-| 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/course-schedule-ii) | Medium |
-| 211 | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word---data-structure-design) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-and-search-word---data-structure-design) | Medium |
-| 212 | [Word Search II](https://leetcode.com/problems/word-search-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-search-ii) | Hard |
-| 213 | [House Robber II](https://leetcode.com/problems/house-robber-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/house-robber-ii) | Medium |
-| 214 | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-palindrome) | Hard |
-| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/kth-largest-element-in-an-array) | Medium |
-| 216 | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/combination-sum-iii) | Medium |
-| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [Golang](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate) | Easy |
-| 218 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | [Golang](https://github.com/openset/leetcode/tree/master/solution/the-skyline-problem) | Hard |
-| 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate-ii) | Easy |
-| 220 | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate-iii) | Medium |
-| 221 | [Maximal Square](https://leetcode.com/problems/maximal-square) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximal-square) | Medium |
-| 222 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-complete-tree-nodes) | Medium |
-| 223 | [Rectangle Area](https://leetcode.com/problems/rectangle-area) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rectangle-area) | Medium |
-| 224 | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/basic-calculator) | Hard |
-| 225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues) | [Golang](https://github.com/openset/leetcode/tree/master/solution/implement-stack-using-queues) | Easy |
-| 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/invert-binary-tree) | Easy |
-| 227 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-ii) | Medium |
-| 228 | [Summary Ranges](https://leetcode.com/problems/summary-ranges) | [Golang](https://github.com/openset/leetcode/tree/master/solution/summary-ranges) | Medium |
-| 229 | [Majority Element II](https://leetcode.com/problems/majority-element-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/majority-element-ii) | Medium |
-| 230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-element-in-a-bst) | Medium |
-| 231 | [Power of Two](https://leetcode.com/problems/power-of-two) | [Golang](https://github.com/openset/leetcode/tree/master/solution/power-of-two) | Easy |
-| 232 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | [Golang](https://github.com/openset/leetcode/tree/master/solution/implement-queue-using-stacks) | Easy |
-| 233 | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-digit-one) | Hard |
-| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindrome-linked-list) | Easy |
-| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lowest-common-ancestor-of-a-binary-search-tree) | Easy |
-| 236 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lowest-common-ancestor-of-a-binary-tree) | Medium |
-| 237 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/delete-node-in-a-linked-list) | Easy |
-| 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | [Golang](https://github.com/openset/leetcode/tree/master/solution/product-of-array-except-self) | Medium |
-| 239 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sliding-window-maximum) | Hard |
-| 240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/search-a-2d-matrix-ii) | Medium |
-| 241 | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/different-ways-to-add-parentheses) | Medium |
-| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-anagram) | Easy |
-| 243 | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance) | Easy |
-| 244 | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-ii) | Medium |
-| 245 | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-iii) | Medium |
-| 246 | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number) | Easy |
-| 247 | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-ii) | Medium |
-| 248 | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-iii) | Hard |
-| 249 | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/group-shifted-strings) | Medium |
-| 250 | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-univalue-subtrees) | Medium |
-| 251 | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flatten-2d-vector) | Medium |
-| 252 | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) | [Golang](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms) | Easy |
-| 253 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms-ii) | Medium |
-| 254 | [Factor Combinations](https://leetcode.com/problems/factor-combinations) | [Golang](https://github.com/openset/leetcode/tree/master/solution/factor-combinations) | Medium |
-| 255 | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-sequence-in-binary-search-tree) | Medium |
-| 256 | [Paint House](https://leetcode.com/problems/paint-house) | [Golang](https://github.com/openset/leetcode/tree/master/solution/paint-house) | Easy |
-| 257 | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-paths) | Easy |
-| 258 | [Add Digits](https://leetcode.com/problems/add-digits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-digits) | Easy |
-| 259 | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) | [Golang](https://github.com/openset/leetcode/tree/master/solution/3sum-smaller) | Medium |
-| 260 | [Single Number III](https://leetcode.com/problems/single-number-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/single-number-iii) | Medium |
-| 261 | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/graph-valid-tree) | Medium |
-| 262 | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [Golang](https://github.com/openset/leetcode/tree/master/solution/trips-and-users) | Hard |
-| 263 | [Ugly Number](https://leetcode.com/problems/ugly-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ugly-number) | Easy |
-| 264 | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ugly-number-ii) | Medium |
-| 265 | [Paint House II](https://leetcode.com/problems/paint-house-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/paint-house-ii) | Hard |
-| 266 | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation) | Easy |
-| 267 | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation-ii) | Medium |
-| 268 | [Missing Number](https://leetcode.com/problems/missing-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/missing-number) | Easy |
-| 269 | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/alien-dictionary) | Hard |
-| 270 | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) | [Golang](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value) | Easy |
-| 271 | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-strings) | Medium |
-| 272 | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value-ii) | Hard |
-| 273 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/integer-to-english-words) | Hard |
-| 274 | [H-Index](https://leetcode.com/problems/h-index) | [Golang](https://github.com/openset/leetcode/tree/master/solution/h-index) | Medium |
-| 275 | [H-Index II](https://leetcode.com/problems/h-index-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/h-index-ii) | Medium |
-| 276 | [Paint Fence](https://leetcode.com/problems/paint-fence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/paint-fence) | Easy |
-| 277 | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-the-celebrity) | Medium |
-| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version) | [Golang](https://github.com/openset/leetcode/tree/master/solution/first-bad-version) | Easy |
-| 279 | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | [Golang](https://github.com/openset/leetcode/tree/master/solution/perfect-squares) | Medium |
-| 280 | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) | [Golang](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort) | Medium |
-| 281 | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/zigzag-iterator) | Medium |
-| 282 | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | [Golang](https://github.com/openset/leetcode/tree/master/solution/expression-add-operators) | Hard |
-| 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/move-zeroes) | Easy |
-| 284 | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/peeking-iterator) | Medium |
-| 285 | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/inorder-successor-in-bst) | Medium |
-| 286 | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) | [Golang](https://github.com/openset/leetcode/tree/master/solution/walls-and-gates) | Medium |
-| 287 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-the-duplicate-number) | Medium |
-| 288 | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-word-abbreviation) | Medium |
-| 289 | [Game of Life](https://leetcode.com/problems/game-of-life) | [Golang](https://github.com/openset/leetcode/tree/master/solution/game-of-life) | Medium |
-| 290 | [Word Pattern](https://leetcode.com/problems/word-pattern) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-pattern) | Easy |
-| 291 | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-pattern-ii) | Hard |
-| 292 | [Nim Game](https://leetcode.com/problems/nim-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/nim-game) | Easy |
-| 293 | [Flip Game](https://leetcode.com/problems/flip-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flip-game) | Easy |
-| 294 | [Flip Game II](https://leetcode.com/problems/flip-game-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flip-game-ii) | Medium |
-| 295 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-median-from-data-stream) | Hard |
-| 296 | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) | [Golang](https://github.com/openset/leetcode/tree/master/solution/best-meeting-point) | Hard |
-| 297 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-binary-tree) | Hard |
-| 298 | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence) | Medium |
-| 299 | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bulls-and-cows) | Medium |
-| 300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-increasing-subsequence) | Medium |
-| 301 | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-invalid-parentheses) | Hard |
-| 302 | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) | [Golang](https://github.com/openset/leetcode/tree/master/solution/smallest-rectangle-enclosing-black-pixels) | Hard |
-| 303 | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query---immutable) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-sum-query---immutable) | Easy |
-| 304 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d---immutable) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d---immutable) | Medium |
-| 305 | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-islands-ii) | Hard |
-| 306 | [Additive Number](https://leetcode.com/problems/additive-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/additive-number) | Medium |
-| 307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query---mutable) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-sum-query---mutable) | Medium |
-| 308 | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d---mutable) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d---mutable) | Hard |
-| 309 | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [Golang](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
-| 310 | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-height-trees) | Medium |
-| 311 | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sparse-matrix-multiplication) | Medium |
-| 312 | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | [Golang](https://github.com/openset/leetcode/tree/master/solution/burst-balloons) | Hard |
-| 313 | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/super-ugly-number) | Medium |
-| 314 | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-vertical-order-traversal) | Medium |
-| 315 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-of-smaller-numbers-after-self) | Hard |
-| 316 | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-duplicate-letters) | Hard |
-| 317 | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-from-all-buildings) | Hard |
-| 318 | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-word-lengths) | Medium |
-| 319 | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bulb-switcher) | Medium |
-| 320 | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/generalized-abbreviation) | Medium |
-| 321 | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/create-maximum-number) | Hard |
-| 322 | [Coin Change](https://leetcode.com/problems/coin-change) | [Golang](https://github.com/openset/leetcode/tree/master/solution/coin-change) | Medium |
-| 323 | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-connected-components-in-an-undirected-graph) | Medium |
-| 324 | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort-ii) | Medium |
-| 325 | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-size-subarray-sum-equals-k) | Medium |
-| 326 | [Power of Three](https://leetcode.com/problems/power-of-three) | [Golang](https://github.com/openset/leetcode/tree/master/solution/power-of-three) | Easy |
-| 327 | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-of-range-sum) | Hard |
-| 328 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/odd-even-linked-list) | Medium |
-| 329 | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-increasing-path-in-a-matrix) | Hard |
-| 330 | [Patching Array](https://leetcode.com/problems/patching-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/patching-array) | Hard |
-| 331 | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-serialization-of-a-binary-tree) | Medium |
-| 332 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reconstruct-itinerary) | Medium |
-| 333 | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-bst-subtree) | Medium |
-| 334 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/increasing-triplet-subsequence) | Medium |
-| 335 | [Self Crossing](https://leetcode.com/problems/self-crossing) | [Golang](https://github.com/openset/leetcode/tree/master/solution/self-crossing) | Hard |
-| 336 | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindrome-pairs) | Hard |
-| 337 | [House Robber III](https://leetcode.com/problems/house-robber-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/house-robber-iii) | Medium |
-| 338 | [Counting Bits](https://leetcode.com/problems/counting-bits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/counting-bits) | Medium |
-| 339 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum) | Easy |
-| 340 | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-k-distinct-characters) | Hard |
-| 341 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flatten-nested-list-iterator) | Medium |
-| 342 | [Power of Four](https://leetcode.com/problems/power-of-four) | [Golang](https://github.com/openset/leetcode/tree/master/solution/power-of-four) | Easy |
-| 343 | [Integer Break](https://leetcode.com/problems/integer-break) | [Golang](https://github.com/openset/leetcode/tree/master/solution/integer-break) | Medium |
-| 344 | [Reverse String](https://leetcode.com/problems/reverse-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-string) | Easy |
-| 345 | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-vowels-of-a-string) | Easy |
-| 346 | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) | [Golang](https://github.com/openset/leetcode/tree/master/solution/moving-average-from-data-stream) | Easy |
-| 347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [Golang](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-elements) | Medium |
-| 348 | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-tic-tac-toe) | Medium |
-| 349 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | [Golang](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays) | Easy |
-| 350 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays-ii) | Easy |
-| 351 | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) | [Golang](https://github.com/openset/leetcode/tree/master/solution/android-unlock-patterns) | Medium |
-| 352 | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals) | [Golang](https://github.com/openset/leetcode/tree/master/solution/data-stream-as-disjoint-intervals) | Hard |
-| 353 | [Design Snake Game](https://leetcode.com/problems/design-snake-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-snake-game) | Medium |
-| 354 | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/russian-doll-envelopes) | Hard |
-| 355 | [Design Twitter](https://leetcode.com/problems/design-twitter) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-twitter) | Medium |
-| 356 | [Line Reflection](https://leetcode.com/problems/line-reflection) | [Golang](https://github.com/openset/leetcode/tree/master/solution/line-reflection) | Medium |
-| 357 | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-numbers-with-unique-digits) | Medium |
-| 358 | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rearrange-string-k-distance-apart) | Hard |
-| 359 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) | [Golang](https://github.com/openset/leetcode/tree/master/solution/logger-rate-limiter) | Easy |
-| 360 | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sort-transformed-array) | Medium |
-| 361 | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bomb-enemy) | Medium |
-| 362 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-hit-counter) | Medium |
-| 363 | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-sum-of-rectangle-no-larger-than-k) | Hard |
-| 364 | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum-ii) | Medium |
-| 365 | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem) | [Golang](https://github.com/openset/leetcode/tree/master/solution/water-and-jug-problem) | Medium |
-| 366 | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-leaves-of-binary-tree) | Medium |
-| 367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-perfect-square) | Easy |
-| 368 | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-divisible-subset) | Medium |
-| 369 | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/plus-one-linked-list) | Medium |
-| 370 | [Range Addition](https://leetcode.com/problems/range-addition) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-addition) | Medium |
-| 371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sum-of-two-integers) | Easy |
-| 372 | [Super Pow](https://leetcode.com/problems/super-pow) | [Golang](https://github.com/openset/leetcode/tree/master/solution/super-pow) | Medium |
-| 373 | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-k-pairs-with-smallest-sums) | Medium |
-| 374 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | [Golang](https://github.com/openset/leetcode/tree/master/solution/guess-number-higher-or-lower) | Easy |
-| 375 | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/guess-number-higher-or-lower-ii) | Medium |
-| 376 | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/wiggle-subsequence) | Medium |
-| 377 | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [Golang](https://github.com/openset/leetcode/tree/master/solution/combination-sum-iv) | Medium |
-| 378 | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-element-in-a-sorted-matrix) | Medium |
-| 379 | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-phone-directory) | Medium |
-| 380 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o(1)) | [Golang](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o(1)) | Medium |
-| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o(1)---duplicates-allowed) | [Golang](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o(1)---duplicates-allowed) | Hard |
-| 382 | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [Golang](https://github.com/openset/leetcode/tree/master/solution/linked-list-random-node) | Medium |
-| 383 | [Ransom Note](https://leetcode.com/problems/ransom-note) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ransom-note) | Easy |
-| 384 | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shuffle-an-array) | Medium |
-| 385 | [Mini Parser](https://leetcode.com/problems/mini-parser) | [Golang](https://github.com/openset/leetcode/tree/master/solution/mini-parser) | Medium |
-| 386 | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lexicographical-numbers) | Medium |
-| 387 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/first-unique-character-in-a-string) | Easy |
-| 388 | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-absolute-file-path) | Medium |
-| 389 | [Find the Difference](https://leetcode.com/problems/find-the-difference) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-the-difference) | Easy |
-| 390 | [Elimination Game](https://leetcode.com/problems/elimination-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/elimination-game) | Medium |
-| 391 | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/perfect-rectangle) | Hard |
-| 392 | [Is Subsequence](https://leetcode.com/problems/is-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/is-subsequence) | Medium |
-| 393 | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/utf-8-validation) | Medium |
-| 394 | [Decode String](https://leetcode.com/problems/decode-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/decode-string) | Medium |
-| 395 | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-least-k-repeating-characters) | Medium |
-| 396 | [Rotate Function](https://leetcode.com/problems/rotate-function) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rotate-function) | Medium |
-| 397 | [Integer Replacement](https://leetcode.com/problems/integer-replacement) | [Golang](https://github.com/openset/leetcode/tree/master/solution/integer-replacement) | Medium |
-| 398 | [Random Pick Index](https://leetcode.com/problems/random-pick-index) | [Golang](https://github.com/openset/leetcode/tree/master/solution/random-pick-index) | Medium |
-| 399 | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | [Golang](https://github.com/openset/leetcode/tree/master/solution/evaluate-division) | Medium |
-| 400 | [Nth Digit](https://leetcode.com/problems/nth-digit) | [Golang](https://github.com/openset/leetcode/tree/master/solution/nth-digit) | Easy |
-| 401 | [Binary Watch](https://leetcode.com/problems/binary-watch) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-watch) | Easy |
-| 402 | [Remove K Digits](https://leetcode.com/problems/remove-k-digits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-k-digits) | Medium |
-| 403 | [Frog Jump](https://leetcode.com/problems/frog-jump) | [Golang](https://github.com/openset/leetcode/tree/master/solution/frog-jump) | Hard |
-| 404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sum-of-left-leaves) | Easy |
-| 405 | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/convert-a-number-to-hexadecimal) | Easy |
-| 406 | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | [Golang](https://github.com/openset/leetcode/tree/master/solution/queue-reconstruction-by-height) | Medium |
-| 407 | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/trapping-rain-water-ii) | Hard |
-| 408 | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-word-abbreviation) | Easy |
-| 409 | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-palindrome) | Easy |
-| 410 | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-array-largest-sum) | Hard |
-| 411 | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-unique-word-abbreviation) | Hard |
-| 412 | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [Golang](https://github.com/openset/leetcode/tree/master/solution/fizz-buzz) | Easy |
-| 413 | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | [Golang](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices) | Medium |
-| 414 | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/third-maximum-number) | Easy |
-| 415 | [Add Strings](https://leetcode.com/problems/add-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-strings) | Easy |
-| 416 | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/partition-equal-subset-sum) | Medium |
-| 417 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [Golang](https://github.com/openset/leetcode/tree/master/solution/pacific-atlantic-water-flow) | Medium |
-| 418 | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sentence-screen-fitting) | Medium |
-| 419 | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | [Golang](https://github.com/openset/leetcode/tree/master/solution/battleships-in-a-board) | Medium |
-| 420 | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker) | [Golang](https://github.com/openset/leetcode/tree/master/solution/strong-password-checker) | Hard |
-| 421 | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-xor-of-two-numbers-in-an-array) | Medium |
-| 422 | [Valid Word Square](https://leetcode.com/problems/valid-word-square) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-word-square) | Easy |
-| 423 | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reconstruct-original-digits-from-english) | Medium |
-| 424 | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-repeating-character-replacement) | Medium |
-| 425 | [Word Squares](https://leetcode.com/problems/word-squares) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-squares) | Hard |
-| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
-| 427 | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/construct-quad-tree) | Easy |
-| 428 | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-n-ary-tree) | Hard |
-| 429 | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-level-order-traversal) | Easy |
-| 430 | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flatten-a-multilevel-doubly-linked-list) | Medium |
-| 431 | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/encode-n-ary-tree-to-binary-tree) | Hard |
-| 432 | [All O`one Data Structure](https://leetcode.com/problems/all-o`one-data-structure) | [Golang](https://github.com/openset/leetcode/tree/master/solution/all-o`one-data-structure) | Hard |
-| 433 | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-genetic-mutation) | Medium |
-| 434 | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-segments-in-a-string) | Easy |
-| 435 | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | [Golang](https://github.com/openset/leetcode/tree/master/solution/non-overlapping-intervals) | Medium |
-| 436 | [Find Right Interval](https://leetcode.com/problems/find-right-interval) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-right-interval) | Medium |
-| 437 | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/path-sum-iii) | Easy |
-| 438 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-all-anagrams-in-a-string) | Easy |
-| 439 | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ternary-expression-parser) | Medium |
-| 440 | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order) | [Golang](https://github.com/openset/leetcode/tree/master/solution/k-th-smallest-in-lexicographical-order) | Hard |
-| 441 | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | [Golang](https://github.com/openset/leetcode/tree/master/solution/arranging-coins) | Easy |
-| 442 | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-all-duplicates-in-an-array) | Medium |
-| 443 | [String Compression](https://leetcode.com/problems/string-compression) | [Golang](https://github.com/openset/leetcode/tree/master/solution/string-compression) | Easy |
-| 444 | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sequence-reconstruction) | Medium |
-| 445 | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers-ii) | Medium |
-| 446 | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii---subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices-ii---subsequence) | Hard |
-| 447 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-boomerangs) | Easy |
-| 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-all-numbers-disappeared-in-an-array) | Easy |
-| 449 | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-bst) | Medium |
-| 450 | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/delete-node-in-a-bst) | Medium |
-| 451 | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sort-characters-by-frequency) | Medium |
-| 452 | [Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-number-of-arrows-to-burst-balloons) | Medium |
-| 453 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-moves-to-equal-array-elements) | Easy |
-| 454 | [4Sum II](https://leetcode.com/problems/4sum-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/4sum-ii) | Medium |
-| 455 | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | [Golang](https://github.com/openset/leetcode/tree/master/solution/assign-cookies) | Easy |
-| 456 | [132 Pattern](https://leetcode.com/problems/132-pattern) | [Golang](https://github.com/openset/leetcode/tree/master/solution/132-pattern) | Medium |
-| 457 | [Circular Array Loop](https://leetcode.com/problems/circular-array-loop) | [Golang](https://github.com/openset/leetcode/tree/master/solution/circular-array-loop) | Medium |
-| 458 | [Poor Pigs](https://leetcode.com/problems/poor-pigs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/poor-pigs) | Easy |
-| 459 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | [Golang](https://github.com/openset/leetcode/tree/master/solution/repeated-substring-pattern) | Easy |
-| 460 | [LFU Cache](https://leetcode.com/problems/lfu-cache) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lfu-cache) | Hard |
-| 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance) | [Golang](https://github.com/openset/leetcode/tree/master/solution/hamming-distance) | Easy |
-| 462 | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-moves-to-equal-array-elements-ii) | Medium |
-| 463 | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | [Golang](https://github.com/openset/leetcode/tree/master/solution/island-perimeter) | Easy |
-| 464 | [Can I Win](https://leetcode.com/problems/can-i-win) | [Golang](https://github.com/openset/leetcode/tree/master/solution/can-i-win) | Medium |
-| 465 | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) | [Golang](https://github.com/openset/leetcode/tree/master/solution/optimal-account-balancing) | Hard |
-| 466 | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-the-repetitions) | Hard |
-| 467 | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-substrings-in-wraparound-string) | Medium |
-| 468 | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [Golang](https://github.com/openset/leetcode/tree/master/solution/validate-ip-address) | Medium |
-| 469 | [Convex Polygon](https://leetcode.com/problems/convex-polygon) | [Golang](https://github.com/openset/leetcode/tree/master/solution/convex-polygon) | Medium |
-| 470 | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10()-using-rand7()) | [Golang](https://github.com/openset/leetcode/tree/master/solution/implement-rand10()-using-rand7()) | Medium |
-| 471 | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) | [Golang](https://github.com/openset/leetcode/tree/master/solution/encode-string-with-shortest-length) | Hard |
-| 472 | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/concatenated-words) | Hard |
-| 473 | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [Golang](https://github.com/openset/leetcode/tree/master/solution/matchsticks-to-square) | Medium |
-| 474 | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ones-and-zeroes) | Medium |
-| 475 | [Heaters](https://leetcode.com/problems/heaters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/heaters) | Easy |
-| 476 | [Number Complement](https://leetcode.com/problems/number-complement) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-complement) | Easy |
-| 477 | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance) | [Golang](https://github.com/openset/leetcode/tree/master/solution/total-hamming-distance) | Medium |
-| 478 | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/generate-random-point-in-a-circle) | Medium |
-| 479 | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-palindrome-product) | Easy |
-| 480 | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sliding-window-median) | Hard |
-| 481 | [Magical String](https://leetcode.com/problems/magical-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/magical-string) | Medium |
-| 482 | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [Golang](https://github.com/openset/leetcode/tree/master/solution/license-key-formatting) | Easy |
-| 483 | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | [Golang](https://github.com/openset/leetcode/tree/master/solution/smallest-good-base) | Hard |
-| 484 | [Find Permutation](https://leetcode.com/problems/find-permutation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-permutation) | Medium |
-| 485 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones) | Easy |
-| 486 | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | [Golang](https://github.com/openset/leetcode/tree/master/solution/predict-the-winner) | Medium |
-| 487 | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones-ii) | Medium |
-| 488 | [Zuma Game](https://leetcode.com/problems/zuma-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/zuma-game) | Hard |
-| 489 | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) | [Golang](https://github.com/openset/leetcode/tree/master/solution/robot-room-cleaner) | Hard |
-| 490 | [The Maze](https://leetcode.com/problems/the-maze) | [Golang](https://github.com/openset/leetcode/tree/master/solution/the-maze) | Medium |
-| 491 | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/increasing-subsequences) | Medium |
-| 492 | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/construct-the-rectangle) | Easy |
-| 493 | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-pairs) | Hard |
-| 494 | [Target Sum](https://leetcode.com/problems/target-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/target-sum) | Medium |
-| 495 | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking) | [Golang](https://github.com/openset/leetcode/tree/master/solution/teemo-attacking) | Medium |
-| 496 | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-i) | Easy |
-| 497 | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles) | [Golang](https://github.com/openset/leetcode/tree/master/solution/random-point-in-non-overlapping-rectangles) | Medium |
-| 498 | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | [Golang](https://github.com/openset/leetcode/tree/master/solution/diagonal-traverse) | Medium |
-| 499 | [The Maze III](https://leetcode.com/problems/the-maze-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/the-maze-iii) | Hard |
-| 500 | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | [Golang](https://github.com/openset/leetcode/tree/master/solution/keyboard-row) | Easy |
-| 501 | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-mode-in-binary-search-tree) | Easy |
-| 502 | [IPO](https://leetcode.com/problems/ipo) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ipo) | Hard |
-| 503 | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-ii) | Medium |
-| 504 | [Base 7](https://leetcode.com/problems/base-7) | [Golang](https://github.com/openset/leetcode/tree/master/solution/base-7) | Easy |
-| 505 | [The Maze II](https://leetcode.com/problems/the-maze-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/the-maze-ii) | Medium |
-| 506 | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | [Golang](https://github.com/openset/leetcode/tree/master/solution/relative-ranks) | Easy |
-| 507 | [Perfect Number](https://leetcode.com/problems/perfect-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/perfect-number) | Easy |
-| 508 | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/most-frequent-subtree-sum) | Medium |
-| 513 | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-bottom-left-tree-value) | Medium |
-| 514 | [Freedom Trail](https://leetcode.com/problems/freedom-trail) | [Golang](https://github.com/openset/leetcode/tree/master/solution/freedom-trail) | Hard |
-| 515 | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-largest-value-in-each-tree-row) | Medium |
-| 516 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-palindromic-subsequence) | Medium |
-| 517 | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines) | [Golang](https://github.com/openset/leetcode/tree/master/solution/super-washing-machines) | Hard |
-| 518 | [Coin Change 2](https://leetcode.com/problems/coin-change-2) | [Golang](https://github.com/openset/leetcode/tree/master/solution/coin-change-2) | Medium |
-| 519 | [Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/random-flip-matrix) | Medium |
-| 520 | [Detect Capital](https://leetcode.com/problems/detect-capital) | [Golang](https://github.com/openset/leetcode/tree/master/solution/detect-capital) | Easy |
-| 521 | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-uncommon-subsequence-i) | Easy |
-| 522 | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-uncommon-subsequence-ii) | Medium |
-| 523 | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/continuous-subarray-sum) | Medium |
-| 524 | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary-through-deleting) | Medium |
-| 525 | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/contiguous-array) | Medium |
-| 526 | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | [Golang](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement) | Medium |
-| 527 | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-abbreviation) | Hard |
-| 528 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | [Golang](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-weight) | Medium |
-| 529 | [Minesweeper](https://leetcode.com/problems/minesweeper) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minesweeper) | Medium |
-| 530 | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-absolute-difference-in-bst) | Easy |
-| 531 | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-i) | Medium |
-| 532 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/k-diff-pairs-in-an-array) | Easy |
-| 533 | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-ii) | Medium |
-| 535 | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | [Golang](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-tinyurl) | Medium |
-| 536 | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-string) | Medium |
-| 537 | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | [Golang](https://github.com/openset/leetcode/tree/master/solution/complex-number-multiplication) | Medium |
-| 538 | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/convert-bst-to-greater-tree) | Easy |
-| 539 | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-time-difference) | Medium |
-| 540 | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/single-element-in-a-sorted-array) | Medium |
-| 541 | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-string-ii) | Easy |
-| 542 | [01 Matrix](https://leetcode.com/problems/01-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/01-matrix) | Medium |
-| 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/diameter-of-binary-tree) | Easy |
-| 544 | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) | [Golang](https://github.com/openset/leetcode/tree/master/solution/output-contest-matches) | Medium |
-| 545 | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/boundary-of-binary-tree) | Medium |
-| 546 | [Remove Boxes](https://leetcode.com/problems/remove-boxes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-boxes) | Hard |
-| 547 | [Friend Circles](https://leetcode.com/problems/friend-circles) | [Golang](https://github.com/openset/leetcode/tree/master/solution/friend-circles) | Medium |
-| 548 | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-array-with-equal-sum) | Medium |
-| 549 | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence-ii) | Medium |
-| 551 | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-i) | Easy |
-| 552 | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-ii) | Hard |
-| 553 | [Optimal Division](https://leetcode.com/problems/optimal-division) | [Golang](https://github.com/openset/leetcode/tree/master/solution/optimal-division) | Medium |
-| 554 | [Brick Wall](https://leetcode.com/problems/brick-wall) | [Golang](https://github.com/openset/leetcode/tree/master/solution/brick-wall) | Medium |
-| 555 | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-concatenated-strings) | Medium |
-| 556 | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-iii) | Medium |
-| 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-iii) | Easy |
-| 558 | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection) | [Golang](https://github.com/openset/leetcode/tree/master/solution/quad-tree-intersection) | Easy |
-| 559 | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-depth-of-n-ary-tree) | Easy |
-| 560 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | [Golang](https://github.com/openset/leetcode/tree/master/solution/subarray-sum-equals-k) | Medium |
-| 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/array-partition-i) | Easy |
-| 562 | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-line-of-consecutive-one-in-matrix) | Medium |
-| 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-tilt) | Easy |
-| 564 | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-the-closest-palindrome) | Hard |
-| 565 | [Array Nesting](https://leetcode.com/problems/array-nesting) | [Golang](https://github.com/openset/leetcode/tree/master/solution/array-nesting) | Medium |
-| 566 | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reshape-the-matrix) | Easy |
-| 567 | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/permutation-in-string) | Medium |
-| 568 | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-vacation-days) | Hard |
-| 569 | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/median-employee-salary) | Hard |
-| 570 | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) | [Golang](https://github.com/openset/leetcode/tree/master/solution/managers-with-at-least-5-direct-reports) | Medium |
-| 571 | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-median-given-frequency-of-numbers) | Hard |
-| 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/subtree-of-another-tree) | Easy |
-| 573 | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/squirrel-simulation) | Medium |
-| 574 | [Winning Candidate](https://leetcode.com/problems/winning-candidate) | [Golang](https://github.com/openset/leetcode/tree/master/solution/winning-candidate) | Medium |
-| 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | [Golang](https://github.com/openset/leetcode/tree/master/solution/distribute-candies) | Easy |
-| 576 | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [Golang](https://github.com/openset/leetcode/tree/master/solution/out-of-boundary-paths) | Medium |
-| 577 | [Employee Bonus](https://leetcode.com/problems/employee-bonus) | [Golang](https://github.com/openset/leetcode/tree/master/solution/employee-bonus) | Easy |
-| 578 | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) | [Golang](https://github.com/openset/leetcode/tree/master/solution/get-highest-answer-rate-question) | Medium |
-| 579 | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-cumulative-salary-of-an-employee) | Hard |
-| 580 | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-student-number-in-departments) | Medium |
-| 581 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-unsorted-continuous-subarray) | Easy |
-| 582 | [Kill Process](https://leetcode.com/problems/kill-process) | [Golang](https://github.com/openset/leetcode/tree/master/solution/kill-process) | Medium |
-| 583 | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/delete-operation-for-two-strings) | Medium |
-| 584 | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-customer-referee) | Easy |
-| 585 | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) | [Golang](https://github.com/openset/leetcode/tree/master/solution/investments-in-2016) | Medium |
-| 586 | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) | [Golang](https://github.com/openset/leetcode/tree/master/solution/customer-placing-the-largest-number-of-orders) | Easy |
-| 587 | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/erect-the-fence) | Hard |
-| 588 | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-in-memory-file-system) | Hard |
-| 589 | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-preorder-traversal) | Easy |
-| 590 | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-postorder-traversal) | Easy |
-| 591 | [Tag Validator](https://leetcode.com/problems/tag-validator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/tag-validator) | Hard |
-| 592 | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction) | [Golang](https://github.com/openset/leetcode/tree/master/solution/fraction-addition-and-subtraction) | Medium |
-| 593 | [Valid Square](https://leetcode.com/problems/valid-square) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-square) | Medium |
-| 594 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-harmonious-subsequence) | Easy |
-| 595 | [Big Countries](https://leetcode.com/problems/big-countries) | [Golang](https://github.com/openset/leetcode/tree/master/solution/big-countries) | Easy |
-| 596 | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [Golang](https://github.com/openset/leetcode/tree/master/solution/classes-more-than-5-students) | Easy |
-| 597 | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i:-overall-acceptance-rate) | [Golang](https://github.com/openset/leetcode/tree/master/solution/friend-requests-i:-overall-acceptance-rate) | Easy |
-| 598 | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-addition-ii) | Easy |
-| 599 | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-index-sum-of-two-lists) | Easy |
-| 600 | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Golang](https://github.com/openset/leetcode/tree/master/solution/non-negative-integers-without-consecutive-ones) | Hard |
-| 601 | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [Golang](https://github.com/openset/leetcode/tree/master/solution/human-traffic-of-stadium) | Hard |
-| 602 | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii:-who-has-the-most-friends) | [Golang](https://github.com/openset/leetcode/tree/master/solution/friend-requests-ii:-who-has-the-most-friends) | Medium |
-| 603 | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) | [Golang](https://github.com/openset/leetcode/tree/master/solution/consecutive-available-seats) | Easy |
-| 604 | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-compressed-string-iterator) | Easy |
-| 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/can-place-flowers) | Easy |
-| 606 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/construct-string-from-binary-tree) | Easy |
-| 607 | [Sales Person](https://leetcode.com/problems/sales-person) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sales-person) | Easy |
-| 608 | [Tree Node](https://leetcode.com/problems/tree-node) | [Golang](https://github.com/openset/leetcode/tree/master/solution/tree-node) | Medium |
-| 609 | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-file-in-system) | Medium |
-| 610 | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) | [Golang](https://github.com/openset/leetcode/tree/master/solution/triangle-judgement) | Easy |
-| 611 | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-triangle-number) | Medium |
-| 612 | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-plane) | Medium |
-| 613 | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-line) | Easy |
-| 614 | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) | [Golang](https://github.com/openset/leetcode/tree/master/solution/second-degree-follower) | Medium |
-| 615 | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary:-departments-vs-company) | [Golang](https://github.com/openset/leetcode/tree/master/solution/average-salary:-departments-vs-company) | Hard |
-| 616 | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-bold-tag-in-string) | Medium |
-| 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/merge-two-binary-trees) | Easy |
-| 618 | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) | [Golang](https://github.com/openset/leetcode/tree/master/solution/students-report-by-geography) | Hard |
-| 619 | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/biggest-single-number) | Easy |
-| 620 | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [Golang](https://github.com/openset/leetcode/tree/master/solution/not-boring-movies) | Easy |
-| 621 | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [Golang](https://github.com/openset/leetcode/tree/master/solution/task-scheduler) | Medium |
-| 622 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-circular-queue) | Medium |
-| 623 | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/add-one-row-to-tree) | Medium |
-| 624 | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-distance-in-arrays) | Easy |
-| 625 | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-factorization) | Medium |
-| 626 | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [Golang](https://github.com/openset/leetcode/tree/master/solution/exchange-seats) | Medium |
-| 627 | [Swap Salary](https://leetcode.com/problems/swap-salary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/swap-salary) | Easy |
-| 628 | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-three-numbers) | Easy |
-| 629 | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/k-inverse-pairs-array) | Hard |
-| 630 | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/course-schedule-iii) | Hard |
-| 631 | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-excel-sum-formula) | Hard |
-| 632 | [Smallest Range](https://leetcode.com/problems/smallest-range) | [Golang](https://github.com/openset/leetcode/tree/master/solution/smallest-range) | Hard |
-| 633 | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sum-of-square-numbers) | Easy |
-| 634 | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-the-derangement-of-an-array) | Medium |
-| 635 | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-log-storage-system) | Medium |
-| 636 | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | [Golang](https://github.com/openset/leetcode/tree/master/solution/exclusive-time-of-functions) | Medium |
-| 637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/average-of-levels-in-binary-tree) | Easy |
-| 638 | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shopping-offers) | Medium |
-| 639 | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/decode-ways-ii) | Hard |
-| 640 | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/solve-the-equation) | Medium |
-| 641 | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-circular-deque) | Medium |
-| 642 | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-search-autocomplete-system) | Hard |
-| 643 | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-i) | Easy |
-| 644 | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-ii) | Hard |
-| 645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [Golang](https://github.com/openset/leetcode/tree/master/solution/set-mismatch) | Easy |
-| 646 | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-pair-chain) | Medium |
-| 647 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/palindromic-substrings) | Medium |
-| 648 | [Replace Words](https://leetcode.com/problems/replace-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/replace-words) | Medium |
-| 649 | [Dota2 Senate](https://leetcode.com/problems/dota2-senate) | [Golang](https://github.com/openset/leetcode/tree/master/solution/dota2-senate) | Medium |
-| 650 | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [Golang](https://github.com/openset/leetcode/tree/master/solution/2-keys-keyboard) | Medium |
-| 651 | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) | [Golang](https://github.com/openset/leetcode/tree/master/solution/4-keys-keyboard) | Medium |
-| 652 | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-subtrees) | Medium |
-| 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv---input-is-a-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/two-sum-iv---input-is-a-bst) | Easy |
-| 654 | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-binary-tree) | Medium |
-| 655 | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/print-binary-tree) | Medium |
-| 656 | [Coin Path](https://leetcode.com/problems/coin-path) | [Golang](https://github.com/openset/leetcode/tree/master/solution/coin-path) | Hard |
-| 657 | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [Golang](https://github.com/openset/leetcode/tree/master/solution/robot-return-to-origin) | Easy |
-| 658 | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-k-closest-elements) | Medium |
-| 659 | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-array-into-consecutive-subsequences) | Medium |
-| 660 | [Remove 9](https://leetcode.com/problems/remove-9) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-9) | Hard |
-| 661 | [Image Smoother](https://leetcode.com/problems/image-smoother) | [Golang](https://github.com/openset/leetcode/tree/master/solution/image-smoother) | Easy |
-| 662 | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-width-of-binary-tree) | Medium |
-| 663 | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) | [Golang](https://github.com/openset/leetcode/tree/master/solution/equal-tree-partition) | Medium |
-| 664 | [Strange Printer](https://leetcode.com/problems/strange-printer) | [Golang](https://github.com/openset/leetcode/tree/master/solution/strange-printer) | Hard |
-| 665 | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/non-decreasing-array) | Easy |
-| 666 | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) | [Golang](https://github.com/openset/leetcode/tree/master/solution/path-sum-iv) | Medium |
-| 667 | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement-ii) | Medium |
-| 668 | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | [Golang](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-number-in-multiplication-table) | Hard |
-| 669 | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/trim-a-binary-search-tree) | Easy |
-| 670 | [Maximum Swap](https://leetcode.com/problems/maximum-swap) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-swap) | Medium |
-| 671 | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/second-minimum-node-in-a-binary-tree) | Easy |
-| 672 | [Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bulb-switcher-ii) | Medium |
-| 673 | [Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-longest-increasing-subsequence) | Medium |
-| 674 | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-continuous-increasing-subsequence) | Easy |
-| 675 | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event) | [Golang](https://github.com/openset/leetcode/tree/master/solution/cut-off-trees-for-golf-event) | Hard |
-| 676 | [Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/implement-magic-dictionary) | Medium |
-| 677 | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/map-sum-pairs) | Medium |
-| 678 | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-parenthesis-string) | Medium |
-| 679 | [24 Game](https://leetcode.com/problems/24-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/24-game) | Hard |
-| 680 | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-palindrome-ii) | Easy |
-| 681 | [Next Closest Time](https://leetcode.com/problems/next-closest-time) | [Golang](https://github.com/openset/leetcode/tree/master/solution/next-closest-time) | Medium |
-| 682 | [Baseball Game](https://leetcode.com/problems/baseball-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/baseball-game) | Easy |
-| 683 | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) | [Golang](https://github.com/openset/leetcode/tree/master/solution/k-empty-slots) | Hard |
-| 684 | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | [Golang](https://github.com/openset/leetcode/tree/master/solution/redundant-connection) | Medium |
-| 685 | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/redundant-connection-ii) | Hard |
-| 686 | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | [Golang](https://github.com/openset/leetcode/tree/master/solution/repeated-string-match) | Easy |
-| 687 | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-univalue-path) | Easy |
-| 688 | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard) | [Golang](https://github.com/openset/leetcode/tree/master/solution/knight-probability-in-chessboard) | Medium |
-| 689 | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-sum-of-3-non-overlapping-subarrays) | Hard |
-| 690 | [Employee Importance](https://leetcode.com/problems/employee-importance) | [Golang](https://github.com/openset/leetcode/tree/master/solution/employee-importance) | Easy |
-| 691 | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word) | [Golang](https://github.com/openset/leetcode/tree/master/solution/stickers-to-spell-word) | Hard |
-| 692 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-words) | Medium |
-| 693 | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-number-with-alternating-bits) | Easy |
-| 694 | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands) | Medium |
-| 695 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-area-of-island) | Medium |
-| 696 | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-binary-substrings) | Easy |
-| 697 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/degree-of-an-array) | Easy |
-| 698 | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) | [Golang](https://github.com/openset/leetcode/tree/master/solution/partition-to-k-equal-sum-subsets) | Medium |
-| 699 | [Falling Squares](https://leetcode.com/problems/falling-squares) | [Golang](https://github.com/openset/leetcode/tree/master/solution/falling-squares) | Hard |
-| 700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/search-in-a-binary-search-tree) | Easy |
-| 701 | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-binary-search-tree) | Medium |
-| 702 | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) | [Golang](https://github.com/openset/leetcode/tree/master/solution/search-in-a-sorted-array-of-unknown-size) | Medium |
-| 703 | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [Golang](https://github.com/openset/leetcode/tree/master/solution/kth-largest-element-in-a-stream) | Easy |
-| 704 | [Binary Search](https://leetcode.com/problems/binary-search) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-search) | Easy |
-| 705 | [Design HashSet](https://leetcode.com/problems/design-hashset) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-hashset) | Easy |
-| 706 | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-hashmap) | Easy |
-| 707 | [Design Linked List](https://leetcode.com/problems/design-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/design-linked-list) | Easy |
-| 708 | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-cyclic-sorted-list) | Medium |
-| 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [Golang](https://github.com/openset/leetcode/tree/master/solution/to-lower-case) | Easy |
-| 710 | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist) | [Golang](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-blacklist) | Hard |
-| 711 | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands-ii) | Hard |
-| 712 | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-ascii-delete-sum-for-two-strings) | Medium |
-| 713 | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | [Golang](https://github.com/openset/leetcode/tree/master/solution/subarray-product-less-than-k) | Medium |
-| 714 | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [Golang](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
-| 715 | [Range Module](https://leetcode.com/problems/range-module) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-module) | Hard |
-| 716 | [Max Stack](https://leetcode.com/problems/max-stack) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-stack) | Easy |
-| 717 | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/1-bit-and-2-bit-characters) | Easy |
-| 718 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-repeated-subarray) | Medium |
-| 719 | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-k-th-smallest-pair-distance) | Hard |
-| 720 | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary) | Easy |
-| 721 | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | [Golang](https://github.com/openset/leetcode/tree/master/solution/accounts-merge) | Medium |
-| 722 | [Remove Comments](https://leetcode.com/problems/remove-comments) | [Golang](https://github.com/openset/leetcode/tree/master/solution/remove-comments) | Medium |
-| 723 | [Candy Crush](https://leetcode.com/problems/candy-crush) | [Golang](https://github.com/openset/leetcode/tree/master/solution/candy-crush) | Medium |
-| 724 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-pivot-index) | Easy |
-| 725 | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-linked-list-in-parts) | Medium |
-| 726 | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-atoms) | Hard |
-| 727 | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-window-subsequence) | Hard |
-| 728 | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/self-dividing-numbers) | Easy |
-| 729 | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/my-calendar-i) | Medium |
-| 730 | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/count-different-palindromic-subsequences) | Hard |
-| 731 | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/my-calendar-ii) | Medium |
-| 732 | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/my-calendar-iii) | Hard |
-| 733 | [Flood Fill](https://leetcode.com/problems/flood-fill) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flood-fill) | Easy |
-| 734 | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity) | Easy |
-| 735 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [Golang](https://github.com/openset/leetcode/tree/master/solution/asteroid-collision) | Medium |
-| 736 | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression) | [Golang](https://github.com/openset/leetcode/tree/master/solution/parse-lisp-expression) | Hard |
-| 737 | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity-ii) | Medium |
-| 738 | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/monotone-increasing-digits) | Medium |
-| 739 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [Golang](https://github.com/openset/leetcode/tree/master/solution/daily-temperatures) | Medium |
-| 740 | [Delete and Earn](https://leetcode.com/problems/delete-and-earn) | [Golang](https://github.com/openset/leetcode/tree/master/solution/delete-and-earn) | Medium |
-| 741 | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup) | [Golang](https://github.com/openset/leetcode/tree/master/solution/cherry-pickup) | Hard |
-| 742 | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/closest-leaf-in-a-binary-tree) | Medium |
-| 743 | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | [Golang](https://github.com/openset/leetcode/tree/master/solution/network-delay-time) | Easy |
-| 744 | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-smallest-letter-greater-than-target) | Easy |
-| 745 | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search) | [Golang](https://github.com/openset/leetcode/tree/master/solution/prefix-and-suffix-search) | Hard |
-| 746 | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/min-cost-climbing-stairs) | Easy |
-| 747 | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-number-at-least-twice-of-others) | Easy |
-| 748 | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-completing-word) | Easy |
-| 749 | [Contain Virus](https://leetcode.com/problems/contain-virus) | [Golang](https://github.com/openset/leetcode/tree/master/solution/contain-virus) | Hard |
-| 750 | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-corner-rectangles) | Medium |
-| 751 | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ip-to-cidr) | Easy |
-| 752 | [Open the Lock](https://leetcode.com/problems/open-the-lock) | [Golang](https://github.com/openset/leetcode/tree/master/solution/open-the-lock) | Medium |
-| 753 | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | [Golang](https://github.com/openset/leetcode/tree/master/solution/cracking-the-safe) | Hard |
-| 754 | [Reach a Number](https://leetcode.com/problems/reach-a-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reach-a-number) | Easy |
-| 755 | [Pour Water](https://leetcode.com/problems/pour-water) | [Golang](https://github.com/openset/leetcode/tree/master/solution/pour-water) | Medium |
-| 756 | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/pyramid-transition-matrix) | Medium |
-| 757 | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two) | [Golang](https://github.com/openset/leetcode/tree/master/solution/set-intersection-size-at-least-two) | Hard |
-| 758 | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bold-words-in-string) | Easy |
-| 759 | [Employee Free Time](https://leetcode.com/problems/employee-free-time) | [Golang](https://github.com/openset/leetcode/tree/master/solution/employee-free-time) | Hard |
-| 760 | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-anagram-mappings) | Easy |
-| 761 | [Special Binary String](https://leetcode.com/problems/special-binary-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/special-binary-string) | Hard |
-| 762 | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/prime-number-of-set-bits-in-binary-representation) | Easy |
-| 763 | [Partition Labels](https://leetcode.com/problems/partition-labels) | [Golang](https://github.com/openset/leetcode/tree/master/solution/partition-labels) | Medium |
-| 764 | [Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-plus-sign) | Medium |
-| 765 | [Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands) | [Golang](https://github.com/openset/leetcode/tree/master/solution/couples-holding-hands) | Hard |
-| 766 | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/toeplitz-matrix) | Easy |
-| 767 | [Reorganize String](https://leetcode.com/problems/reorganize-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reorganize-string) | Medium |
-| 768 | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-chunks-to-make-sorted-ii) | Hard |
-| 769 | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-chunks-to-make-sorted) | Medium |
-| 770 | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv) | [Golang](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iv) | Hard |
-| 771 | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | [Golang](https://github.com/openset/leetcode/tree/master/solution/jewels-and-stones) | Easy |
-| 772 | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iii) | Hard |
-| 773 | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sliding-puzzle) | Hard |
-| 774 | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimize-max-distance-to-gas-station) | Hard |
-| 775 | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | [Golang](https://github.com/openset/leetcode/tree/master/solution/global-and-local-inversions) | Medium |
-| 776 | [Split BST](https://leetcode.com/problems/split-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-bst) | Medium |
-| 777 | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/swap-adjacent-in-lr-string) | Medium |
-| 778 | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water) | [Golang](https://github.com/openset/leetcode/tree/master/solution/swim-in-rising-water) | Hard |
-| 779 | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | [Golang](https://github.com/openset/leetcode/tree/master/solution/k-th-symbol-in-grammar) | Medium |
-| 780 | [Reaching Points](https://leetcode.com/problems/reaching-points) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reaching-points) | Hard |
-| 781 | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rabbits-in-forest) | Medium |
-| 782 | [Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard) | [Golang](https://github.com/openset/leetcode/tree/master/solution/transform-to-chessboard) | Hard |
-| 783 | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-distance-between-bst-nodes) | Easy |
-| 784 | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/letter-case-permutation) | Easy |
-| 785 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite?) | [Golang](https://github.com/openset/leetcode/tree/master/solution/is-graph-bipartite?) | Medium |
-| 786 | [K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction) | [Golang](https://github.com/openset/leetcode/tree/master/solution/k-th-smallest-prime-fraction) | Hard |
-| 787 | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops) | [Golang](https://github.com/openset/leetcode/tree/master/solution/cheapest-flights-within-k-stops) | Medium |
-| 788 | [Rotated Digits](https://leetcode.com/problems/rotated-digits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rotated-digits) | Easy |
-| 789 | [Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts) | [Golang](https://github.com/openset/leetcode/tree/master/solution/escape-the-ghosts) | Medium |
-| 790 | [Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling) | [Golang](https://github.com/openset/leetcode/tree/master/solution/domino-and-tromino-tiling) | Medium |
-| 791 | [Custom Sort String](https://leetcode.com/problems/custom-sort-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/custom-sort-string) | Medium |
-| 792 | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-matching-subsequences) | Medium |
-| 793 | [Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function) | [Golang](https://github.com/openset/leetcode/tree/master/solution/preimage-size-of-factorial-zeroes-function) | Hard |
-| 794 | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-tic-tac-toe-state) | Medium |
-| 795 | [Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-subarrays-with-bounded-maximum) | Medium |
-| 796 | [Rotate String](https://leetcode.com/problems/rotate-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rotate-string) | Easy |
-| 797 | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | [Golang](https://github.com/openset/leetcode/tree/master/solution/all-paths-from-source-to-target) | Medium |
-| 798 | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score) | [Golang](https://github.com/openset/leetcode/tree/master/solution/smallest-rotation-with-highest-score) | Hard |
-| 799 | [Champagne Tower](https://leetcode.com/problems/champagne-tower) | [Golang](https://github.com/openset/leetcode/tree/master/solution/champagne-tower) | Medium |
-| 800 | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) | [Golang](https://github.com/openset/leetcode/tree/master/solution/similar-rgb-color) | Easy |
-| 801 | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-swaps-to-make-sequences-increasing) | Medium |
-| 802 | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-eventual-safe-states) | Medium |
-| 803 | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bricks-falling-when-hit) | Hard |
-| 804 | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-morse-code-words) | Easy |
-| 805 | [Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-array-with-same-average) | Hard |
-| 806 | [Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-lines-to-write-string) | Easy |
-| 807 | [Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline) | [Golang](https://github.com/openset/leetcode/tree/master/solution/max-increase-to-keep-city-skyline) | Medium |
-| 808 | [Soup Servings](https://leetcode.com/problems/soup-servings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/soup-servings) | Medium |
-| 809 | [Expressive Words](https://leetcode.com/problems/expressive-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/expressive-words) | Medium |
-| 810 | [Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/chalkboard-xor-game) | Hard |
-| 811 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count) | [Golang](https://github.com/openset/leetcode/tree/master/solution/subdomain-visit-count) | Easy |
-| 812 | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-triangle-area) | Easy |
-| 813 | [Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-sum-of-averages) | Medium |
-| 814 | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-tree-pruning) | Medium |
-| 815 | [Bus Routes](https://leetcode.com/problems/bus-routes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bus-routes) | Hard |
-| 816 | [Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates) | [Golang](https://github.com/openset/leetcode/tree/master/solution/ambiguous-coordinates) | Medium |
-| 817 | [Linked List Components](https://leetcode.com/problems/linked-list-components) | [Golang](https://github.com/openset/leetcode/tree/master/solution/linked-list-components) | Medium |
-| 818 | [Race Car](https://leetcode.com/problems/race-car) | [Golang](https://github.com/openset/leetcode/tree/master/solution/race-car) | Hard |
-| 819 | [Most Common Word](https://leetcode.com/problems/most-common-word) | [Golang](https://github.com/openset/leetcode/tree/master/solution/most-common-word) | Easy |
-| 820 | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words) | [Golang](https://github.com/openset/leetcode/tree/master/solution/short-encoding-of-words) | Medium |
-| 821 | [Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-to-a-character) | Easy |
-| 822 | [Card Flipping Game](https://leetcode.com/problems/card-flipping-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/card-flipping-game) | Medium |
-| 823 | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-trees-with-factors) | Medium |
-| 824 | [Goat Latin](https://leetcode.com/problems/goat-latin) | [Golang](https://github.com/openset/leetcode/tree/master/solution/goat-latin) | Easy |
-| 825 | [Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages) | [Golang](https://github.com/openset/leetcode/tree/master/solution/friends-of-appropriate-ages) | Medium |
-| 826 | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work) | [Golang](https://github.com/openset/leetcode/tree/master/solution/most-profit-assigning-work) | Medium |
-| 827 | [Making A Large Island](https://leetcode.com/problems/making-a-large-island) | [Golang](https://github.com/openset/leetcode/tree/master/solution/making-a-large-island) | Hard |
-| 828 | [Unique Letter String](https://leetcode.com/problems/unique-letter-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-letter-string) | Hard |
-| 829 | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/consecutive-numbers-sum) | Hard |
-| 830 | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups) | [Golang](https://github.com/openset/leetcode/tree/master/solution/positions-of-large-groups) | Easy |
-| 831 | [Masking Personal Information](https://leetcode.com/problems/masking-personal-information) | [Golang](https://github.com/openset/leetcode/tree/master/solution/masking-personal-information) | Medium |
-| 832 | [Flipping an Image](https://leetcode.com/problems/flipping-an-image) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flipping-an-image) | Easy |
-| 833 | [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-and-replace-in-string) | Medium |
-| 834 | [Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sum-of-distances-in-tree) | Hard |
-| 835 | [Image Overlap](https://leetcode.com/problems/image-overlap) | [Golang](https://github.com/openset/leetcode/tree/master/solution/image-overlap) | Medium |
-| 836 | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rectangle-overlap) | Easy |
-| 837 | [New 21 Game](https://leetcode.com/problems/new-21-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/new-21-game) | Medium |
-| 838 | [Push Dominoes](https://leetcode.com/problems/push-dominoes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/push-dominoes) | Medium |
-| 839 | [Similar String Groups](https://leetcode.com/problems/similar-string-groups) | [Golang](https://github.com/openset/leetcode/tree/master/solution/similar-string-groups) | Hard |
-| 840 | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid) | [Golang](https://github.com/openset/leetcode/tree/master/solution/magic-squares-in-grid) | Easy |
-| 841 | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms) | [Golang](https://github.com/openset/leetcode/tree/master/solution/keys-and-rooms) | Medium |
-| 842 | [Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/split-array-into-fibonacci-sequence) | Medium |
-| 843 | [Guess the Word](https://leetcode.com/problems/guess-the-word) | [Golang](https://github.com/openset/leetcode/tree/master/solution/guess-the-word) | Hard |
-| 844 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | [Golang](https://github.com/openset/leetcode/tree/master/solution/backspace-string-compare) | Easy |
-| 845 | [Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/longest-mountain-in-array) | Medium |
-| 846 | [Hand of Straights](https://leetcode.com/problems/hand-of-straights) | [Golang](https://github.com/openset/leetcode/tree/master/solution/hand-of-straights) | Medium |
-| 847 | [Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-path-visiting-all-nodes) | Hard |
-| 848 | [Shifting Letters](https://leetcode.com/problems/shifting-letters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shifting-letters) | Medium |
-| 849 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximize-distance-to-closest-person) | Easy |
-| 850 | [Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rectangle-area-ii) | Hard |
-| 851 | [Loud and Rich](https://leetcode.com/problems/loud-and-rich) | [Golang](https://github.com/openset/leetcode/tree/master/solution/loud-and-rich) | Medium |
-| 852 | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/peak-index-in-a-mountain-array) | Easy |
-| 853 | [Car Fleet](https://leetcode.com/problems/car-fleet) | [Golang](https://github.com/openset/leetcode/tree/master/solution/car-fleet) | Medium |
-| 854 | [K-Similar Strings](https://leetcode.com/problems/k-similar-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/k-similar-strings) | Hard |
-| 855 | [Exam Room](https://leetcode.com/problems/exam-room) | [Golang](https://github.com/openset/leetcode/tree/master/solution/exam-room) | Medium |
-| 856 | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/score-of-parentheses) | Medium |
-| 857 | [Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-cost-to-hire-k-workers) | Hard |
-| 858 | [Mirror Reflection](https://leetcode.com/problems/mirror-reflection) | [Golang](https://github.com/openset/leetcode/tree/master/solution/mirror-reflection) | Medium |
-| 859 | [Buddy Strings](https://leetcode.com/problems/buddy-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/buddy-strings) | Easy |
-| 860 | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [Golang](https://github.com/openset/leetcode/tree/master/solution/lemonade-change) | Easy |
-| 861 | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/score-after-flipping-matrix) | Medium |
-| 862 | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-subarray-with-sum-at-least-k) | Hard |
-| 863 | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/all-nodes-distance-k-in-binary-tree) | Medium |
-| 864 | [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-path-to-get-all-keys) | Hard |
-| 865 | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/smallest-subtree-with-all-the-deepest-nodes) | Medium |
-| 866 | [Prime Palindrome](https://leetcode.com/problems/prime-palindrome) | [Golang](https://github.com/openset/leetcode/tree/master/solution/prime-palindrome) | Medium |
-| 867 | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | [Golang](https://github.com/openset/leetcode/tree/master/solution/transpose-matrix) | Easy |
-| 868 | [Binary Gap](https://leetcode.com/problems/binary-gap) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-gap) | Easy |
-| 869 | [Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reordered-power-of-2) | Medium |
-| 870 | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/advantage-shuffle) | Medium |
-| 871 | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-number-of-refueling-stops) | Hard |
-| 872 | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/leaf-similar-trees) | Easy |
-| 873 | [Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/length-of-longest-fibonacci-subsequence) | Medium |
-| 874 | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation) | [Golang](https://github.com/openset/leetcode/tree/master/solution/walking-robot-simulation) | Easy |
-| 875 | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas) | [Golang](https://github.com/openset/leetcode/tree/master/solution/koko-eating-bananas) | Medium |
-| 876 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | [Golang](https://github.com/openset/leetcode/tree/master/solution/middle-of-the-linked-list) | Easy |
-| 877 | [Stone Game](https://leetcode.com/problems/stone-game) | [Golang](https://github.com/openset/leetcode/tree/master/solution/stone-game) | Medium |
-| 878 | [Nth Magical Number](https://leetcode.com/problems/nth-magical-number) | [Golang](https://github.com/openset/leetcode/tree/master/solution/nth-magical-number) | Hard |
-| 879 | [Profitable Schemes](https://leetcode.com/problems/profitable-schemes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/profitable-schemes) | Hard |
-| 880 | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index) | [Golang](https://github.com/openset/leetcode/tree/master/solution/decoded-string-at-index) | Medium |
-| 881 | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people) | [Golang](https://github.com/openset/leetcode/tree/master/solution/boats-to-save-people) | Medium |
-| 882 | [Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reachable-nodes-in-subdivided-graph) | Hard |
-| 883 | [Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/projection-area-of-3d-shapes) | Easy |
-| 884 | [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/uncommon-words-from-two-sentences) | Easy |
-| 885 | [Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix-iii) | Medium |
-| 886 | [Possible Bipartition](https://leetcode.com/problems/possible-bipartition) | [Golang](https://github.com/openset/leetcode/tree/master/solution/possible-bipartition) | Medium |
-| 887 | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop) | [Golang](https://github.com/openset/leetcode/tree/master/solution/super-egg-drop) | Hard |
-| 888 | [Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap) | [Golang](https://github.com/openset/leetcode/tree/master/solution/fair-candy-swap) | Easy |
-| 889 | [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | [Golang](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-preorder-and-postorder-traversal) | Medium |
-| 890 | [Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-and-replace-pattern) | Medium |
-| 891 | [Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sum-of-subsequence-widths) | Hard |
-| 892 | [Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/surface-area-of-3d-shapes) | Easy |
-| 893 | [Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings) | [Golang](https://github.com/openset/leetcode/tree/master/solution/groups-of-special-equivalent-strings) | Easy |
-| 894 | [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/all-possible-full-binary-trees) | Medium |
-| 895 | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-frequency-stack) | Hard |
-| 896 | [Monotonic Array](https://leetcode.com/problems/monotonic-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/monotonic-array) | Easy |
-| 897 | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree) | [Golang](https://github.com/openset/leetcode/tree/master/solution/increasing-order-search-tree) | Easy |
-| 898 | [Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bitwise-ors-of-subarrays) | Medium |
-| 899 | [Orderly Queue](https://leetcode.com/problems/orderly-queue) | [Golang](https://github.com/openset/leetcode/tree/master/solution/orderly-queue) | Hard |
-| 900 | [RLE Iterator](https://leetcode.com/problems/rle-iterator) | [Golang](https://github.com/openset/leetcode/tree/master/solution/rle-iterator) | Medium |
-| 901 | [Online Stock Span](https://leetcode.com/problems/online-stock-span) | [Golang](https://github.com/openset/leetcode/tree/master/solution/online-stock-span) | Medium |
-| 902 | [Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set) | [Golang](https://github.com/openset/leetcode/tree/master/solution/numbers-at-most-n-given-digit-set) | Hard |
-| 903 | [Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-permutations-for-di-sequence) | Hard |
-| 904 | [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets) | [Golang](https://github.com/openset/leetcode/tree/master/solution/fruit-into-baskets) | Medium |
-| 905 | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sort-array-by-parity) | Easy |
-| 906 | [Super Palindromes](https://leetcode.com/problems/super-palindromes) | [Golang](https://github.com/openset/leetcode/tree/master/solution/super-palindromes) | Hard |
-| 907 | [Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sum-of-subarray-minimums) | Medium |
-| 908 | [Smallest Range I](https://leetcode.com/problems/smallest-range-i) | [Golang](https://github.com/openset/leetcode/tree/master/solution/smallest-range-i) | Easy |
-| 909 | [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders) | [Golang](https://github.com/openset/leetcode/tree/master/solution/snakes-and-ladders) | Medium |
-| 910 | [Smallest Range II](https://leetcode.com/problems/smallest-range-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/smallest-range-ii) | Medium |
-| 911 | [Online Election](https://leetcode.com/problems/online-election) | [Golang](https://github.com/openset/leetcode/tree/master/solution/online-election) | Medium |
-| 913 | [Cat and Mouse](https://leetcode.com/problems/cat-and-mouse) | [Golang](https://github.com/openset/leetcode/tree/master/solution/cat-and-mouse) | Hard |
-| 914 | [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | [Golang](https://github.com/openset/leetcode/tree/master/solution/x-of-a-kind-in-a-deck-of-cards) | Easy |
-| 915 | [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals) | [Golang](https://github.com/openset/leetcode/tree/master/solution/partition-array-into-disjoint-intervals) | Medium |
-| 916 | [Word Subsets](https://leetcode.com/problems/word-subsets) | [Golang](https://github.com/openset/leetcode/tree/master/solution/word-subsets) | Medium |
-| 917 | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reverse-only-letters) | Easy |
-| 918 | [Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray) | [Golang](https://github.com/openset/leetcode/tree/master/solution/maximum-sum-circular-subarray) | Medium |
-| 919 | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter) | [Golang](https://github.com/openset/leetcode/tree/master/solution/complete-binary-tree-inserter) | Medium |
-| 920 | [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-music-playlists) | Hard |
-| 921 | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-add-to-make-parentheses-valid) | Medium |
-| 922 | [Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/sort-array-by-parity-ii) | Easy |
-| 923 | [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity) | [Golang](https://github.com/openset/leetcode/tree/master/solution/3sum-with-multiplicity) | Medium |
-| 924 | [Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimize-malware-spread) | Hard |
-| 925 | [Long Pressed Name](https://leetcode.com/problems/long-pressed-name) | [Golang](https://github.com/openset/leetcode/tree/master/solution/long-pressed-name) | Easy |
-| 926 | [Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flip-string-to-monotone-increasing) | Medium |
-| 927 | [Three Equal Parts](https://leetcode.com/problems/three-equal-parts) | [Golang](https://github.com/openset/leetcode/tree/master/solution/three-equal-parts) | Hard |
-| 928 | [Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimize-malware-spread-ii) | Hard |
-| 929 | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses) | [Golang](https://github.com/openset/leetcode/tree/master/solution/unique-email-addresses) | Easy |
-| 930 | [Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/binary-subarrays-with-sum) | Medium |
-| 931 | [Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-falling-path-sum) | Medium |
-| 932 | [Beautiful Array](https://leetcode.com/problems/beautiful-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/beautiful-array) | Medium |
-| 933 | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls) | [Golang](https://github.com/openset/leetcode/tree/master/solution/number-of-recent-calls) | Easy |
-| 934 | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge) | [Golang](https://github.com/openset/leetcode/tree/master/solution/shortest-bridge) | Medium |
-| 935 | [Knight Dialer](https://leetcode.com/problems/knight-dialer) | [Golang](https://github.com/openset/leetcode/tree/master/solution/knight-dialer) | Medium |
-| 936 | [Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence) | [Golang](https://github.com/openset/leetcode/tree/master/solution/stamping-the-sequence) | Hard |
-| 937 | [Reorder Log Files](https://leetcode.com/problems/reorder-log-files) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reorder-log-files) | Easy |
-| 938 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | [Golang](https://github.com/openset/leetcode/tree/master/solution/range-sum-of-bst) | Medium |
-| 939 | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-area-rectangle) | Medium |
-| 940 | [Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/distinct-subsequences-ii) | Hard |
-| 941 | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array) | [Golang](https://github.com/openset/leetcode/tree/master/solution/valid-mountain-array) | Easy |
-| 942 | [DI String Match](https://leetcode.com/problems/di-string-match) | [Golang](https://github.com/openset/leetcode/tree/master/solution/di-string-match) | Easy |
-| 943 | [Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring) | [Golang](https://github.com/openset/leetcode/tree/master/solution/find-the-shortest-superstring) | Hard |
-| 944 | [Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted) | [Golang](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted) | Easy |
-| 945 | [Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique) | [Golang](https://github.com/openset/leetcode/tree/master/solution/minimum-increment-to-make-array-unique) | Medium |
-| 946 | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences) | [Golang](https://github.com/openset/leetcode/tree/master/solution/validate-stack-sequences) | Medium |
-| 947 | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column) | [Golang](https://github.com/openset/leetcode/tree/master/solution/most-stones-removed-with-same-row-or-column) | Medium |
-| 948 | [Bag of Tokens](https://leetcode.com/problems/bag-of-tokens) | [Golang](https://github.com/openset/leetcode/tree/master/solution/bag-of-tokens) | Medium |
-| 949 | [Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-time-for-given-digits) | Easy |
-| 950 | [Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order) | [Golang](https://github.com/openset/leetcode/tree/master/solution/reveal-cards-in-increasing-order) | Medium |
-| 951 | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees) | [Golang](https://github.com/openset/leetcode/tree/master/solution/flip-equivalent-binary-trees) | Medium |
-| 952 | [Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor) | [Golang](https://github.com/openset/leetcode/tree/master/solution/largest-component-size-by-common-factor) | Hard |
-| 953 | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary) | [Golang](https://github.com/openset/leetcode/tree/master/solution/verifying-an-alien-dictionary) | Easy |
-| 954 | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs) | [Golang](https://github.com/openset/leetcode/tree/master/solution/array-of-doubled-pairs) | Medium |
-| 955 | [Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii) | [Golang](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted-ii) | Medium |
-| 956 | [Tallest Billboard](https://leetcode.com/problems/tallest-billboard) | [Golang](https://github.com/openset/leetcode/tree/master/solution/tallest-billboard) | Hard |
+| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum) | Easy |
+| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers) | Medium |
+| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-without-repeating-characters) | Medium |
+| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/median-of-two-sorted-arrays) | Hard |
+| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-palindromic-substring) | Medium |
+| 6 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | [Go](https://github.com/openset/leetcode/tree/master/solution/zigzag-conversion) | Medium |
+| 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-integer) | Easy |
+| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-(atoi)) | [Go](https://github.com/openset/leetcode/tree/master/solution/string-to-integer-(atoi)) | Medium |
+| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-number) | Easy |
+| 10 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | [Go](https://github.com/openset/leetcode/tree/master/solution/regular-expression-matching) | Hard |
+| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/container-with-most-water) | Medium |
+| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-to-roman) | Medium |
+| 13 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | [Go](https://github.com/openset/leetcode/tree/master/solution/roman-to-integer) | Easy |
+| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-common-prefix) | Easy |
+| 15 | [3Sum](https://leetcode.com/problems/3sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum) | Medium |
+| 16 | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-closest) | Medium |
+| 17 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/letter-combinations-of-a-phone-number) | Medium |
+| 18 | [4Sum](https://leetcode.com/problems/4sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/4sum) | Medium |
+| 19 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-nth-node-from-end-of-list) | Medium |
+| 20 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-parentheses) | Easy |
+| 21 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-two-sorted-lists) | Easy |
+| 22 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/generate-parentheses) | Medium |
+| 23 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-k-sorted-lists) | Hard |
+| 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-nodes-in-pairs) | Medium |
+| 25 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-nodes-in-k-group) | Hard |
+| 26 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-array) | Easy |
+| 27 | [Remove Element](https://leetcode.com/problems/remove-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-element) | Easy |
+| 28 | [Implement strStr()](https://leetcode.com/problems/implement-strstr()) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-strstr()) | Easy |
+| 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/solution/divide-two-integers) | Medium |
+| 30 | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/substring-with-concatenation-of-all-words) | Hard |
+| 31 | [Next Permutation](https://leetcode.com/problems/next-permutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-permutation) | Medium |
+| 32 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-valid-parentheses) | Hard |
+| 33 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-rotated-sorted-array) | Medium |
+| 34 | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-first-and-last-position-of-element-in-sorted-array) | Medium |
+| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-insert-position) | Easy |
+| 36 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-sudoku) | Medium |
+| 37 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | [Go](https://github.com/openset/leetcode/tree/master/solution/sudoku-solver) | Hard |
+| 38 | [Count and Say](https://leetcode.com/problems/count-and-say) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-and-say) | Easy |
+| 39 | [Combination Sum](https://leetcode.com/problems/combination-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum) | Medium |
+| 40 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum-ii) | Medium |
+| 41 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | [Go](https://github.com/openset/leetcode/tree/master/solution/first-missing-positive) | Hard |
+| 42 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/trapping-rain-water) | Hard |
+| 43 | [Multiply Strings](https://leetcode.com/problems/multiply-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/multiply-strings) | Medium |
+| 44 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | [Go](https://github.com/openset/leetcode/tree/master/solution/wildcard-matching) | Hard |
+| 45 | [Jump Game II](https://leetcode.com/problems/jump-game-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/jump-game-ii) | Hard |
+| 46 | [Permutations](https://leetcode.com/problems/permutations) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutations) | Medium |
+| 47 | [Permutations II](https://leetcode.com/problems/permutations-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutations-ii) | Medium |
+| 48 | [Rotate Image](https://leetcode.com/problems/rotate-image) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-image) | Medium |
+| 49 | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | [Go](https://github.com/openset/leetcode/tree/master/solution/group-anagrams) | Medium |
+| 50 | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [Go](https://github.com/openset/leetcode/tree/master/solution/powx-n) | Medium |
+| 51 | [N-Queens](https://leetcode.com/problems/n-queens) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-queens) | Hard |
+| 52 | [N-Queens II](https://leetcode.com/problems/n-queens-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-queens-ii) | Hard |
+| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-subarray) | Easy |
+| 54 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix) | Medium |
+| 55 | [Jump Game](https://leetcode.com/problems/jump-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/jump-game) | Medium |
+| 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-intervals) | Medium |
+| 57 | [Insert Interval](https://leetcode.com/problems/insert-interval) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-interval) | Hard |
+| 58 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/length-of-last-word) | Easy |
+| 59 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix-ii) | Medium |
+| 60 | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutation-sequence) | Medium |
+| 61 | [Rotate List](https://leetcode.com/problems/rotate-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-list) | Medium |
+| 62 | [Unique Paths](https://leetcode.com/problems/unique-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-paths) | Medium |
+| 63 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-paths-ii) | Medium |
+| 64 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-path-sum) | Medium |
+| 65 | [Valid Number](https://leetcode.com/problems/valid-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-number) | Hard |
+| 66 | [Plus One](https://leetcode.com/problems/plus-one) | [Go](https://github.com/openset/leetcode/tree/master/solution/plus-one) | Easy |
+| 67 | [Add Binary](https://leetcode.com/problems/add-binary) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-binary) | Easy |
+| 68 | [Text Justification](https://leetcode.com/problems/text-justification) | [Go](https://github.com/openset/leetcode/tree/master/solution/text-justification) | Hard |
+| 69 | [Sqrt(x)](https://leetcode.com/problems/sqrt(x)) | [Go](https://github.com/openset/leetcode/tree/master/solution/sqrt(x)) | Easy |
+| 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/climbing-stairs) | Easy |
+| 71 | [Simplify Path](https://leetcode.com/problems/simplify-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/simplify-path) | Medium |
+| 72 | [Edit Distance](https://leetcode.com/problems/edit-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/edit-distance) | Hard |
+| 73 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-matrix-zeroes) | Medium |
+| 74 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-a-2d-matrix) | Medium |
+| 75 | [Sort Colors](https://leetcode.com/problems/sort-colors) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-colors) | Medium |
+| 76 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-window-substring) | Hard |
+| 77 | [Combinations](https://leetcode.com/problems/combinations) | [Go](https://github.com/openset/leetcode/tree/master/solution/combinations) | Medium |
+| 78 | [Subsets](https://leetcode.com/problems/subsets) | [Go](https://github.com/openset/leetcode/tree/master/solution/subsets) | Medium |
+| 79 | [Word Search](https://leetcode.com/problems/word-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-search) | Medium |
+| 80 | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-array-ii) | Medium |
+| 81 | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-rotated-sorted-array-ii) | Medium |
+| 82 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-list-ii) | Medium |
+| 83 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-list) | Easy |
+| 84 | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-rectangle-in-histogram) | Hard |
+| 85 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximal-rectangle) | Hard |
+| 86 | [Partition List](https://leetcode.com/problems/partition-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-list) | Medium |
+| 87 | [Scramble String](https://leetcode.com/problems/scramble-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/scramble-string) | Hard |
+| 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-sorted-array) | Easy |
+| 89 | [Gray Code](https://leetcode.com/problems/gray-code) | [Go](https://github.com/openset/leetcode/tree/master/solution/gray-code) | Medium |
+| 90 | [Subsets II](https://leetcode.com/problems/subsets-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/subsets-ii) | Medium |
+| 91 | [Decode Ways](https://leetcode.com/problems/decode-ways) | [Go](https://github.com/openset/leetcode/tree/master/solution/decode-ways) | Medium |
+| 92 | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-linked-list-ii) | Medium |
+| 93 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | [Go](https://github.com/openset/leetcode/tree/master/solution/restore-ip-addresses) | Medium |
+| 94 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-inorder-traversal) | Medium |
+| 95 | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-binary-search-trees-ii) | Medium |
+| 96 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-binary-search-trees) | Medium |
+| 97 | [Interleaving String](https://leetcode.com/problems/interleaving-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/interleaving-string) | Hard |
+| 98 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/validate-binary-search-tree) | Medium |
+| 99 | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/recover-binary-search-tree) | Hard |
+| 100 | [Same Tree](https://leetcode.com/problems/same-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/same-tree) | Easy |
+| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/symmetric-tree) | Easy |
+| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-level-order-traversal) | Medium |
+| 103 | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-zigzag-level-order-traversal) | Medium |
+| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-depth-of-binary-tree) | Easy |
+| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium |
+| 106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-inorder-and-postorder-traversal) | Medium |
+| 107 | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-level-order-traversal-ii) | Easy |
+| 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-sorted-array-to-binary-search-tree) | Easy |
+| 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-sorted-list-to-binary-search-tree) | Medium |
+| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/balanced-binary-tree) | Easy |
+| 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-depth-of-binary-tree) | Easy |
+| 112 | [Path Sum](https://leetcode.com/problems/path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum) | Easy |
+| 113 | [Path Sum II](https://leetcode.com/problems/path-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-ii) | Medium |
+| 114 | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-binary-tree-to-linked-list) | Medium |
+| 115 | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/distinct-subsequences) | Hard |
+| 116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | [Go](https://github.com/openset/leetcode/tree/master/solution/populating-next-right-pointers-in-each-node) | Medium |
+| 117 | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/populating-next-right-pointers-in-each-node-ii) | Medium |
+| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascal's-triangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/pascal's-triangle) | Easy |
+| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascal's-triangle-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/pascal's-triangle-ii) | Easy |
+| 120 | [Triangle](https://leetcode.com/problems/triangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/triangle) | Medium |
+| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock) | Easy |
+| 122 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-ii) | Easy |
+| 123 | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iii) | Hard |
+| 124 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-maximum-path-sum) | Hard |
+| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-palindrome) | Easy |
+| 126 | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-ladder-ii) | Hard |
+| 127 | [Word Ladder](https://leetcode.com/problems/word-ladder) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-ladder) | Medium |
+| 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-consecutive-sequence) | Hard |
+| 129 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-root-to-leaf-numbers) | Medium |
+| 130 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions) | [Go](https://github.com/openset/leetcode/tree/master/solution/surrounded-regions) | Medium |
+| 131 | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-partitioning) | Medium |
+| 132 | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-partitioning-ii) | Hard |
+| 133 | [Clone Graph](https://leetcode.com/problems/clone-graph) | [Go](https://github.com/openset/leetcode/tree/master/solution/clone-graph) | Medium |
+| 134 | [Gas Station](https://leetcode.com/problems/gas-station) | [Go](https://github.com/openset/leetcode/tree/master/solution/gas-station) | Medium |
+| 135 | [Candy](https://leetcode.com/problems/candy) | [Go](https://github.com/openset/leetcode/tree/master/solution/candy) | Hard |
+| 136 | [Single Number](https://leetcode.com/problems/single-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-number) | Easy |
+| 137 | [Single Number II](https://leetcode.com/problems/single-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-number-ii) | Medium |
+| 138 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | [Go](https://github.com/openset/leetcode/tree/master/solution/copy-list-with-random-pointer) | Medium |
+| 139 | [Word Break](https://leetcode.com/problems/word-break) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-break) | Medium |
+| 140 | [Word Break II](https://leetcode.com/problems/word-break-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-break-ii) | Hard |
+| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-cycle) | Easy |
+| 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-cycle-ii) | Medium |
+| 143 | [Reorder List](https://leetcode.com/problems/reorder-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/reorder-list) | Medium |
+| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-preorder-traversal) | Medium |
+| 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-postorder-traversal) | Hard |
+| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache) | [Go](https://github.com/openset/leetcode/tree/master/solution/lru-cache) | Hard |
+| 147 | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/insertion-sort-list) | Medium |
+| 148 | [Sort List](https://leetcode.com/problems/sort-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-list) | Medium |
+| 149 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-points-on-a-line) | Hard |
+| 150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | [Go](https://github.com/openset/leetcode/tree/master/solution/evaluate-reverse-polish-notation) | Medium |
+| 151 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string) | Medium |
+| 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-subarray) | Medium |
+| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array) | Medium |
+| 154 | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array-ii) | Hard |
+| 155 | [Min Stack](https://leetcode.com/problems/min-stack) | [Go](https://github.com/openset/leetcode/tree/master/solution/min-stack) | Easy |
+| 156 | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-upside-down) | Medium |
+| 157 | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4) | Easy |
+| 158 | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii---call-multiple-times) | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4-ii---call-multiple-times) | Hard |
+| 159 | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-two-distinct-characters) | Hard |
+| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-linked-lists) | Easy |
+| 161 | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/one-edit-distance) | Medium |
+| 162 | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-peak-element) | Medium |
+| 163 | [Missing Ranges](https://leetcode.com/problems/missing-ranges) | [Go](https://github.com/openset/leetcode/tree/master/solution/missing-ranges) | Medium |
+| 164 | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-gap) | Hard |
+| 165 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/compare-version-numbers) | Medium |
+| 166 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [Go](https://github.com/openset/leetcode/tree/master/solution/fraction-to-recurring-decimal) | Medium |
+| 167 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii---input-array-is-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-ii---input-array-is-sorted) | Easy |
+| 168 | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [Go](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-title) | Easy |
+| 169 | [Majority Element](https://leetcode.com/problems/majority-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/majority-element) | Easy |
+| 170 | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii---data-structure-design) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iii---data-structure-design) | Easy |
+| 171 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-number) | Easy |
+| 172 | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/factorial-trailing-zeroes) | Easy |
+| 173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-search-tree-iterator) | Medium |
+| 174 | [Dungeon Game](https://leetcode.com/problems/dungeon-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/dungeon-game) | Hard |
+| 175 | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | [Go](https://github.com/openset/leetcode/tree/master/solution/combine-two-tables) | Easy |
+| 176 | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/second-highest-salary) | Easy |
+| 177 | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/nth-highest-salary) | Medium |
+| 178 | [Rank Scores](https://leetcode.com/problems/rank-scores) | [Go](https://github.com/openset/leetcode/tree/master/solution/rank-scores) | Medium |
+| 179 | [Largest Number](https://leetcode.com/problems/largest-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-number) | Medium |
+| 180 | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-numbers) | Medium |
+| 181 | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | [Go](https://github.com/openset/leetcode/tree/master/solution/employees-earning-more-than-their-managers) | Easy |
+| 182 | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/solution/duplicate-emails) | Easy |
+| 183 | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/customers-who-never-order) | Easy |
+| 184 | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/department-highest-salary) | Medium |
+| 185 | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [Go](https://github.com/openset/leetcode/tree/master/solution/department-top-three-salaries) | Hard |
+| 186 | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-ii) | Medium |
+| 187 | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-dna-sequences) | Medium |
+| 188 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iv) | Hard |
+| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-array) | Easy |
+| 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-bits) | Easy |
+| 191 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-1-bits) | Easy |
+| 192 | [Word Frequency](https://leetcode.com/problems/word-frequency) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-frequency) | Medium |
+| 193 | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-phone-numbers) | Easy |
+| 194 | [Transpose File](https://leetcode.com/problems/transpose-file) | [Go](https://github.com/openset/leetcode/tree/master/solution/transpose-file) | Medium |
+| 195 | [Tenth Line](https://leetcode.com/problems/tenth-line) | [Go](https://github.com/openset/leetcode/tree/master/solution/tenth-line) | Easy |
+| 196 | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-duplicate-emails) | Easy |
+| 197 | [Rising Temperature](https://leetcode.com/problems/rising-temperature) | [Go](https://github.com/openset/leetcode/tree/master/solution/rising-temperature) | Easy |
+| 198 | [House Robber](https://leetcode.com/problems/house-robber) | [Go](https://github.com/openset/leetcode/tree/master/solution/house-robber) | Easy |
+| 199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-right-side-view) | Medium |
+| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-islands) | Medium |
+| 201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | [Go](https://github.com/openset/leetcode/tree/master/solution/bitwise-and-of-numbers-range) | Medium |
+| 202 | [Happy Number](https://leetcode.com/problems/happy-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/happy-number) | Easy |
+| 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-linked-list-elements) | Easy |
+| 204 | [Count Primes](https://leetcode.com/problems/count-primes) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-primes) | Easy |
+| 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/isomorphic-strings) | Easy |
+| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-linked-list) | Easy |
+| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule) | Medium |
+| 208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-(prefix-tree)) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-trie-(prefix-tree)) | Medium |
+| 209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-size-subarray-sum) | Medium |
+| 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule-ii) | Medium |
+| 211 | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word---data-structure-design) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-and-search-word---data-structure-design) | Medium |
+| 212 | [Word Search II](https://leetcode.com/problems/word-search-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-search-ii) | Hard |
+| 213 | [House Robber II](https://leetcode.com/problems/house-robber-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/house-robber-ii) | Medium |
+| 214 | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-palindrome) | Hard |
+| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-largest-element-in-an-array) | Medium |
+| 216 | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum-iii) | Medium |
+| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [Go](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate) | Easy |
+| 218 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | [Go](https://github.com/openset/leetcode/tree/master/solution/the-skyline-problem) | Hard |
+| 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate-ii) | Easy |
+| 220 | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate-iii) | Medium |
+| 221 | [Maximal Square](https://leetcode.com/problems/maximal-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximal-square) | Medium |
+| 222 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-complete-tree-nodes) | Medium |
+| 223 | [Rectangle Area](https://leetcode.com/problems/rectangle-area) | [Go](https://github.com/openset/leetcode/tree/master/solution/rectangle-area) | Medium |
+| 224 | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator) | Hard |
+| 225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-stack-using-queues) | Easy |
+| 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/invert-binary-tree) | Easy |
+| 227 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-ii) | Medium |
+| 228 | [Summary Ranges](https://leetcode.com/problems/summary-ranges) | [Go](https://github.com/openset/leetcode/tree/master/solution/summary-ranges) | Medium |
+| 229 | [Majority Element II](https://leetcode.com/problems/majority-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/majority-element-ii) | Medium |
+| 230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-element-in-a-bst) | Medium |
+| 231 | [Power of Two](https://leetcode.com/problems/power-of-two) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-two) | Easy |
+| 232 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-queue-using-stacks) | Easy |
+| 233 | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-digit-one) | Hard |
+| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-linked-list) | Easy |
+| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/lowest-common-ancestor-of-a-binary-search-tree) | Easy |
+| 236 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/lowest-common-ancestor-of-a-binary-tree) | Medium |
+| 237 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-node-in-a-linked-list) | Easy |
+| 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | [Go](https://github.com/openset/leetcode/tree/master/solution/product-of-array-except-self) | Medium |
+| 239 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | [Go](https://github.com/openset/leetcode/tree/master/solution/sliding-window-maximum) | Hard |
+| 240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-a-2d-matrix-ii) | Medium |
+| 241 | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/different-ways-to-add-parentheses) | Medium |
+| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-anagram) | Easy |
+| 243 | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance) | Easy |
+| 244 | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-ii) | Medium |
+| 245 | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-iii) | Medium |
+| 246 | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number) | Easy |
+| 247 | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-ii) | Medium |
+| 248 | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-iii) | Hard |
+| 249 | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/group-shifted-strings) | Medium |
+| 250 | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-univalue-subtrees) | Medium |
+| 251 | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-2d-vector) | Medium |
+| 252 | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms) | Easy |
+| 253 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms-ii) | Medium |
+| 254 | [Factor Combinations](https://leetcode.com/problems/factor-combinations) | [Go](https://github.com/openset/leetcode/tree/master/solution/factor-combinations) | Medium |
+| 255 | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-sequence-in-binary-search-tree) | Medium |
+| 256 | [Paint House](https://leetcode.com/problems/paint-house) | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house) | Easy |
+| 257 | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-paths) | Easy |
+| 258 | [Add Digits](https://leetcode.com/problems/add-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-digits) | Easy |
+| 259 | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-smaller) | Medium |
+| 260 | [Single Number III](https://leetcode.com/problems/single-number-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-number-iii) | Medium |
+| 261 | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/graph-valid-tree) | Medium |
+| 262 | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [Go](https://github.com/openset/leetcode/tree/master/solution/trips-and-users) | Hard |
+| 263 | [Ugly Number](https://leetcode.com/problems/ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/ugly-number) | Easy |
+| 264 | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/ugly-number-ii) | Medium |
+| 265 | [Paint House II](https://leetcode.com/problems/paint-house-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house-ii) | Hard |
+| 266 | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation) | Easy |
+| 267 | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation-ii) | Medium |
+| 268 | [Missing Number](https://leetcode.com/problems/missing-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/missing-number) | Easy |
+| 269 | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/alien-dictionary) | Hard |
+| 270 | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value) | Easy |
+| 271 | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-strings) | Medium |
+| 272 | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value-ii) | Hard |
+| 273 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-to-english-words) | Hard |
+| 274 | [H-Index](https://leetcode.com/problems/h-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/h-index) | Medium |
+| 275 | [H-Index II](https://leetcode.com/problems/h-index-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/h-index-ii) | Medium |
+| 276 | [Paint Fence](https://leetcode.com/problems/paint-fence) | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-fence) | Easy |
+| 277 | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-celebrity) | Medium |
+| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version) | [Go](https://github.com/openset/leetcode/tree/master/solution/first-bad-version) | Easy |
+| 279 | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-squares) | Medium |
+| 280 | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort) | Medium |
+| 281 | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/zigzag-iterator) | Medium |
+| 282 | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | [Go](https://github.com/openset/leetcode/tree/master/solution/expression-add-operators) | Hard |
+| 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/move-zeroes) | Easy |
+| 284 | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/peeking-iterator) | Medium |
+| 285 | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/inorder-successor-in-bst) | Medium |
+| 286 | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) | [Go](https://github.com/openset/leetcode/tree/master/solution/walls-and-gates) | Medium |
+| 287 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-duplicate-number) | Medium |
+| 288 | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-word-abbreviation) | Medium |
+| 289 | [Game of Life](https://leetcode.com/problems/game-of-life) | [Go](https://github.com/openset/leetcode/tree/master/solution/game-of-life) | Medium |
+| 290 | [Word Pattern](https://leetcode.com/problems/word-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-pattern) | Easy |
+| 291 | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-pattern-ii) | Hard |
+| 292 | [Nim Game](https://leetcode.com/problems/nim-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/nim-game) | Easy |
+| 293 | [Flip Game](https://leetcode.com/problems/flip-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game) | Easy |
+| 294 | [Flip Game II](https://leetcode.com/problems/flip-game-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game-ii) | Medium |
+| 295 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-median-from-data-stream) | Hard |
+| 296 | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-meeting-point) | Hard |
+| 297 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-binary-tree) | Hard |
+| 298 | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence) | Medium |
+| 299 | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulls-and-cows) | Medium |
+| 300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-increasing-subsequence) | Medium |
+| 301 | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-invalid-parentheses) | Hard |
+| 302 | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rectangle-enclosing-black-pixels) | Hard |
+| 303 | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query---immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query---immutable) | Easy |
+| 304 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d---immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d---immutable) | Medium |
+| 305 | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-islands-ii) | Hard |
+| 306 | [Additive Number](https://leetcode.com/problems/additive-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/additive-number) | Medium |
+| 307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query---mutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query---mutable) | Medium |
+| 308 | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d---mutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d---mutable) | Hard |
+| 309 | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
+| 310 | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-height-trees) | Medium |
+| 311 | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) | [Go](https://github.com/openset/leetcode/tree/master/solution/sparse-matrix-multiplication) | Medium |
+| 312 | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/solution/burst-balloons) | Hard |
+| 313 | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-ugly-number) | Medium |
+| 314 | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-vertical-order-traversal) | Medium |
+| 315 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-of-smaller-numbers-after-self) | Hard |
+| 316 | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicate-letters) | Hard |
+| 317 | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-from-all-buildings) | Hard |
+| 318 | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-word-lengths) | Medium |
+| 319 | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulb-switcher) | Medium |
+| 320 | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) | [Go](https://github.com/openset/leetcode/tree/master/solution/generalized-abbreviation) | Medium |
+| 321 | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/create-maximum-number) | Hard |
+| 322 | [Coin Change](https://leetcode.com/problems/coin-change) | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-change) | Medium |
+| 323 | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-connected-components-in-an-undirected-graph) | Medium |
+| 324 | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort-ii) | Medium |
+| 325 | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-size-subarray-sum-equals-k) | Medium |
+| 326 | [Power of Three](https://leetcode.com/problems/power-of-three) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-three) | Easy |
+| 327 | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-of-range-sum) | Hard |
+| 328 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/odd-even-linked-list) | Medium |
+| 329 | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-increasing-path-in-a-matrix) | Hard |
+| 330 | [Patching Array](https://leetcode.com/problems/patching-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/patching-array) | Hard |
+| 331 | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-serialization-of-a-binary-tree) | Medium |
+| 332 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | [Go](https://github.com/openset/leetcode/tree/master/solution/reconstruct-itinerary) | Medium |
+| 333 | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-bst-subtree) | Medium |
+| 334 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-triplet-subsequence) | Medium |
+| 335 | [Self Crossing](https://leetcode.com/problems/self-crossing) | [Go](https://github.com/openset/leetcode/tree/master/solution/self-crossing) | Hard |
+| 336 | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-pairs) | Hard |
+| 337 | [House Robber III](https://leetcode.com/problems/house-robber-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/house-robber-iii) | Medium |
+| 338 | [Counting Bits](https://leetcode.com/problems/counting-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/counting-bits) | Medium |
+| 339 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum) | Easy |
+| 340 | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-k-distinct-characters) | Hard |
+| 341 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-nested-list-iterator) | Medium |
+| 342 | [Power of Four](https://leetcode.com/problems/power-of-four) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-four) | Easy |
+| 343 | [Integer Break](https://leetcode.com/problems/integer-break) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-break) | Medium |
+| 344 | [Reverse String](https://leetcode.com/problems/reverse-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-string) | Easy |
+| 345 | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-vowels-of-a-string) | Easy |
+| 346 | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) | [Go](https://github.com/openset/leetcode/tree/master/solution/moving-average-from-data-stream) | Easy |
+| 347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-elements) | Medium |
+| 348 | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-tic-tac-toe) | Medium |
+| 349 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays) | Easy |
+| 350 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays-ii) | Easy |
+| 351 | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) | [Go](https://github.com/openset/leetcode/tree/master/solution/android-unlock-patterns) | Medium |
+| 352 | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/data-stream-as-disjoint-intervals) | Hard |
+| 353 | [Design Snake Game](https://leetcode.com/problems/design-snake-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-snake-game) | Medium |
+| 354 | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | [Go](https://github.com/openset/leetcode/tree/master/solution/russian-doll-envelopes) | Hard |
+| 355 | [Design Twitter](https://leetcode.com/problems/design-twitter) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-twitter) | Medium |
+| 356 | [Line Reflection](https://leetcode.com/problems/line-reflection) | [Go](https://github.com/openset/leetcode/tree/master/solution/line-reflection) | Medium |
+| 357 | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-numbers-with-unique-digits) | Medium |
+| 358 | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) | [Go](https://github.com/openset/leetcode/tree/master/solution/rearrange-string-k-distance-apart) | Hard |
+| 359 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) | [Go](https://github.com/openset/leetcode/tree/master/solution/logger-rate-limiter) | Easy |
+| 360 | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-transformed-array) | Medium |
+| 361 | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) | [Go](https://github.com/openset/leetcode/tree/master/solution/bomb-enemy) | Medium |
+| 362 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hit-counter) | Medium |
+| 363 | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-sum-of-rectangle-no-larger-than-k) | Hard |
+| 364 | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum-ii) | Medium |
+| 365 | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem) | [Go](https://github.com/openset/leetcode/tree/master/solution/water-and-jug-problem) | Medium |
+| 366 | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-leaves-of-binary-tree) | Medium |
+| 367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-perfect-square) | Easy |
+| 368 | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-divisible-subset) | Medium |
+| 369 | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/plus-one-linked-list) | Medium |
+| 370 | [Range Addition](https://leetcode.com/problems/range-addition) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-addition) | Medium |
+| 371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-two-integers) | Easy |
+| 372 | [Super Pow](https://leetcode.com/problems/super-pow) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-pow) | Medium |
+| 373 | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-pairs-with-smallest-sums) | Medium |
+| 374 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | [Go](https://github.com/openset/leetcode/tree/master/solution/guess-number-higher-or-lower) | Easy |
+| 375 | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/guess-number-higher-or-lower-ii) | Medium |
+| 376 | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-subsequence) | Medium |
+| 377 | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum-iv) | Medium |
+| 378 | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-element-in-a-sorted-matrix) | Medium |
+| 379 | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-phone-directory) | Medium |
+| 380 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o(1)) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o(1)) | Medium |
+| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o(1)---duplicates-allowed) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o(1)---duplicates-allowed) | Hard |
+| 382 | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-random-node) | Medium |
+| 383 | [Ransom Note](https://leetcode.com/problems/ransom-note) | [Go](https://github.com/openset/leetcode/tree/master/solution/ransom-note) | Easy |
+| 384 | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/shuffle-an-array) | Medium |
+| 385 | [Mini Parser](https://leetcode.com/problems/mini-parser) | [Go](https://github.com/openset/leetcode/tree/master/solution/mini-parser) | Medium |
+| 386 | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/lexicographical-numbers) | Medium |
+| 387 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/first-unique-character-in-a-string) | Easy |
+| 388 | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-absolute-file-path) | Medium |
+| 389 | [Find the Difference](https://leetcode.com/problems/find-the-difference) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-difference) | Easy |
+| 390 | [Elimination Game](https://leetcode.com/problems/elimination-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/elimination-game) | Medium |
+| 391 | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-rectangle) | Hard |
+| 392 | [Is Subsequence](https://leetcode.com/problems/is-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/is-subsequence) | Medium |
+| 393 | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation) | [Go](https://github.com/openset/leetcode/tree/master/solution/utf-8-validation) | Medium |
+| 394 | [Decode String](https://leetcode.com/problems/decode-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/decode-string) | Medium |
+| 395 | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-least-k-repeating-characters) | Medium |
+| 396 | [Rotate Function](https://leetcode.com/problems/rotate-function) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-function) | Medium |
+| 397 | [Integer Replacement](https://leetcode.com/problems/integer-replacement) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-replacement) | Medium |
+| 398 | [Random Pick Index](https://leetcode.com/problems/random-pick-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-index) | Medium |
+| 399 | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | [Go](https://github.com/openset/leetcode/tree/master/solution/evaluate-division) | Medium |
+| 400 | [Nth Digit](https://leetcode.com/problems/nth-digit) | [Go](https://github.com/openset/leetcode/tree/master/solution/nth-digit) | Easy |
+| 401 | [Binary Watch](https://leetcode.com/problems/binary-watch) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-watch) | Easy |
+| 402 | [Remove K Digits](https://leetcode.com/problems/remove-k-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-k-digits) | Medium |
+| 403 | [Frog Jump](https://leetcode.com/problems/frog-jump) | [Go](https://github.com/openset/leetcode/tree/master/solution/frog-jump) | Hard |
+| 404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-left-leaves) | Easy |
+| 405 | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-a-number-to-hexadecimal) | Easy |
+| 406 | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | [Go](https://github.com/openset/leetcode/tree/master/solution/queue-reconstruction-by-height) | Medium |
+| 407 | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/trapping-rain-water-ii) | Hard |
+| 408 | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-abbreviation) | Easy |
+| 409 | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-palindrome) | Easy |
+| 410 | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-largest-sum) | Hard |
+| 411 | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-unique-word-abbreviation) | Hard |
+| 412 | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [Go](https://github.com/openset/leetcode/tree/master/solution/fizz-buzz) | Easy |
+| 413 | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | [Go](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices) | Medium |
+| 414 | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/third-maximum-number) | Easy |
+| 415 | [Add Strings](https://leetcode.com/problems/add-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-strings) | Easy |
+| 416 | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-equal-subset-sum) | Medium |
+| 417 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [Go](https://github.com/openset/leetcode/tree/master/solution/pacific-atlantic-water-flow) | Medium |
+| 418 | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-screen-fitting) | Medium |
+| 419 | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | [Go](https://github.com/openset/leetcode/tree/master/solution/battleships-in-a-board) | Medium |
+| 420 | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker) | [Go](https://github.com/openset/leetcode/tree/master/solution/strong-password-checker) | Hard |
+| 421 | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-xor-of-two-numbers-in-an-array) | Medium |
+| 422 | [Valid Word Square](https://leetcode.com/problems/valid-word-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-square) | Easy |
+| 423 | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english) | [Go](https://github.com/openset/leetcode/tree/master/solution/reconstruct-original-digits-from-english) | Medium |
+| 424 | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-repeating-character-replacement) | Medium |
+| 425 | [Word Squares](https://leetcode.com/problems/word-squares) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-squares) | Hard |
+| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
+| 427 | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-quad-tree) | Easy |
+| 428 | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-n-ary-tree) | Hard |
+| 429 | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-level-order-traversal) | Easy |
+| 430 | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-a-multilevel-doubly-linked-list) | Medium |
+| 431 | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-n-ary-tree-to-binary-tree) | Hard |
+| 432 | [All O`one Data Structure](https://leetcode.com/problems/all-o`one-data-structure) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-o`one-data-structure) | Hard |
+| 433 | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-genetic-mutation) | Medium |
+| 434 | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-segments-in-a-string) | Easy |
+| 435 | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-overlapping-intervals) | Medium |
+| 436 | [Find Right Interval](https://leetcode.com/problems/find-right-interval) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-right-interval) | Medium |
+| 437 | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-iii) | Easy |
+| 438 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-anagrams-in-a-string) | Easy |
+| 439 | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) | [Go](https://github.com/openset/leetcode/tree/master/solution/ternary-expression-parser) | Medium |
+| 440 | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-smallest-in-lexicographical-order) | Hard |
+| 441 | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | [Go](https://github.com/openset/leetcode/tree/master/solution/arranging-coins) | Easy |
+| 442 | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-duplicates-in-an-array) | Medium |
+| 443 | [String Compression](https://leetcode.com/problems/string-compression) | [Go](https://github.com/openset/leetcode/tree/master/solution/string-compression) | Easy |
+| 444 | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) | [Go](https://github.com/openset/leetcode/tree/master/solution/sequence-reconstruction) | Medium |
+| 445 | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers-ii) | Medium |
+| 446 | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii---subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices-ii---subsequence) | Hard |
+| 447 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-boomerangs) | Easy |
+| 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-numbers-disappeared-in-an-array) | Easy |
+| 449 | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-bst) | Medium |
+| 450 | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-node-in-a-bst) | Medium |
+| 451 | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-characters-by-frequency) | Medium |
+| 452 | [Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-number-of-arrows-to-burst-balloons) | Medium |
+| 453 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-moves-to-equal-array-elements) | Easy |
+| 454 | [4Sum II](https://leetcode.com/problems/4sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/4sum-ii) | Medium |
+| 455 | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | [Go](https://github.com/openset/leetcode/tree/master/solution/assign-cookies) | Easy |
+| 456 | [132 Pattern](https://leetcode.com/problems/132-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/132-pattern) | Medium |
+| 457 | [Circular Array Loop](https://leetcode.com/problems/circular-array-loop) | [Go](https://github.com/openset/leetcode/tree/master/solution/circular-array-loop) | Medium |
+| 458 | [Poor Pigs](https://leetcode.com/problems/poor-pigs) | [Go](https://github.com/openset/leetcode/tree/master/solution/poor-pigs) | Easy |
+| 459 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-substring-pattern) | Easy |
+| 460 | [LFU Cache](https://leetcode.com/problems/lfu-cache) | [Go](https://github.com/openset/leetcode/tree/master/solution/lfu-cache) | Hard |
+| 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/hamming-distance) | Easy |
+| 462 | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-moves-to-equal-array-elements-ii) | Medium |
+| 463 | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | [Go](https://github.com/openset/leetcode/tree/master/solution/island-perimeter) | Easy |
+| 464 | [Can I Win](https://leetcode.com/problems/can-i-win) | [Go](https://github.com/openset/leetcode/tree/master/solution/can-i-win) | Medium |
+| 465 | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) | [Go](https://github.com/openset/leetcode/tree/master/solution/optimal-account-balancing) | Hard |
+| 466 | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-the-repetitions) | Hard |
+| 467 | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-substrings-in-wraparound-string) | Medium |
+| 468 | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [Go](https://github.com/openset/leetcode/tree/master/solution/validate-ip-address) | Medium |
+| 469 | [Convex Polygon](https://leetcode.com/problems/convex-polygon) | [Go](https://github.com/openset/leetcode/tree/master/solution/convex-polygon) | Medium |
+| 470 | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10()-using-rand7()) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-rand10()-using-rand7()) | Medium |
+| 471 | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-string-with-shortest-length) | Hard |
+| 472 | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/concatenated-words) | Hard |
+| 473 | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/matchsticks-to-square) | Medium |
+| 474 | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/ones-and-zeroes) | Medium |
+| 475 | [Heaters](https://leetcode.com/problems/heaters) | [Go](https://github.com/openset/leetcode/tree/master/solution/heaters) | Easy |
+| 476 | [Number Complement](https://leetcode.com/problems/number-complement) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-complement) | Easy |
+| 477 | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/total-hamming-distance) | Medium |
+| 478 | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle) | [Go](https://github.com/openset/leetcode/tree/master/solution/generate-random-point-in-a-circle) | Medium |
+| 479 | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-palindrome-product) | Easy |
+| 480 | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median) | [Go](https://github.com/openset/leetcode/tree/master/solution/sliding-window-median) | Hard |
+| 481 | [Magical String](https://leetcode.com/problems/magical-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/magical-string) | Medium |
+| 482 | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [Go](https://github.com/openset/leetcode/tree/master/solution/license-key-formatting) | Easy |
+| 483 | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-good-base) | Hard |
+| 484 | [Find Permutation](https://leetcode.com/problems/find-permutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-permutation) | Medium |
+| 485 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones) | Easy |
+| 486 | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | [Go](https://github.com/openset/leetcode/tree/master/solution/predict-the-winner) | Medium |
+| 487 | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones-ii) | Medium |
+| 488 | [Zuma Game](https://leetcode.com/problems/zuma-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/zuma-game) | Hard |
+| 489 | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) | [Go](https://github.com/openset/leetcode/tree/master/solution/robot-room-cleaner) | Hard |
+| 490 | [The Maze](https://leetcode.com/problems/the-maze) | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze) | Medium |
+| 491 | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-subsequences) | Medium |
+| 492 | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-the-rectangle) | Easy |
+| 493 | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-pairs) | Hard |
+| 494 | [Target Sum](https://leetcode.com/problems/target-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/target-sum) | Medium |
+| 495 | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking) | [Go](https://github.com/openset/leetcode/tree/master/solution/teemo-attacking) | Medium |
+| 496 | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-i) | Easy |
+| 497 | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-point-in-non-overlapping-rectangles) | Medium |
+| 498 | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | [Go](https://github.com/openset/leetcode/tree/master/solution/diagonal-traverse) | Medium |
+| 499 | [The Maze III](https://leetcode.com/problems/the-maze-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-iii) | Hard |
+| 500 | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | [Go](https://github.com/openset/leetcode/tree/master/solution/keyboard-row) | Easy |
+| 501 | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-mode-in-binary-search-tree) | Easy |
+| 502 | [IPO](https://leetcode.com/problems/ipo) | [Go](https://github.com/openset/leetcode/tree/master/solution/ipo) | Hard |
+| 503 | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-ii) | Medium |
+| 504 | [Base 7](https://leetcode.com/problems/base-7) | [Go](https://github.com/openset/leetcode/tree/master/solution/base-7) | Easy |
+| 505 | [The Maze II](https://leetcode.com/problems/the-maze-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-ii) | Medium |
+| 506 | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | [Go](https://github.com/openset/leetcode/tree/master/solution/relative-ranks) | Easy |
+| 507 | [Perfect Number](https://leetcode.com/problems/perfect-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-number) | Easy |
+| 508 | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-frequent-subtree-sum) | Medium |
+| 513 | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-bottom-left-tree-value) | Medium |
+| 514 | [Freedom Trail](https://leetcode.com/problems/freedom-trail) | [Go](https://github.com/openset/leetcode/tree/master/solution/freedom-trail) | Hard |
+| 515 | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-largest-value-in-each-tree-row) | Medium |
+| 516 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-palindromic-subsequence) | Medium |
+| 517 | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-washing-machines) | Hard |
+| 518 | [Coin Change 2](https://leetcode.com/problems/coin-change-2) | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-change-2) | Medium |
+| 519 | [Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-flip-matrix) | Medium |
+| 520 | [Detect Capital](https://leetcode.com/problems/detect-capital) | [Go](https://github.com/openset/leetcode/tree/master/solution/detect-capital) | Easy |
+| 521 | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-uncommon-subsequence-i) | Easy |
+| 522 | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-uncommon-subsequence-ii) | Medium |
+| 523 | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/continuous-subarray-sum) | Medium |
+| 524 | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary-through-deleting) | Medium |
+| 525 | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/contiguous-array) | Medium |
+| 526 | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement) | Medium |
+| 527 | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-abbreviation) | Hard |
+| 528 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-weight) | Medium |
+| 529 | [Minesweeper](https://leetcode.com/problems/minesweeper) | [Go](https://github.com/openset/leetcode/tree/master/solution/minesweeper) | Medium |
+| 530 | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-absolute-difference-in-bst) | Easy |
+| 531 | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-i) | Medium |
+| 532 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-diff-pairs-in-an-array) | Easy |
+| 533 | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-ii) | Medium |
+| 535 | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-tinyurl) | Medium |
+| 536 | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-string) | Medium |
+| 537 | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | [Go](https://github.com/openset/leetcode/tree/master/solution/complex-number-multiplication) | Medium |
+| 538 | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-bst-to-greater-tree) | Easy |
+| 539 | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-time-difference) | Medium |
+| 540 | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-element-in-a-sorted-array) | Medium |
+| 541 | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-string-ii) | Easy |
+| 542 | [01 Matrix](https://leetcode.com/problems/01-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/01-matrix) | Medium |
+| 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/diameter-of-binary-tree) | Easy |
+| 544 | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) | [Go](https://github.com/openset/leetcode/tree/master/solution/output-contest-matches) | Medium |
+| 545 | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/boundary-of-binary-tree) | Medium |
+| 546 | [Remove Boxes](https://leetcode.com/problems/remove-boxes) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-boxes) | Hard |
+| 547 | [Friend Circles](https://leetcode.com/problems/friend-circles) | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-circles) | Medium |
+| 548 | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-with-equal-sum) | Medium |
+| 549 | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence-ii) | Medium |
+| 551 | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-i) | Easy |
+| 552 | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-ii) | Hard |
+| 553 | [Optimal Division](https://leetcode.com/problems/optimal-division) | [Go](https://github.com/openset/leetcode/tree/master/solution/optimal-division) | Medium |
+| 554 | [Brick Wall](https://leetcode.com/problems/brick-wall) | [Go](https://github.com/openset/leetcode/tree/master/solution/brick-wall) | Medium |
+| 555 | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-concatenated-strings) | Medium |
+| 556 | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-iii) | Medium |
+| 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-iii) | Easy |
+| 558 | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection) | [Go](https://github.com/openset/leetcode/tree/master/solution/quad-tree-intersection) | Easy |
+| 559 | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-depth-of-n-ary-tree) | Easy |
+| 560 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/subarray-sum-equals-k) | Medium |
+| 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-partition-i) | Easy |
+| 562 | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-line-of-consecutive-one-in-matrix) | Medium |
+| 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-tilt) | Easy |
+| 564 | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-closest-palindrome) | Hard |
+| 565 | [Array Nesting](https://leetcode.com/problems/array-nesting) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-nesting) | Medium |
+| 566 | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/reshape-the-matrix) | Easy |
+| 567 | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutation-in-string) | Medium |
+| 568 | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-vacation-days) | Hard |
+| 569 | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/median-employee-salary) | Hard |
+| 570 | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) | [Go](https://github.com/openset/leetcode/tree/master/solution/managers-with-at-least-5-direct-reports) | Medium |
+| 571 | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-median-given-frequency-of-numbers) | Hard |
+| 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/subtree-of-another-tree) | Easy |
+| 573 | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) | [Go](https://github.com/openset/leetcode/tree/master/solution/squirrel-simulation) | Medium |
+| 574 | [Winning Candidate](https://leetcode.com/problems/winning-candidate) | [Go](https://github.com/openset/leetcode/tree/master/solution/winning-candidate) | Medium |
+| 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | [Go](https://github.com/openset/leetcode/tree/master/solution/distribute-candies) | Easy |
+| 576 | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/out-of-boundary-paths) | Medium |
+| 577 | [Employee Bonus](https://leetcode.com/problems/employee-bonus) | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-bonus) | Easy |
+| 578 | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) | [Go](https://github.com/openset/leetcode/tree/master/solution/get-highest-answer-rate-question) | Medium |
+| 579 | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-cumulative-salary-of-an-employee) | Hard |
+| 580 | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-student-number-in-departments) | Medium |
+| 581 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-unsorted-continuous-subarray) | Easy |
+| 582 | [Kill Process](https://leetcode.com/problems/kill-process) | [Go](https://github.com/openset/leetcode/tree/master/solution/kill-process) | Medium |
+| 583 | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-operation-for-two-strings) | Medium |
+| 584 | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-customer-referee) | Easy |
+| 585 | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) | [Go](https://github.com/openset/leetcode/tree/master/solution/investments-in-2016) | Medium |
+| 586 | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) | [Go](https://github.com/openset/leetcode/tree/master/solution/customer-placing-the-largest-number-of-orders) | Easy |
+| 587 | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | [Go](https://github.com/openset/leetcode/tree/master/solution/erect-the-fence) | Hard |
+| 588 | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-in-memory-file-system) | Hard |
+| 589 | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-preorder-traversal) | Easy |
+| 590 | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-postorder-traversal) | Easy |
+| 591 | [Tag Validator](https://leetcode.com/problems/tag-validator) | [Go](https://github.com/openset/leetcode/tree/master/solution/tag-validator) | Hard |
+| 592 | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction) | [Go](https://github.com/openset/leetcode/tree/master/solution/fraction-addition-and-subtraction) | Medium |
+| 593 | [Valid Square](https://leetcode.com/problems/valid-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-square) | Medium |
+| 594 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-harmonious-subsequence) | Easy |
+| 595 | [Big Countries](https://leetcode.com/problems/big-countries) | [Go](https://github.com/openset/leetcode/tree/master/solution/big-countries) | Easy |
+| 596 | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [Go](https://github.com/openset/leetcode/tree/master/solution/classes-more-than-5-students) | Easy |
+| 597 | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i:-overall-acceptance-rate) | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-i:-overall-acceptance-rate) | Easy |
+| 598 | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-addition-ii) | Easy |
+| 599 | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-index-sum-of-two-lists) | Easy |
+| 600 | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-negative-integers-without-consecutive-ones) | Hard |
+| 601 | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [Go](https://github.com/openset/leetcode/tree/master/solution/human-traffic-of-stadium) | Hard |
+| 602 | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii:-who-has-the-most-friends) | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-ii:-who-has-the-most-friends) | Medium |
+| 603 | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-available-seats) | Easy |
+| 604 | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-compressed-string-iterator) | Easy |
+| 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [Go](https://github.com/openset/leetcode/tree/master/solution/can-place-flowers) | Easy |
+| 606 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-string-from-binary-tree) | Easy |
+| 607 | [Sales Person](https://leetcode.com/problems/sales-person) | [Go](https://github.com/openset/leetcode/tree/master/solution/sales-person) | Easy |
+| 608 | [Tree Node](https://leetcode.com/problems/tree-node) | [Go](https://github.com/openset/leetcode/tree/master/solution/tree-node) | Medium |
+| 609 | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-file-in-system) | Medium |
+| 610 | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) | [Go](https://github.com/openset/leetcode/tree/master/solution/triangle-judgement) | Easy |
+| 611 | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-triangle-number) | Medium |
+| 612 | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-plane) | Medium |
+| 613 | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-line) | Easy |
+| 614 | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) | [Go](https://github.com/openset/leetcode/tree/master/solution/second-degree-follower) | Medium |
+| 615 | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary:-departments-vs-company) | [Go](https://github.com/openset/leetcode/tree/master/solution/average-salary:-departments-vs-company) | Hard |
+| 616 | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-bold-tag-in-string) | Medium |
+| 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-two-binary-trees) | Easy |
+| 618 | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) | [Go](https://github.com/openset/leetcode/tree/master/solution/students-report-by-geography) | Hard |
+| 619 | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/biggest-single-number) | Easy |
+| 620 | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [Go](https://github.com/openset/leetcode/tree/master/solution/not-boring-movies) | Easy |
+| 621 | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [Go](https://github.com/openset/leetcode/tree/master/solution/task-scheduler) | Medium |
+| 622 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-circular-queue) | Medium |
+| 623 | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-one-row-to-tree) | Medium |
+| 624 | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-distance-in-arrays) | Easy |
+| 625 | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-factorization) | Medium |
+| 626 | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [Go](https://github.com/openset/leetcode/tree/master/solution/exchange-seats) | Medium |
+| 627 | [Swap Salary](https://leetcode.com/problems/swap-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-salary) | Easy |
+| 628 | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-three-numbers) | Easy |
+| 629 | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-inverse-pairs-array) | Hard |
+| 630 | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule-iii) | Hard |
+| 631 | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-excel-sum-formula) | Hard |
+| 632 | [Smallest Range](https://leetcode.com/problems/smallest-range) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-range) | Hard |
+| 633 | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-square-numbers) | Easy |
+| 634 | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-derangement-of-an-array) | Medium |
+| 635 | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-log-storage-system) | Medium |
+| 636 | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | [Go](https://github.com/openset/leetcode/tree/master/solution/exclusive-time-of-functions) | Medium |
+| 637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/average-of-levels-in-binary-tree) | Easy |
+| 638 | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | [Go](https://github.com/openset/leetcode/tree/master/solution/shopping-offers) | Medium |
+| 639 | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/decode-ways-ii) | Hard |
+| 640 | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | [Go](https://github.com/openset/leetcode/tree/master/solution/solve-the-equation) | Medium |
+| 641 | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-circular-deque) | Medium |
+| 642 | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-search-autocomplete-system) | Hard |
+| 643 | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-i) | Easy |
+| 644 | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-ii) | Hard |
+| 645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-mismatch) | Easy |
+| 646 | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-pair-chain) | Medium |
+| 647 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindromic-substrings) | Medium |
+| 648 | [Replace Words](https://leetcode.com/problems/replace-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/replace-words) | Medium |
+| 649 | [Dota2 Senate](https://leetcode.com/problems/dota2-senate) | [Go](https://github.com/openset/leetcode/tree/master/solution/dota2-senate) | Medium |
+| 650 | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/2-keys-keyboard) | Medium |
+| 651 | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/4-keys-keyboard) | Medium |
+| 652 | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-subtrees) | Medium |
+| 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv---input-is-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iv---input-is-a-bst) | Easy |
+| 654 | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-binary-tree) | Medium |
+| 655 | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/print-binary-tree) | Medium |
+| 656 | [Coin Path](https://leetcode.com/problems/coin-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-path) | Hard |
+| 657 | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [Go](https://github.com/openset/leetcode/tree/master/solution/robot-return-to-origin) | Easy |
+| 658 | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-closest-elements) | Medium |
+| 659 | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-into-consecutive-subsequences) | Medium |
+| 660 | [Remove 9](https://leetcode.com/problems/remove-9) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-9) | Hard |
+| 661 | [Image Smoother](https://leetcode.com/problems/image-smoother) | [Go](https://github.com/openset/leetcode/tree/master/solution/image-smoother) | Easy |
+| 662 | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-width-of-binary-tree) | Medium |
+| 663 | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) | [Go](https://github.com/openset/leetcode/tree/master/solution/equal-tree-partition) | Medium |
+| 664 | [Strange Printer](https://leetcode.com/problems/strange-printer) | [Go](https://github.com/openset/leetcode/tree/master/solution/strange-printer) | Hard |
+| 665 | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-decreasing-array) | Easy |
+| 666 | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-iv) | Medium |
+| 667 | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement-ii) | Medium |
+| 668 | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-number-in-multiplication-table) | Hard |
+| 669 | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/trim-a-binary-search-tree) | Easy |
+| 670 | [Maximum Swap](https://leetcode.com/problems/maximum-swap) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-swap) | Medium |
+| 671 | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/second-minimum-node-in-a-binary-tree) | Easy |
+| 672 | [Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulb-switcher-ii) | Medium |
+| 673 | [Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-longest-increasing-subsequence) | Medium |
+| 674 | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-continuous-increasing-subsequence) | Easy |
+| 675 | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event) | [Go](https://github.com/openset/leetcode/tree/master/solution/cut-off-trees-for-golf-event) | Hard |
+| 676 | [Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-magic-dictionary) | Medium |
+| 677 | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/map-sum-pairs) | Medium |
+| 678 | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-parenthesis-string) | Medium |
+| 679 | [24 Game](https://leetcode.com/problems/24-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/24-game) | Hard |
+| 680 | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-palindrome-ii) | Easy |
+| 681 | [Next Closest Time](https://leetcode.com/problems/next-closest-time) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-closest-time) | Medium |
+| 682 | [Baseball Game](https://leetcode.com/problems/baseball-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/baseball-game) | Easy |
+| 683 | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-empty-slots) | Hard |
+| 684 | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | [Go](https://github.com/openset/leetcode/tree/master/solution/redundant-connection) | Medium |
+| 685 | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/redundant-connection-ii) | Hard |
+| 686 | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-string-match) | Easy |
+| 687 | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-univalue-path) | Easy |
+| 688 | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/knight-probability-in-chessboard) | Medium |
+| 689 | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-sum-of-3-non-overlapping-subarrays) | Hard |
+| 690 | [Employee Importance](https://leetcode.com/problems/employee-importance) | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-importance) | Easy |
+| 691 | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/stickers-to-spell-word) | Hard |
+| 692 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-words) | Medium |
+| 693 | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-number-with-alternating-bits) | Easy |
+| 694 | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands) | Medium |
+| 695 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-area-of-island) | Medium |
+| 696 | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-binary-substrings) | Easy |
+| 697 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/degree-of-an-array) | Easy |
+| 698 | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-to-k-equal-sum-subsets) | Medium |
+| 699 | [Falling Squares](https://leetcode.com/problems/falling-squares) | [Go](https://github.com/openset/leetcode/tree/master/solution/falling-squares) | Hard |
+| 700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-a-binary-search-tree) | Easy |
+| 701 | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-binary-search-tree) | Medium |
+| 702 | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-a-sorted-array-of-unknown-size) | Medium |
+| 703 | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-largest-element-in-a-stream) | Easy |
+| 704 | [Binary Search](https://leetcode.com/problems/binary-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-search) | Easy |
+| 705 | [Design HashSet](https://leetcode.com/problems/design-hashset) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hashset) | Easy |
+| 706 | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hashmap) | Easy |
+| 707 | [Design Linked List](https://leetcode.com/problems/design-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-linked-list) | Easy |
+| 708 | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-cyclic-sorted-list) | Medium |
+| 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [Go](https://github.com/openset/leetcode/tree/master/solution/to-lower-case) | Easy |
+| 710 | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-blacklist) | Hard |
+| 711 | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands-ii) | Hard |
+| 712 | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-ascii-delete-sum-for-two-strings) | Medium |
+| 713 | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/subarray-product-less-than-k) | Medium |
+| 714 | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
+| 715 | [Range Module](https://leetcode.com/problems/range-module) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-module) | Hard |
+| 716 | [Max Stack](https://leetcode.com/problems/max-stack) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-stack) | Easy |
+| 717 | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/1-bit-and-2-bit-characters) | Easy |
+| 718 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-repeated-subarray) | Medium |
+| 719 | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-th-smallest-pair-distance) | Hard |
+| 720 | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary) | Easy |
+| 721 | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | [Go](https://github.com/openset/leetcode/tree/master/solution/accounts-merge) | Medium |
+| 722 | [Remove Comments](https://leetcode.com/problems/remove-comments) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-comments) | Medium |
+| 723 | [Candy Crush](https://leetcode.com/problems/candy-crush) | [Go](https://github.com/openset/leetcode/tree/master/solution/candy-crush) | Medium |
+| 724 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-pivot-index) | Easy |
+| 725 | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-linked-list-in-parts) | Medium |
+| 726 | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-atoms) | Hard |
+| 727 | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-window-subsequence) | Hard |
+| 728 | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/self-dividing-numbers) | Easy |
+| 729 | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-i) | Medium |
+| 730 | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-different-palindromic-subsequences) | Hard |
+| 731 | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-ii) | Medium |
+| 732 | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-iii) | Hard |
+| 733 | [Flood Fill](https://leetcode.com/problems/flood-fill) | [Go](https://github.com/openset/leetcode/tree/master/solution/flood-fill) | Easy |
+| 734 | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity) | Easy |
+| 735 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [Go](https://github.com/openset/leetcode/tree/master/solution/asteroid-collision) | Medium |
+| 736 | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression) | [Go](https://github.com/openset/leetcode/tree/master/solution/parse-lisp-expression) | Hard |
+| 737 | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity-ii) | Medium |
+| 738 | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/monotone-increasing-digits) | Medium |
+| 739 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [Go](https://github.com/openset/leetcode/tree/master/solution/daily-temperatures) | Medium |
+| 740 | [Delete and Earn](https://leetcode.com/problems/delete-and-earn) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-and-earn) | Medium |
+| 741 | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup) | [Go](https://github.com/openset/leetcode/tree/master/solution/cherry-pickup) | Hard |
+| 742 | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-leaf-in-a-binary-tree) | Medium |
+| 743 | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | [Go](https://github.com/openset/leetcode/tree/master/solution/network-delay-time) | Easy |
+| 744 | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-smallest-letter-greater-than-target) | Easy |
+| 745 | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/prefix-and-suffix-search) | Hard |
+| 746 | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/min-cost-climbing-stairs) | Easy |
+| 747 | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-number-at-least-twice-of-others) | Easy |
+| 748 | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-completing-word) | Easy |
+| 749 | [Contain Virus](https://leetcode.com/problems/contain-virus) | [Go](https://github.com/openset/leetcode/tree/master/solution/contain-virus) | Hard |
+| 750 | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-corner-rectangles) | Medium |
+| 751 | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) | [Go](https://github.com/openset/leetcode/tree/master/solution/ip-to-cidr) | Easy |
+| 752 | [Open the Lock](https://leetcode.com/problems/open-the-lock) | [Go](https://github.com/openset/leetcode/tree/master/solution/open-the-lock) | Medium |
+| 753 | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | [Go](https://github.com/openset/leetcode/tree/master/solution/cracking-the-safe) | Hard |
+| 754 | [Reach a Number](https://leetcode.com/problems/reach-a-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/reach-a-number) | Easy |
+| 755 | [Pour Water](https://leetcode.com/problems/pour-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/pour-water) | Medium |
+| 756 | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/pyramid-transition-matrix) | Medium |
+| 757 | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-intersection-size-at-least-two) | Hard |
+| 758 | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/bold-words-in-string) | Easy |
+| 759 | [Employee Free Time](https://leetcode.com/problems/employee-free-time) | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-free-time) | Hard |
+| 760 | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-anagram-mappings) | Easy |
+| 761 | [Special Binary String](https://leetcode.com/problems/special-binary-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/special-binary-string) | Hard |
+| 762 | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [Go](https://github.com/openset/leetcode/tree/master/solution/prime-number-of-set-bits-in-binary-representation) | Easy |
+| 763 | [Partition Labels](https://leetcode.com/problems/partition-labels) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-labels) | Medium |
+| 764 | [Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-plus-sign) | Medium |
+| 765 | [Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands) | [Go](https://github.com/openset/leetcode/tree/master/solution/couples-holding-hands) | Hard |
+| 766 | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/toeplitz-matrix) | Easy |
+| 767 | [Reorganize String](https://leetcode.com/problems/reorganize-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reorganize-string) | Medium |
+| 768 | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-chunks-to-make-sorted-ii) | Hard |
+| 769 | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-chunks-to-make-sorted) | Medium |
+| 770 | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iv) | Hard |
+| 771 | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | [Go](https://github.com/openset/leetcode/tree/master/solution/jewels-and-stones) | Easy |
+| 772 | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iii) | Hard |
+| 773 | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle) | [Go](https://github.com/openset/leetcode/tree/master/solution/sliding-puzzle) | Hard |
+| 774 | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-max-distance-to-gas-station) | Hard |
+| 775 | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | [Go](https://github.com/openset/leetcode/tree/master/solution/global-and-local-inversions) | Medium |
+| 776 | [Split BST](https://leetcode.com/problems/split-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-bst) | Medium |
+| 777 | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-adjacent-in-lr-string) | Medium |
+| 778 | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/swim-in-rising-water) | Hard |
+| 779 | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-symbol-in-grammar) | Medium |
+| 780 | [Reaching Points](https://leetcode.com/problems/reaching-points) | [Go](https://github.com/openset/leetcode/tree/master/solution/reaching-points) | Hard |
+| 781 | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest) | [Go](https://github.com/openset/leetcode/tree/master/solution/rabbits-in-forest) | Medium |
+| 782 | [Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/transform-to-chessboard) | Hard |
+| 783 | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-distance-between-bst-nodes) | Easy |
+| 784 | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/letter-case-permutation) | Easy |
+| 785 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite?) | [Go](https://github.com/openset/leetcode/tree/master/solution/is-graph-bipartite?) | Medium |
+| 786 | [K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-smallest-prime-fraction) | Hard |
+| 787 | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops) | [Go](https://github.com/openset/leetcode/tree/master/solution/cheapest-flights-within-k-stops) | Medium |
+| 788 | [Rotated Digits](https://leetcode.com/problems/rotated-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotated-digits) | Easy |
+| 789 | [Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts) | [Go](https://github.com/openset/leetcode/tree/master/solution/escape-the-ghosts) | Medium |
+| 790 | [Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling) | [Go](https://github.com/openset/leetcode/tree/master/solution/domino-and-tromino-tiling) | Medium |
+| 791 | [Custom Sort String](https://leetcode.com/problems/custom-sort-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/custom-sort-string) | Medium |
+| 792 | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-matching-subsequences) | Medium |
+| 793 | [Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function) | [Go](https://github.com/openset/leetcode/tree/master/solution/preimage-size-of-factorial-zeroes-function) | Hard |
+| 794 | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-tic-tac-toe-state) | Medium |
+| 795 | [Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-subarrays-with-bounded-maximum) | Medium |
+| 796 | [Rotate String](https://leetcode.com/problems/rotate-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-string) | Easy |
+| 797 | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-paths-from-source-to-target) | Medium |
+| 798 | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rotation-with-highest-score) | Hard |
+| 799 | [Champagne Tower](https://leetcode.com/problems/champagne-tower) | [Go](https://github.com/openset/leetcode/tree/master/solution/champagne-tower) | Medium |
+| 800 | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) | [Go](https://github.com/openset/leetcode/tree/master/solution/similar-rgb-color) | Easy |
+| 801 | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-swaps-to-make-sequences-increasing) | Medium |
+| 802 | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-eventual-safe-states) | Medium |
+| 803 | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit) | [Go](https://github.com/openset/leetcode/tree/master/solution/bricks-falling-when-hit) | Hard |
+| 804 | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-morse-code-words) | Easy |
+| 805 | [Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-with-same-average) | Hard |
+| 806 | [Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-lines-to-write-string) | Easy |
+| 807 | [Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-increase-to-keep-city-skyline) | Medium |
+| 808 | [Soup Servings](https://leetcode.com/problems/soup-servings) | [Go](https://github.com/openset/leetcode/tree/master/solution/soup-servings) | Medium |
+| 809 | [Expressive Words](https://leetcode.com/problems/expressive-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/expressive-words) | Medium |
+| 810 | [Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/chalkboard-xor-game) | Hard |
+| 811 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count) | [Go](https://github.com/openset/leetcode/tree/master/solution/subdomain-visit-count) | Easy |
+| 812 | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-triangle-area) | Easy |
+| 813 | [Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-sum-of-averages) | Medium |
+| 814 | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-pruning) | Medium |
+| 815 | [Bus Routes](https://leetcode.com/problems/bus-routes) | [Go](https://github.com/openset/leetcode/tree/master/solution/bus-routes) | Hard |
+| 816 | [Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates) | [Go](https://github.com/openset/leetcode/tree/master/solution/ambiguous-coordinates) | Medium |
+| 817 | [Linked List Components](https://leetcode.com/problems/linked-list-components) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-components) | Medium |
+| 818 | [Race Car](https://leetcode.com/problems/race-car) | [Go](https://github.com/openset/leetcode/tree/master/solution/race-car) | Hard |
+| 819 | [Most Common Word](https://leetcode.com/problems/most-common-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-common-word) | Easy |
+| 820 | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/short-encoding-of-words) | Medium |
+| 821 | [Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-to-a-character) | Easy |
+| 822 | [Card Flipping Game](https://leetcode.com/problems/card-flipping-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/card-flipping-game) | Medium |
+| 823 | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-trees-with-factors) | Medium |
+| 824 | [Goat Latin](https://leetcode.com/problems/goat-latin) | [Go](https://github.com/openset/leetcode/tree/master/solution/goat-latin) | Easy |
+| 825 | [Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages) | [Go](https://github.com/openset/leetcode/tree/master/solution/friends-of-appropriate-ages) | Medium |
+| 826 | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-profit-assigning-work) | Medium |
+| 827 | [Making A Large Island](https://leetcode.com/problems/making-a-large-island) | [Go](https://github.com/openset/leetcode/tree/master/solution/making-a-large-island) | Hard |
+| 828 | [Unique Letter String](https://leetcode.com/problems/unique-letter-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-letter-string) | Hard |
+| 829 | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-numbers-sum) | Hard |
+| 830 | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups) | [Go](https://github.com/openset/leetcode/tree/master/solution/positions-of-large-groups) | Easy |
+| 831 | [Masking Personal Information](https://leetcode.com/problems/masking-personal-information) | [Go](https://github.com/openset/leetcode/tree/master/solution/masking-personal-information) | Medium |
+| 832 | [Flipping an Image](https://leetcode.com/problems/flipping-an-image) | [Go](https://github.com/openset/leetcode/tree/master/solution/flipping-an-image) | Easy |
+| 833 | [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-and-replace-in-string) | Medium |
+| 834 | [Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-distances-in-tree) | Hard |
+| 835 | [Image Overlap](https://leetcode.com/problems/image-overlap) | [Go](https://github.com/openset/leetcode/tree/master/solution/image-overlap) | Medium |
+| 836 | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | [Go](https://github.com/openset/leetcode/tree/master/solution/rectangle-overlap) | Easy |
+| 837 | [New 21 Game](https://leetcode.com/problems/new-21-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/new-21-game) | Medium |
+| 838 | [Push Dominoes](https://leetcode.com/problems/push-dominoes) | [Go](https://github.com/openset/leetcode/tree/master/solution/push-dominoes) | Medium |
+| 839 | [Similar String Groups](https://leetcode.com/problems/similar-string-groups) | [Go](https://github.com/openset/leetcode/tree/master/solution/similar-string-groups) | Hard |
+| 840 | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid) | [Go](https://github.com/openset/leetcode/tree/master/solution/magic-squares-in-grid) | Easy |
+| 841 | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms) | [Go](https://github.com/openset/leetcode/tree/master/solution/keys-and-rooms) | Medium |
+| 842 | [Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-into-fibonacci-sequence) | Medium |
+| 843 | [Guess the Word](https://leetcode.com/problems/guess-the-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/guess-the-word) | Hard |
+| 844 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | [Go](https://github.com/openset/leetcode/tree/master/solution/backspace-string-compare) | Easy |
+| 845 | [Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-mountain-in-array) | Medium |
+| 846 | [Hand of Straights](https://leetcode.com/problems/hand-of-straights) | [Go](https://github.com/openset/leetcode/tree/master/solution/hand-of-straights) | Medium |
+| 847 | [Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-path-visiting-all-nodes) | Hard |
+| 848 | [Shifting Letters](https://leetcode.com/problems/shifting-letters) | [Go](https://github.com/openset/leetcode/tree/master/solution/shifting-letters) | Medium |
+| 849 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximize-distance-to-closest-person) | Easy |
+| 850 | [Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/rectangle-area-ii) | Hard |
+| 851 | [Loud and Rich](https://leetcode.com/problems/loud-and-rich) | [Go](https://github.com/openset/leetcode/tree/master/solution/loud-and-rich) | Medium |
+| 852 | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/peak-index-in-a-mountain-array) | Easy |
+| 853 | [Car Fleet](https://leetcode.com/problems/car-fleet) | [Go](https://github.com/openset/leetcode/tree/master/solution/car-fleet) | Medium |
+| 854 | [K-Similar Strings](https://leetcode.com/problems/k-similar-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-similar-strings) | Hard |
+| 855 | [Exam Room](https://leetcode.com/problems/exam-room) | [Go](https://github.com/openset/leetcode/tree/master/solution/exam-room) | Medium |
+| 856 | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/score-of-parentheses) | Medium |
+| 857 | [Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-cost-to-hire-k-workers) | Hard |
+| 858 | [Mirror Reflection](https://leetcode.com/problems/mirror-reflection) | [Go](https://github.com/openset/leetcode/tree/master/solution/mirror-reflection) | Medium |
+| 859 | [Buddy Strings](https://leetcode.com/problems/buddy-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/buddy-strings) | Easy |
+| 860 | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [Go](https://github.com/openset/leetcode/tree/master/solution/lemonade-change) | Easy |
+| 861 | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/score-after-flipping-matrix) | Medium |
+| 862 | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-subarray-with-sum-at-least-k) | Hard |
+| 863 | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-nodes-distance-k-in-binary-tree) | Medium |
+| 864 | [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-path-to-get-all-keys) | Hard |
+| 865 | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-subtree-with-all-the-deepest-nodes) | Medium |
+| 866 | [Prime Palindrome](https://leetcode.com/problems/prime-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/prime-palindrome) | Medium |
+| 867 | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/transpose-matrix) | Easy |
+| 868 | [Binary Gap](https://leetcode.com/problems/binary-gap) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-gap) | Easy |
+| 869 | [Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2) | [Go](https://github.com/openset/leetcode/tree/master/solution/reordered-power-of-2) | Medium |
+| 870 | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle) | [Go](https://github.com/openset/leetcode/tree/master/solution/advantage-shuffle) | Medium |
+| 871 | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-number-of-refueling-stops) | Hard |
+| 872 | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/leaf-similar-trees) | Easy |
+| 873 | [Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/length-of-longest-fibonacci-subsequence) | Medium |
+| 874 | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation) | [Go](https://github.com/openset/leetcode/tree/master/solution/walking-robot-simulation) | Easy |
+| 875 | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas) | [Go](https://github.com/openset/leetcode/tree/master/solution/koko-eating-bananas) | Medium |
+| 876 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/middle-of-the-linked-list) | Easy |
+| 877 | [Stone Game](https://leetcode.com/problems/stone-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/stone-game) | Medium |
+| 878 | [Nth Magical Number](https://leetcode.com/problems/nth-magical-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/nth-magical-number) | Hard |
+| 879 | [Profitable Schemes](https://leetcode.com/problems/profitable-schemes) | [Go](https://github.com/openset/leetcode/tree/master/solution/profitable-schemes) | Hard |
+| 880 | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/decoded-string-at-index) | Medium |
+| 881 | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people) | [Go](https://github.com/openset/leetcode/tree/master/solution/boats-to-save-people) | Medium |
+| 882 | [Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph) | [Go](https://github.com/openset/leetcode/tree/master/solution/reachable-nodes-in-subdivided-graph) | Hard |
+| 883 | [Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/solution/projection-area-of-3d-shapes) | Easy |
+| 884 | [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences) | [Go](https://github.com/openset/leetcode/tree/master/solution/uncommon-words-from-two-sentences) | Easy |
+| 885 | [Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix-iii) | Medium |
+| 886 | [Possible Bipartition](https://leetcode.com/problems/possible-bipartition) | [Go](https://github.com/openset/leetcode/tree/master/solution/possible-bipartition) | Medium |
+| 887 | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-egg-drop) | Hard |
+| 888 | [Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap) | [Go](https://github.com/openset/leetcode/tree/master/solution/fair-candy-swap) | Easy |
+| 889 | [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-preorder-and-postorder-traversal) | Medium |
+| 890 | [Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-and-replace-pattern) | Medium |
+| 891 | [Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-subsequence-widths) | Hard |
+| 892 | [Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/solution/surface-area-of-3d-shapes) | Easy |
+| 893 | [Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/groups-of-special-equivalent-strings) | Easy |
+| 894 | [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-possible-full-binary-trees) | Medium |
+| 895 | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-frequency-stack) | Hard |
+| 896 | [Monotonic Array](https://leetcode.com/problems/monotonic-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/monotonic-array) | Easy |
+| 897 | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-order-search-tree) | Easy |
+| 898 | [Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/bitwise-ors-of-subarrays) | Medium |
+| 899 | [Orderly Queue](https://leetcode.com/problems/orderly-queue) | [Go](https://github.com/openset/leetcode/tree/master/solution/orderly-queue) | Hard |
+| 900 | [RLE Iterator](https://leetcode.com/problems/rle-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/rle-iterator) | Medium |
+| 901 | [Online Stock Span](https://leetcode.com/problems/online-stock-span) | [Go](https://github.com/openset/leetcode/tree/master/solution/online-stock-span) | Medium |
+| 902 | [Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set) | [Go](https://github.com/openset/leetcode/tree/master/solution/numbers-at-most-n-given-digit-set) | Hard |
+| 903 | [Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-permutations-for-di-sequence) | Hard |
+| 904 | [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets) | [Go](https://github.com/openset/leetcode/tree/master/solution/fruit-into-baskets) | Medium |
+| 905 | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-array-by-parity) | Easy |
+| 906 | [Super Palindromes](https://leetcode.com/problems/super-palindromes) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-palindromes) | Hard |
+| 907 | [Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-subarray-minimums) | Medium |
+| 908 | [Smallest Range I](https://leetcode.com/problems/smallest-range-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-range-i) | Easy |
+| 909 | [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders) | [Go](https://github.com/openset/leetcode/tree/master/solution/snakes-and-ladders) | Medium |
+| 910 | [Smallest Range II](https://leetcode.com/problems/smallest-range-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-range-ii) | Medium |
+| 911 | [Online Election](https://leetcode.com/problems/online-election) | [Go](https://github.com/openset/leetcode/tree/master/solution/online-election) | Medium |
+| 913 | [Cat and Mouse](https://leetcode.com/problems/cat-and-mouse) | [Go](https://github.com/openset/leetcode/tree/master/solution/cat-and-mouse) | Hard |
+| 914 | [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | [Go](https://github.com/openset/leetcode/tree/master/solution/x-of-a-kind-in-a-deck-of-cards) | Easy |
+| 915 | [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-array-into-disjoint-intervals) | Medium |
+| 916 | [Word Subsets](https://leetcode.com/problems/word-subsets) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-subsets) | Medium |
+| 917 | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-only-letters) | Easy |
+| 918 | [Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-sum-circular-subarray) | Medium |
+| 919 | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter) | [Go](https://github.com/openset/leetcode/tree/master/solution/complete-binary-tree-inserter) | Medium |
+| 920 | [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-music-playlists) | Hard |
+| 921 | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-add-to-make-parentheses-valid) | Medium |
+| 922 | [Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-array-by-parity-ii) | Easy |
+| 923 | [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity) | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-with-multiplicity) | Medium |
+| 924 | [Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-malware-spread) | Hard |
+| 925 | [Long Pressed Name](https://leetcode.com/problems/long-pressed-name) | [Go](https://github.com/openset/leetcode/tree/master/solution/long-pressed-name) | Easy |
+| 926 | [Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing) | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-string-to-monotone-increasing) | Medium |
+| 927 | [Three Equal Parts](https://leetcode.com/problems/three-equal-parts) | [Go](https://github.com/openset/leetcode/tree/master/solution/three-equal-parts) | Hard |
+| 928 | [Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-malware-spread-ii) | Hard |
+| 929 | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-email-addresses) | Easy |
+| 930 | [Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-subarrays-with-sum) | Medium |
+| 931 | [Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-falling-path-sum) | Medium |
+| 932 | [Beautiful Array](https://leetcode.com/problems/beautiful-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-array) | Medium |
+| 933 | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-recent-calls) | Easy |
+| 934 | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-bridge) | Medium |
+| 935 | [Knight Dialer](https://leetcode.com/problems/knight-dialer) | [Go](https://github.com/openset/leetcode/tree/master/solution/knight-dialer) | Medium |
+| 936 | [Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/stamping-the-sequence) | Hard |
+| 937 | [Reorder Log Files](https://leetcode.com/problems/reorder-log-files) | [Go](https://github.com/openset/leetcode/tree/master/solution/reorder-log-files) | Easy |
+| 938 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-of-bst) | Medium |
+| 939 | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-area-rectangle) | Medium |
+| 940 | [Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/distinct-subsequences-ii) | Hard |
+| 941 | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-mountain-array) | Easy |
+| 942 | [DI String Match](https://leetcode.com/problems/di-string-match) | [Go](https://github.com/openset/leetcode/tree/master/solution/di-string-match) | Easy |
+| 943 | [Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-shortest-superstring) | Hard |
+| 944 | [Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted) | Easy |
+| 945 | [Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-increment-to-make-array-unique) | Medium |
+| 946 | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/validate-stack-sequences) | Medium |
+| 947 | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-stones-removed-with-same-row-or-column) | Medium |
+| 948 | [Bag of Tokens](https://leetcode.com/problems/bag-of-tokens) | [Go](https://github.com/openset/leetcode/tree/master/solution/bag-of-tokens) | Medium |
+| 949 | [Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-time-for-given-digits) | Easy |
+| 950 | [Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/reveal-cards-in-increasing-order) | Medium |
+| 951 | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-equivalent-binary-trees) | Medium |
+| 952 | [Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-component-size-by-common-factor) | Hard |
+| 953 | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/verifying-an-alien-dictionary) | Easy |
+| 954 | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-of-doubled-pairs) | Medium |
+| 955 | [Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted-ii) | Medium |
+| 956 | [Tallest Billboard](https://leetcode.com/problems/tallest-billboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/tallest-billboard) | Hard |

From fc848cf4f08755711f9f80c97655098a18af2b42 Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Sat, 15 Dec 2018 09:43:50 +0800
Subject: [PATCH 06/22] Add: codecov

---
 .gitignore | 1 +
 index.md   | 1 +
 2 files changed, 2 insertions(+)
 create mode 100644 .gitignore

diff --git a/.gitignore b/.gitignore
new file mode 100644
index 000000000..e43b0f988
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1 @@
+.DS_Store
diff --git a/index.md b/index.md
index 7194cd586..913110e2c 100644
--- a/index.md
+++ b/index.md
@@ -3,6 +3,7 @@
 LeetCode Problems' Solutions
 
 [![Build Status](https://travis-ci.org/openset/leetcode.svg?branch=master)](https://travis-ci.org/openset/leetcode)
+[![codecov](https://codecov.io/gh/openset/leetcode/branch/master/graph/badge.svg)](https://codecov.io/gh/openset/leetcode)
 [![Go Report Card](https://goreportcard.com/badge/github.com/openset/leetcode)](https://goreportcard.com/report/github.com/openset/leetcode)
 [![GitHub contributors](https://img.shields.io/github/contributors/openset/leetcode.svg)](https://github.com/openset/leetcode/graphs/contributors)
 [![license](https://img.shields.io/github/license/openset/leetcode.svg)](https://github.com/openset/leetcode/blob/master/LICENSE)

From 20566b1f878bf34c1ef176363b1edffacceab1cd Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Sat, 15 Dec 2018 10:38:42 +0800
Subject: [PATCH 07/22] Fixed: link

---
 index.md | 39 +++++++++++++++++++--------------------
 1 file changed, 19 insertions(+), 20 deletions(-)

diff --git a/index.md b/index.md
index 913110e2c..bc64a29fd 100644
--- a/index.md
+++ b/index.md
@@ -1,5 +1,4 @@
 # [LeetCode](https://openset.github.io/leetcode)
-
 LeetCode Problems' Solutions
 
 [![Build Status](https://travis-ci.org/openset/leetcode.svg?branch=master)](https://travis-ci.org/openset/leetcode)
@@ -18,7 +17,7 @@ LeetCode Problems' Solutions
 | 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-palindromic-substring) | Medium |
 | 6 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | [Go](https://github.com/openset/leetcode/tree/master/solution/zigzag-conversion) | Medium |
 | 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-integer) | Easy |
-| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-(atoi)) | [Go](https://github.com/openset/leetcode/tree/master/solution/string-to-integer-(atoi)) | Medium |
+| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | [Go](https://github.com/openset/leetcode/tree/master/solution/string-to-integer-atoi) | Medium |
 | 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-number) | Easy |
 | 10 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | [Go](https://github.com/openset/leetcode/tree/master/solution/regular-expression-matching) | Hard |
 | 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/container-with-most-water) | Medium |
@@ -79,7 +78,7 @@ LeetCode Problems' Solutions
 | 66 | [Plus One](https://leetcode.com/problems/plus-one) | [Go](https://github.com/openset/leetcode/tree/master/solution/plus-one) | Easy |
 | 67 | [Add Binary](https://leetcode.com/problems/add-binary) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-binary) | Easy |
 | 68 | [Text Justification](https://leetcode.com/problems/text-justification) | [Go](https://github.com/openset/leetcode/tree/master/solution/text-justification) | Hard |
-| 69 | [Sqrt(x)](https://leetcode.com/problems/sqrt(x)) | [Go](https://github.com/openset/leetcode/tree/master/solution/sqrt(x)) | Easy |
+| 69 | [Sqrt(x)](https://leetcode.com/problems/sqrtx) | [Go](https://github.com/openset/leetcode/tree/master/solution/sqrtx) | Easy |
 | 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/climbing-stairs) | Easy |
 | 71 | [Simplify Path](https://leetcode.com/problems/simplify-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/simplify-path) | Medium |
 | 72 | [Edit Distance](https://leetcode.com/problems/edit-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/edit-distance) | Hard |
@@ -128,8 +127,8 @@ LeetCode Problems' Solutions
 | 115 | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/distinct-subsequences) | Hard |
 | 116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | [Go](https://github.com/openset/leetcode/tree/master/solution/populating-next-right-pointers-in-each-node) | Medium |
 | 117 | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/populating-next-right-pointers-in-each-node-ii) | Medium |
-| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascal's-triangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/pascal's-triangle) | Easy |
-| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascal's-triangle-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/pascal's-triangle-ii) | Easy |
+| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/pascals-triangle) | Easy |
+| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/pascals-triangle-ii) | Easy |
 | 120 | [Triangle](https://leetcode.com/problems/triangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/triangle) | Medium |
 | 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock) | Easy |
 | 122 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-ii) | Easy |
@@ -168,7 +167,7 @@ LeetCode Problems' Solutions
 | 155 | [Min Stack](https://leetcode.com/problems/min-stack) | [Go](https://github.com/openset/leetcode/tree/master/solution/min-stack) | Easy |
 | 156 | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-upside-down) | Medium |
 | 157 | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4) | Easy |
-| 158 | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii---call-multiple-times) | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4-ii---call-multiple-times) | Hard |
+| 158 | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4-ii-call-multiple-times) | Hard |
 | 159 | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-two-distinct-characters) | Hard |
 | 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-linked-lists) | Easy |
 | 161 | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/one-edit-distance) | Medium |
@@ -177,10 +176,10 @@ LeetCode Problems' Solutions
 | 164 | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-gap) | Hard |
 | 165 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/compare-version-numbers) | Medium |
 | 166 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [Go](https://github.com/openset/leetcode/tree/master/solution/fraction-to-recurring-decimal) | Medium |
-| 167 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii---input-array-is-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-ii---input-array-is-sorted) | Easy |
+| 167 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-ii-input-array-is-sorted) | Easy |
 | 168 | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [Go](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-title) | Easy |
 | 169 | [Majority Element](https://leetcode.com/problems/majority-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/majority-element) | Easy |
-| 170 | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii---data-structure-design) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iii---data-structure-design) | Easy |
+| 170 | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iii-data-structure-design) | Easy |
 | 171 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-number) | Easy |
 | 172 | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/factorial-trailing-zeroes) | Easy |
 | 173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-search-tree-iterator) | Medium |
@@ -218,10 +217,10 @@ LeetCode Problems' Solutions
 | 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/isomorphic-strings) | Easy |
 | 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-linked-list) | Easy |
 | 207 | [Course Schedule](https://leetcode.com/problems/course-schedule) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule) | Medium |
-| 208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-(prefix-tree)) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-trie-(prefix-tree)) | Medium |
+| 208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-trie-prefix-tree) | Medium |
 | 209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-size-subarray-sum) | Medium |
 | 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule-ii) | Medium |
-| 211 | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word---data-structure-design) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-and-search-word---data-structure-design) | Medium |
+| 211 | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-and-search-word-data-structure-design) | Medium |
 | 212 | [Word Search II](https://leetcode.com/problems/word-search-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-search-ii) | Hard |
 | 213 | [House Robber II](https://leetcode.com/problems/house-robber-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/house-robber-ii) | Medium |
 | 214 | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-palindrome) | Hard |
@@ -313,12 +312,12 @@ LeetCode Problems' Solutions
 | 300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-increasing-subsequence) | Medium |
 | 301 | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-invalid-parentheses) | Hard |
 | 302 | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rectangle-enclosing-black-pixels) | Hard |
-| 303 | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query---immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query---immutable) | Easy |
-| 304 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d---immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d---immutable) | Medium |
+| 303 | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-immutable) | Easy |
+| 304 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-immutablee) | Medium |
 | 305 | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-islands-ii) | Hard |
 | 306 | [Additive Number](https://leetcode.com/problems/additive-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/additive-number) | Medium |
-| 307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query---mutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query---mutable) | Medium |
-| 308 | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d---mutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d---mutable) | Hard |
+| 307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-mutable) | Medium |
+| 308 | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-mutable) | Hard |
 | 309 | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
 | 310 | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-height-trees) | Medium |
 | 311 | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) | [Go](https://github.com/openset/leetcode/tree/master/solution/sparse-matrix-multiplication) | Medium |
@@ -390,8 +389,8 @@ LeetCode Problems' Solutions
 | 377 | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum-iv) | Medium |
 | 378 | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-element-in-a-sorted-matrix) | Medium |
 | 379 | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-phone-directory) | Medium |
-| 380 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o(1)) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o(1)) | Medium |
-| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o(1)---duplicates-allowed) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o(1)---duplicates-allowed) | Hard |
+| 380 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o1) | Medium |
+| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o1-duplicates-allowed) | Hard |
 | 382 | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-random-node) | Medium |
 | 383 | [Ransom Note](https://leetcode.com/problems/ransom-note) | [Go](https://github.com/openset/leetcode/tree/master/solution/ransom-note) | Easy |
 | 384 | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/shuffle-an-array) | Medium |
@@ -456,7 +455,7 @@ LeetCode Problems' Solutions
 | 443 | [String Compression](https://leetcode.com/problems/string-compression) | [Go](https://github.com/openset/leetcode/tree/master/solution/string-compression) | Easy |
 | 444 | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) | [Go](https://github.com/openset/leetcode/tree/master/solution/sequence-reconstruction) | Medium |
 | 445 | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers-ii) | Medium |
-| 446 | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii---subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices-ii---subsequence) | Hard |
+| 446 | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices-ii-subsequence) | Hard |
 | 447 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-boomerangs) | Easy |
 | 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-numbers-disappeared-in-an-array) | Easy |
 | 449 | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-bst) | Medium |
@@ -606,7 +605,7 @@ LeetCode Problems' Solutions
 | 599 | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-index-sum-of-two-lists) | Easy |
 | 600 | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-negative-integers-without-consecutive-ones) | Hard |
 | 601 | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [Go](https://github.com/openset/leetcode/tree/master/solution/human-traffic-of-stadium) | Hard |
-| 602 | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii:-who-has-the-most-friends) | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-ii:-who-has-the-most-friends) | Medium |
+| 602 | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends) | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-ii-who-has-the-most-friends) | Medium |
 | 603 | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-available-seats) | Easy |
 | 604 | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-compressed-string-iterator) | Easy |
 | 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [Go](https://github.com/openset/leetcode/tree/master/solution/can-place-flowers) | Easy |
@@ -657,7 +656,7 @@ LeetCode Problems' Solutions
 | 650 | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/2-keys-keyboard) | Medium |
 | 651 | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/4-keys-keyboard) | Medium |
 | 652 | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-subtrees) | Medium |
-| 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv---input-is-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iv---input-is-a-bst) | Easy |
+| 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iv-input-is-a-bst) | Easy |
 | 654 | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-binary-tree) | Medium |
 | 655 | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/print-binary-tree) | Medium |
 | 656 | [Coin Path](https://leetcode.com/problems/coin-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-path) | Hard |
@@ -789,7 +788,7 @@ LeetCode Problems' Solutions
 | 782 | [Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/transform-to-chessboard) | Hard |
 | 783 | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-distance-between-bst-nodes) | Easy |
 | 784 | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/letter-case-permutation) | Easy |
-| 785 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite?) | [Go](https://github.com/openset/leetcode/tree/master/solution/is-graph-bipartite?) | Medium |
+| 785 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite) | [Go](https://github.com/openset/leetcode/tree/master/solution/is-graph-bipartite) | Medium |
 | 786 | [K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-smallest-prime-fraction) | Hard |
 | 787 | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops) | [Go](https://github.com/openset/leetcode/tree/master/solution/cheapest-flights-within-k-stops) | Medium |
 | 788 | [Rotated Digits](https://leetcode.com/problems/rotated-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotated-digits) | Easy |

From 050606861ba48295647c925acfa80d9935f7e96f Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Mon, 17 Dec 2018 19:07:15 +0800
Subject: [PATCH 08/22] Add: problems all

---
 index.md | 18 +++++++++++-------
 1 file changed, 11 insertions(+), 7 deletions(-)

diff --git a/index.md b/index.md
index bc64a29fd..21ae46aa5 100644
--- a/index.md
+++ b/index.md
@@ -37,7 +37,7 @@ LeetCode Problems' Solutions
 | 25 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-nodes-in-k-group) | Hard |
 | 26 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-array) | Easy |
 | 27 | [Remove Element](https://leetcode.com/problems/remove-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-element) | Easy |
-| 28 | [Implement strStr()](https://leetcode.com/problems/implement-strstr()) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-strstr()) | Easy |
+| 28 | [Implement strStr()](https://leetcode.com/problems/implement-strstr) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-strstr) | Easy |
 | 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/solution/divide-two-integers) | Medium |
 | 30 | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/substring-with-concatenation-of-all-words) | Hard |
 | 31 | [Next Permutation](https://leetcode.com/problems/next-permutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-permutation) | Medium |
@@ -313,7 +313,7 @@ LeetCode Problems' Solutions
 | 301 | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-invalid-parentheses) | Hard |
 | 302 | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rectangle-enclosing-black-pixels) | Hard |
 | 303 | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-immutable) | Easy |
-| 304 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-immutablee) | Medium |
+| 304 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-immutable) | Medium |
 | 305 | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-islands-ii) | Hard |
 | 306 | [Additive Number](https://leetcode.com/problems/additive-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/additive-number) | Medium |
 | 307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-mutable) | Medium |
@@ -441,7 +441,7 @@ LeetCode Problems' Solutions
 | 429 | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-level-order-traversal) | Easy |
 | 430 | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-a-multilevel-doubly-linked-list) | Medium |
 | 431 | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-n-ary-tree-to-binary-tree) | Hard |
-| 432 | [All O`one Data Structure](https://leetcode.com/problems/all-o`one-data-structure) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-o`one-data-structure) | Hard |
+| 432 | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-oone-data-structure) | Hard |
 | 433 | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-genetic-mutation) | Medium |
 | 434 | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-segments-in-a-string) | Easy |
 | 435 | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-overlapping-intervals) | Medium |
@@ -479,7 +479,7 @@ LeetCode Problems' Solutions
 | 467 | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-substrings-in-wraparound-string) | Medium |
 | 468 | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [Go](https://github.com/openset/leetcode/tree/master/solution/validate-ip-address) | Medium |
 | 469 | [Convex Polygon](https://leetcode.com/problems/convex-polygon) | [Go](https://github.com/openset/leetcode/tree/master/solution/convex-polygon) | Medium |
-| 470 | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10()-using-rand7()) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-rand10()-using-rand7()) | Medium |
+| 470 | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-rand10-using-rand7) | Medium |
 | 471 | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-string-with-shortest-length) | Hard |
 | 472 | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/concatenated-words) | Hard |
 | 473 | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/matchsticks-to-square) | Medium |
@@ -526,7 +526,7 @@ LeetCode Problems' Solutions
 | 518 | [Coin Change 2](https://leetcode.com/problems/coin-change-2) | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-change-2) | Medium |
 | 519 | [Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-flip-matrix) | Medium |
 | 520 | [Detect Capital](https://leetcode.com/problems/detect-capital) | [Go](https://github.com/openset/leetcode/tree/master/solution/detect-capital) | Easy |
-| 521 | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-uncommon-subsequence-i) | Easy |
+| 521 | [Longest Uncommon Subsequence I ](https://leetcode.com/problems/longest-uncommon-subsequence-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-uncommon-subsequence-i) | Easy |
 | 522 | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-uncommon-subsequence-ii) | Medium |
 | 523 | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/continuous-subarray-sum) | Medium |
 | 524 | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary-through-deleting) | Medium |
@@ -600,7 +600,7 @@ LeetCode Problems' Solutions
 | 594 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-harmonious-subsequence) | Easy |
 | 595 | [Big Countries](https://leetcode.com/problems/big-countries) | [Go](https://github.com/openset/leetcode/tree/master/solution/big-countries) | Easy |
 | 596 | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [Go](https://github.com/openset/leetcode/tree/master/solution/classes-more-than-5-students) | Easy |
-| 597 | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i:-overall-acceptance-rate) | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-i:-overall-acceptance-rate) | Easy |
+| 597 | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-i-overall-acceptance-rate) | Easy |
 | 598 | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-addition-ii) | Easy |
 | 599 | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-index-sum-of-two-lists) | Easy |
 | 600 | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-negative-integers-without-consecutive-ones) | Hard |
@@ -618,7 +618,7 @@ LeetCode Problems' Solutions
 | 612 | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-plane) | Medium |
 | 613 | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-line) | Easy |
 | 614 | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) | [Go](https://github.com/openset/leetcode/tree/master/solution/second-degree-follower) | Medium |
-| 615 | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary:-departments-vs-company) | [Go](https://github.com/openset/leetcode/tree/master/solution/average-salary:-departments-vs-company) | Hard |
+| 615 | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) | [Go](https://github.com/openset/leetcode/tree/master/solution/average-salary-departments-vs-company) | Hard |
 | 616 | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-bold-tag-in-string) | Medium |
 | 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-two-binary-trees) | Easy |
 | 618 | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) | [Go](https://github.com/openset/leetcode/tree/master/solution/students-report-by-geography) | Hard |
@@ -959,3 +959,7 @@ LeetCode Problems' Solutions
 | 954 | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-of-doubled-pairs) | Medium |
 | 955 | [Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted-ii) | Medium |
 | 956 | [Tallest Billboard](https://leetcode.com/problems/tallest-billboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/tallest-billboard) | Hard |
+| 957 | [Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days) | [Go](https://github.com/openset/leetcode/tree/master/solution/prison-cells-after-n-days) | Medium |
+| 958 | [Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/check-completeness-of-a-binary-tree) | Medium |
+| 959 | [Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes) | [Go](https://github.com/openset/leetcode/tree/master/solution/regions-cut-by-slashes) | Medium |
+| 960 | [Delete Columns to Make Sorted III](https://leetcode.com/problems/delete-columns-to-make-sorted-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted-iii) | Hard |

From 59bb953eba7469c4644e8e3fc6b6213a5f64c19d Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Wed, 19 Dec 2018 22:54:17 +0800
Subject: [PATCH 09/22] Update: index

---
 index.md | 1908 +++++++++++++++++++++++++++---------------------------
 1 file changed, 955 insertions(+), 953 deletions(-)

diff --git a/index.md b/index.md
index 21ae46aa5..426bd70de 100644
--- a/index.md
+++ b/index.md
@@ -1,3 +1,5 @@
+<!--This file generated by command(leetcode readme); DO NOT EDIT.-->
+
 # [LeetCode](https://openset.github.io/leetcode)
 LeetCode Problems' Solutions
 
@@ -10,956 +12,956 @@ LeetCode Problems' Solutions
 
 | # | Title | Solution | Difficulty |
 | :-: | - | - | :-: |
-| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum) | Easy |
-| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers) | Medium |
-| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-without-repeating-characters) | Medium |
-| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/median-of-two-sorted-arrays) | Hard |
-| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-palindromic-substring) | Medium |
-| 6 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | [Go](https://github.com/openset/leetcode/tree/master/solution/zigzag-conversion) | Medium |
-| 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-integer) | Easy |
-| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | [Go](https://github.com/openset/leetcode/tree/master/solution/string-to-integer-atoi) | Medium |
-| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-number) | Easy |
-| 10 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | [Go](https://github.com/openset/leetcode/tree/master/solution/regular-expression-matching) | Hard |
-| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/container-with-most-water) | Medium |
-| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-to-roman) | Medium |
-| 13 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | [Go](https://github.com/openset/leetcode/tree/master/solution/roman-to-integer) | Easy |
-| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-common-prefix) | Easy |
-| 15 | [3Sum](https://leetcode.com/problems/3sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum) | Medium |
-| 16 | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-closest) | Medium |
-| 17 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/letter-combinations-of-a-phone-number) | Medium |
-| 18 | [4Sum](https://leetcode.com/problems/4sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/4sum) | Medium |
-| 19 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-nth-node-from-end-of-list) | Medium |
-| 20 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-parentheses) | Easy |
-| 21 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-two-sorted-lists) | Easy |
-| 22 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/generate-parentheses) | Medium |
-| 23 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-k-sorted-lists) | Hard |
-| 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-nodes-in-pairs) | Medium |
-| 25 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-nodes-in-k-group) | Hard |
-| 26 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-array) | Easy |
-| 27 | [Remove Element](https://leetcode.com/problems/remove-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-element) | Easy |
-| 28 | [Implement strStr()](https://leetcode.com/problems/implement-strstr) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-strstr) | Easy |
-| 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/solution/divide-two-integers) | Medium |
-| 30 | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/substring-with-concatenation-of-all-words) | Hard |
-| 31 | [Next Permutation](https://leetcode.com/problems/next-permutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-permutation) | Medium |
-| 32 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-valid-parentheses) | Hard |
-| 33 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-rotated-sorted-array) | Medium |
-| 34 | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-first-and-last-position-of-element-in-sorted-array) | Medium |
-| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-insert-position) | Easy |
-| 36 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-sudoku) | Medium |
-| 37 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | [Go](https://github.com/openset/leetcode/tree/master/solution/sudoku-solver) | Hard |
-| 38 | [Count and Say](https://leetcode.com/problems/count-and-say) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-and-say) | Easy |
-| 39 | [Combination Sum](https://leetcode.com/problems/combination-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum) | Medium |
-| 40 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum-ii) | Medium |
-| 41 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | [Go](https://github.com/openset/leetcode/tree/master/solution/first-missing-positive) | Hard |
-| 42 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/trapping-rain-water) | Hard |
-| 43 | [Multiply Strings](https://leetcode.com/problems/multiply-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/multiply-strings) | Medium |
-| 44 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | [Go](https://github.com/openset/leetcode/tree/master/solution/wildcard-matching) | Hard |
-| 45 | [Jump Game II](https://leetcode.com/problems/jump-game-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/jump-game-ii) | Hard |
-| 46 | [Permutations](https://leetcode.com/problems/permutations) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutations) | Medium |
-| 47 | [Permutations II](https://leetcode.com/problems/permutations-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutations-ii) | Medium |
-| 48 | [Rotate Image](https://leetcode.com/problems/rotate-image) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-image) | Medium |
-| 49 | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | [Go](https://github.com/openset/leetcode/tree/master/solution/group-anagrams) | Medium |
-| 50 | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [Go](https://github.com/openset/leetcode/tree/master/solution/powx-n) | Medium |
-| 51 | [N-Queens](https://leetcode.com/problems/n-queens) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-queens) | Hard |
-| 52 | [N-Queens II](https://leetcode.com/problems/n-queens-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-queens-ii) | Hard |
-| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-subarray) | Easy |
-| 54 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix) | Medium |
-| 55 | [Jump Game](https://leetcode.com/problems/jump-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/jump-game) | Medium |
-| 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-intervals) | Medium |
-| 57 | [Insert Interval](https://leetcode.com/problems/insert-interval) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-interval) | Hard |
-| 58 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/length-of-last-word) | Easy |
-| 59 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix-ii) | Medium |
-| 60 | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutation-sequence) | Medium |
-| 61 | [Rotate List](https://leetcode.com/problems/rotate-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-list) | Medium |
-| 62 | [Unique Paths](https://leetcode.com/problems/unique-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-paths) | Medium |
-| 63 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-paths-ii) | Medium |
-| 64 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-path-sum) | Medium |
-| 65 | [Valid Number](https://leetcode.com/problems/valid-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-number) | Hard |
-| 66 | [Plus One](https://leetcode.com/problems/plus-one) | [Go](https://github.com/openset/leetcode/tree/master/solution/plus-one) | Easy |
-| 67 | [Add Binary](https://leetcode.com/problems/add-binary) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-binary) | Easy |
-| 68 | [Text Justification](https://leetcode.com/problems/text-justification) | [Go](https://github.com/openset/leetcode/tree/master/solution/text-justification) | Hard |
-| 69 | [Sqrt(x)](https://leetcode.com/problems/sqrtx) | [Go](https://github.com/openset/leetcode/tree/master/solution/sqrtx) | Easy |
-| 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/climbing-stairs) | Easy |
-| 71 | [Simplify Path](https://leetcode.com/problems/simplify-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/simplify-path) | Medium |
-| 72 | [Edit Distance](https://leetcode.com/problems/edit-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/edit-distance) | Hard |
-| 73 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-matrix-zeroes) | Medium |
-| 74 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-a-2d-matrix) | Medium |
-| 75 | [Sort Colors](https://leetcode.com/problems/sort-colors) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-colors) | Medium |
-| 76 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-window-substring) | Hard |
-| 77 | [Combinations](https://leetcode.com/problems/combinations) | [Go](https://github.com/openset/leetcode/tree/master/solution/combinations) | Medium |
-| 78 | [Subsets](https://leetcode.com/problems/subsets) | [Go](https://github.com/openset/leetcode/tree/master/solution/subsets) | Medium |
-| 79 | [Word Search](https://leetcode.com/problems/word-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-search) | Medium |
-| 80 | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-array-ii) | Medium |
-| 81 | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-rotated-sorted-array-ii) | Medium |
-| 82 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-list-ii) | Medium |
-| 83 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-list) | Easy |
-| 84 | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-rectangle-in-histogram) | Hard |
-| 85 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximal-rectangle) | Hard |
-| 86 | [Partition List](https://leetcode.com/problems/partition-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-list) | Medium |
-| 87 | [Scramble String](https://leetcode.com/problems/scramble-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/scramble-string) | Hard |
-| 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-sorted-array) | Easy |
-| 89 | [Gray Code](https://leetcode.com/problems/gray-code) | [Go](https://github.com/openset/leetcode/tree/master/solution/gray-code) | Medium |
-| 90 | [Subsets II](https://leetcode.com/problems/subsets-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/subsets-ii) | Medium |
-| 91 | [Decode Ways](https://leetcode.com/problems/decode-ways) | [Go](https://github.com/openset/leetcode/tree/master/solution/decode-ways) | Medium |
-| 92 | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-linked-list-ii) | Medium |
-| 93 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | [Go](https://github.com/openset/leetcode/tree/master/solution/restore-ip-addresses) | Medium |
-| 94 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-inorder-traversal) | Medium |
-| 95 | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-binary-search-trees-ii) | Medium |
-| 96 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-binary-search-trees) | Medium |
-| 97 | [Interleaving String](https://leetcode.com/problems/interleaving-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/interleaving-string) | Hard |
-| 98 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/validate-binary-search-tree) | Medium |
-| 99 | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/recover-binary-search-tree) | Hard |
-| 100 | [Same Tree](https://leetcode.com/problems/same-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/same-tree) | Easy |
-| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/symmetric-tree) | Easy |
-| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-level-order-traversal) | Medium |
-| 103 | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-zigzag-level-order-traversal) | Medium |
-| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-depth-of-binary-tree) | Easy |
-| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium |
-| 106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-inorder-and-postorder-traversal) | Medium |
-| 107 | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-level-order-traversal-ii) | Easy |
-| 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-sorted-array-to-binary-search-tree) | Easy |
-| 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-sorted-list-to-binary-search-tree) | Medium |
-| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/balanced-binary-tree) | Easy |
-| 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-depth-of-binary-tree) | Easy |
-| 112 | [Path Sum](https://leetcode.com/problems/path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum) | Easy |
-| 113 | [Path Sum II](https://leetcode.com/problems/path-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-ii) | Medium |
-| 114 | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-binary-tree-to-linked-list) | Medium |
-| 115 | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/distinct-subsequences) | Hard |
-| 116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | [Go](https://github.com/openset/leetcode/tree/master/solution/populating-next-right-pointers-in-each-node) | Medium |
-| 117 | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/populating-next-right-pointers-in-each-node-ii) | Medium |
-| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/pascals-triangle) | Easy |
-| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/pascals-triangle-ii) | Easy |
-| 120 | [Triangle](https://leetcode.com/problems/triangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/triangle) | Medium |
-| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock) | Easy |
-| 122 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-ii) | Easy |
-| 123 | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iii) | Hard |
-| 124 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-maximum-path-sum) | Hard |
-| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-palindrome) | Easy |
-| 126 | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-ladder-ii) | Hard |
-| 127 | [Word Ladder](https://leetcode.com/problems/word-ladder) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-ladder) | Medium |
-| 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-consecutive-sequence) | Hard |
-| 129 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-root-to-leaf-numbers) | Medium |
-| 130 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions) | [Go](https://github.com/openset/leetcode/tree/master/solution/surrounded-regions) | Medium |
-| 131 | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-partitioning) | Medium |
-| 132 | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-partitioning-ii) | Hard |
-| 133 | [Clone Graph](https://leetcode.com/problems/clone-graph) | [Go](https://github.com/openset/leetcode/tree/master/solution/clone-graph) | Medium |
-| 134 | [Gas Station](https://leetcode.com/problems/gas-station) | [Go](https://github.com/openset/leetcode/tree/master/solution/gas-station) | Medium |
-| 135 | [Candy](https://leetcode.com/problems/candy) | [Go](https://github.com/openset/leetcode/tree/master/solution/candy) | Hard |
-| 136 | [Single Number](https://leetcode.com/problems/single-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-number) | Easy |
-| 137 | [Single Number II](https://leetcode.com/problems/single-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-number-ii) | Medium |
-| 138 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | [Go](https://github.com/openset/leetcode/tree/master/solution/copy-list-with-random-pointer) | Medium |
-| 139 | [Word Break](https://leetcode.com/problems/word-break) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-break) | Medium |
-| 140 | [Word Break II](https://leetcode.com/problems/word-break-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-break-ii) | Hard |
-| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-cycle) | Easy |
-| 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-cycle-ii) | Medium |
-| 143 | [Reorder List](https://leetcode.com/problems/reorder-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/reorder-list) | Medium |
-| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-preorder-traversal) | Medium |
-| 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-postorder-traversal) | Hard |
-| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache) | [Go](https://github.com/openset/leetcode/tree/master/solution/lru-cache) | Hard |
-| 147 | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/insertion-sort-list) | Medium |
-| 148 | [Sort List](https://leetcode.com/problems/sort-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-list) | Medium |
-| 149 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-points-on-a-line) | Hard |
-| 150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | [Go](https://github.com/openset/leetcode/tree/master/solution/evaluate-reverse-polish-notation) | Medium |
-| 151 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string) | Medium |
-| 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-subarray) | Medium |
-| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array) | Medium |
-| 154 | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array-ii) | Hard |
-| 155 | [Min Stack](https://leetcode.com/problems/min-stack) | [Go](https://github.com/openset/leetcode/tree/master/solution/min-stack) | Easy |
-| 156 | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-upside-down) | Medium |
-| 157 | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4) | Easy |
-| 158 | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4-ii-call-multiple-times) | Hard |
-| 159 | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-two-distinct-characters) | Hard |
-| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-linked-lists) | Easy |
-| 161 | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/one-edit-distance) | Medium |
-| 162 | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-peak-element) | Medium |
-| 163 | [Missing Ranges](https://leetcode.com/problems/missing-ranges) | [Go](https://github.com/openset/leetcode/tree/master/solution/missing-ranges) | Medium |
-| 164 | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-gap) | Hard |
-| 165 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/compare-version-numbers) | Medium |
-| 166 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [Go](https://github.com/openset/leetcode/tree/master/solution/fraction-to-recurring-decimal) | Medium |
-| 167 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-ii-input-array-is-sorted) | Easy |
-| 168 | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [Go](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-title) | Easy |
-| 169 | [Majority Element](https://leetcode.com/problems/majority-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/majority-element) | Easy |
-| 170 | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iii-data-structure-design) | Easy |
-| 171 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-number) | Easy |
-| 172 | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/factorial-trailing-zeroes) | Easy |
-| 173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-search-tree-iterator) | Medium |
-| 174 | [Dungeon Game](https://leetcode.com/problems/dungeon-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/dungeon-game) | Hard |
-| 175 | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | [Go](https://github.com/openset/leetcode/tree/master/solution/combine-two-tables) | Easy |
-| 176 | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/second-highest-salary) | Easy |
-| 177 | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/nth-highest-salary) | Medium |
-| 178 | [Rank Scores](https://leetcode.com/problems/rank-scores) | [Go](https://github.com/openset/leetcode/tree/master/solution/rank-scores) | Medium |
-| 179 | [Largest Number](https://leetcode.com/problems/largest-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-number) | Medium |
-| 180 | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-numbers) | Medium |
-| 181 | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | [Go](https://github.com/openset/leetcode/tree/master/solution/employees-earning-more-than-their-managers) | Easy |
-| 182 | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/solution/duplicate-emails) | Easy |
-| 183 | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/customers-who-never-order) | Easy |
-| 184 | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/department-highest-salary) | Medium |
-| 185 | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [Go](https://github.com/openset/leetcode/tree/master/solution/department-top-three-salaries) | Hard |
-| 186 | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-ii) | Medium |
-| 187 | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-dna-sequences) | Medium |
-| 188 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iv) | Hard |
-| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-array) | Easy |
-| 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-bits) | Easy |
-| 191 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-1-bits) | Easy |
-| 192 | [Word Frequency](https://leetcode.com/problems/word-frequency) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-frequency) | Medium |
-| 193 | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-phone-numbers) | Easy |
-| 194 | [Transpose File](https://leetcode.com/problems/transpose-file) | [Go](https://github.com/openset/leetcode/tree/master/solution/transpose-file) | Medium |
-| 195 | [Tenth Line](https://leetcode.com/problems/tenth-line) | [Go](https://github.com/openset/leetcode/tree/master/solution/tenth-line) | Easy |
-| 196 | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-duplicate-emails) | Easy |
-| 197 | [Rising Temperature](https://leetcode.com/problems/rising-temperature) | [Go](https://github.com/openset/leetcode/tree/master/solution/rising-temperature) | Easy |
-| 198 | [House Robber](https://leetcode.com/problems/house-robber) | [Go](https://github.com/openset/leetcode/tree/master/solution/house-robber) | Easy |
-| 199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-right-side-view) | Medium |
-| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-islands) | Medium |
-| 201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | [Go](https://github.com/openset/leetcode/tree/master/solution/bitwise-and-of-numbers-range) | Medium |
-| 202 | [Happy Number](https://leetcode.com/problems/happy-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/happy-number) | Easy |
-| 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-linked-list-elements) | Easy |
-| 204 | [Count Primes](https://leetcode.com/problems/count-primes) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-primes) | Easy |
-| 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/isomorphic-strings) | Easy |
-| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-linked-list) | Easy |
-| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule) | Medium |
-| 208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-trie-prefix-tree) | Medium |
-| 209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-size-subarray-sum) | Medium |
-| 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule-ii) | Medium |
-| 211 | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-and-search-word-data-structure-design) | Medium |
-| 212 | [Word Search II](https://leetcode.com/problems/word-search-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-search-ii) | Hard |
-| 213 | [House Robber II](https://leetcode.com/problems/house-robber-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/house-robber-ii) | Medium |
-| 214 | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-palindrome) | Hard |
-| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-largest-element-in-an-array) | Medium |
-| 216 | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum-iii) | Medium |
-| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [Go](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate) | Easy |
-| 218 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | [Go](https://github.com/openset/leetcode/tree/master/solution/the-skyline-problem) | Hard |
-| 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate-ii) | Easy |
-| 220 | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate-iii) | Medium |
-| 221 | [Maximal Square](https://leetcode.com/problems/maximal-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximal-square) | Medium |
-| 222 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-complete-tree-nodes) | Medium |
-| 223 | [Rectangle Area](https://leetcode.com/problems/rectangle-area) | [Go](https://github.com/openset/leetcode/tree/master/solution/rectangle-area) | Medium |
-| 224 | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator) | Hard |
-| 225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-stack-using-queues) | Easy |
-| 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/invert-binary-tree) | Easy |
-| 227 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-ii) | Medium |
-| 228 | [Summary Ranges](https://leetcode.com/problems/summary-ranges) | [Go](https://github.com/openset/leetcode/tree/master/solution/summary-ranges) | Medium |
-| 229 | [Majority Element II](https://leetcode.com/problems/majority-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/majority-element-ii) | Medium |
-| 230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-element-in-a-bst) | Medium |
-| 231 | [Power of Two](https://leetcode.com/problems/power-of-two) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-two) | Easy |
-| 232 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-queue-using-stacks) | Easy |
-| 233 | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-digit-one) | Hard |
-| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-linked-list) | Easy |
-| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/lowest-common-ancestor-of-a-binary-search-tree) | Easy |
-| 236 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/lowest-common-ancestor-of-a-binary-tree) | Medium |
-| 237 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-node-in-a-linked-list) | Easy |
-| 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | [Go](https://github.com/openset/leetcode/tree/master/solution/product-of-array-except-self) | Medium |
-| 239 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | [Go](https://github.com/openset/leetcode/tree/master/solution/sliding-window-maximum) | Hard |
-| 240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-a-2d-matrix-ii) | Medium |
-| 241 | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/different-ways-to-add-parentheses) | Medium |
-| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-anagram) | Easy |
-| 243 | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance) | Easy |
-| 244 | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-ii) | Medium |
-| 245 | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-iii) | Medium |
-| 246 | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number) | Easy |
-| 247 | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-ii) | Medium |
-| 248 | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-iii) | Hard |
-| 249 | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/group-shifted-strings) | Medium |
-| 250 | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-univalue-subtrees) | Medium |
-| 251 | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-2d-vector) | Medium |
-| 252 | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms) | Easy |
-| 253 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms-ii) | Medium |
-| 254 | [Factor Combinations](https://leetcode.com/problems/factor-combinations) | [Go](https://github.com/openset/leetcode/tree/master/solution/factor-combinations) | Medium |
-| 255 | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-sequence-in-binary-search-tree) | Medium |
-| 256 | [Paint House](https://leetcode.com/problems/paint-house) | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house) | Easy |
-| 257 | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-paths) | Easy |
-| 258 | [Add Digits](https://leetcode.com/problems/add-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-digits) | Easy |
-| 259 | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-smaller) | Medium |
-| 260 | [Single Number III](https://leetcode.com/problems/single-number-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-number-iii) | Medium |
-| 261 | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/graph-valid-tree) | Medium |
-| 262 | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [Go](https://github.com/openset/leetcode/tree/master/solution/trips-and-users) | Hard |
-| 263 | [Ugly Number](https://leetcode.com/problems/ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/ugly-number) | Easy |
-| 264 | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/ugly-number-ii) | Medium |
-| 265 | [Paint House II](https://leetcode.com/problems/paint-house-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house-ii) | Hard |
-| 266 | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation) | Easy |
-| 267 | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation-ii) | Medium |
-| 268 | [Missing Number](https://leetcode.com/problems/missing-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/missing-number) | Easy |
-| 269 | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/alien-dictionary) | Hard |
-| 270 | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value) | Easy |
-| 271 | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-strings) | Medium |
-| 272 | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value-ii) | Hard |
-| 273 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-to-english-words) | Hard |
-| 274 | [H-Index](https://leetcode.com/problems/h-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/h-index) | Medium |
-| 275 | [H-Index II](https://leetcode.com/problems/h-index-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/h-index-ii) | Medium |
-| 276 | [Paint Fence](https://leetcode.com/problems/paint-fence) | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-fence) | Easy |
-| 277 | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-celebrity) | Medium |
-| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version) | [Go](https://github.com/openset/leetcode/tree/master/solution/first-bad-version) | Easy |
-| 279 | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-squares) | Medium |
-| 280 | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort) | Medium |
-| 281 | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/zigzag-iterator) | Medium |
-| 282 | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | [Go](https://github.com/openset/leetcode/tree/master/solution/expression-add-operators) | Hard |
-| 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/move-zeroes) | Easy |
-| 284 | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/peeking-iterator) | Medium |
-| 285 | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/inorder-successor-in-bst) | Medium |
-| 286 | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) | [Go](https://github.com/openset/leetcode/tree/master/solution/walls-and-gates) | Medium |
-| 287 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-duplicate-number) | Medium |
-| 288 | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-word-abbreviation) | Medium |
-| 289 | [Game of Life](https://leetcode.com/problems/game-of-life) | [Go](https://github.com/openset/leetcode/tree/master/solution/game-of-life) | Medium |
-| 290 | [Word Pattern](https://leetcode.com/problems/word-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-pattern) | Easy |
-| 291 | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-pattern-ii) | Hard |
-| 292 | [Nim Game](https://leetcode.com/problems/nim-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/nim-game) | Easy |
-| 293 | [Flip Game](https://leetcode.com/problems/flip-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game) | Easy |
-| 294 | [Flip Game II](https://leetcode.com/problems/flip-game-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game-ii) | Medium |
-| 295 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-median-from-data-stream) | Hard |
-| 296 | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-meeting-point) | Hard |
-| 297 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-binary-tree) | Hard |
-| 298 | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence) | Medium |
-| 299 | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulls-and-cows) | Medium |
-| 300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-increasing-subsequence) | Medium |
-| 301 | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-invalid-parentheses) | Hard |
-| 302 | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rectangle-enclosing-black-pixels) | Hard |
-| 303 | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-immutable) | Easy |
-| 304 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-immutable) | Medium |
-| 305 | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-islands-ii) | Hard |
-| 306 | [Additive Number](https://leetcode.com/problems/additive-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/additive-number) | Medium |
-| 307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-mutable) | Medium |
-| 308 | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-mutable) | Hard |
-| 309 | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
-| 310 | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-height-trees) | Medium |
-| 311 | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) | [Go](https://github.com/openset/leetcode/tree/master/solution/sparse-matrix-multiplication) | Medium |
-| 312 | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/solution/burst-balloons) | Hard |
-| 313 | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-ugly-number) | Medium |
-| 314 | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-vertical-order-traversal) | Medium |
-| 315 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-of-smaller-numbers-after-self) | Hard |
-| 316 | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicate-letters) | Hard |
-| 317 | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-from-all-buildings) | Hard |
-| 318 | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-word-lengths) | Medium |
-| 319 | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulb-switcher) | Medium |
-| 320 | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) | [Go](https://github.com/openset/leetcode/tree/master/solution/generalized-abbreviation) | Medium |
-| 321 | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/create-maximum-number) | Hard |
-| 322 | [Coin Change](https://leetcode.com/problems/coin-change) | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-change) | Medium |
-| 323 | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-connected-components-in-an-undirected-graph) | Medium |
-| 324 | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort-ii) | Medium |
-| 325 | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-size-subarray-sum-equals-k) | Medium |
-| 326 | [Power of Three](https://leetcode.com/problems/power-of-three) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-three) | Easy |
-| 327 | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-of-range-sum) | Hard |
-| 328 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/odd-even-linked-list) | Medium |
-| 329 | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-increasing-path-in-a-matrix) | Hard |
-| 330 | [Patching Array](https://leetcode.com/problems/patching-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/patching-array) | Hard |
-| 331 | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-serialization-of-a-binary-tree) | Medium |
-| 332 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | [Go](https://github.com/openset/leetcode/tree/master/solution/reconstruct-itinerary) | Medium |
-| 333 | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-bst-subtree) | Medium |
-| 334 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-triplet-subsequence) | Medium |
-| 335 | [Self Crossing](https://leetcode.com/problems/self-crossing) | [Go](https://github.com/openset/leetcode/tree/master/solution/self-crossing) | Hard |
-| 336 | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-pairs) | Hard |
-| 337 | [House Robber III](https://leetcode.com/problems/house-robber-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/house-robber-iii) | Medium |
-| 338 | [Counting Bits](https://leetcode.com/problems/counting-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/counting-bits) | Medium |
-| 339 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum) | Easy |
-| 340 | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-k-distinct-characters) | Hard |
-| 341 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-nested-list-iterator) | Medium |
-| 342 | [Power of Four](https://leetcode.com/problems/power-of-four) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-four) | Easy |
-| 343 | [Integer Break](https://leetcode.com/problems/integer-break) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-break) | Medium |
-| 344 | [Reverse String](https://leetcode.com/problems/reverse-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-string) | Easy |
-| 345 | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-vowels-of-a-string) | Easy |
-| 346 | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) | [Go](https://github.com/openset/leetcode/tree/master/solution/moving-average-from-data-stream) | Easy |
-| 347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-elements) | Medium |
-| 348 | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-tic-tac-toe) | Medium |
-| 349 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays) | Easy |
-| 350 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays-ii) | Easy |
-| 351 | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) | [Go](https://github.com/openset/leetcode/tree/master/solution/android-unlock-patterns) | Medium |
-| 352 | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/data-stream-as-disjoint-intervals) | Hard |
-| 353 | [Design Snake Game](https://leetcode.com/problems/design-snake-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-snake-game) | Medium |
-| 354 | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | [Go](https://github.com/openset/leetcode/tree/master/solution/russian-doll-envelopes) | Hard |
-| 355 | [Design Twitter](https://leetcode.com/problems/design-twitter) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-twitter) | Medium |
-| 356 | [Line Reflection](https://leetcode.com/problems/line-reflection) | [Go](https://github.com/openset/leetcode/tree/master/solution/line-reflection) | Medium |
-| 357 | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-numbers-with-unique-digits) | Medium |
-| 358 | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) | [Go](https://github.com/openset/leetcode/tree/master/solution/rearrange-string-k-distance-apart) | Hard |
-| 359 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) | [Go](https://github.com/openset/leetcode/tree/master/solution/logger-rate-limiter) | Easy |
-| 360 | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-transformed-array) | Medium |
-| 361 | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) | [Go](https://github.com/openset/leetcode/tree/master/solution/bomb-enemy) | Medium |
-| 362 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hit-counter) | Medium |
-| 363 | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-sum-of-rectangle-no-larger-than-k) | Hard |
-| 364 | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum-ii) | Medium |
-| 365 | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem) | [Go](https://github.com/openset/leetcode/tree/master/solution/water-and-jug-problem) | Medium |
-| 366 | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-leaves-of-binary-tree) | Medium |
-| 367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-perfect-square) | Easy |
-| 368 | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-divisible-subset) | Medium |
-| 369 | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/plus-one-linked-list) | Medium |
-| 370 | [Range Addition](https://leetcode.com/problems/range-addition) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-addition) | Medium |
-| 371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-two-integers) | Easy |
-| 372 | [Super Pow](https://leetcode.com/problems/super-pow) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-pow) | Medium |
-| 373 | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-pairs-with-smallest-sums) | Medium |
-| 374 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | [Go](https://github.com/openset/leetcode/tree/master/solution/guess-number-higher-or-lower) | Easy |
-| 375 | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/guess-number-higher-or-lower-ii) | Medium |
-| 376 | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-subsequence) | Medium |
-| 377 | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum-iv) | Medium |
-| 378 | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-element-in-a-sorted-matrix) | Medium |
-| 379 | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-phone-directory) | Medium |
-| 380 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o1) | Medium |
-| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o1-duplicates-allowed) | Hard |
-| 382 | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-random-node) | Medium |
-| 383 | [Ransom Note](https://leetcode.com/problems/ransom-note) | [Go](https://github.com/openset/leetcode/tree/master/solution/ransom-note) | Easy |
-| 384 | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/shuffle-an-array) | Medium |
-| 385 | [Mini Parser](https://leetcode.com/problems/mini-parser) | [Go](https://github.com/openset/leetcode/tree/master/solution/mini-parser) | Medium |
-| 386 | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/lexicographical-numbers) | Medium |
-| 387 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/first-unique-character-in-a-string) | Easy |
-| 388 | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-absolute-file-path) | Medium |
-| 389 | [Find the Difference](https://leetcode.com/problems/find-the-difference) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-difference) | Easy |
-| 390 | [Elimination Game](https://leetcode.com/problems/elimination-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/elimination-game) | Medium |
-| 391 | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-rectangle) | Hard |
-| 392 | [Is Subsequence](https://leetcode.com/problems/is-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/is-subsequence) | Medium |
-| 393 | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation) | [Go](https://github.com/openset/leetcode/tree/master/solution/utf-8-validation) | Medium |
-| 394 | [Decode String](https://leetcode.com/problems/decode-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/decode-string) | Medium |
-| 395 | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-least-k-repeating-characters) | Medium |
-| 396 | [Rotate Function](https://leetcode.com/problems/rotate-function) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-function) | Medium |
-| 397 | [Integer Replacement](https://leetcode.com/problems/integer-replacement) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-replacement) | Medium |
-| 398 | [Random Pick Index](https://leetcode.com/problems/random-pick-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-index) | Medium |
-| 399 | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | [Go](https://github.com/openset/leetcode/tree/master/solution/evaluate-division) | Medium |
-| 400 | [Nth Digit](https://leetcode.com/problems/nth-digit) | [Go](https://github.com/openset/leetcode/tree/master/solution/nth-digit) | Easy |
-| 401 | [Binary Watch](https://leetcode.com/problems/binary-watch) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-watch) | Easy |
-| 402 | [Remove K Digits](https://leetcode.com/problems/remove-k-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-k-digits) | Medium |
-| 403 | [Frog Jump](https://leetcode.com/problems/frog-jump) | [Go](https://github.com/openset/leetcode/tree/master/solution/frog-jump) | Hard |
-| 404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-left-leaves) | Easy |
-| 405 | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-a-number-to-hexadecimal) | Easy |
-| 406 | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | [Go](https://github.com/openset/leetcode/tree/master/solution/queue-reconstruction-by-height) | Medium |
-| 407 | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/trapping-rain-water-ii) | Hard |
-| 408 | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-abbreviation) | Easy |
-| 409 | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-palindrome) | Easy |
-| 410 | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-largest-sum) | Hard |
-| 411 | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-unique-word-abbreviation) | Hard |
-| 412 | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [Go](https://github.com/openset/leetcode/tree/master/solution/fizz-buzz) | Easy |
-| 413 | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | [Go](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices) | Medium |
-| 414 | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/third-maximum-number) | Easy |
-| 415 | [Add Strings](https://leetcode.com/problems/add-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-strings) | Easy |
-| 416 | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-equal-subset-sum) | Medium |
-| 417 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [Go](https://github.com/openset/leetcode/tree/master/solution/pacific-atlantic-water-flow) | Medium |
-| 418 | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-screen-fitting) | Medium |
-| 419 | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | [Go](https://github.com/openset/leetcode/tree/master/solution/battleships-in-a-board) | Medium |
-| 420 | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker) | [Go](https://github.com/openset/leetcode/tree/master/solution/strong-password-checker) | Hard |
-| 421 | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-xor-of-two-numbers-in-an-array) | Medium |
-| 422 | [Valid Word Square](https://leetcode.com/problems/valid-word-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-square) | Easy |
-| 423 | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english) | [Go](https://github.com/openset/leetcode/tree/master/solution/reconstruct-original-digits-from-english) | Medium |
-| 424 | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-repeating-character-replacement) | Medium |
-| 425 | [Word Squares](https://leetcode.com/problems/word-squares) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-squares) | Hard |
-| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
-| 427 | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-quad-tree) | Easy |
-| 428 | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-n-ary-tree) | Hard |
-| 429 | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-level-order-traversal) | Easy |
-| 430 | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-a-multilevel-doubly-linked-list) | Medium |
-| 431 | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-n-ary-tree-to-binary-tree) | Hard |
-| 432 | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-oone-data-structure) | Hard |
-| 433 | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-genetic-mutation) | Medium |
-| 434 | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-segments-in-a-string) | Easy |
-| 435 | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-overlapping-intervals) | Medium |
-| 436 | [Find Right Interval](https://leetcode.com/problems/find-right-interval) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-right-interval) | Medium |
-| 437 | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-iii) | Easy |
-| 438 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-anagrams-in-a-string) | Easy |
-| 439 | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) | [Go](https://github.com/openset/leetcode/tree/master/solution/ternary-expression-parser) | Medium |
-| 440 | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-smallest-in-lexicographical-order) | Hard |
-| 441 | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | [Go](https://github.com/openset/leetcode/tree/master/solution/arranging-coins) | Easy |
-| 442 | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-duplicates-in-an-array) | Medium |
-| 443 | [String Compression](https://leetcode.com/problems/string-compression) | [Go](https://github.com/openset/leetcode/tree/master/solution/string-compression) | Easy |
-| 444 | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) | [Go](https://github.com/openset/leetcode/tree/master/solution/sequence-reconstruction) | Medium |
-| 445 | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers-ii) | Medium |
-| 446 | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices-ii-subsequence) | Hard |
-| 447 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-boomerangs) | Easy |
-| 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-numbers-disappeared-in-an-array) | Easy |
-| 449 | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-bst) | Medium |
-| 450 | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-node-in-a-bst) | Medium |
-| 451 | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-characters-by-frequency) | Medium |
-| 452 | [Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-number-of-arrows-to-burst-balloons) | Medium |
-| 453 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-moves-to-equal-array-elements) | Easy |
-| 454 | [4Sum II](https://leetcode.com/problems/4sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/4sum-ii) | Medium |
-| 455 | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | [Go](https://github.com/openset/leetcode/tree/master/solution/assign-cookies) | Easy |
-| 456 | [132 Pattern](https://leetcode.com/problems/132-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/132-pattern) | Medium |
-| 457 | [Circular Array Loop](https://leetcode.com/problems/circular-array-loop) | [Go](https://github.com/openset/leetcode/tree/master/solution/circular-array-loop) | Medium |
-| 458 | [Poor Pigs](https://leetcode.com/problems/poor-pigs) | [Go](https://github.com/openset/leetcode/tree/master/solution/poor-pigs) | Easy |
-| 459 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-substring-pattern) | Easy |
-| 460 | [LFU Cache](https://leetcode.com/problems/lfu-cache) | [Go](https://github.com/openset/leetcode/tree/master/solution/lfu-cache) | Hard |
-| 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/hamming-distance) | Easy |
-| 462 | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-moves-to-equal-array-elements-ii) | Medium |
-| 463 | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | [Go](https://github.com/openset/leetcode/tree/master/solution/island-perimeter) | Easy |
-| 464 | [Can I Win](https://leetcode.com/problems/can-i-win) | [Go](https://github.com/openset/leetcode/tree/master/solution/can-i-win) | Medium |
-| 465 | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) | [Go](https://github.com/openset/leetcode/tree/master/solution/optimal-account-balancing) | Hard |
-| 466 | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-the-repetitions) | Hard |
-| 467 | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-substrings-in-wraparound-string) | Medium |
-| 468 | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [Go](https://github.com/openset/leetcode/tree/master/solution/validate-ip-address) | Medium |
-| 469 | [Convex Polygon](https://leetcode.com/problems/convex-polygon) | [Go](https://github.com/openset/leetcode/tree/master/solution/convex-polygon) | Medium |
-| 470 | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-rand10-using-rand7) | Medium |
-| 471 | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-string-with-shortest-length) | Hard |
-| 472 | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/concatenated-words) | Hard |
-| 473 | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/matchsticks-to-square) | Medium |
-| 474 | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/ones-and-zeroes) | Medium |
-| 475 | [Heaters](https://leetcode.com/problems/heaters) | [Go](https://github.com/openset/leetcode/tree/master/solution/heaters) | Easy |
-| 476 | [Number Complement](https://leetcode.com/problems/number-complement) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-complement) | Easy |
-| 477 | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/total-hamming-distance) | Medium |
-| 478 | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle) | [Go](https://github.com/openset/leetcode/tree/master/solution/generate-random-point-in-a-circle) | Medium |
-| 479 | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-palindrome-product) | Easy |
-| 480 | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median) | [Go](https://github.com/openset/leetcode/tree/master/solution/sliding-window-median) | Hard |
-| 481 | [Magical String](https://leetcode.com/problems/magical-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/magical-string) | Medium |
-| 482 | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [Go](https://github.com/openset/leetcode/tree/master/solution/license-key-formatting) | Easy |
-| 483 | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-good-base) | Hard |
-| 484 | [Find Permutation](https://leetcode.com/problems/find-permutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-permutation) | Medium |
-| 485 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones) | Easy |
-| 486 | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | [Go](https://github.com/openset/leetcode/tree/master/solution/predict-the-winner) | Medium |
-| 487 | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones-ii) | Medium |
-| 488 | [Zuma Game](https://leetcode.com/problems/zuma-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/zuma-game) | Hard |
-| 489 | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) | [Go](https://github.com/openset/leetcode/tree/master/solution/robot-room-cleaner) | Hard |
-| 490 | [The Maze](https://leetcode.com/problems/the-maze) | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze) | Medium |
-| 491 | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-subsequences) | Medium |
-| 492 | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-the-rectangle) | Easy |
-| 493 | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-pairs) | Hard |
-| 494 | [Target Sum](https://leetcode.com/problems/target-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/target-sum) | Medium |
-| 495 | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking) | [Go](https://github.com/openset/leetcode/tree/master/solution/teemo-attacking) | Medium |
-| 496 | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-i) | Easy |
-| 497 | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-point-in-non-overlapping-rectangles) | Medium |
-| 498 | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | [Go](https://github.com/openset/leetcode/tree/master/solution/diagonal-traverse) | Medium |
-| 499 | [The Maze III](https://leetcode.com/problems/the-maze-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-iii) | Hard |
-| 500 | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | [Go](https://github.com/openset/leetcode/tree/master/solution/keyboard-row) | Easy |
-| 501 | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-mode-in-binary-search-tree) | Easy |
-| 502 | [IPO](https://leetcode.com/problems/ipo) | [Go](https://github.com/openset/leetcode/tree/master/solution/ipo) | Hard |
-| 503 | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-ii) | Medium |
-| 504 | [Base 7](https://leetcode.com/problems/base-7) | [Go](https://github.com/openset/leetcode/tree/master/solution/base-7) | Easy |
-| 505 | [The Maze II](https://leetcode.com/problems/the-maze-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-ii) | Medium |
-| 506 | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | [Go](https://github.com/openset/leetcode/tree/master/solution/relative-ranks) | Easy |
-| 507 | [Perfect Number](https://leetcode.com/problems/perfect-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-number) | Easy |
-| 508 | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-frequent-subtree-sum) | Medium |
-| 513 | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-bottom-left-tree-value) | Medium |
-| 514 | [Freedom Trail](https://leetcode.com/problems/freedom-trail) | [Go](https://github.com/openset/leetcode/tree/master/solution/freedom-trail) | Hard |
-| 515 | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-largest-value-in-each-tree-row) | Medium |
-| 516 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-palindromic-subsequence) | Medium |
-| 517 | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-washing-machines) | Hard |
-| 518 | [Coin Change 2](https://leetcode.com/problems/coin-change-2) | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-change-2) | Medium |
-| 519 | [Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-flip-matrix) | Medium |
-| 520 | [Detect Capital](https://leetcode.com/problems/detect-capital) | [Go](https://github.com/openset/leetcode/tree/master/solution/detect-capital) | Easy |
-| 521 | [Longest Uncommon Subsequence I ](https://leetcode.com/problems/longest-uncommon-subsequence-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-uncommon-subsequence-i) | Easy |
-| 522 | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-uncommon-subsequence-ii) | Medium |
-| 523 | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/continuous-subarray-sum) | Medium |
-| 524 | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary-through-deleting) | Medium |
-| 525 | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/contiguous-array) | Medium |
-| 526 | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement) | Medium |
-| 527 | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-abbreviation) | Hard |
-| 528 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-weight) | Medium |
-| 529 | [Minesweeper](https://leetcode.com/problems/minesweeper) | [Go](https://github.com/openset/leetcode/tree/master/solution/minesweeper) | Medium |
-| 530 | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-absolute-difference-in-bst) | Easy |
-| 531 | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-i) | Medium |
-| 532 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-diff-pairs-in-an-array) | Easy |
-| 533 | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-ii) | Medium |
-| 535 | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-tinyurl) | Medium |
-| 536 | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-string) | Medium |
-| 537 | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | [Go](https://github.com/openset/leetcode/tree/master/solution/complex-number-multiplication) | Medium |
-| 538 | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-bst-to-greater-tree) | Easy |
-| 539 | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-time-difference) | Medium |
-| 540 | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-element-in-a-sorted-array) | Medium |
-| 541 | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-string-ii) | Easy |
-| 542 | [01 Matrix](https://leetcode.com/problems/01-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/01-matrix) | Medium |
-| 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/diameter-of-binary-tree) | Easy |
-| 544 | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) | [Go](https://github.com/openset/leetcode/tree/master/solution/output-contest-matches) | Medium |
-| 545 | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/boundary-of-binary-tree) | Medium |
-| 546 | [Remove Boxes](https://leetcode.com/problems/remove-boxes) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-boxes) | Hard |
-| 547 | [Friend Circles](https://leetcode.com/problems/friend-circles) | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-circles) | Medium |
-| 548 | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-with-equal-sum) | Medium |
-| 549 | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence-ii) | Medium |
-| 551 | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-i) | Easy |
-| 552 | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-ii) | Hard |
-| 553 | [Optimal Division](https://leetcode.com/problems/optimal-division) | [Go](https://github.com/openset/leetcode/tree/master/solution/optimal-division) | Medium |
-| 554 | [Brick Wall](https://leetcode.com/problems/brick-wall) | [Go](https://github.com/openset/leetcode/tree/master/solution/brick-wall) | Medium |
-| 555 | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-concatenated-strings) | Medium |
-| 556 | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-iii) | Medium |
-| 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-iii) | Easy |
-| 558 | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection) | [Go](https://github.com/openset/leetcode/tree/master/solution/quad-tree-intersection) | Easy |
-| 559 | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-depth-of-n-ary-tree) | Easy |
-| 560 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/subarray-sum-equals-k) | Medium |
-| 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-partition-i) | Easy |
-| 562 | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-line-of-consecutive-one-in-matrix) | Medium |
-| 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-tilt) | Easy |
-| 564 | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-closest-palindrome) | Hard |
-| 565 | [Array Nesting](https://leetcode.com/problems/array-nesting) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-nesting) | Medium |
-| 566 | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/reshape-the-matrix) | Easy |
-| 567 | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutation-in-string) | Medium |
-| 568 | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-vacation-days) | Hard |
-| 569 | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/median-employee-salary) | Hard |
-| 570 | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) | [Go](https://github.com/openset/leetcode/tree/master/solution/managers-with-at-least-5-direct-reports) | Medium |
-| 571 | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-median-given-frequency-of-numbers) | Hard |
-| 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/subtree-of-another-tree) | Easy |
-| 573 | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) | [Go](https://github.com/openset/leetcode/tree/master/solution/squirrel-simulation) | Medium |
-| 574 | [Winning Candidate](https://leetcode.com/problems/winning-candidate) | [Go](https://github.com/openset/leetcode/tree/master/solution/winning-candidate) | Medium |
-| 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | [Go](https://github.com/openset/leetcode/tree/master/solution/distribute-candies) | Easy |
-| 576 | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/out-of-boundary-paths) | Medium |
-| 577 | [Employee Bonus](https://leetcode.com/problems/employee-bonus) | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-bonus) | Easy |
-| 578 | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) | [Go](https://github.com/openset/leetcode/tree/master/solution/get-highest-answer-rate-question) | Medium |
-| 579 | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-cumulative-salary-of-an-employee) | Hard |
-| 580 | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-student-number-in-departments) | Medium |
-| 581 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-unsorted-continuous-subarray) | Easy |
-| 582 | [Kill Process](https://leetcode.com/problems/kill-process) | [Go](https://github.com/openset/leetcode/tree/master/solution/kill-process) | Medium |
-| 583 | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-operation-for-two-strings) | Medium |
-| 584 | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-customer-referee) | Easy |
-| 585 | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) | [Go](https://github.com/openset/leetcode/tree/master/solution/investments-in-2016) | Medium |
-| 586 | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) | [Go](https://github.com/openset/leetcode/tree/master/solution/customer-placing-the-largest-number-of-orders) | Easy |
-| 587 | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | [Go](https://github.com/openset/leetcode/tree/master/solution/erect-the-fence) | Hard |
-| 588 | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-in-memory-file-system) | Hard |
-| 589 | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-preorder-traversal) | Easy |
-| 590 | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-postorder-traversal) | Easy |
-| 591 | [Tag Validator](https://leetcode.com/problems/tag-validator) | [Go](https://github.com/openset/leetcode/tree/master/solution/tag-validator) | Hard |
-| 592 | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction) | [Go](https://github.com/openset/leetcode/tree/master/solution/fraction-addition-and-subtraction) | Medium |
-| 593 | [Valid Square](https://leetcode.com/problems/valid-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-square) | Medium |
-| 594 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-harmonious-subsequence) | Easy |
-| 595 | [Big Countries](https://leetcode.com/problems/big-countries) | [Go](https://github.com/openset/leetcode/tree/master/solution/big-countries) | Easy |
-| 596 | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [Go](https://github.com/openset/leetcode/tree/master/solution/classes-more-than-5-students) | Easy |
-| 597 | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-i-overall-acceptance-rate) | Easy |
-| 598 | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-addition-ii) | Easy |
-| 599 | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-index-sum-of-two-lists) | Easy |
-| 600 | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-negative-integers-without-consecutive-ones) | Hard |
-| 601 | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [Go](https://github.com/openset/leetcode/tree/master/solution/human-traffic-of-stadium) | Hard |
-| 602 | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends) | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-ii-who-has-the-most-friends) | Medium |
-| 603 | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-available-seats) | Easy |
-| 604 | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-compressed-string-iterator) | Easy |
-| 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [Go](https://github.com/openset/leetcode/tree/master/solution/can-place-flowers) | Easy |
-| 606 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-string-from-binary-tree) | Easy |
-| 607 | [Sales Person](https://leetcode.com/problems/sales-person) | [Go](https://github.com/openset/leetcode/tree/master/solution/sales-person) | Easy |
-| 608 | [Tree Node](https://leetcode.com/problems/tree-node) | [Go](https://github.com/openset/leetcode/tree/master/solution/tree-node) | Medium |
-| 609 | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-file-in-system) | Medium |
-| 610 | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) | [Go](https://github.com/openset/leetcode/tree/master/solution/triangle-judgement) | Easy |
-| 611 | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-triangle-number) | Medium |
-| 612 | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-plane) | Medium |
-| 613 | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-line) | Easy |
-| 614 | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) | [Go](https://github.com/openset/leetcode/tree/master/solution/second-degree-follower) | Medium |
-| 615 | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) | [Go](https://github.com/openset/leetcode/tree/master/solution/average-salary-departments-vs-company) | Hard |
-| 616 | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-bold-tag-in-string) | Medium |
-| 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-two-binary-trees) | Easy |
-| 618 | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) | [Go](https://github.com/openset/leetcode/tree/master/solution/students-report-by-geography) | Hard |
-| 619 | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/biggest-single-number) | Easy |
-| 620 | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [Go](https://github.com/openset/leetcode/tree/master/solution/not-boring-movies) | Easy |
-| 621 | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [Go](https://github.com/openset/leetcode/tree/master/solution/task-scheduler) | Medium |
-| 622 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-circular-queue) | Medium |
-| 623 | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-one-row-to-tree) | Medium |
-| 624 | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-distance-in-arrays) | Easy |
-| 625 | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-factorization) | Medium |
-| 626 | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [Go](https://github.com/openset/leetcode/tree/master/solution/exchange-seats) | Medium |
-| 627 | [Swap Salary](https://leetcode.com/problems/swap-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-salary) | Easy |
-| 628 | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-three-numbers) | Easy |
-| 629 | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-inverse-pairs-array) | Hard |
-| 630 | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule-iii) | Hard |
-| 631 | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-excel-sum-formula) | Hard |
-| 632 | [Smallest Range](https://leetcode.com/problems/smallest-range) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-range) | Hard |
-| 633 | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-square-numbers) | Easy |
-| 634 | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-derangement-of-an-array) | Medium |
-| 635 | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-log-storage-system) | Medium |
-| 636 | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | [Go](https://github.com/openset/leetcode/tree/master/solution/exclusive-time-of-functions) | Medium |
-| 637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/average-of-levels-in-binary-tree) | Easy |
-| 638 | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | [Go](https://github.com/openset/leetcode/tree/master/solution/shopping-offers) | Medium |
-| 639 | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/decode-ways-ii) | Hard |
-| 640 | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | [Go](https://github.com/openset/leetcode/tree/master/solution/solve-the-equation) | Medium |
-| 641 | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-circular-deque) | Medium |
-| 642 | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-search-autocomplete-system) | Hard |
-| 643 | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-i) | Easy |
-| 644 | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-ii) | Hard |
-| 645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-mismatch) | Easy |
-| 646 | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-pair-chain) | Medium |
-| 647 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindromic-substrings) | Medium |
-| 648 | [Replace Words](https://leetcode.com/problems/replace-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/replace-words) | Medium |
-| 649 | [Dota2 Senate](https://leetcode.com/problems/dota2-senate) | [Go](https://github.com/openset/leetcode/tree/master/solution/dota2-senate) | Medium |
-| 650 | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/2-keys-keyboard) | Medium |
-| 651 | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/4-keys-keyboard) | Medium |
-| 652 | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-subtrees) | Medium |
-| 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iv-input-is-a-bst) | Easy |
-| 654 | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-binary-tree) | Medium |
-| 655 | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/print-binary-tree) | Medium |
-| 656 | [Coin Path](https://leetcode.com/problems/coin-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-path) | Hard |
-| 657 | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [Go](https://github.com/openset/leetcode/tree/master/solution/robot-return-to-origin) | Easy |
-| 658 | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-closest-elements) | Medium |
-| 659 | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-into-consecutive-subsequences) | Medium |
-| 660 | [Remove 9](https://leetcode.com/problems/remove-9) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-9) | Hard |
-| 661 | [Image Smoother](https://leetcode.com/problems/image-smoother) | [Go](https://github.com/openset/leetcode/tree/master/solution/image-smoother) | Easy |
-| 662 | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-width-of-binary-tree) | Medium |
-| 663 | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) | [Go](https://github.com/openset/leetcode/tree/master/solution/equal-tree-partition) | Medium |
-| 664 | [Strange Printer](https://leetcode.com/problems/strange-printer) | [Go](https://github.com/openset/leetcode/tree/master/solution/strange-printer) | Hard |
-| 665 | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-decreasing-array) | Easy |
-| 666 | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-iv) | Medium |
-| 667 | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement-ii) | Medium |
-| 668 | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-number-in-multiplication-table) | Hard |
-| 669 | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/trim-a-binary-search-tree) | Easy |
-| 670 | [Maximum Swap](https://leetcode.com/problems/maximum-swap) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-swap) | Medium |
-| 671 | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/second-minimum-node-in-a-binary-tree) | Easy |
-| 672 | [Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulb-switcher-ii) | Medium |
-| 673 | [Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-longest-increasing-subsequence) | Medium |
-| 674 | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-continuous-increasing-subsequence) | Easy |
-| 675 | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event) | [Go](https://github.com/openset/leetcode/tree/master/solution/cut-off-trees-for-golf-event) | Hard |
-| 676 | [Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-magic-dictionary) | Medium |
-| 677 | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/map-sum-pairs) | Medium |
-| 678 | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-parenthesis-string) | Medium |
-| 679 | [24 Game](https://leetcode.com/problems/24-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/24-game) | Hard |
-| 680 | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-palindrome-ii) | Easy |
-| 681 | [Next Closest Time](https://leetcode.com/problems/next-closest-time) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-closest-time) | Medium |
-| 682 | [Baseball Game](https://leetcode.com/problems/baseball-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/baseball-game) | Easy |
-| 683 | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-empty-slots) | Hard |
-| 684 | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | [Go](https://github.com/openset/leetcode/tree/master/solution/redundant-connection) | Medium |
-| 685 | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/redundant-connection-ii) | Hard |
-| 686 | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-string-match) | Easy |
-| 687 | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-univalue-path) | Easy |
-| 688 | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/knight-probability-in-chessboard) | Medium |
-| 689 | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-sum-of-3-non-overlapping-subarrays) | Hard |
-| 690 | [Employee Importance](https://leetcode.com/problems/employee-importance) | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-importance) | Easy |
-| 691 | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/stickers-to-spell-word) | Hard |
-| 692 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-words) | Medium |
-| 693 | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-number-with-alternating-bits) | Easy |
-| 694 | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands) | Medium |
-| 695 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-area-of-island) | Medium |
-| 696 | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-binary-substrings) | Easy |
-| 697 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/degree-of-an-array) | Easy |
-| 698 | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-to-k-equal-sum-subsets) | Medium |
-| 699 | [Falling Squares](https://leetcode.com/problems/falling-squares) | [Go](https://github.com/openset/leetcode/tree/master/solution/falling-squares) | Hard |
-| 700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-a-binary-search-tree) | Easy |
-| 701 | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-binary-search-tree) | Medium |
-| 702 | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-a-sorted-array-of-unknown-size) | Medium |
-| 703 | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-largest-element-in-a-stream) | Easy |
-| 704 | [Binary Search](https://leetcode.com/problems/binary-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-search) | Easy |
-| 705 | [Design HashSet](https://leetcode.com/problems/design-hashset) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hashset) | Easy |
-| 706 | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hashmap) | Easy |
-| 707 | [Design Linked List](https://leetcode.com/problems/design-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-linked-list) | Easy |
-| 708 | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-cyclic-sorted-list) | Medium |
-| 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [Go](https://github.com/openset/leetcode/tree/master/solution/to-lower-case) | Easy |
-| 710 | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-blacklist) | Hard |
-| 711 | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands-ii) | Hard |
-| 712 | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-ascii-delete-sum-for-two-strings) | Medium |
-| 713 | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/subarray-product-less-than-k) | Medium |
-| 714 | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
-| 715 | [Range Module](https://leetcode.com/problems/range-module) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-module) | Hard |
-| 716 | [Max Stack](https://leetcode.com/problems/max-stack) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-stack) | Easy |
-| 717 | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/1-bit-and-2-bit-characters) | Easy |
-| 718 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-repeated-subarray) | Medium |
-| 719 | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-th-smallest-pair-distance) | Hard |
-| 720 | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary) | Easy |
-| 721 | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | [Go](https://github.com/openset/leetcode/tree/master/solution/accounts-merge) | Medium |
-| 722 | [Remove Comments](https://leetcode.com/problems/remove-comments) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-comments) | Medium |
-| 723 | [Candy Crush](https://leetcode.com/problems/candy-crush) | [Go](https://github.com/openset/leetcode/tree/master/solution/candy-crush) | Medium |
-| 724 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-pivot-index) | Easy |
-| 725 | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-linked-list-in-parts) | Medium |
-| 726 | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-atoms) | Hard |
-| 727 | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-window-subsequence) | Hard |
-| 728 | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/self-dividing-numbers) | Easy |
-| 729 | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-i) | Medium |
-| 730 | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-different-palindromic-subsequences) | Hard |
-| 731 | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-ii) | Medium |
-| 732 | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-iii) | Hard |
-| 733 | [Flood Fill](https://leetcode.com/problems/flood-fill) | [Go](https://github.com/openset/leetcode/tree/master/solution/flood-fill) | Easy |
-| 734 | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity) | Easy |
-| 735 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [Go](https://github.com/openset/leetcode/tree/master/solution/asteroid-collision) | Medium |
-| 736 | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression) | [Go](https://github.com/openset/leetcode/tree/master/solution/parse-lisp-expression) | Hard |
-| 737 | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity-ii) | Medium |
-| 738 | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/monotone-increasing-digits) | Medium |
-| 739 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [Go](https://github.com/openset/leetcode/tree/master/solution/daily-temperatures) | Medium |
-| 740 | [Delete and Earn](https://leetcode.com/problems/delete-and-earn) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-and-earn) | Medium |
-| 741 | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup) | [Go](https://github.com/openset/leetcode/tree/master/solution/cherry-pickup) | Hard |
-| 742 | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-leaf-in-a-binary-tree) | Medium |
-| 743 | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | [Go](https://github.com/openset/leetcode/tree/master/solution/network-delay-time) | Easy |
-| 744 | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-smallest-letter-greater-than-target) | Easy |
-| 745 | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/prefix-and-suffix-search) | Hard |
-| 746 | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/min-cost-climbing-stairs) | Easy |
-| 747 | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-number-at-least-twice-of-others) | Easy |
-| 748 | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-completing-word) | Easy |
-| 749 | [Contain Virus](https://leetcode.com/problems/contain-virus) | [Go](https://github.com/openset/leetcode/tree/master/solution/contain-virus) | Hard |
-| 750 | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-corner-rectangles) | Medium |
-| 751 | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) | [Go](https://github.com/openset/leetcode/tree/master/solution/ip-to-cidr) | Easy |
-| 752 | [Open the Lock](https://leetcode.com/problems/open-the-lock) | [Go](https://github.com/openset/leetcode/tree/master/solution/open-the-lock) | Medium |
-| 753 | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | [Go](https://github.com/openset/leetcode/tree/master/solution/cracking-the-safe) | Hard |
-| 754 | [Reach a Number](https://leetcode.com/problems/reach-a-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/reach-a-number) | Easy |
-| 755 | [Pour Water](https://leetcode.com/problems/pour-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/pour-water) | Medium |
-| 756 | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/pyramid-transition-matrix) | Medium |
-| 757 | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-intersection-size-at-least-two) | Hard |
-| 758 | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/bold-words-in-string) | Easy |
-| 759 | [Employee Free Time](https://leetcode.com/problems/employee-free-time) | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-free-time) | Hard |
-| 760 | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-anagram-mappings) | Easy |
-| 761 | [Special Binary String](https://leetcode.com/problems/special-binary-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/special-binary-string) | Hard |
-| 762 | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [Go](https://github.com/openset/leetcode/tree/master/solution/prime-number-of-set-bits-in-binary-representation) | Easy |
-| 763 | [Partition Labels](https://leetcode.com/problems/partition-labels) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-labels) | Medium |
-| 764 | [Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-plus-sign) | Medium |
-| 765 | [Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands) | [Go](https://github.com/openset/leetcode/tree/master/solution/couples-holding-hands) | Hard |
-| 766 | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/toeplitz-matrix) | Easy |
-| 767 | [Reorganize String](https://leetcode.com/problems/reorganize-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reorganize-string) | Medium |
-| 768 | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-chunks-to-make-sorted-ii) | Hard |
-| 769 | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-chunks-to-make-sorted) | Medium |
-| 770 | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iv) | Hard |
-| 771 | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | [Go](https://github.com/openset/leetcode/tree/master/solution/jewels-and-stones) | Easy |
-| 772 | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iii) | Hard |
-| 773 | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle) | [Go](https://github.com/openset/leetcode/tree/master/solution/sliding-puzzle) | Hard |
-| 774 | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-max-distance-to-gas-station) | Hard |
-| 775 | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | [Go](https://github.com/openset/leetcode/tree/master/solution/global-and-local-inversions) | Medium |
-| 776 | [Split BST](https://leetcode.com/problems/split-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-bst) | Medium |
-| 777 | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-adjacent-in-lr-string) | Medium |
-| 778 | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/swim-in-rising-water) | Hard |
-| 779 | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-symbol-in-grammar) | Medium |
-| 780 | [Reaching Points](https://leetcode.com/problems/reaching-points) | [Go](https://github.com/openset/leetcode/tree/master/solution/reaching-points) | Hard |
-| 781 | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest) | [Go](https://github.com/openset/leetcode/tree/master/solution/rabbits-in-forest) | Medium |
-| 782 | [Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/transform-to-chessboard) | Hard |
-| 783 | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-distance-between-bst-nodes) | Easy |
-| 784 | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/letter-case-permutation) | Easy |
-| 785 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite) | [Go](https://github.com/openset/leetcode/tree/master/solution/is-graph-bipartite) | Medium |
-| 786 | [K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-smallest-prime-fraction) | Hard |
-| 787 | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops) | [Go](https://github.com/openset/leetcode/tree/master/solution/cheapest-flights-within-k-stops) | Medium |
-| 788 | [Rotated Digits](https://leetcode.com/problems/rotated-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotated-digits) | Easy |
-| 789 | [Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts) | [Go](https://github.com/openset/leetcode/tree/master/solution/escape-the-ghosts) | Medium |
-| 790 | [Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling) | [Go](https://github.com/openset/leetcode/tree/master/solution/domino-and-tromino-tiling) | Medium |
-| 791 | [Custom Sort String](https://leetcode.com/problems/custom-sort-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/custom-sort-string) | Medium |
-| 792 | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-matching-subsequences) | Medium |
-| 793 | [Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function) | [Go](https://github.com/openset/leetcode/tree/master/solution/preimage-size-of-factorial-zeroes-function) | Hard |
-| 794 | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-tic-tac-toe-state) | Medium |
-| 795 | [Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-subarrays-with-bounded-maximum) | Medium |
-| 796 | [Rotate String](https://leetcode.com/problems/rotate-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-string) | Easy |
-| 797 | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-paths-from-source-to-target) | Medium |
-| 798 | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rotation-with-highest-score) | Hard |
-| 799 | [Champagne Tower](https://leetcode.com/problems/champagne-tower) | [Go](https://github.com/openset/leetcode/tree/master/solution/champagne-tower) | Medium |
-| 800 | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) | [Go](https://github.com/openset/leetcode/tree/master/solution/similar-rgb-color) | Easy |
-| 801 | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-swaps-to-make-sequences-increasing) | Medium |
-| 802 | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-eventual-safe-states) | Medium |
-| 803 | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit) | [Go](https://github.com/openset/leetcode/tree/master/solution/bricks-falling-when-hit) | Hard |
-| 804 | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-morse-code-words) | Easy |
-| 805 | [Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-with-same-average) | Hard |
-| 806 | [Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-lines-to-write-string) | Easy |
-| 807 | [Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-increase-to-keep-city-skyline) | Medium |
-| 808 | [Soup Servings](https://leetcode.com/problems/soup-servings) | [Go](https://github.com/openset/leetcode/tree/master/solution/soup-servings) | Medium |
-| 809 | [Expressive Words](https://leetcode.com/problems/expressive-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/expressive-words) | Medium |
-| 810 | [Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/chalkboard-xor-game) | Hard |
-| 811 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count) | [Go](https://github.com/openset/leetcode/tree/master/solution/subdomain-visit-count) | Easy |
-| 812 | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-triangle-area) | Easy |
-| 813 | [Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-sum-of-averages) | Medium |
-| 814 | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-pruning) | Medium |
-| 815 | [Bus Routes](https://leetcode.com/problems/bus-routes) | [Go](https://github.com/openset/leetcode/tree/master/solution/bus-routes) | Hard |
-| 816 | [Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates) | [Go](https://github.com/openset/leetcode/tree/master/solution/ambiguous-coordinates) | Medium |
-| 817 | [Linked List Components](https://leetcode.com/problems/linked-list-components) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-components) | Medium |
-| 818 | [Race Car](https://leetcode.com/problems/race-car) | [Go](https://github.com/openset/leetcode/tree/master/solution/race-car) | Hard |
-| 819 | [Most Common Word](https://leetcode.com/problems/most-common-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-common-word) | Easy |
-| 820 | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/short-encoding-of-words) | Medium |
-| 821 | [Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-to-a-character) | Easy |
-| 822 | [Card Flipping Game](https://leetcode.com/problems/card-flipping-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/card-flipping-game) | Medium |
-| 823 | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-trees-with-factors) | Medium |
-| 824 | [Goat Latin](https://leetcode.com/problems/goat-latin) | [Go](https://github.com/openset/leetcode/tree/master/solution/goat-latin) | Easy |
-| 825 | [Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages) | [Go](https://github.com/openset/leetcode/tree/master/solution/friends-of-appropriate-ages) | Medium |
-| 826 | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-profit-assigning-work) | Medium |
-| 827 | [Making A Large Island](https://leetcode.com/problems/making-a-large-island) | [Go](https://github.com/openset/leetcode/tree/master/solution/making-a-large-island) | Hard |
-| 828 | [Unique Letter String](https://leetcode.com/problems/unique-letter-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-letter-string) | Hard |
-| 829 | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-numbers-sum) | Hard |
-| 830 | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups) | [Go](https://github.com/openset/leetcode/tree/master/solution/positions-of-large-groups) | Easy |
-| 831 | [Masking Personal Information](https://leetcode.com/problems/masking-personal-information) | [Go](https://github.com/openset/leetcode/tree/master/solution/masking-personal-information) | Medium |
-| 832 | [Flipping an Image](https://leetcode.com/problems/flipping-an-image) | [Go](https://github.com/openset/leetcode/tree/master/solution/flipping-an-image) | Easy |
-| 833 | [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-and-replace-in-string) | Medium |
-| 834 | [Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-distances-in-tree) | Hard |
-| 835 | [Image Overlap](https://leetcode.com/problems/image-overlap) | [Go](https://github.com/openset/leetcode/tree/master/solution/image-overlap) | Medium |
-| 836 | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | [Go](https://github.com/openset/leetcode/tree/master/solution/rectangle-overlap) | Easy |
-| 837 | [New 21 Game](https://leetcode.com/problems/new-21-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/new-21-game) | Medium |
-| 838 | [Push Dominoes](https://leetcode.com/problems/push-dominoes) | [Go](https://github.com/openset/leetcode/tree/master/solution/push-dominoes) | Medium |
-| 839 | [Similar String Groups](https://leetcode.com/problems/similar-string-groups) | [Go](https://github.com/openset/leetcode/tree/master/solution/similar-string-groups) | Hard |
-| 840 | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid) | [Go](https://github.com/openset/leetcode/tree/master/solution/magic-squares-in-grid) | Easy |
-| 841 | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms) | [Go](https://github.com/openset/leetcode/tree/master/solution/keys-and-rooms) | Medium |
-| 842 | [Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-into-fibonacci-sequence) | Medium |
-| 843 | [Guess the Word](https://leetcode.com/problems/guess-the-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/guess-the-word) | Hard |
-| 844 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | [Go](https://github.com/openset/leetcode/tree/master/solution/backspace-string-compare) | Easy |
-| 845 | [Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-mountain-in-array) | Medium |
-| 846 | [Hand of Straights](https://leetcode.com/problems/hand-of-straights) | [Go](https://github.com/openset/leetcode/tree/master/solution/hand-of-straights) | Medium |
-| 847 | [Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-path-visiting-all-nodes) | Hard |
-| 848 | [Shifting Letters](https://leetcode.com/problems/shifting-letters) | [Go](https://github.com/openset/leetcode/tree/master/solution/shifting-letters) | Medium |
-| 849 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximize-distance-to-closest-person) | Easy |
-| 850 | [Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/rectangle-area-ii) | Hard |
-| 851 | [Loud and Rich](https://leetcode.com/problems/loud-and-rich) | [Go](https://github.com/openset/leetcode/tree/master/solution/loud-and-rich) | Medium |
-| 852 | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/peak-index-in-a-mountain-array) | Easy |
-| 853 | [Car Fleet](https://leetcode.com/problems/car-fleet) | [Go](https://github.com/openset/leetcode/tree/master/solution/car-fleet) | Medium |
-| 854 | [K-Similar Strings](https://leetcode.com/problems/k-similar-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-similar-strings) | Hard |
-| 855 | [Exam Room](https://leetcode.com/problems/exam-room) | [Go](https://github.com/openset/leetcode/tree/master/solution/exam-room) | Medium |
-| 856 | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/score-of-parentheses) | Medium |
-| 857 | [Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-cost-to-hire-k-workers) | Hard |
-| 858 | [Mirror Reflection](https://leetcode.com/problems/mirror-reflection) | [Go](https://github.com/openset/leetcode/tree/master/solution/mirror-reflection) | Medium |
-| 859 | [Buddy Strings](https://leetcode.com/problems/buddy-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/buddy-strings) | Easy |
-| 860 | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [Go](https://github.com/openset/leetcode/tree/master/solution/lemonade-change) | Easy |
-| 861 | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/score-after-flipping-matrix) | Medium |
-| 862 | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-subarray-with-sum-at-least-k) | Hard |
-| 863 | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-nodes-distance-k-in-binary-tree) | Medium |
-| 864 | [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-path-to-get-all-keys) | Hard |
-| 865 | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-subtree-with-all-the-deepest-nodes) | Medium |
-| 866 | [Prime Palindrome](https://leetcode.com/problems/prime-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/prime-palindrome) | Medium |
-| 867 | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/transpose-matrix) | Easy |
-| 868 | [Binary Gap](https://leetcode.com/problems/binary-gap) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-gap) | Easy |
-| 869 | [Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2) | [Go](https://github.com/openset/leetcode/tree/master/solution/reordered-power-of-2) | Medium |
-| 870 | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle) | [Go](https://github.com/openset/leetcode/tree/master/solution/advantage-shuffle) | Medium |
-| 871 | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-number-of-refueling-stops) | Hard |
-| 872 | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/leaf-similar-trees) | Easy |
-| 873 | [Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/length-of-longest-fibonacci-subsequence) | Medium |
-| 874 | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation) | [Go](https://github.com/openset/leetcode/tree/master/solution/walking-robot-simulation) | Easy |
-| 875 | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas) | [Go](https://github.com/openset/leetcode/tree/master/solution/koko-eating-bananas) | Medium |
-| 876 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/middle-of-the-linked-list) | Easy |
-| 877 | [Stone Game](https://leetcode.com/problems/stone-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/stone-game) | Medium |
-| 878 | [Nth Magical Number](https://leetcode.com/problems/nth-magical-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/nth-magical-number) | Hard |
-| 879 | [Profitable Schemes](https://leetcode.com/problems/profitable-schemes) | [Go](https://github.com/openset/leetcode/tree/master/solution/profitable-schemes) | Hard |
-| 880 | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/decoded-string-at-index) | Medium |
-| 881 | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people) | [Go](https://github.com/openset/leetcode/tree/master/solution/boats-to-save-people) | Medium |
-| 882 | [Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph) | [Go](https://github.com/openset/leetcode/tree/master/solution/reachable-nodes-in-subdivided-graph) | Hard |
-| 883 | [Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/solution/projection-area-of-3d-shapes) | Easy |
-| 884 | [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences) | [Go](https://github.com/openset/leetcode/tree/master/solution/uncommon-words-from-two-sentences) | Easy |
-| 885 | [Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix-iii) | Medium |
-| 886 | [Possible Bipartition](https://leetcode.com/problems/possible-bipartition) | [Go](https://github.com/openset/leetcode/tree/master/solution/possible-bipartition) | Medium |
-| 887 | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-egg-drop) | Hard |
-| 888 | [Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap) | [Go](https://github.com/openset/leetcode/tree/master/solution/fair-candy-swap) | Easy |
-| 889 | [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-preorder-and-postorder-traversal) | Medium |
-| 890 | [Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-and-replace-pattern) | Medium |
-| 891 | [Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-subsequence-widths) | Hard |
-| 892 | [Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/solution/surface-area-of-3d-shapes) | Easy |
-| 893 | [Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/groups-of-special-equivalent-strings) | Easy |
-| 894 | [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-possible-full-binary-trees) | Medium |
-| 895 | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-frequency-stack) | Hard |
-| 896 | [Monotonic Array](https://leetcode.com/problems/monotonic-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/monotonic-array) | Easy |
-| 897 | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-order-search-tree) | Easy |
-| 898 | [Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/bitwise-ors-of-subarrays) | Medium |
-| 899 | [Orderly Queue](https://leetcode.com/problems/orderly-queue) | [Go](https://github.com/openset/leetcode/tree/master/solution/orderly-queue) | Hard |
-| 900 | [RLE Iterator](https://leetcode.com/problems/rle-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/rle-iterator) | Medium |
-| 901 | [Online Stock Span](https://leetcode.com/problems/online-stock-span) | [Go](https://github.com/openset/leetcode/tree/master/solution/online-stock-span) | Medium |
-| 902 | [Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set) | [Go](https://github.com/openset/leetcode/tree/master/solution/numbers-at-most-n-given-digit-set) | Hard |
-| 903 | [Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-permutations-for-di-sequence) | Hard |
-| 904 | [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets) | [Go](https://github.com/openset/leetcode/tree/master/solution/fruit-into-baskets) | Medium |
-| 905 | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-array-by-parity) | Easy |
-| 906 | [Super Palindromes](https://leetcode.com/problems/super-palindromes) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-palindromes) | Hard |
-| 907 | [Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-subarray-minimums) | Medium |
-| 908 | [Smallest Range I](https://leetcode.com/problems/smallest-range-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-range-i) | Easy |
-| 909 | [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders) | [Go](https://github.com/openset/leetcode/tree/master/solution/snakes-and-ladders) | Medium |
-| 910 | [Smallest Range II](https://leetcode.com/problems/smallest-range-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-range-ii) | Medium |
-| 911 | [Online Election](https://leetcode.com/problems/online-election) | [Go](https://github.com/openset/leetcode/tree/master/solution/online-election) | Medium |
-| 913 | [Cat and Mouse](https://leetcode.com/problems/cat-and-mouse) | [Go](https://github.com/openset/leetcode/tree/master/solution/cat-and-mouse) | Hard |
-| 914 | [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | [Go](https://github.com/openset/leetcode/tree/master/solution/x-of-a-kind-in-a-deck-of-cards) | Easy |
-| 915 | [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-array-into-disjoint-intervals) | Medium |
-| 916 | [Word Subsets](https://leetcode.com/problems/word-subsets) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-subsets) | Medium |
-| 917 | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-only-letters) | Easy |
-| 918 | [Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-sum-circular-subarray) | Medium |
-| 919 | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter) | [Go](https://github.com/openset/leetcode/tree/master/solution/complete-binary-tree-inserter) | Medium |
-| 920 | [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-music-playlists) | Hard |
-| 921 | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-add-to-make-parentheses-valid) | Medium |
-| 922 | [Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-array-by-parity-ii) | Easy |
-| 923 | [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity) | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-with-multiplicity) | Medium |
-| 924 | [Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-malware-spread) | Hard |
-| 925 | [Long Pressed Name](https://leetcode.com/problems/long-pressed-name) | [Go](https://github.com/openset/leetcode/tree/master/solution/long-pressed-name) | Easy |
-| 926 | [Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing) | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-string-to-monotone-increasing) | Medium |
-| 927 | [Three Equal Parts](https://leetcode.com/problems/three-equal-parts) | [Go](https://github.com/openset/leetcode/tree/master/solution/three-equal-parts) | Hard |
-| 928 | [Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-malware-spread-ii) | Hard |
-| 929 | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-email-addresses) | Easy |
-| 930 | [Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-subarrays-with-sum) | Medium |
-| 931 | [Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-falling-path-sum) | Medium |
-| 932 | [Beautiful Array](https://leetcode.com/problems/beautiful-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-array) | Medium |
-| 933 | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-recent-calls) | Easy |
-| 934 | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-bridge) | Medium |
-| 935 | [Knight Dialer](https://leetcode.com/problems/knight-dialer) | [Go](https://github.com/openset/leetcode/tree/master/solution/knight-dialer) | Medium |
-| 936 | [Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/stamping-the-sequence) | Hard |
-| 937 | [Reorder Log Files](https://leetcode.com/problems/reorder-log-files) | [Go](https://github.com/openset/leetcode/tree/master/solution/reorder-log-files) | Easy |
-| 938 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-of-bst) | Medium |
-| 939 | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-area-rectangle) | Medium |
-| 940 | [Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/distinct-subsequences-ii) | Hard |
-| 941 | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-mountain-array) | Easy |
-| 942 | [DI String Match](https://leetcode.com/problems/di-string-match) | [Go](https://github.com/openset/leetcode/tree/master/solution/di-string-match) | Easy |
-| 943 | [Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-shortest-superstring) | Hard |
-| 944 | [Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted) | Easy |
-| 945 | [Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-increment-to-make-array-unique) | Medium |
-| 946 | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/validate-stack-sequences) | Medium |
-| 947 | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-stones-removed-with-same-row-or-column) | Medium |
-| 948 | [Bag of Tokens](https://leetcode.com/problems/bag-of-tokens) | [Go](https://github.com/openset/leetcode/tree/master/solution/bag-of-tokens) | Medium |
-| 949 | [Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-time-for-given-digits) | Easy |
-| 950 | [Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/reveal-cards-in-increasing-order) | Medium |
-| 951 | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-equivalent-binary-trees) | Medium |
-| 952 | [Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-component-size-by-common-factor) | Hard |
-| 953 | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/verifying-an-alien-dictionary) | Easy |
-| 954 | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-of-doubled-pairs) | Medium |
-| 955 | [Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted-ii) | Medium |
-| 956 | [Tallest Billboard](https://leetcode.com/problems/tallest-billboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/tallest-billboard) | Hard |
-| 957 | [Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days) | [Go](https://github.com/openset/leetcode/tree/master/solution/prison-cells-after-n-days) | Medium |
-| 958 | [Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/check-completeness-of-a-binary-tree) | Medium |
-| 959 | [Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes) | [Go](https://github.com/openset/leetcode/tree/master/solution/regions-cut-by-slashes) | Medium |
-| 960 | [Delete Columns to Make Sorted III](https://leetcode.com/problems/delete-columns-to-make-sorted-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted-iii) | Hard |
+| <span id="1">1</span> | [Two Sum](https://leetcode.com/problems/two-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum) | Easy |
+| <span id="2">2</span> | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers) | Medium |
+| <span id="3">3</span> | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-without-repeating-characters) | Medium |
+| <span id="4">4</span> | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/median-of-two-sorted-arrays) | Hard |
+| <span id="5">5</span> | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-palindromic-substring) | Medium |
+| <span id="6">6</span> | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | [Go](https://github.com/openset/leetcode/tree/master/solution/zigzag-conversion) | Medium |
+| <span id="7">7</span> | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-integer) | Easy |
+| <span id="8">8</span> | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | [Go](https://github.com/openset/leetcode/tree/master/solution/string-to-integer-atoi) | Medium |
+| <span id="9">9</span> | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-number) | Easy |
+| <span id="10">10</span> | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | [Go](https://github.com/openset/leetcode/tree/master/solution/regular-expression-matching) | Hard |
+| <span id="11">11</span> | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/container-with-most-water) | Medium |
+| <span id="12">12</span> | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-to-roman) | Medium |
+| <span id="13">13</span> | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | [Go](https://github.com/openset/leetcode/tree/master/solution/roman-to-integer) | Easy |
+| <span id="14">14</span> | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-common-prefix) | Easy |
+| <span id="15">15</span> | [3Sum](https://leetcode.com/problems/3sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum) | Medium |
+| <span id="16">16</span> | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-closest) | Medium |
+| <span id="17">17</span> | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/letter-combinations-of-a-phone-number) | Medium |
+| <span id="18">18</span> | [4Sum](https://leetcode.com/problems/4sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/4sum) | Medium |
+| <span id="19">19</span> | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-nth-node-from-end-of-list) | Medium |
+| <span id="20">20</span> | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-parentheses) | Easy |
+| <span id="21">21</span> | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-two-sorted-lists) | Easy |
+| <span id="22">22</span> | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/generate-parentheses) | Medium |
+| <span id="23">23</span> | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-k-sorted-lists) | Hard |
+| <span id="24">24</span> | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-nodes-in-pairs) | Medium |
+| <span id="25">25</span> | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-nodes-in-k-group) | Hard |
+| <span id="26">26</span> | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-array) | Easy |
+| <span id="27">27</span> | [Remove Element](https://leetcode.com/problems/remove-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-element) | Easy |
+| <span id="28">28</span> | [Implement strStr()](https://leetcode.com/problems/implement-strstr) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-strstr) | Easy |
+| <span id="29">29</span> | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/solution/divide-two-integers) | Medium |
+| <span id="30">30</span> | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/substring-with-concatenation-of-all-words) | Hard |
+| <span id="31">31</span> | [Next Permutation](https://leetcode.com/problems/next-permutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-permutation) | Medium |
+| <span id="32">32</span> | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-valid-parentheses) | Hard |
+| <span id="33">33</span> | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-rotated-sorted-array) | Medium |
+| <span id="34">34</span> | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-first-and-last-position-of-element-in-sorted-array) | Medium |
+| <span id="35">35</span> | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-insert-position) | Easy |
+| <span id="36">36</span> | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-sudoku) | Medium |
+| <span id="37">37</span> | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | [Go](https://github.com/openset/leetcode/tree/master/solution/sudoku-solver) | Hard |
+| <span id="38">38</span> | [Count and Say](https://leetcode.com/problems/count-and-say) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-and-say) | Easy |
+| <span id="39">39</span> | [Combination Sum](https://leetcode.com/problems/combination-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum) | Medium |
+| <span id="40">40</span> | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum-ii) | Medium |
+| <span id="41">41</span> | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | [Go](https://github.com/openset/leetcode/tree/master/solution/first-missing-positive) | Hard |
+| <span id="42">42</span> | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/trapping-rain-water) | Hard |
+| <span id="43">43</span> | [Multiply Strings](https://leetcode.com/problems/multiply-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/multiply-strings) | Medium |
+| <span id="44">44</span> | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | [Go](https://github.com/openset/leetcode/tree/master/solution/wildcard-matching) | Hard |
+| <span id="45">45</span> | [Jump Game II](https://leetcode.com/problems/jump-game-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/jump-game-ii) | Hard |
+| <span id="46">46</span> | [Permutations](https://leetcode.com/problems/permutations) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutations) | Medium |
+| <span id="47">47</span> | [Permutations II](https://leetcode.com/problems/permutations-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutations-ii) | Medium |
+| <span id="48">48</span> | [Rotate Image](https://leetcode.com/problems/rotate-image) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-image) | Medium |
+| <span id="49">49</span> | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | [Go](https://github.com/openset/leetcode/tree/master/solution/group-anagrams) | Medium |
+| <span id="50">50</span> | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [Go](https://github.com/openset/leetcode/tree/master/solution/powx-n) | Medium |
+| <span id="51">51</span> | [N-Queens](https://leetcode.com/problems/n-queens) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-queens) | Hard |
+| <span id="52">52</span> | [N-Queens II](https://leetcode.com/problems/n-queens-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-queens-ii) | Hard |
+| <span id="53">53</span> | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-subarray) | Easy |
+| <span id="54">54</span> | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix) | Medium |
+| <span id="55">55</span> | [Jump Game](https://leetcode.com/problems/jump-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/jump-game) | Medium |
+| <span id="56">56</span> | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-intervals) | Medium |
+| <span id="57">57</span> | [Insert Interval](https://leetcode.com/problems/insert-interval) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-interval) | Hard |
+| <span id="58">58</span> | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/length-of-last-word) | Easy |
+| <span id="59">59</span> | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix-ii) | Medium |
+| <span id="60">60</span> | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutation-sequence) | Medium |
+| <span id="61">61</span> | [Rotate List](https://leetcode.com/problems/rotate-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-list) | Medium |
+| <span id="62">62</span> | [Unique Paths](https://leetcode.com/problems/unique-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-paths) | Medium |
+| <span id="63">63</span> | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-paths-ii) | Medium |
+| <span id="64">64</span> | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-path-sum) | Medium |
+| <span id="65">65</span> | [Valid Number](https://leetcode.com/problems/valid-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-number) | Hard |
+| <span id="66">66</span> | [Plus One](https://leetcode.com/problems/plus-one) | [Go](https://github.com/openset/leetcode/tree/master/solution/plus-one) | Easy |
+| <span id="67">67</span> | [Add Binary](https://leetcode.com/problems/add-binary) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-binary) | Easy |
+| <span id="68">68</span> | [Text Justification](https://leetcode.com/problems/text-justification) | [Go](https://github.com/openset/leetcode/tree/master/solution/text-justification) | Hard |
+| <span id="69">69</span> | [Sqrt(x)](https://leetcode.com/problems/sqrtx) | [Go](https://github.com/openset/leetcode/tree/master/solution/sqrtx) | Easy |
+| <span id="70">70</span> | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/climbing-stairs) | Easy |
+| <span id="71">71</span> | [Simplify Path](https://leetcode.com/problems/simplify-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/simplify-path) | Medium |
+| <span id="72">72</span> | [Edit Distance](https://leetcode.com/problems/edit-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/edit-distance) | Hard |
+| <span id="73">73</span> | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-matrix-zeroes) | Medium |
+| <span id="74">74</span> | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-a-2d-matrix) | Medium |
+| <span id="75">75</span> | [Sort Colors](https://leetcode.com/problems/sort-colors) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-colors) | Medium |
+| <span id="76">76</span> | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-window-substring) | Hard |
+| <span id="77">77</span> | [Combinations](https://leetcode.com/problems/combinations) | [Go](https://github.com/openset/leetcode/tree/master/solution/combinations) | Medium |
+| <span id="78">78</span> | [Subsets](https://leetcode.com/problems/subsets) | [Go](https://github.com/openset/leetcode/tree/master/solution/subsets) | Medium |
+| <span id="79">79</span> | [Word Search](https://leetcode.com/problems/word-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-search) | Medium |
+| <span id="80">80</span> | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-array-ii) | Medium |
+| <span id="81">81</span> | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-rotated-sorted-array-ii) | Medium |
+| <span id="82">82</span> | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-list-ii) | Medium |
+| <span id="83">83</span> | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-list) | Easy |
+| <span id="84">84</span> | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-rectangle-in-histogram) | Hard |
+| <span id="85">85</span> | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximal-rectangle) | Hard |
+| <span id="86">86</span> | [Partition List](https://leetcode.com/problems/partition-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-list) | Medium |
+| <span id="87">87</span> | [Scramble String](https://leetcode.com/problems/scramble-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/scramble-string) | Hard |
+| <span id="88">88</span> | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-sorted-array) | Easy |
+| <span id="89">89</span> | [Gray Code](https://leetcode.com/problems/gray-code) | [Go](https://github.com/openset/leetcode/tree/master/solution/gray-code) | Medium |
+| <span id="90">90</span> | [Subsets II](https://leetcode.com/problems/subsets-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/subsets-ii) | Medium |
+| <span id="91">91</span> | [Decode Ways](https://leetcode.com/problems/decode-ways) | [Go](https://github.com/openset/leetcode/tree/master/solution/decode-ways) | Medium |
+| <span id="92">92</span> | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-linked-list-ii) | Medium |
+| <span id="93">93</span> | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | [Go](https://github.com/openset/leetcode/tree/master/solution/restore-ip-addresses) | Medium |
+| <span id="94">94</span> | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-inorder-traversal) | Medium |
+| <span id="95">95</span> | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-binary-search-trees-ii) | Medium |
+| <span id="96">96</span> | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-binary-search-trees) | Medium |
+| <span id="97">97</span> | [Interleaving String](https://leetcode.com/problems/interleaving-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/interleaving-string) | Hard |
+| <span id="98">98</span> | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/validate-binary-search-tree) | Medium |
+| <span id="99">99</span> | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/recover-binary-search-tree) | Hard |
+| <span id="100">100</span> | [Same Tree](https://leetcode.com/problems/same-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/same-tree) | Easy |
+| <span id="101">101</span> | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/symmetric-tree) | Easy |
+| <span id="102">102</span> | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-level-order-traversal) | Medium |
+| <span id="103">103</span> | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-zigzag-level-order-traversal) | Medium |
+| <span id="104">104</span> | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-depth-of-binary-tree) | Easy |
+| <span id="105">105</span> | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium |
+| <span id="106">106</span> | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-inorder-and-postorder-traversal) | Medium |
+| <span id="107">107</span> | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-level-order-traversal-ii) | Easy |
+| <span id="108">108</span> | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-sorted-array-to-binary-search-tree) | Easy |
+| <span id="109">109</span> | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-sorted-list-to-binary-search-tree) | Medium |
+| <span id="110">110</span> | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/balanced-binary-tree) | Easy |
+| <span id="111">111</span> | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-depth-of-binary-tree) | Easy |
+| <span id="112">112</span> | [Path Sum](https://leetcode.com/problems/path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum) | Easy |
+| <span id="113">113</span> | [Path Sum II](https://leetcode.com/problems/path-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-ii) | Medium |
+| <span id="114">114</span> | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-binary-tree-to-linked-list) | Medium |
+| <span id="115">115</span> | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/distinct-subsequences) | Hard |
+| <span id="116">116</span> | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | [Go](https://github.com/openset/leetcode/tree/master/solution/populating-next-right-pointers-in-each-node) | Medium |
+| <span id="117">117</span> | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/populating-next-right-pointers-in-each-node-ii) | Medium |
+| <span id="118">118</span> | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/pascals-triangle) | Easy |
+| <span id="119">119</span> | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/pascals-triangle-ii) | Easy |
+| <span id="120">120</span> | [Triangle](https://leetcode.com/problems/triangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/triangle) | Medium |
+| <span id="121">121</span> | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock) | Easy |
+| <span id="122">122</span> | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-ii) | Easy |
+| <span id="123">123</span> | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iii) | Hard |
+| <span id="124">124</span> | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-maximum-path-sum) | Hard |
+| <span id="125">125</span> | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-palindrome) | Easy |
+| <span id="126">126</span> | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-ladder-ii) | Hard |
+| <span id="127">127</span> | [Word Ladder](https://leetcode.com/problems/word-ladder) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-ladder) | Medium |
+| <span id="128">128</span> | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-consecutive-sequence) | Hard |
+| <span id="129">129</span> | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-root-to-leaf-numbers) | Medium |
+| <span id="130">130</span> | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions) | [Go](https://github.com/openset/leetcode/tree/master/solution/surrounded-regions) | Medium |
+| <span id="131">131</span> | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-partitioning) | Medium |
+| <span id="132">132</span> | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-partitioning-ii) | Hard |
+| <span id="133">133</span> | [Clone Graph](https://leetcode.com/problems/clone-graph) | [Go](https://github.com/openset/leetcode/tree/master/solution/clone-graph) | Medium |
+| <span id="134">134</span> | [Gas Station](https://leetcode.com/problems/gas-station) | [Go](https://github.com/openset/leetcode/tree/master/solution/gas-station) | Medium |
+| <span id="135">135</span> | [Candy](https://leetcode.com/problems/candy) | [Go](https://github.com/openset/leetcode/tree/master/solution/candy) | Hard |
+| <span id="136">136</span> | [Single Number](https://leetcode.com/problems/single-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-number) | Easy |
+| <span id="137">137</span> | [Single Number II](https://leetcode.com/problems/single-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-number-ii) | Medium |
+| <span id="138">138</span> | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | [Go](https://github.com/openset/leetcode/tree/master/solution/copy-list-with-random-pointer) | Medium |
+| <span id="139">139</span> | [Word Break](https://leetcode.com/problems/word-break) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-break) | Medium |
+| <span id="140">140</span> | [Word Break II](https://leetcode.com/problems/word-break-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-break-ii) | Hard |
+| <span id="141">141</span> | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-cycle) | Easy |
+| <span id="142">142</span> | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-cycle-ii) | Medium |
+| <span id="143">143</span> | [Reorder List](https://leetcode.com/problems/reorder-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/reorder-list) | Medium |
+| <span id="144">144</span> | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-preorder-traversal) | Medium |
+| <span id="145">145</span> | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-postorder-traversal) | Hard |
+| <span id="146">146</span> | [LRU Cache](https://leetcode.com/problems/lru-cache) | [Go](https://github.com/openset/leetcode/tree/master/solution/lru-cache) | Hard |
+| <span id="147">147</span> | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/insertion-sort-list) | Medium |
+| <span id="148">148</span> | [Sort List](https://leetcode.com/problems/sort-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-list) | Medium |
+| <span id="149">149</span> | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-points-on-a-line) | Hard |
+| <span id="150">150</span> | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | [Go](https://github.com/openset/leetcode/tree/master/solution/evaluate-reverse-polish-notation) | Medium |
+| <span id="151">151</span> | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string) | Medium |
+| <span id="152">152</span> | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-subarray) | Medium |
+| <span id="153">153</span> | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array) | Medium |
+| <span id="154">154</span> | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array-ii) | Hard |
+| <span id="155">155</span> | [Min Stack](https://leetcode.com/problems/min-stack) | [Go](https://github.com/openset/leetcode/tree/master/solution/min-stack) | Easy |
+| <span id="156">156</span> | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-upside-down) | Medium |
+| <span id="157">157</span> | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4) | Easy |
+| <span id="158">158</span> | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4-ii-call-multiple-times) | Hard |
+| <span id="159">159</span> | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-two-distinct-characters) | Hard |
+| <span id="160">160</span> | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-linked-lists) | Easy |
+| <span id="161">161</span> | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/one-edit-distance) | Medium |
+| <span id="162">162</span> | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-peak-element) | Medium |
+| <span id="163">163</span> | [Missing Ranges](https://leetcode.com/problems/missing-ranges) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/missing-ranges) | Medium |
+| <span id="164">164</span> | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-gap) | Hard |
+| <span id="165">165</span> | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/compare-version-numbers) | Medium |
+| <span id="166">166</span> | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [Go](https://github.com/openset/leetcode/tree/master/solution/fraction-to-recurring-decimal) | Medium |
+| <span id="167">167</span> | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-ii-input-array-is-sorted) | Easy |
+| <span id="168">168</span> | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [Go](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-title) | Easy |
+| <span id="169">169</span> | [Majority Element](https://leetcode.com/problems/majority-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/majority-element) | Easy |
+| <span id="170">170</span> | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iii-data-structure-design) | Easy |
+| <span id="171">171</span> | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-number) | Easy |
+| <span id="172">172</span> | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/factorial-trailing-zeroes) | Easy |
+| <span id="173">173</span> | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-search-tree-iterator) | Medium |
+| <span id="174">174</span> | [Dungeon Game](https://leetcode.com/problems/dungeon-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/dungeon-game) | Hard |
+| <span id="175">175</span> | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | [Go](https://github.com/openset/leetcode/tree/master/solution/combine-two-tables) | Easy |
+| <span id="176">176</span> | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/second-highest-salary) | Easy |
+| <span id="177">177</span> | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/nth-highest-salary) | Medium |
+| <span id="178">178</span> | [Rank Scores](https://leetcode.com/problems/rank-scores) | [Go](https://github.com/openset/leetcode/tree/master/solution/rank-scores) | Medium |
+| <span id="179">179</span> | [Largest Number](https://leetcode.com/problems/largest-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-number) | Medium |
+| <span id="180">180</span> | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-numbers) | Medium |
+| <span id="181">181</span> | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | [Go](https://github.com/openset/leetcode/tree/master/solution/employees-earning-more-than-their-managers) | Easy |
+| <span id="182">182</span> | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/solution/duplicate-emails) | Easy |
+| <span id="183">183</span> | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/customers-who-never-order) | Easy |
+| <span id="184">184</span> | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/department-highest-salary) | Medium |
+| <span id="185">185</span> | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [Go](https://github.com/openset/leetcode/tree/master/solution/department-top-three-salaries) | Hard |
+| <span id="186">186</span> | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-ii) | Medium |
+| <span id="187">187</span> | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-dna-sequences) | Medium |
+| <span id="188">188</span> | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iv) | Hard |
+| <span id="189">189</span> | [Rotate Array](https://leetcode.com/problems/rotate-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-array) | Easy |
+| <span id="190">190</span> | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-bits) | Easy |
+| <span id="191">191</span> | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-1-bits) | Easy |
+| <span id="192">192</span> | [Word Frequency](https://leetcode.com/problems/word-frequency) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-frequency) | Medium |
+| <span id="193">193</span> | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-phone-numbers) | Easy |
+| <span id="194">194</span> | [Transpose File](https://leetcode.com/problems/transpose-file) | [Go](https://github.com/openset/leetcode/tree/master/solution/transpose-file) | Medium |
+| <span id="195">195</span> | [Tenth Line](https://leetcode.com/problems/tenth-line) | [Go](https://github.com/openset/leetcode/tree/master/solution/tenth-line) | Easy |
+| <span id="196">196</span> | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-duplicate-emails) | Easy |
+| <span id="197">197</span> | [Rising Temperature](https://leetcode.com/problems/rising-temperature) | [Go](https://github.com/openset/leetcode/tree/master/solution/rising-temperature) | Easy |
+| <span id="198">198</span> | [House Robber](https://leetcode.com/problems/house-robber) | [Go](https://github.com/openset/leetcode/tree/master/solution/house-robber) | Easy |
+| <span id="199">199</span> | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-right-side-view) | Medium |
+| <span id="200">200</span> | [Number of Islands](https://leetcode.com/problems/number-of-islands) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-islands) | Medium |
+| <span id="201">201</span> | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | [Go](https://github.com/openset/leetcode/tree/master/solution/bitwise-and-of-numbers-range) | Medium |
+| <span id="202">202</span> | [Happy Number](https://leetcode.com/problems/happy-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/happy-number) | Easy |
+| <span id="203">203</span> | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-linked-list-elements) | Easy |
+| <span id="204">204</span> | [Count Primes](https://leetcode.com/problems/count-primes) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-primes) | Easy |
+| <span id="205">205</span> | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/isomorphic-strings) | Easy |
+| <span id="206">206</span> | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-linked-list) | Easy |
+| <span id="207">207</span> | [Course Schedule](https://leetcode.com/problems/course-schedule) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule) | Medium |
+| <span id="208">208</span> | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-trie-prefix-tree) | Medium |
+| <span id="209">209</span> | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-size-subarray-sum) | Medium |
+| <span id="210">210</span> | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule-ii) | Medium |
+| <span id="211">211</span> | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-and-search-word-data-structure-design) | Medium |
+| <span id="212">212</span> | [Word Search II](https://leetcode.com/problems/word-search-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-search-ii) | Hard |
+| <span id="213">213</span> | [House Robber II](https://leetcode.com/problems/house-robber-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/house-robber-ii) | Medium |
+| <span id="214">214</span> | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-palindrome) | Hard |
+| <span id="215">215</span> | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-largest-element-in-an-array) | Medium |
+| <span id="216">216</span> | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum-iii) | Medium |
+| <span id="217">217</span> | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [Go](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate) | Easy |
+| <span id="218">218</span> | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | [Go](https://github.com/openset/leetcode/tree/master/solution/the-skyline-problem) | Hard |
+| <span id="219">219</span> | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate-ii) | Easy |
+| <span id="220">220</span> | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate-iii) | Medium |
+| <span id="221">221</span> | [Maximal Square](https://leetcode.com/problems/maximal-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximal-square) | Medium |
+| <span id="222">222</span> | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-complete-tree-nodes) | Medium |
+| <span id="223">223</span> | [Rectangle Area](https://leetcode.com/problems/rectangle-area) | [Go](https://github.com/openset/leetcode/tree/master/solution/rectangle-area) | Medium |
+| <span id="224">224</span> | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator) | Hard |
+| <span id="225">225</span> | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-stack-using-queues) | Easy |
+| <span id="226">226</span> | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/invert-binary-tree) | Easy |
+| <span id="227">227</span> | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-ii) | Medium |
+| <span id="228">228</span> | [Summary Ranges](https://leetcode.com/problems/summary-ranges) | [Go](https://github.com/openset/leetcode/tree/master/solution/summary-ranges) | Medium |
+| <span id="229">229</span> | [Majority Element II](https://leetcode.com/problems/majority-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/majority-element-ii) | Medium |
+| <span id="230">230</span> | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-element-in-a-bst) | Medium |
+| <span id="231">231</span> | [Power of Two](https://leetcode.com/problems/power-of-two) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-two) | Easy |
+| <span id="232">232</span> | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-queue-using-stacks) | Easy |
+| <span id="233">233</span> | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-digit-one) | Hard |
+| <span id="234">234</span> | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-linked-list) | Easy |
+| <span id="235">235</span> | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/lowest-common-ancestor-of-a-binary-search-tree) | Easy |
+| <span id="236">236</span> | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/lowest-common-ancestor-of-a-binary-tree) | Medium |
+| <span id="237">237</span> | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-node-in-a-linked-list) | Easy |
+| <span id="238">238</span> | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | [Go](https://github.com/openset/leetcode/tree/master/solution/product-of-array-except-self) | Medium |
+| <span id="239">239</span> | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | [Go](https://github.com/openset/leetcode/tree/master/solution/sliding-window-maximum) | Hard |
+| <span id="240">240</span> | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-a-2d-matrix-ii) | Medium |
+| <span id="241">241</span> | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/different-ways-to-add-parentheses) | Medium |
+| <span id="242">242</span> | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-anagram) | Easy |
+| <span id="243">243</span> | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance) | Easy |
+| <span id="244">244</span> | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-ii) | Medium |
+| <span id="245">245</span> | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-iii) | Medium |
+| <span id="246">246</span> | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number) | Easy |
+| <span id="247">247</span> | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-ii) | Medium |
+| <span id="248">248</span> | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-iii) | Hard |
+| <span id="249">249</span> | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/group-shifted-strings) | Medium |
+| <span id="250">250</span> | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/count-univalue-subtrees) | Medium |
+| <span id="251">251</span> | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-2d-vector) | Medium |
+| <span id="252">252</span> | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms) | Easy |
+| <span id="253">253</span> | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms-ii) | Medium |
+| <span id="254">254</span> | [Factor Combinations](https://leetcode.com/problems/factor-combinations) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/factor-combinations) | Medium |
+| <span id="255">255</span> | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-sequence-in-binary-search-tree) | Medium |
+| <span id="256">256</span> | [Paint House](https://leetcode.com/problems/paint-house) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house) | Easy |
+| <span id="257">257</span> | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-paths) | Easy |
+| <span id="258">258</span> | [Add Digits](https://leetcode.com/problems/add-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-digits) | Easy |
+| <span id="259">259</span> | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-smaller) | Medium |
+| <span id="260">260</span> | [Single Number III](https://leetcode.com/problems/single-number-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-number-iii) | Medium |
+| <span id="261">261</span> | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/graph-valid-tree) | Medium |
+| <span id="262">262</span> | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [Go](https://github.com/openset/leetcode/tree/master/solution/trips-and-users) | Hard |
+| <span id="263">263</span> | [Ugly Number](https://leetcode.com/problems/ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/ugly-number) | Easy |
+| <span id="264">264</span> | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/ugly-number-ii) | Medium |
+| <span id="265">265</span> | [Paint House II](https://leetcode.com/problems/paint-house-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house-ii) | Hard |
+| <span id="266">266</span> | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation) | Easy |
+| <span id="267">267</span> | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation-ii) | Medium |
+| <span id="268">268</span> | [Missing Number](https://leetcode.com/problems/missing-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/missing-number) | Easy |
+| <span id="269">269</span> | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/alien-dictionary) | Hard |
+| <span id="270">270</span> | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value) | Easy |
+| <span id="271">271</span> | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-strings) | Medium |
+| <span id="272">272</span> | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value-ii) | Hard |
+| <span id="273">273</span> | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-to-english-words) | Hard |
+| <span id="274">274</span> | [H-Index](https://leetcode.com/problems/h-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/h-index) | Medium |
+| <span id="275">275</span> | [H-Index II](https://leetcode.com/problems/h-index-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/h-index-ii) | Medium |
+| <span id="276">276</span> | [Paint Fence](https://leetcode.com/problems/paint-fence) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-fence) | Easy |
+| <span id="277">277</span> | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-celebrity) | Medium |
+| <span id="278">278</span> | [First Bad Version](https://leetcode.com/problems/first-bad-version) | [Go](https://github.com/openset/leetcode/tree/master/solution/first-bad-version) | Easy |
+| <span id="279">279</span> | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-squares) | Medium |
+| <span id="280">280</span> | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort) | Medium |
+| <span id="281">281</span> | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/zigzag-iterator) | Medium |
+| <span id="282">282</span> | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | [Go](https://github.com/openset/leetcode/tree/master/solution/expression-add-operators) | Hard |
+| <span id="283">283</span> | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/move-zeroes) | Easy |
+| <span id="284">284</span> | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/peeking-iterator) | Medium |
+| <span id="285">285</span> | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/inorder-successor-in-bst) | Medium |
+| <span id="286">286</span> | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/walls-and-gates) | Medium |
+| <span id="287">287</span> | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-duplicate-number) | Medium |
+| <span id="288">288</span> | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-word-abbreviation) | Medium |
+| <span id="289">289</span> | [Game of Life](https://leetcode.com/problems/game-of-life) | [Go](https://github.com/openset/leetcode/tree/master/solution/game-of-life) | Medium |
+| <span id="290">290</span> | [Word Pattern](https://leetcode.com/problems/word-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-pattern) | Easy |
+| <span id="291">291</span> | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/word-pattern-ii) | Hard |
+| <span id="292">292</span> | [Nim Game](https://leetcode.com/problems/nim-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/nim-game) | Easy |
+| <span id="293">293</span> | [Flip Game](https://leetcode.com/problems/flip-game) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game) | Easy |
+| <span id="294">294</span> | [Flip Game II](https://leetcode.com/problems/flip-game-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game-ii) | Medium |
+| <span id="295">295</span> | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-median-from-data-stream) | Hard |
+| <span id="296">296</span> | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/best-meeting-point) | Hard |
+| <span id="297">297</span> | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-binary-tree) | Hard |
+| <span id="298">298</span> | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence) | Medium |
+| <span id="299">299</span> | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulls-and-cows) | Medium |
+| <span id="300">300</span> | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-increasing-subsequence) | Medium |
+| <span id="301">301</span> | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-invalid-parentheses) | Hard |
+| <span id="302">302</span> | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rectangle-enclosing-black-pixels) | Hard |
+| <span id="303">303</span> | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-immutable) | Easy |
+| <span id="304">304</span> | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-immutable) | Medium |
+| <span id="305">305</span> | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-islands-ii) | Hard |
+| <span id="306">306</span> | [Additive Number](https://leetcode.com/problems/additive-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/additive-number) | Medium |
+| <span id="307">307</span> | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-mutable) | Medium |
+| <span id="308">308</span> | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-mutable) | Hard |
+| <span id="309">309</span> | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
+| <span id="310">310</span> | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-height-trees) | Medium |
+| <span id="311">311</span> | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/sparse-matrix-multiplication) | Medium |
+| <span id="312">312</span> | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/solution/burst-balloons) | Hard |
+| <span id="313">313</span> | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-ugly-number) | Medium |
+| <span id="314">314</span> | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-vertical-order-traversal) | Medium |
+| <span id="315">315</span> | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-of-smaller-numbers-after-self) | Hard |
+| <span id="316">316</span> | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicate-letters) | Hard |
+| <span id="317">317</span> | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-from-all-buildings) | Hard |
+| <span id="318">318</span> | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-word-lengths) | Medium |
+| <span id="319">319</span> | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulb-switcher) | Medium |
+| <span id="320">320</span> | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/generalized-abbreviation) | Medium |
+| <span id="321">321</span> | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/create-maximum-number) | Hard |
+| <span id="322">322</span> | [Coin Change](https://leetcode.com/problems/coin-change) | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-change) | Medium |
+| <span id="323">323</span> | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-connected-components-in-an-undirected-graph) | Medium |
+| <span id="324">324</span> | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort-ii) | Medium |
+| <span id="325">325</span> | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-size-subarray-sum-equals-k) | Medium |
+| <span id="326">326</span> | [Power of Three](https://leetcode.com/problems/power-of-three) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-three) | Easy |
+| <span id="327">327</span> | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-of-range-sum) | Hard |
+| <span id="328">328</span> | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/odd-even-linked-list) | Medium |
+| <span id="329">329</span> | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-increasing-path-in-a-matrix) | Hard |
+| <span id="330">330</span> | [Patching Array](https://leetcode.com/problems/patching-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/patching-array) | Hard |
+| <span id="331">331</span> | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-serialization-of-a-binary-tree) | Medium |
+| <span id="332">332</span> | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | [Go](https://github.com/openset/leetcode/tree/master/solution/reconstruct-itinerary) | Medium |
+| <span id="333">333</span> | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-bst-subtree) | Medium |
+| <span id="334">334</span> | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-triplet-subsequence) | Medium |
+| <span id="335">335</span> | [Self Crossing](https://leetcode.com/problems/self-crossing) | [Go](https://github.com/openset/leetcode/tree/master/solution/self-crossing) | Hard |
+| <span id="336">336</span> | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-pairs) | Hard |
+| <span id="337">337</span> | [House Robber III](https://leetcode.com/problems/house-robber-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/house-robber-iii) | Medium |
+| <span id="338">338</span> | [Counting Bits](https://leetcode.com/problems/counting-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/counting-bits) | Medium |
+| <span id="339">339</span> | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum) | Easy |
+| <span id="340">340</span> | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-k-distinct-characters) | Hard |
+| <span id="341">341</span> | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-nested-list-iterator) | Medium |
+| <span id="342">342</span> | [Power of Four](https://leetcode.com/problems/power-of-four) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-four) | Easy |
+| <span id="343">343</span> | [Integer Break](https://leetcode.com/problems/integer-break) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-break) | Medium |
+| <span id="344">344</span> | [Reverse String](https://leetcode.com/problems/reverse-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-string) | Easy |
+| <span id="345">345</span> | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-vowels-of-a-string) | Easy |
+| <span id="346">346</span> | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/moving-average-from-data-stream) | Easy |
+| <span id="347">347</span> | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-elements) | Medium |
+| <span id="348">348</span> | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-tic-tac-toe) | Medium |
+| <span id="349">349</span> | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays) | Easy |
+| <span id="350">350</span> | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays-ii) | Easy |
+| <span id="351">351</span> | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/android-unlock-patterns) | Medium |
+| <span id="352">352</span> | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/data-stream-as-disjoint-intervals) | Hard |
+| <span id="353">353</span> | [Design Snake Game](https://leetcode.com/problems/design-snake-game) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-snake-game) | Medium |
+| <span id="354">354</span> | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | [Go](https://github.com/openset/leetcode/tree/master/solution/russian-doll-envelopes) | Hard |
+| <span id="355">355</span> | [Design Twitter](https://leetcode.com/problems/design-twitter) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-twitter) | Medium |
+| <span id="356">356</span> | [Line Reflection](https://leetcode.com/problems/line-reflection) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/line-reflection) | Medium |
+| <span id="357">357</span> | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-numbers-with-unique-digits) | Medium |
+| <span id="358">358</span> | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/rearrange-string-k-distance-apart) | Hard |
+| <span id="359">359</span> | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/logger-rate-limiter) | Easy |
+| <span id="360">360</span> | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-transformed-array) | Medium |
+| <span id="361">361</span> | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/bomb-enemy) | Medium |
+| <span id="362">362</span> | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hit-counter) | Medium |
+| <span id="363">363</span> | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-sum-of-rectangle-no-larger-than-k) | Hard |
+| <span id="364">364</span> | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum-ii) | Medium |
+| <span id="365">365</span> | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem) | [Go](https://github.com/openset/leetcode/tree/master/solution/water-and-jug-problem) | Medium |
+| <span id="366">366</span> | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-leaves-of-binary-tree) | Medium |
+| <span id="367">367</span> | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-perfect-square) | Easy |
+| <span id="368">368</span> | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-divisible-subset) | Medium |
+| <span id="369">369</span> | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/plus-one-linked-list) | Medium |
+| <span id="370">370</span> | [Range Addition](https://leetcode.com/problems/range-addition) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/range-addition) | Medium |
+| <span id="371">371</span> | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-two-integers) | Easy |
+| <span id="372">372</span> | [Super Pow](https://leetcode.com/problems/super-pow) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-pow) | Medium |
+| <span id="373">373</span> | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-pairs-with-smallest-sums) | Medium |
+| <span id="374">374</span> | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | [Go](https://github.com/openset/leetcode/tree/master/solution/guess-number-higher-or-lower) | Easy |
+| <span id="375">375</span> | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/guess-number-higher-or-lower-ii) | Medium |
+| <span id="376">376</span> | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-subsequence) | Medium |
+| <span id="377">377</span> | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum-iv) | Medium |
+| <span id="378">378</span> | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-element-in-a-sorted-matrix) | Medium |
+| <span id="379">379</span> | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-phone-directory) | Medium |
+| <span id="380">380</span> | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o1) | Medium |
+| <span id="381">381</span> | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o1-duplicates-allowed) | Hard |
+| <span id="382">382</span> | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-random-node) | Medium |
+| <span id="383">383</span> | [Ransom Note](https://leetcode.com/problems/ransom-note) | [Go](https://github.com/openset/leetcode/tree/master/solution/ransom-note) | Easy |
+| <span id="384">384</span> | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/shuffle-an-array) | Medium |
+| <span id="385">385</span> | [Mini Parser](https://leetcode.com/problems/mini-parser) | [Go](https://github.com/openset/leetcode/tree/master/solution/mini-parser) | Medium |
+| <span id="386">386</span> | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/lexicographical-numbers) | Medium |
+| <span id="387">387</span> | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/first-unique-character-in-a-string) | Easy |
+| <span id="388">388</span> | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-absolute-file-path) | Medium |
+| <span id="389">389</span> | [Find the Difference](https://leetcode.com/problems/find-the-difference) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-difference) | Easy |
+| <span id="390">390</span> | [Elimination Game](https://leetcode.com/problems/elimination-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/elimination-game) | Medium |
+| <span id="391">391</span> | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-rectangle) | Hard |
+| <span id="392">392</span> | [Is Subsequence](https://leetcode.com/problems/is-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/is-subsequence) | Medium |
+| <span id="393">393</span> | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation) | [Go](https://github.com/openset/leetcode/tree/master/solution/utf-8-validation) | Medium |
+| <span id="394">394</span> | [Decode String](https://leetcode.com/problems/decode-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/decode-string) | Medium |
+| <span id="395">395</span> | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-least-k-repeating-characters) | Medium |
+| <span id="396">396</span> | [Rotate Function](https://leetcode.com/problems/rotate-function) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-function) | Medium |
+| <span id="397">397</span> | [Integer Replacement](https://leetcode.com/problems/integer-replacement) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-replacement) | Medium |
+| <span id="398">398</span> | [Random Pick Index](https://leetcode.com/problems/random-pick-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-index) | Medium |
+| <span id="399">399</span> | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | [Go](https://github.com/openset/leetcode/tree/master/solution/evaluate-division) | Medium |
+| <span id="400">400</span> | [Nth Digit](https://leetcode.com/problems/nth-digit) | [Go](https://github.com/openset/leetcode/tree/master/solution/nth-digit) | Easy |
+| <span id="401">401</span> | [Binary Watch](https://leetcode.com/problems/binary-watch) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-watch) | Easy |
+| <span id="402">402</span> | [Remove K Digits](https://leetcode.com/problems/remove-k-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-k-digits) | Medium |
+| <span id="403">403</span> | [Frog Jump](https://leetcode.com/problems/frog-jump) | [Go](https://github.com/openset/leetcode/tree/master/solution/frog-jump) | Hard |
+| <span id="404">404</span> | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-left-leaves) | Easy |
+| <span id="405">405</span> | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-a-number-to-hexadecimal) | Easy |
+| <span id="406">406</span> | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | [Go](https://github.com/openset/leetcode/tree/master/solution/queue-reconstruction-by-height) | Medium |
+| <span id="407">407</span> | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/trapping-rain-water-ii) | Hard |
+| <span id="408">408</span> | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-abbreviation) | Easy |
+| <span id="409">409</span> | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-palindrome) | Easy |
+| <span id="410">410</span> | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-largest-sum) | Hard |
+| <span id="411">411</span> | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-unique-word-abbreviation) | Hard |
+| <span id="412">412</span> | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [Go](https://github.com/openset/leetcode/tree/master/solution/fizz-buzz) | Easy |
+| <span id="413">413</span> | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | [Go](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices) | Medium |
+| <span id="414">414</span> | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/third-maximum-number) | Easy |
+| <span id="415">415</span> | [Add Strings](https://leetcode.com/problems/add-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-strings) | Easy |
+| <span id="416">416</span> | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-equal-subset-sum) | Medium |
+| <span id="417">417</span> | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [Go](https://github.com/openset/leetcode/tree/master/solution/pacific-atlantic-water-flow) | Medium |
+| <span id="418">418</span> | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-screen-fitting) | Medium |
+| <span id="419">419</span> | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | [Go](https://github.com/openset/leetcode/tree/master/solution/battleships-in-a-board) | Medium |
+| <span id="420">420</span> | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker) | [Go](https://github.com/openset/leetcode/tree/master/solution/strong-password-checker) | Hard |
+| <span id="421">421</span> | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-xor-of-two-numbers-in-an-array) | Medium |
+| <span id="422">422</span> | [Valid Word Square](https://leetcode.com/problems/valid-word-square) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-square) | Easy |
+| <span id="423">423</span> | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english) | [Go](https://github.com/openset/leetcode/tree/master/solution/reconstruct-original-digits-from-english) | Medium |
+| <span id="424">424</span> | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-repeating-character-replacement) | Medium |
+| <span id="425">425</span> | [Word Squares](https://leetcode.com/problems/word-squares) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/word-squares) | Hard |
+| <span id="426">426</span> | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
+| <span id="427">427</span> | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-quad-tree) | Easy |
+| <span id="428">428</span> | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-n-ary-tree) | Hard |
+| <span id="429">429</span> | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-level-order-traversal) | Easy |
+| <span id="430">430</span> | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-a-multilevel-doubly-linked-list) | Medium |
+| <span id="431">431</span> | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-n-ary-tree-to-binary-tree) | Hard |
+| <span id="432">432</span> | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-oone-data-structure) | Hard |
+| <span id="433">433</span> | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-genetic-mutation) | Medium |
+| <span id="434">434</span> | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-segments-in-a-string) | Easy |
+| <span id="435">435</span> | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-overlapping-intervals) | Medium |
+| <span id="436">436</span> | [Find Right Interval](https://leetcode.com/problems/find-right-interval) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-right-interval) | Medium |
+| <span id="437">437</span> | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-iii) | Easy |
+| <span id="438">438</span> | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-anagrams-in-a-string) | Easy |
+| <span id="439">439</span> | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/ternary-expression-parser) | Medium |
+| <span id="440">440</span> | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-smallest-in-lexicographical-order) | Hard |
+| <span id="441">441</span> | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | [Go](https://github.com/openset/leetcode/tree/master/solution/arranging-coins) | Easy |
+| <span id="442">442</span> | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-duplicates-in-an-array) | Medium |
+| <span id="443">443</span> | [String Compression](https://leetcode.com/problems/string-compression) | [Go](https://github.com/openset/leetcode/tree/master/solution/string-compression) | Easy |
+| <span id="444">444</span> | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/sequence-reconstruction) | Medium |
+| <span id="445">445</span> | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers-ii) | Medium |
+| <span id="446">446</span> | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices-ii-subsequence) | Hard |
+| <span id="447">447</span> | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-boomerangs) | Easy |
+| <span id="448">448</span> | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-numbers-disappeared-in-an-array) | Easy |
+| <span id="449">449</span> | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-bst) | Medium |
+| <span id="450">450</span> | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-node-in-a-bst) | Medium |
+| <span id="451">451</span> | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-characters-by-frequency) | Medium |
+| <span id="452">452</span> | [Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-number-of-arrows-to-burst-balloons) | Medium |
+| <span id="453">453</span> | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-moves-to-equal-array-elements) | Easy |
+| <span id="454">454</span> | [4Sum II](https://leetcode.com/problems/4sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/4sum-ii) | Medium |
+| <span id="455">455</span> | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | [Go](https://github.com/openset/leetcode/tree/master/solution/assign-cookies) | Easy |
+| <span id="456">456</span> | [132 Pattern](https://leetcode.com/problems/132-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/132-pattern) | Medium |
+| <span id="457">457</span> | [Circular Array Loop](https://leetcode.com/problems/circular-array-loop) | [Go](https://github.com/openset/leetcode/tree/master/solution/circular-array-loop) | Medium |
+| <span id="458">458</span> | [Poor Pigs](https://leetcode.com/problems/poor-pigs) | [Go](https://github.com/openset/leetcode/tree/master/solution/poor-pigs) | Easy |
+| <span id="459">459</span> | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-substring-pattern) | Easy |
+| <span id="460">460</span> | [LFU Cache](https://leetcode.com/problems/lfu-cache) | [Go](https://github.com/openset/leetcode/tree/master/solution/lfu-cache) | Hard |
+| <span id="461">461</span> | [Hamming Distance](https://leetcode.com/problems/hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/hamming-distance) | Easy |
+| <span id="462">462</span> | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-moves-to-equal-array-elements-ii) | Medium |
+| <span id="463">463</span> | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | [Go](https://github.com/openset/leetcode/tree/master/solution/island-perimeter) | Easy |
+| <span id="464">464</span> | [Can I Win](https://leetcode.com/problems/can-i-win) | [Go](https://github.com/openset/leetcode/tree/master/solution/can-i-win) | Medium |
+| <span id="465">465</span> | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/optimal-account-balancing) | Hard |
+| <span id="466">466</span> | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-the-repetitions) | Hard |
+| <span id="467">467</span> | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-substrings-in-wraparound-string) | Medium |
+| <span id="468">468</span> | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [Go](https://github.com/openset/leetcode/tree/master/solution/validate-ip-address) | Medium |
+| <span id="469">469</span> | [Convex Polygon](https://leetcode.com/problems/convex-polygon) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/convex-polygon) | Medium |
+| <span id="470">470</span> | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-rand10-using-rand7) | Medium |
+| <span id="471">471</span> | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-string-with-shortest-length) | Hard |
+| <span id="472">472</span> | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/concatenated-words) | Hard |
+| <span id="473">473</span> | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/matchsticks-to-square) | Medium |
+| <span id="474">474</span> | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/ones-and-zeroes) | Medium |
+| <span id="475">475</span> | [Heaters](https://leetcode.com/problems/heaters) | [Go](https://github.com/openset/leetcode/tree/master/solution/heaters) | Easy |
+| <span id="476">476</span> | [Number Complement](https://leetcode.com/problems/number-complement) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-complement) | Easy |
+| <span id="477">477</span> | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/total-hamming-distance) | Medium |
+| <span id="478">478</span> | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle) | [Go](https://github.com/openset/leetcode/tree/master/solution/generate-random-point-in-a-circle) | Medium |
+| <span id="479">479</span> | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-palindrome-product) | Easy |
+| <span id="480">480</span> | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median) | [Go](https://github.com/openset/leetcode/tree/master/solution/sliding-window-median) | Hard |
+| <span id="481">481</span> | [Magical String](https://leetcode.com/problems/magical-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/magical-string) | Medium |
+| <span id="482">482</span> | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [Go](https://github.com/openset/leetcode/tree/master/solution/license-key-formatting) | Easy |
+| <span id="483">483</span> | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-good-base) | Hard |
+| <span id="484">484</span> | [Find Permutation](https://leetcode.com/problems/find-permutation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-permutation) | Medium |
+| <span id="485">485</span> | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones) | Easy |
+| <span id="486">486</span> | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | [Go](https://github.com/openset/leetcode/tree/master/solution/predict-the-winner) | Medium |
+| <span id="487">487</span> | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones-ii) | Medium |
+| <span id="488">488</span> | [Zuma Game](https://leetcode.com/problems/zuma-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/zuma-game) | Hard |
+| <span id="489">489</span> | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/robot-room-cleaner) | Hard |
+| <span id="490">490</span> | [The Maze](https://leetcode.com/problems/the-maze) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze) | Medium |
+| <span id="491">491</span> | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-subsequences) | Medium |
+| <span id="492">492</span> | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-the-rectangle) | Easy |
+| <span id="493">493</span> | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-pairs) | Hard |
+| <span id="494">494</span> | [Target Sum](https://leetcode.com/problems/target-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/target-sum) | Medium |
+| <span id="495">495</span> | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking) | [Go](https://github.com/openset/leetcode/tree/master/solution/teemo-attacking) | Medium |
+| <span id="496">496</span> | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-i) | Easy |
+| <span id="497">497</span> | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-point-in-non-overlapping-rectangles) | Medium |
+| <span id="498">498</span> | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | [Go](https://github.com/openset/leetcode/tree/master/solution/diagonal-traverse) | Medium |
+| <span id="499">499</span> | [The Maze III](https://leetcode.com/problems/the-maze-iii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-iii) | Hard |
+| <span id="500">500</span> | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | [Go](https://github.com/openset/leetcode/tree/master/solution/keyboard-row) | Easy |
+| <span id="501">501</span> | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-mode-in-binary-search-tree) | Easy |
+| <span id="502">502</span> | [IPO](https://leetcode.com/problems/ipo) | [Go](https://github.com/openset/leetcode/tree/master/solution/ipo) | Hard |
+| <span id="503">503</span> | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-ii) | Medium |
+| <span id="504">504</span> | [Base 7](https://leetcode.com/problems/base-7) | [Go](https://github.com/openset/leetcode/tree/master/solution/base-7) | Easy |
+| <span id="505">505</span> | [The Maze II](https://leetcode.com/problems/the-maze-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-ii) | Medium |
+| <span id="506">506</span> | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | [Go](https://github.com/openset/leetcode/tree/master/solution/relative-ranks) | Easy |
+| <span id="507">507</span> | [Perfect Number](https://leetcode.com/problems/perfect-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-number) | Easy |
+| <span id="508">508</span> | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-frequent-subtree-sum) | Medium |
+| <span id="513">513</span> | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-bottom-left-tree-value) | Medium |
+| <span id="514">514</span> | [Freedom Trail](https://leetcode.com/problems/freedom-trail) | [Go](https://github.com/openset/leetcode/tree/master/solution/freedom-trail) | Hard |
+| <span id="515">515</span> | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-largest-value-in-each-tree-row) | Medium |
+| <span id="516">516</span> | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-palindromic-subsequence) | Medium |
+| <span id="517">517</span> | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-washing-machines) | Hard |
+| <span id="518">518</span> | [Coin Change 2](https://leetcode.com/problems/coin-change-2) | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-change-2) | Medium |
+| <span id="519">519</span> | [Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-flip-matrix) | Medium |
+| <span id="520">520</span> | [Detect Capital](https://leetcode.com/problems/detect-capital) | [Go](https://github.com/openset/leetcode/tree/master/solution/detect-capital) | Easy |
+| <span id="521">521</span> | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-uncommon-subsequence-i) | Easy |
+| <span id="522">522</span> | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-uncommon-subsequence-ii) | Medium |
+| <span id="523">523</span> | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/continuous-subarray-sum) | Medium |
+| <span id="524">524</span> | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary-through-deleting) | Medium |
+| <span id="525">525</span> | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/contiguous-array) | Medium |
+| <span id="526">526</span> | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement) | Medium |
+| <span id="527">527</span> | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/word-abbreviation) | Hard |
+| <span id="528">528</span> | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-weight) | Medium |
+| <span id="529">529</span> | [Minesweeper](https://leetcode.com/problems/minesweeper) | [Go](https://github.com/openset/leetcode/tree/master/solution/minesweeper) | Medium |
+| <span id="530">530</span> | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-absolute-difference-in-bst) | Easy |
+| <span id="531">531</span> | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-i) | Medium |
+| <span id="532">532</span> | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-diff-pairs-in-an-array) | Easy |
+| <span id="533">533</span> | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-ii) | Medium |
+| <span id="535">535</span> | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-tinyurl) | Medium |
+| <span id="536">536</span> | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-string) | Medium |
+| <span id="537">537</span> | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | [Go](https://github.com/openset/leetcode/tree/master/solution/complex-number-multiplication) | Medium |
+| <span id="538">538</span> | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-bst-to-greater-tree) | Easy |
+| <span id="539">539</span> | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-time-difference) | Medium |
+| <span id="540">540</span> | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-element-in-a-sorted-array) | Medium |
+| <span id="541">541</span> | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-string-ii) | Easy |
+| <span id="542">542</span> | [01 Matrix](https://leetcode.com/problems/01-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/01-matrix) | Medium |
+| <span id="543">543</span> | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/diameter-of-binary-tree) | Easy |
+| <span id="544">544</span> | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/output-contest-matches) | Medium |
+| <span id="545">545</span> | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/boundary-of-binary-tree) | Medium |
+| <span id="546">546</span> | [Remove Boxes](https://leetcode.com/problems/remove-boxes) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-boxes) | Hard |
+| <span id="547">547</span> | [Friend Circles](https://leetcode.com/problems/friend-circles) | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-circles) | Medium |
+| <span id="548">548</span> | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-with-equal-sum) | Medium |
+| <span id="549">549</span> | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence-ii) | Medium |
+| <span id="551">551</span> | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-i) | Easy |
+| <span id="552">552</span> | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-ii) | Hard |
+| <span id="553">553</span> | [Optimal Division](https://leetcode.com/problems/optimal-division) | [Go](https://github.com/openset/leetcode/tree/master/solution/optimal-division) | Medium |
+| <span id="554">554</span> | [Brick Wall](https://leetcode.com/problems/brick-wall) | [Go](https://github.com/openset/leetcode/tree/master/solution/brick-wall) | Medium |
+| <span id="555">555</span> | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/split-concatenated-strings) | Medium |
+| <span id="556">556</span> | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-iii) | Medium |
+| <span id="557">557</span> | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-iii) | Easy |
+| <span id="558">558</span> | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection) | [Go](https://github.com/openset/leetcode/tree/master/solution/quad-tree-intersection) | Easy |
+| <span id="559">559</span> | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-depth-of-n-ary-tree) | Easy |
+| <span id="560">560</span> | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/subarray-sum-equals-k) | Medium |
+| <span id="561">561</span> | [Array Partition I](https://leetcode.com/problems/array-partition-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-partition-i) | Easy |
+| <span id="562">562</span> | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-line-of-consecutive-one-in-matrix) | Medium |
+| <span id="563">563</span> | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-tilt) | Easy |
+| <span id="564">564</span> | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-closest-palindrome) | Hard |
+| <span id="565">565</span> | [Array Nesting](https://leetcode.com/problems/array-nesting) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-nesting) | Medium |
+| <span id="566">566</span> | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/reshape-the-matrix) | Easy |
+| <span id="567">567</span> | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutation-in-string) | Medium |
+| <span id="568">568</span> | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-vacation-days) | Hard |
+| <span id="569">569</span> | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/median-employee-salary) | Hard |
+| <span id="570">570</span> | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/managers-with-at-least-5-direct-reports) | Medium |
+| <span id="571">571</span> | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-median-given-frequency-of-numbers) | Hard |
+| <span id="572">572</span> | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/subtree-of-another-tree) | Easy |
+| <span id="573">573</span> | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/squirrel-simulation) | Medium |
+| <span id="574">574</span> | [Winning Candidate](https://leetcode.com/problems/winning-candidate) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/winning-candidate) | Medium |
+| <span id="575">575</span> | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | [Go](https://github.com/openset/leetcode/tree/master/solution/distribute-candies) | Easy |
+| <span id="576">576</span> | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/out-of-boundary-paths) | Medium |
+| <span id="577">577</span> | [Employee Bonus](https://leetcode.com/problems/employee-bonus) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-bonus) | Easy |
+| <span id="578">578</span> | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/get-highest-answer-rate-question) | Medium |
+| <span id="579">579</span> | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-cumulative-salary-of-an-employee) | Hard |
+| <span id="580">580</span> | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/count-student-number-in-departments) | Medium |
+| <span id="581">581</span> | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-unsorted-continuous-subarray) | Easy |
+| <span id="582">582</span> | [Kill Process](https://leetcode.com/problems/kill-process) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/kill-process) | Medium |
+| <span id="583">583</span> | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-operation-for-two-strings) | Medium |
+| <span id="584">584</span> | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-customer-referee) | Easy |
+| <span id="585">585</span> | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/investments-in-2016) | Medium |
+| <span id="586">586</span> | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/customer-placing-the-largest-number-of-orders) | Easy |
+| <span id="587">587</span> | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | [Go](https://github.com/openset/leetcode/tree/master/solution/erect-the-fence) | Hard |
+| <span id="588">588</span> | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-in-memory-file-system) | Hard |
+| <span id="589">589</span> | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-preorder-traversal) | Easy |
+| <span id="590">590</span> | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-postorder-traversal) | Easy |
+| <span id="591">591</span> | [Tag Validator](https://leetcode.com/problems/tag-validator) | [Go](https://github.com/openset/leetcode/tree/master/solution/tag-validator) | Hard |
+| <span id="592">592</span> | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction) | [Go](https://github.com/openset/leetcode/tree/master/solution/fraction-addition-and-subtraction) | Medium |
+| <span id="593">593</span> | [Valid Square](https://leetcode.com/problems/valid-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-square) | Medium |
+| <span id="594">594</span> | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-harmonious-subsequence) | Easy |
+| <span id="595">595</span> | [Big Countries](https://leetcode.com/problems/big-countries) | [Go](https://github.com/openset/leetcode/tree/master/solution/big-countries) | Easy |
+| <span id="596">596</span> | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [Go](https://github.com/openset/leetcode/tree/master/solution/classes-more-than-5-students) | Easy |
+| <span id="597">597</span> | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-i-overall-acceptance-rate) | Easy |
+| <span id="598">598</span> | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-addition-ii) | Easy |
+| <span id="599">599</span> | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-index-sum-of-two-lists) | Easy |
+| <span id="600">600</span> | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-negative-integers-without-consecutive-ones) | Hard |
+| <span id="601">601</span> | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [Go](https://github.com/openset/leetcode/tree/master/solution/human-traffic-of-stadium) | Hard |
+| <span id="602">602</span> | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-ii-who-has-the-most-friends) | Medium |
+| <span id="603">603</span> | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-available-seats) | Easy |
+| <span id="604">604</span> | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-compressed-string-iterator) | Easy |
+| <span id="605">605</span> | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [Go](https://github.com/openset/leetcode/tree/master/solution/can-place-flowers) | Easy |
+| <span id="606">606</span> | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-string-from-binary-tree) | Easy |
+| <span id="607">607</span> | [Sales Person](https://leetcode.com/problems/sales-person) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/sales-person) | Easy |
+| <span id="608">608</span> | [Tree Node](https://leetcode.com/problems/tree-node) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/tree-node) | Medium |
+| <span id="609">609</span> | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-file-in-system) | Medium |
+| <span id="610">610</span> | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/triangle-judgement) | Easy |
+| <span id="611">611</span> | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-triangle-number) | Medium |
+| <span id="612">612</span> | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-plane) | Medium |
+| <span id="613">613</span> | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-line) | Easy |
+| <span id="614">614</span> | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/second-degree-follower) | Medium |
+| <span id="615">615</span> | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/average-salary-departments-vs-company) | Hard |
+| <span id="616">616</span> | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/add-bold-tag-in-string) | Medium |
+| <span id="617">617</span> | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-two-binary-trees) | Easy |
+| <span id="618">618</span> | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/students-report-by-geography) | Hard |
+| <span id="619">619</span> | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/biggest-single-number) | Easy |
+| <span id="620">620</span> | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [Go](https://github.com/openset/leetcode/tree/master/solution/not-boring-movies) | Easy |
+| <span id="621">621</span> | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [Go](https://github.com/openset/leetcode/tree/master/solution/task-scheduler) | Medium |
+| <span id="622">622</span> | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-circular-queue) | Medium |
+| <span id="623">623</span> | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-one-row-to-tree) | Medium |
+| <span id="624">624</span> | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-distance-in-arrays) | Easy |
+| <span id="625">625</span> | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-factorization) | Medium |
+| <span id="626">626</span> | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [Go](https://github.com/openset/leetcode/tree/master/solution/exchange-seats) | Medium |
+| <span id="627">627</span> | [Swap Salary](https://leetcode.com/problems/swap-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-salary) | Easy |
+| <span id="628">628</span> | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-three-numbers) | Easy |
+| <span id="629">629</span> | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-inverse-pairs-array) | Hard |
+| <span id="630">630</span> | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule-iii) | Hard |
+| <span id="631">631</span> | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-excel-sum-formula) | Hard |
+| <span id="632">632</span> | [Smallest Range](https://leetcode.com/problems/smallest-range) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-range) | Hard |
+| <span id="633">633</span> | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-square-numbers) | Easy |
+| <span id="634">634</span> | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-derangement-of-an-array) | Medium |
+| <span id="635">635</span> | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-log-storage-system) | Medium |
+| <span id="636">636</span> | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | [Go](https://github.com/openset/leetcode/tree/master/solution/exclusive-time-of-functions) | Medium |
+| <span id="637">637</span> | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/average-of-levels-in-binary-tree) | Easy |
+| <span id="638">638</span> | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | [Go](https://github.com/openset/leetcode/tree/master/solution/shopping-offers) | Medium |
+| <span id="639">639</span> | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/decode-ways-ii) | Hard |
+| <span id="640">640</span> | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | [Go](https://github.com/openset/leetcode/tree/master/solution/solve-the-equation) | Medium |
+| <span id="641">641</span> | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-circular-deque) | Medium |
+| <span id="642">642</span> | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-search-autocomplete-system) | Hard |
+| <span id="643">643</span> | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-i) | Easy |
+| <span id="644">644</span> | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-ii) | Hard |
+| <span id="645">645</span> | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-mismatch) | Easy |
+| <span id="646">646</span> | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-pair-chain) | Medium |
+| <span id="647">647</span> | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindromic-substrings) | Medium |
+| <span id="648">648</span> | [Replace Words](https://leetcode.com/problems/replace-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/replace-words) | Medium |
+| <span id="649">649</span> | [Dota2 Senate](https://leetcode.com/problems/dota2-senate) | [Go](https://github.com/openset/leetcode/tree/master/solution/dota2-senate) | Medium |
+| <span id="650">650</span> | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/2-keys-keyboard) | Medium |
+| <span id="651">651</span> | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/4-keys-keyboard) | Medium |
+| <span id="652">652</span> | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-subtrees) | Medium |
+| <span id="653">653</span> | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iv-input-is-a-bst) | Easy |
+| <span id="654">654</span> | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-binary-tree) | Medium |
+| <span id="655">655</span> | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/print-binary-tree) | Medium |
+| <span id="656">656</span> | [Coin Path](https://leetcode.com/problems/coin-path) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-path) | Hard |
+| <span id="657">657</span> | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [Go](https://github.com/openset/leetcode/tree/master/solution/robot-return-to-origin) | Easy |
+| <span id="658">658</span> | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-closest-elements) | Medium |
+| <span id="659">659</span> | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-into-consecutive-subsequences) | Medium |
+| <span id="660">660</span> | [Remove 9](https://leetcode.com/problems/remove-9) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-9) | Hard |
+| <span id="661">661</span> | [Image Smoother](https://leetcode.com/problems/image-smoother) | [Go](https://github.com/openset/leetcode/tree/master/solution/image-smoother) | Easy |
+| <span id="662">662</span> | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-width-of-binary-tree) | Medium |
+| <span id="663">663</span> | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/equal-tree-partition) | Medium |
+| <span id="664">664</span> | [Strange Printer](https://leetcode.com/problems/strange-printer) | [Go](https://github.com/openset/leetcode/tree/master/solution/strange-printer) | Hard |
+| <span id="665">665</span> | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-decreasing-array) | Easy |
+| <span id="666">666</span> | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-iv) | Medium |
+| <span id="667">667</span> | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement-ii) | Medium |
+| <span id="668">668</span> | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-number-in-multiplication-table) | Hard |
+| <span id="669">669</span> | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/trim-a-binary-search-tree) | Easy |
+| <span id="670">670</span> | [Maximum Swap](https://leetcode.com/problems/maximum-swap) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-swap) | Medium |
+| <span id="671">671</span> | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/second-minimum-node-in-a-binary-tree) | Easy |
+| <span id="672">672</span> | [Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulb-switcher-ii) | Medium |
+| <span id="673">673</span> | [Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-longest-increasing-subsequence) | Medium |
+| <span id="674">674</span> | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-continuous-increasing-subsequence) | Easy |
+| <span id="675">675</span> | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event) | [Go](https://github.com/openset/leetcode/tree/master/solution/cut-off-trees-for-golf-event) | Hard |
+| <span id="676">676</span> | [Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-magic-dictionary) | Medium |
+| <span id="677">677</span> | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/map-sum-pairs) | Medium |
+| <span id="678">678</span> | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-parenthesis-string) | Medium |
+| <span id="679">679</span> | [24 Game](https://leetcode.com/problems/24-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/24-game) | Hard |
+| <span id="680">680</span> | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-palindrome-ii) | Easy |
+| <span id="681">681</span> | [Next Closest Time](https://leetcode.com/problems/next-closest-time) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/next-closest-time) | Medium |
+| <span id="682">682</span> | [Baseball Game](https://leetcode.com/problems/baseball-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/baseball-game) | Easy |
+| <span id="683">683</span> | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/k-empty-slots) | Hard |
+| <span id="684">684</span> | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | [Go](https://github.com/openset/leetcode/tree/master/solution/redundant-connection) | Medium |
+| <span id="685">685</span> | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/redundant-connection-ii) | Hard |
+| <span id="686">686</span> | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-string-match) | Easy |
+| <span id="687">687</span> | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-univalue-path) | Easy |
+| <span id="688">688</span> | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/knight-probability-in-chessboard) | Medium |
+| <span id="689">689</span> | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-sum-of-3-non-overlapping-subarrays) | Hard |
+| <span id="690">690</span> | [Employee Importance](https://leetcode.com/problems/employee-importance) | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-importance) | Easy |
+| <span id="691">691</span> | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/stickers-to-spell-word) | Hard |
+| <span id="692">692</span> | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-words) | Medium |
+| <span id="693">693</span> | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-number-with-alternating-bits) | Easy |
+| <span id="694">694</span> | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands) | Medium |
+| <span id="695">695</span> | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-area-of-island) | Medium |
+| <span id="696">696</span> | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-binary-substrings) | Easy |
+| <span id="697">697</span> | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/degree-of-an-array) | Easy |
+| <span id="698">698</span> | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-to-k-equal-sum-subsets) | Medium |
+| <span id="699">699</span> | [Falling Squares](https://leetcode.com/problems/falling-squares) | [Go](https://github.com/openset/leetcode/tree/master/solution/falling-squares) | Hard |
+| <span id="700">700</span> | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-a-binary-search-tree) | Easy |
+| <span id="701">701</span> | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-binary-search-tree) | Medium |
+| <span id="702">702</span> | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-a-sorted-array-of-unknown-size) | Medium |
+| <span id="703">703</span> | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-largest-element-in-a-stream) | Easy |
+| <span id="704">704</span> | [Binary Search](https://leetcode.com/problems/binary-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-search) | Easy |
+| <span id="705">705</span> | [Design HashSet](https://leetcode.com/problems/design-hashset) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hashset) | Easy |
+| <span id="706">706</span> | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hashmap) | Easy |
+| <span id="707">707</span> | [Design Linked List](https://leetcode.com/problems/design-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-linked-list) | Easy |
+| <span id="708">708</span> | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-cyclic-sorted-list) | Medium |
+| <span id="709">709</span> | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [Go](https://github.com/openset/leetcode/tree/master/solution/to-lower-case) | Easy |
+| <span id="710">710</span> | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-blacklist) | Hard |
+| <span id="711">711</span> | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands-ii) | Hard |
+| <span id="712">712</span> | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-ascii-delete-sum-for-two-strings) | Medium |
+| <span id="713">713</span> | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/subarray-product-less-than-k) | Medium |
+| <span id="714">714</span> | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
+| <span id="715">715</span> | [Range Module](https://leetcode.com/problems/range-module) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-module) | Hard |
+| <span id="716">716</span> | [Max Stack](https://leetcode.com/problems/max-stack) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/max-stack) | Easy |
+| <span id="717">717</span> | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/1-bit-and-2-bit-characters) | Easy |
+| <span id="718">718</span> | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-repeated-subarray) | Medium |
+| <span id="719">719</span> | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-th-smallest-pair-distance) | Hard |
+| <span id="720">720</span> | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary) | Easy |
+| <span id="721">721</span> | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | [Go](https://github.com/openset/leetcode/tree/master/solution/accounts-merge) | Medium |
+| <span id="722">722</span> | [Remove Comments](https://leetcode.com/problems/remove-comments) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-comments) | Medium |
+| <span id="723">723</span> | [Candy Crush](https://leetcode.com/problems/candy-crush) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/candy-crush) | Medium |
+| <span id="724">724</span> | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-pivot-index) | Easy |
+| <span id="725">725</span> | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-linked-list-in-parts) | Medium |
+| <span id="726">726</span> | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-atoms) | Hard |
+| <span id="727">727</span> | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-window-subsequence) | Hard |
+| <span id="728">728</span> | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/self-dividing-numbers) | Easy |
+| <span id="729">729</span> | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-i) | Medium |
+| <span id="730">730</span> | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-different-palindromic-subsequences) | Hard |
+| <span id="731">731</span> | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-ii) | Medium |
+| <span id="732">732</span> | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-iii) | Hard |
+| <span id="733">733</span> | [Flood Fill](https://leetcode.com/problems/flood-fill) | [Go](https://github.com/openset/leetcode/tree/master/solution/flood-fill) | Easy |
+| <span id="734">734</span> | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity) | Easy |
+| <span id="735">735</span> | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [Go](https://github.com/openset/leetcode/tree/master/solution/asteroid-collision) | Medium |
+| <span id="736">736</span> | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression) | [Go](https://github.com/openset/leetcode/tree/master/solution/parse-lisp-expression) | Hard |
+| <span id="737">737</span> | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity-ii) | Medium |
+| <span id="738">738</span> | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/monotone-increasing-digits) | Medium |
+| <span id="739">739</span> | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [Go](https://github.com/openset/leetcode/tree/master/solution/daily-temperatures) | Medium |
+| <span id="740">740</span> | [Delete and Earn](https://leetcode.com/problems/delete-and-earn) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-and-earn) | Medium |
+| <span id="741">741</span> | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup) | [Go](https://github.com/openset/leetcode/tree/master/solution/cherry-pickup) | Hard |
+| <span id="742">742</span> | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-leaf-in-a-binary-tree) | Medium |
+| <span id="743">743</span> | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | [Go](https://github.com/openset/leetcode/tree/master/solution/network-delay-time) | Easy |
+| <span id="744">744</span> | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-smallest-letter-greater-than-target) | Easy |
+| <span id="745">745</span> | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/prefix-and-suffix-search) | Hard |
+| <span id="746">746</span> | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/min-cost-climbing-stairs) | Easy |
+| <span id="747">747</span> | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-number-at-least-twice-of-others) | Easy |
+| <span id="748">748</span> | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-completing-word) | Easy |
+| <span id="749">749</span> | [Contain Virus](https://leetcode.com/problems/contain-virus) | [Go](https://github.com/openset/leetcode/tree/master/solution/contain-virus) | Hard |
+| <span id="750">750</span> | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-corner-rectangles) | Medium |
+| <span id="751">751</span> | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/ip-to-cidr) | Easy |
+| <span id="752">752</span> | [Open the Lock](https://leetcode.com/problems/open-the-lock) | [Go](https://github.com/openset/leetcode/tree/master/solution/open-the-lock) | Medium |
+| <span id="753">753</span> | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | [Go](https://github.com/openset/leetcode/tree/master/solution/cracking-the-safe) | Hard |
+| <span id="754">754</span> | [Reach a Number](https://leetcode.com/problems/reach-a-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/reach-a-number) | Easy |
+| <span id="755">755</span> | [Pour Water](https://leetcode.com/problems/pour-water) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/pour-water) | Medium |
+| <span id="756">756</span> | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/pyramid-transition-matrix) | Medium |
+| <span id="757">757</span> | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-intersection-size-at-least-two) | Hard |
+| <span id="758">758</span> | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/bold-words-in-string) | Easy |
+| <span id="759">759</span> | [Employee Free Time](https://leetcode.com/problems/employee-free-time) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-free-time) | Hard |
+| <span id="760">760</span> | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-anagram-mappings) | Easy |
+| <span id="761">761</span> | [Special Binary String](https://leetcode.com/problems/special-binary-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/special-binary-string) | Hard |
+| <span id="762">762</span> | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [Go](https://github.com/openset/leetcode/tree/master/solution/prime-number-of-set-bits-in-binary-representation) | Easy |
+| <span id="763">763</span> | [Partition Labels](https://leetcode.com/problems/partition-labels) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-labels) | Medium |
+| <span id="764">764</span> | [Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-plus-sign) | Medium |
+| <span id="765">765</span> | [Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands) | [Go](https://github.com/openset/leetcode/tree/master/solution/couples-holding-hands) | Hard |
+| <span id="766">766</span> | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/toeplitz-matrix) | Easy |
+| <span id="767">767</span> | [Reorganize String](https://leetcode.com/problems/reorganize-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reorganize-string) | Medium |
+| <span id="768">768</span> | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-chunks-to-make-sorted-ii) | Hard |
+| <span id="769">769</span> | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-chunks-to-make-sorted) | Medium |
+| <span id="770">770</span> | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iv) | Hard |
+| <span id="771">771</span> | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | [Go](https://github.com/openset/leetcode/tree/master/solution/jewels-and-stones) | Easy |
+| <span id="772">772</span> | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iii) | Hard |
+| <span id="773">773</span> | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle) | [Go](https://github.com/openset/leetcode/tree/master/solution/sliding-puzzle) | Hard |
+| <span id="774">774</span> | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-max-distance-to-gas-station) | Hard |
+| <span id="775">775</span> | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | [Go](https://github.com/openset/leetcode/tree/master/solution/global-and-local-inversions) | Medium |
+| <span id="776">776</span> | [Split BST](https://leetcode.com/problems/split-bst) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/split-bst) | Medium |
+| <span id="777">777</span> | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-adjacent-in-lr-string) | Medium |
+| <span id="778">778</span> | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/swim-in-rising-water) | Hard |
+| <span id="779">779</span> | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-symbol-in-grammar) | Medium |
+| <span id="780">780</span> | [Reaching Points](https://leetcode.com/problems/reaching-points) | [Go](https://github.com/openset/leetcode/tree/master/solution/reaching-points) | Hard |
+| <span id="781">781</span> | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest) | [Go](https://github.com/openset/leetcode/tree/master/solution/rabbits-in-forest) | Medium |
+| <span id="782">782</span> | [Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/transform-to-chessboard) | Hard |
+| <span id="783">783</span> | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-distance-between-bst-nodes) | Easy |
+| <span id="784">784</span> | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/letter-case-permutation) | Easy |
+| <span id="785">785</span> | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite) | [Go](https://github.com/openset/leetcode/tree/master/solution/is-graph-bipartite) | Medium |
+| <span id="786">786</span> | [K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-smallest-prime-fraction) | Hard |
+| <span id="787">787</span> | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops) | [Go](https://github.com/openset/leetcode/tree/master/solution/cheapest-flights-within-k-stops) | Medium |
+| <span id="788">788</span> | [Rotated Digits](https://leetcode.com/problems/rotated-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotated-digits) | Easy |
+| <span id="789">789</span> | [Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts) | [Go](https://github.com/openset/leetcode/tree/master/solution/escape-the-ghosts) | Medium |
+| <span id="790">790</span> | [Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling) | [Go](https://github.com/openset/leetcode/tree/master/solution/domino-and-tromino-tiling) | Medium |
+| <span id="791">791</span> | [Custom Sort String](https://leetcode.com/problems/custom-sort-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/custom-sort-string) | Medium |
+| <span id="792">792</span> | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-matching-subsequences) | Medium |
+| <span id="793">793</span> | [Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function) | [Go](https://github.com/openset/leetcode/tree/master/solution/preimage-size-of-factorial-zeroes-function) | Hard |
+| <span id="794">794</span> | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-tic-tac-toe-state) | Medium |
+| <span id="795">795</span> | [Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-subarrays-with-bounded-maximum) | Medium |
+| <span id="796">796</span> | [Rotate String](https://leetcode.com/problems/rotate-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-string) | Easy |
+| <span id="797">797</span> | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-paths-from-source-to-target) | Medium |
+| <span id="798">798</span> | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rotation-with-highest-score) | Hard |
+| <span id="799">799</span> | [Champagne Tower](https://leetcode.com/problems/champagne-tower) | [Go](https://github.com/openset/leetcode/tree/master/solution/champagne-tower) | Medium |
+| <span id="800">800</span> | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/similar-rgb-color) | Easy |
+| <span id="801">801</span> | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-swaps-to-make-sequences-increasing) | Medium |
+| <span id="802">802</span> | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-eventual-safe-states) | Medium |
+| <span id="803">803</span> | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit) | [Go](https://github.com/openset/leetcode/tree/master/solution/bricks-falling-when-hit) | Hard |
+| <span id="804">804</span> | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-morse-code-words) | Easy |
+| <span id="805">805</span> | [Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-with-same-average) | Hard |
+| <span id="806">806</span> | [Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-lines-to-write-string) | Easy |
+| <span id="807">807</span> | [Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-increase-to-keep-city-skyline) | Medium |
+| <span id="808">808</span> | [Soup Servings](https://leetcode.com/problems/soup-servings) | [Go](https://github.com/openset/leetcode/tree/master/solution/soup-servings) | Medium |
+| <span id="809">809</span> | [Expressive Words](https://leetcode.com/problems/expressive-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/expressive-words) | Medium |
+| <span id="810">810</span> | [Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/chalkboard-xor-game) | Hard |
+| <span id="811">811</span> | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count) | [Go](https://github.com/openset/leetcode/tree/master/solution/subdomain-visit-count) | Easy |
+| <span id="812">812</span> | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-triangle-area) | Easy |
+| <span id="813">813</span> | [Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-sum-of-averages) | Medium |
+| <span id="814">814</span> | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-pruning) | Medium |
+| <span id="815">815</span> | [Bus Routes](https://leetcode.com/problems/bus-routes) | [Go](https://github.com/openset/leetcode/tree/master/solution/bus-routes) | Hard |
+| <span id="816">816</span> | [Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates) | [Go](https://github.com/openset/leetcode/tree/master/solution/ambiguous-coordinates) | Medium |
+| <span id="817">817</span> | [Linked List Components](https://leetcode.com/problems/linked-list-components) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-components) | Medium |
+| <span id="818">818</span> | [Race Car](https://leetcode.com/problems/race-car) | [Go](https://github.com/openset/leetcode/tree/master/solution/race-car) | Hard |
+| <span id="819">819</span> | [Most Common Word](https://leetcode.com/problems/most-common-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-common-word) | Easy |
+| <span id="820">820</span> | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/short-encoding-of-words) | Medium |
+| <span id="821">821</span> | [Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-to-a-character) | Easy |
+| <span id="822">822</span> | [Card Flipping Game](https://leetcode.com/problems/card-flipping-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/card-flipping-game) | Medium |
+| <span id="823">823</span> | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-trees-with-factors) | Medium |
+| <span id="824">824</span> | [Goat Latin](https://leetcode.com/problems/goat-latin) | [Go](https://github.com/openset/leetcode/tree/master/solution/goat-latin) | Easy |
+| <span id="825">825</span> | [Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages) | [Go](https://github.com/openset/leetcode/tree/master/solution/friends-of-appropriate-ages) | Medium |
+| <span id="826">826</span> | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-profit-assigning-work) | Medium |
+| <span id="827">827</span> | [Making A Large Island](https://leetcode.com/problems/making-a-large-island) | [Go](https://github.com/openset/leetcode/tree/master/solution/making-a-large-island) | Hard |
+| <span id="828">828</span> | [Unique Letter String](https://leetcode.com/problems/unique-letter-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-letter-string) | Hard |
+| <span id="829">829</span> | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-numbers-sum) | Hard |
+| <span id="830">830</span> | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups) | [Go](https://github.com/openset/leetcode/tree/master/solution/positions-of-large-groups) | Easy |
+| <span id="831">831</span> | [Masking Personal Information](https://leetcode.com/problems/masking-personal-information) | [Go](https://github.com/openset/leetcode/tree/master/solution/masking-personal-information) | Medium |
+| <span id="832">832</span> | [Flipping an Image](https://leetcode.com/problems/flipping-an-image) | [Go](https://github.com/openset/leetcode/tree/master/solution/flipping-an-image) | Easy |
+| <span id="833">833</span> | [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-and-replace-in-string) | Medium |
+| <span id="834">834</span> | [Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-distances-in-tree) | Hard |
+| <span id="835">835</span> | [Image Overlap](https://leetcode.com/problems/image-overlap) | [Go](https://github.com/openset/leetcode/tree/master/solution/image-overlap) | Medium |
+| <span id="836">836</span> | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | [Go](https://github.com/openset/leetcode/tree/master/solution/rectangle-overlap) | Easy |
+| <span id="837">837</span> | [New 21 Game](https://leetcode.com/problems/new-21-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/new-21-game) | Medium |
+| <span id="838">838</span> | [Push Dominoes](https://leetcode.com/problems/push-dominoes) | [Go](https://github.com/openset/leetcode/tree/master/solution/push-dominoes) | Medium |
+| <span id="839">839</span> | [Similar String Groups](https://leetcode.com/problems/similar-string-groups) | [Go](https://github.com/openset/leetcode/tree/master/solution/similar-string-groups) | Hard |
+| <span id="840">840</span> | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid) | [Go](https://github.com/openset/leetcode/tree/master/solution/magic-squares-in-grid) | Easy |
+| <span id="841">841</span> | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms) | [Go](https://github.com/openset/leetcode/tree/master/solution/keys-and-rooms) | Medium |
+| <span id="842">842</span> | [Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-into-fibonacci-sequence) | Medium |
+| <span id="843">843</span> | [Guess the Word](https://leetcode.com/problems/guess-the-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/guess-the-word) | Hard |
+| <span id="844">844</span> | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | [Go](https://github.com/openset/leetcode/tree/master/solution/backspace-string-compare) | Easy |
+| <span id="845">845</span> | [Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-mountain-in-array) | Medium |
+| <span id="846">846</span> | [Hand of Straights](https://leetcode.com/problems/hand-of-straights) | [Go](https://github.com/openset/leetcode/tree/master/solution/hand-of-straights) | Medium |
+| <span id="847">847</span> | [Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-path-visiting-all-nodes) | Hard |
+| <span id="848">848</span> | [Shifting Letters](https://leetcode.com/problems/shifting-letters) | [Go](https://github.com/openset/leetcode/tree/master/solution/shifting-letters) | Medium |
+| <span id="849">849</span> | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximize-distance-to-closest-person) | Easy |
+| <span id="850">850</span> | [Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/rectangle-area-ii) | Hard |
+| <span id="851">851</span> | [Loud and Rich](https://leetcode.com/problems/loud-and-rich) | [Go](https://github.com/openset/leetcode/tree/master/solution/loud-and-rich) | Medium |
+| <span id="852">852</span> | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/peak-index-in-a-mountain-array) | Easy |
+| <span id="853">853</span> | [Car Fleet](https://leetcode.com/problems/car-fleet) | [Go](https://github.com/openset/leetcode/tree/master/solution/car-fleet) | Medium |
+| <span id="854">854</span> | [K-Similar Strings](https://leetcode.com/problems/k-similar-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-similar-strings) | Hard |
+| <span id="855">855</span> | [Exam Room](https://leetcode.com/problems/exam-room) | [Go](https://github.com/openset/leetcode/tree/master/solution/exam-room) | Medium |
+| <span id="856">856</span> | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/score-of-parentheses) | Medium |
+| <span id="857">857</span> | [Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-cost-to-hire-k-workers) | Hard |
+| <span id="858">858</span> | [Mirror Reflection](https://leetcode.com/problems/mirror-reflection) | [Go](https://github.com/openset/leetcode/tree/master/solution/mirror-reflection) | Medium |
+| <span id="859">859</span> | [Buddy Strings](https://leetcode.com/problems/buddy-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/buddy-strings) | Easy |
+| <span id="860">860</span> | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [Go](https://github.com/openset/leetcode/tree/master/solution/lemonade-change) | Easy |
+| <span id="861">861</span> | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/score-after-flipping-matrix) | Medium |
+| <span id="862">862</span> | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-subarray-with-sum-at-least-k) | Hard |
+| <span id="863">863</span> | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-nodes-distance-k-in-binary-tree) | Medium |
+| <span id="864">864</span> | [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-path-to-get-all-keys) | Hard |
+| <span id="865">865</span> | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-subtree-with-all-the-deepest-nodes) | Medium |
+| <span id="866">866</span> | [Prime Palindrome](https://leetcode.com/problems/prime-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/prime-palindrome) | Medium |
+| <span id="867">867</span> | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/transpose-matrix) | Easy |
+| <span id="868">868</span> | [Binary Gap](https://leetcode.com/problems/binary-gap) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-gap) | Easy |
+| <span id="869">869</span> | [Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2) | [Go](https://github.com/openset/leetcode/tree/master/solution/reordered-power-of-2) | Medium |
+| <span id="870">870</span> | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle) | [Go](https://github.com/openset/leetcode/tree/master/solution/advantage-shuffle) | Medium |
+| <span id="871">871</span> | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-number-of-refueling-stops) | Hard |
+| <span id="872">872</span> | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/leaf-similar-trees) | Easy |
+| <span id="873">873</span> | [Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/length-of-longest-fibonacci-subsequence) | Medium |
+| <span id="874">874</span> | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation) | [Go](https://github.com/openset/leetcode/tree/master/solution/walking-robot-simulation) | Easy |
+| <span id="875">875</span> | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas) | [Go](https://github.com/openset/leetcode/tree/master/solution/koko-eating-bananas) | Medium |
+| <span id="876">876</span> | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/middle-of-the-linked-list) | Easy |
+| <span id="877">877</span> | [Stone Game](https://leetcode.com/problems/stone-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/stone-game) | Medium |
+| <span id="878">878</span> | [Nth Magical Number](https://leetcode.com/problems/nth-magical-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/nth-magical-number) | Hard |
+| <span id="879">879</span> | [Profitable Schemes](https://leetcode.com/problems/profitable-schemes) | [Go](https://github.com/openset/leetcode/tree/master/solution/profitable-schemes) | Hard |
+| <span id="880">880</span> | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/decoded-string-at-index) | Medium |
+| <span id="881">881</span> | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people) | [Go](https://github.com/openset/leetcode/tree/master/solution/boats-to-save-people) | Medium |
+| <span id="882">882</span> | [Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph) | [Go](https://github.com/openset/leetcode/tree/master/solution/reachable-nodes-in-subdivided-graph) | Hard |
+| <span id="883">883</span> | [Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/solution/projection-area-of-3d-shapes) | Easy |
+| <span id="884">884</span> | [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences) | [Go](https://github.com/openset/leetcode/tree/master/solution/uncommon-words-from-two-sentences) | Easy |
+| <span id="885">885</span> | [Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix-iii) | Medium |
+| <span id="886">886</span> | [Possible Bipartition](https://leetcode.com/problems/possible-bipartition) | [Go](https://github.com/openset/leetcode/tree/master/solution/possible-bipartition) | Medium |
+| <span id="887">887</span> | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-egg-drop) | Hard |
+| <span id="888">888</span> | [Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap) | [Go](https://github.com/openset/leetcode/tree/master/solution/fair-candy-swap) | Easy |
+| <span id="889">889</span> | [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-preorder-and-postorder-traversal) | Medium |
+| <span id="890">890</span> | [Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-and-replace-pattern) | Medium |
+| <span id="891">891</span> | [Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-subsequence-widths) | Hard |
+| <span id="892">892</span> | [Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/solution/surface-area-of-3d-shapes) | Easy |
+| <span id="893">893</span> | [Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/groups-of-special-equivalent-strings) | Easy |
+| <span id="894">894</span> | [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-possible-full-binary-trees) | Medium |
+| <span id="895">895</span> | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-frequency-stack) | Hard |
+| <span id="896">896</span> | [Monotonic Array](https://leetcode.com/problems/monotonic-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/monotonic-array) | Easy |
+| <span id="897">897</span> | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-order-search-tree) | Easy |
+| <span id="898">898</span> | [Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/bitwise-ors-of-subarrays) | Medium |
+| <span id="899">899</span> | [Orderly Queue](https://leetcode.com/problems/orderly-queue) | [Go](https://github.com/openset/leetcode/tree/master/solution/orderly-queue) | Hard |
+| <span id="900">900</span> | [RLE Iterator](https://leetcode.com/problems/rle-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/rle-iterator) | Medium |
+| <span id="901">901</span> | [Online Stock Span](https://leetcode.com/problems/online-stock-span) | [Go](https://github.com/openset/leetcode/tree/master/solution/online-stock-span) | Medium |
+| <span id="902">902</span> | [Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set) | [Go](https://github.com/openset/leetcode/tree/master/solution/numbers-at-most-n-given-digit-set) | Hard |
+| <span id="903">903</span> | [Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-permutations-for-di-sequence) | Hard |
+| <span id="904">904</span> | [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets) | [Go](https://github.com/openset/leetcode/tree/master/solution/fruit-into-baskets) | Medium |
+| <span id="905">905</span> | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-array-by-parity) | Easy |
+| <span id="906">906</span> | [Super Palindromes](https://leetcode.com/problems/super-palindromes) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-palindromes) | Hard |
+| <span id="907">907</span> | [Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-subarray-minimums) | Medium |
+| <span id="908">908</span> | [Smallest Range I](https://leetcode.com/problems/smallest-range-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-range-i) | Easy |
+| <span id="909">909</span> | [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders) | [Go](https://github.com/openset/leetcode/tree/master/solution/snakes-and-ladders) | Medium |
+| <span id="910">910</span> | [Smallest Range II](https://leetcode.com/problems/smallest-range-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-range-ii) | Medium |
+| <span id="911">911</span> | [Online Election](https://leetcode.com/problems/online-election) | [Go](https://github.com/openset/leetcode/tree/master/solution/online-election) | Medium |
+| <span id="913">913</span> | [Cat and Mouse](https://leetcode.com/problems/cat-and-mouse) | [Go](https://github.com/openset/leetcode/tree/master/solution/cat-and-mouse) | Hard |
+| <span id="914">914</span> | [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | [Go](https://github.com/openset/leetcode/tree/master/solution/x-of-a-kind-in-a-deck-of-cards) | Easy |
+| <span id="915">915</span> | [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-array-into-disjoint-intervals) | Medium |
+| <span id="916">916</span> | [Word Subsets](https://leetcode.com/problems/word-subsets) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-subsets) | Medium |
+| <span id="917">917</span> | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-only-letters) | Easy |
+| <span id="918">918</span> | [Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-sum-circular-subarray) | Medium |
+| <span id="919">919</span> | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter) | [Go](https://github.com/openset/leetcode/tree/master/solution/complete-binary-tree-inserter) | Medium |
+| <span id="920">920</span> | [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-music-playlists) | Hard |
+| <span id="921">921</span> | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-add-to-make-parentheses-valid) | Medium |
+| <span id="922">922</span> | [Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-array-by-parity-ii) | Easy |
+| <span id="923">923</span> | [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity) | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-with-multiplicity) | Medium |
+| <span id="924">924</span> | [Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-malware-spread) | Hard |
+| <span id="925">925</span> | [Long Pressed Name](https://leetcode.com/problems/long-pressed-name) | [Go](https://github.com/openset/leetcode/tree/master/solution/long-pressed-name) | Easy |
+| <span id="926">926</span> | [Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing) | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-string-to-monotone-increasing) | Medium |
+| <span id="927">927</span> | [Three Equal Parts](https://leetcode.com/problems/three-equal-parts) | [Go](https://github.com/openset/leetcode/tree/master/solution/three-equal-parts) | Hard |
+| <span id="928">928</span> | [Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-malware-spread-ii) | Hard |
+| <span id="929">929</span> | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-email-addresses) | Easy |
+| <span id="930">930</span> | [Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-subarrays-with-sum) | Medium |
+| <span id="931">931</span> | [Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-falling-path-sum) | Medium |
+| <span id="932">932</span> | [Beautiful Array](https://leetcode.com/problems/beautiful-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-array) | Medium |
+| <span id="933">933</span> | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-recent-calls) | Easy |
+| <span id="934">934</span> | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-bridge) | Medium |
+| <span id="935">935</span> | [Knight Dialer](https://leetcode.com/problems/knight-dialer) | [Go](https://github.com/openset/leetcode/tree/master/solution/knight-dialer) | Medium |
+| <span id="936">936</span> | [Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/stamping-the-sequence) | Hard |
+| <span id="937">937</span> | [Reorder Log Files](https://leetcode.com/problems/reorder-log-files) | [Go](https://github.com/openset/leetcode/tree/master/solution/reorder-log-files) | Easy |
+| <span id="938">938</span> | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-of-bst) | Medium |
+| <span id="939">939</span> | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-area-rectangle) | Medium |
+| <span id="940">940</span> | [Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/distinct-subsequences-ii) | Hard |
+| <span id="941">941</span> | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-mountain-array) | Easy |
+| <span id="942">942</span> | [DI String Match](https://leetcode.com/problems/di-string-match) | [Go](https://github.com/openset/leetcode/tree/master/solution/di-string-match) | Easy |
+| <span id="943">943</span> | [Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-shortest-superstring) | Hard |
+| <span id="944">944</span> | [Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted) | Easy |
+| <span id="945">945</span> | [Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-increment-to-make-array-unique) | Medium |
+| <span id="946">946</span> | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/validate-stack-sequences) | Medium |
+| <span id="947">947</span> | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-stones-removed-with-same-row-or-column) | Medium |
+| <span id="948">948</span> | [Bag of Tokens](https://leetcode.com/problems/bag-of-tokens) | [Go](https://github.com/openset/leetcode/tree/master/solution/bag-of-tokens) | Medium |
+| <span id="949">949</span> | [Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-time-for-given-digits) | Easy |
+| <span id="950">950</span> | [Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/reveal-cards-in-increasing-order) | Medium |
+| <span id="951">951</span> | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-equivalent-binary-trees) | Medium |
+| <span id="952">952</span> | [Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-component-size-by-common-factor) | Hard |
+| <span id="953">953</span> | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/verifying-an-alien-dictionary) | Easy |
+| <span id="954">954</span> | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-of-doubled-pairs) | Medium |
+| <span id="955">955</span> | [Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted-ii) | Medium |
+| <span id="956">956</span> | [Tallest Billboard](https://leetcode.com/problems/tallest-billboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/tallest-billboard) | Hard |
+| <span id="957">957</span> | [Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days) | [Go](https://github.com/openset/leetcode/tree/master/solution/prison-cells-after-n-days) | Medium |
+| <span id="958">958</span> | [Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/check-completeness-of-a-binary-tree) | Medium |
+| <span id="959">959</span> | [Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes) | [Go](https://github.com/openset/leetcode/tree/master/solution/regions-cut-by-slashes) | Medium |
+| <span id="960">960</span> | [Delete Columns to Make Sorted III](https://leetcode.com/problems/delete-columns-to-make-sorted-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted-iii) | Hard |

From 7d933bce66452b151e84fdec36b803bbda61d7eb Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Thu, 20 Dec 2018 18:21:10 +0800
Subject: [PATCH 10/22] Add: navigation

---
 index.md | 359 ++++++++++++++++++++++++++++++-------------------------
 1 file changed, 197 insertions(+), 162 deletions(-)

diff --git a/index.md b/index.md
index 426bd70de..70d1167c9 100644
--- a/index.md
+++ b/index.md
@@ -10,6 +10,41 @@ LeetCode Problems' Solutions
 [![license](https://img.shields.io/github/license/openset/leetcode.svg)](https://github.com/openset/leetcode/blob/master/LICENSE)
 [![GitHub code size in bytes](https://img.shields.io/github/languages/code-size/openset/leetcode.svg?colorB=green)](https://github.com/openset/leetcode/archive/master.zip)
 
+<table><thead>
+<tr>
+<th align="center"><a href="#1">[1-50]</a></th>
+<th align="center"><a href="#51">[51-100]</a></th>
+<th align="center"><a href="#101">[101-150]</a></th>
+<th align="center"><a href="#151">[151-200]</a></th>
+<th align="center"><a href="#201">[201-250]</a></th>
+<th align="center"><a href="#251">[251-300]</a></th>
+</tr>
+<tr>
+<th align="center"><a href="#301">[301-350]</a></th>
+<th align="center"><a href="#351">[351-400]</a></th>
+<th align="center"><a href="#401">[401-450]</a></th>
+<th align="center"><a href="#451">[451-500]</a></th>
+<th align="center"><a href="#501">[501-550]</a></th>
+<th align="center"><a href="#551">[551-600]</a></th>
+</tr>
+<tr>
+<th align="center"><a href="#601">[601-650]</a></th>
+<th align="center"><a href="#651">[651-700]</a></th>
+<th align="center"><a href="#701">[701-750]</a></th>
+<th align="center"><a href="#751">[751-800]</a></th>
+<th align="center"><a href="#801">[801-850]</a></th>
+<th align="center"><a href="#851">[851-900]</a></th>
+</tr>
+<tr>
+<th align="center"><a href="#901">[901-950]</a></th>
+<th align="center"><a href="#951">[951-1000]</a></th>
+<th align="center"><a href="#1001">[1001-1050]</a></th>
+<th align="center"><a href="#1051">[1051-1100]</a></th>
+<th align="center"><a href="#1101">[1101-1150]</a></th>
+<th align="center"><a href="#1151">[1151-1200]</a></th>
+</tr>
+</thead></table>
+
 | # | Title | Solution | Difficulty |
 | :-: | - | - | :-: |
 | <span id="1">1</span> | [Two Sum](https://leetcode.com/problems/two-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum) | Easy |
@@ -167,21 +202,21 @@ LeetCode Problems' Solutions
 | <span id="153">153</span> | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array) | Medium |
 | <span id="154">154</span> | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array-ii) | Hard |
 | <span id="155">155</span> | [Min Stack](https://leetcode.com/problems/min-stack) | [Go](https://github.com/openset/leetcode/tree/master/solution/min-stack) | Easy |
-| <span id="156">156</span> | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-upside-down) | Medium |
-| <span id="157">157</span> | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4) | Easy |
-| <span id="158">158</span> | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4-ii-call-multiple-times) | Hard |
-| <span id="159">159</span> | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-two-distinct-characters) | Hard |
+| <span id="156">156</span> | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-upside-down) | Medium |
+| <span id="157">157</span> | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4) | Easy |
+| <span id="158">158</span> | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4-ii-call-multiple-times) | Hard |
+| <span id="159">159</span> | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-two-distinct-characters) | Hard |
 | <span id="160">160</span> | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-linked-lists) | Easy |
-| <span id="161">161</span> | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/one-edit-distance) | Medium |
+| <span id="161">161</span> | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/one-edit-distance) | Medium |
 | <span id="162">162</span> | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-peak-element) | Medium |
-| <span id="163">163</span> | [Missing Ranges](https://leetcode.com/problems/missing-ranges) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/missing-ranges) | Medium |
+| <span id="163">163</span> | [Missing Ranges](https://leetcode.com/problems/missing-ranges) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/missing-ranges) | Medium |
 | <span id="164">164</span> | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-gap) | Hard |
 | <span id="165">165</span> | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/compare-version-numbers) | Medium |
 | <span id="166">166</span> | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [Go](https://github.com/openset/leetcode/tree/master/solution/fraction-to-recurring-decimal) | Medium |
 | <span id="167">167</span> | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-ii-input-array-is-sorted) | Easy |
 | <span id="168">168</span> | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [Go](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-title) | Easy |
 | <span id="169">169</span> | [Majority Element](https://leetcode.com/problems/majority-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/majority-element) | Easy |
-| <span id="170">170</span> | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iii-data-structure-design) | Easy |
+| <span id="170">170</span> | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iii-data-structure-design) | Easy |
 | <span id="171">171</span> | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-number) | Easy |
 | <span id="172">172</span> | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/factorial-trailing-zeroes) | Easy |
 | <span id="173">173</span> | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-search-tree-iterator) | Medium |
@@ -197,7 +232,7 @@ LeetCode Problems' Solutions
 | <span id="183">183</span> | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/customers-who-never-order) | Easy |
 | <span id="184">184</span> | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/department-highest-salary) | Medium |
 | <span id="185">185</span> | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [Go](https://github.com/openset/leetcode/tree/master/solution/department-top-three-salaries) | Hard |
-| <span id="186">186</span> | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-ii) | Medium |
+| <span id="186">186</span> | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-ii) | Medium |
 | <span id="187">187</span> | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-dna-sequences) | Medium |
 | <span id="188">188</span> | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iv) | Hard |
 | <span id="189">189</span> | [Rotate Array](https://leetcode.com/problems/rotate-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-array) | Easy |
@@ -254,89 +289,89 @@ LeetCode Problems' Solutions
 | <span id="240">240</span> | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-a-2d-matrix-ii) | Medium |
 | <span id="241">241</span> | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/different-ways-to-add-parentheses) | Medium |
 | <span id="242">242</span> | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-anagram) | Easy |
-| <span id="243">243</span> | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance) | Easy |
-| <span id="244">244</span> | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-ii) | Medium |
-| <span id="245">245</span> | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-iii) | Medium |
-| <span id="246">246</span> | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number) | Easy |
-| <span id="247">247</span> | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-ii) | Medium |
-| <span id="248">248</span> | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-iii) | Hard |
-| <span id="249">249</span> | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/group-shifted-strings) | Medium |
-| <span id="250">250</span> | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/count-univalue-subtrees) | Medium |
-| <span id="251">251</span> | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-2d-vector) | Medium |
-| <span id="252">252</span> | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms) | Easy |
-| <span id="253">253</span> | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms-ii) | Medium |
-| <span id="254">254</span> | [Factor Combinations](https://leetcode.com/problems/factor-combinations) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/factor-combinations) | Medium |
-| <span id="255">255</span> | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-sequence-in-binary-search-tree) | Medium |
-| <span id="256">256</span> | [Paint House](https://leetcode.com/problems/paint-house) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house) | Easy |
+| <span id="243">243</span> | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance) | Easy |
+| <span id="244">244</span> | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-ii) | Medium |
+| <span id="245">245</span> | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-iii) | Medium |
+| <span id="246">246</span> | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number) | Easy |
+| <span id="247">247</span> | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-ii) | Medium |
+| <span id="248">248</span> | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-iii) | Hard |
+| <span id="249">249</span> | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/group-shifted-strings) | Medium |
+| <span id="250">250</span> | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/count-univalue-subtrees) | Medium |
+| <span id="251">251</span> | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-2d-vector) | Medium |
+| <span id="252">252</span> | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms) | Easy |
+| <span id="253">253</span> | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms-ii) | Medium |
+| <span id="254">254</span> | [Factor Combinations](https://leetcode.com/problems/factor-combinations) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/factor-combinations) | Medium |
+| <span id="255">255</span> | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-sequence-in-binary-search-tree) | Medium |
+| <span id="256">256</span> | [Paint House](https://leetcode.com/problems/paint-house) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house) | Easy |
 | <span id="257">257</span> | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-paths) | Easy |
 | <span id="258">258</span> | [Add Digits](https://leetcode.com/problems/add-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-digits) | Easy |
-| <span id="259">259</span> | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-smaller) | Medium |
+| <span id="259">259</span> | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-smaller) | Medium |
 | <span id="260">260</span> | [Single Number III](https://leetcode.com/problems/single-number-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-number-iii) | Medium |
-| <span id="261">261</span> | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/graph-valid-tree) | Medium |
+| <span id="261">261</span> | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/graph-valid-tree) | Medium |
 | <span id="262">262</span> | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [Go](https://github.com/openset/leetcode/tree/master/solution/trips-and-users) | Hard |
 | <span id="263">263</span> | [Ugly Number](https://leetcode.com/problems/ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/ugly-number) | Easy |
 | <span id="264">264</span> | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/ugly-number-ii) | Medium |
-| <span id="265">265</span> | [Paint House II](https://leetcode.com/problems/paint-house-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house-ii) | Hard |
-| <span id="266">266</span> | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation) | Easy |
-| <span id="267">267</span> | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation-ii) | Medium |
+| <span id="265">265</span> | [Paint House II](https://leetcode.com/problems/paint-house-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house-ii) | Hard |
+| <span id="266">266</span> | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation) | Easy |
+| <span id="267">267</span> | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation-ii) | Medium |
 | <span id="268">268</span> | [Missing Number](https://leetcode.com/problems/missing-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/missing-number) | Easy |
-| <span id="269">269</span> | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/alien-dictionary) | Hard |
-| <span id="270">270</span> | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value) | Easy |
-| <span id="271">271</span> | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-strings) | Medium |
-| <span id="272">272</span> | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value-ii) | Hard |
+| <span id="269">269</span> | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/alien-dictionary) | Hard |
+| <span id="270">270</span> | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value) | Easy |
+| <span id="271">271</span> | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-strings) | Medium |
+| <span id="272">272</span> | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value-ii) | Hard |
 | <span id="273">273</span> | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-to-english-words) | Hard |
 | <span id="274">274</span> | [H-Index](https://leetcode.com/problems/h-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/h-index) | Medium |
 | <span id="275">275</span> | [H-Index II](https://leetcode.com/problems/h-index-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/h-index-ii) | Medium |
-| <span id="276">276</span> | [Paint Fence](https://leetcode.com/problems/paint-fence) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-fence) | Easy |
-| <span id="277">277</span> | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-celebrity) | Medium |
+| <span id="276">276</span> | [Paint Fence](https://leetcode.com/problems/paint-fence) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-fence) | Easy |
+| <span id="277">277</span> | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-celebrity) | Medium |
 | <span id="278">278</span> | [First Bad Version](https://leetcode.com/problems/first-bad-version) | [Go](https://github.com/openset/leetcode/tree/master/solution/first-bad-version) | Easy |
 | <span id="279">279</span> | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-squares) | Medium |
-| <span id="280">280</span> | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort) | Medium |
-| <span id="281">281</span> | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/zigzag-iterator) | Medium |
+| <span id="280">280</span> | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort) | Medium |
+| <span id="281">281</span> | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/zigzag-iterator) | Medium |
 | <span id="282">282</span> | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | [Go](https://github.com/openset/leetcode/tree/master/solution/expression-add-operators) | Hard |
 | <span id="283">283</span> | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/move-zeroes) | Easy |
 | <span id="284">284</span> | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/peeking-iterator) | Medium |
-| <span id="285">285</span> | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/inorder-successor-in-bst) | Medium |
-| <span id="286">286</span> | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/walls-and-gates) | Medium |
+| <span id="285">285</span> | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/inorder-successor-in-bst) | Medium |
+| <span id="286">286</span> | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/walls-and-gates) | Medium |
 | <span id="287">287</span> | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-duplicate-number) | Medium |
-| <span id="288">288</span> | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-word-abbreviation) | Medium |
+| <span id="288">288</span> | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-word-abbreviation) | Medium |
 | <span id="289">289</span> | [Game of Life](https://leetcode.com/problems/game-of-life) | [Go](https://github.com/openset/leetcode/tree/master/solution/game-of-life) | Medium |
 | <span id="290">290</span> | [Word Pattern](https://leetcode.com/problems/word-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-pattern) | Easy |
-| <span id="291">291</span> | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/word-pattern-ii) | Hard |
+| <span id="291">291</span> | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/word-pattern-ii) | Hard |
 | <span id="292">292</span> | [Nim Game](https://leetcode.com/problems/nim-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/nim-game) | Easy |
-| <span id="293">293</span> | [Flip Game](https://leetcode.com/problems/flip-game) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game) | Easy |
-| <span id="294">294</span> | [Flip Game II](https://leetcode.com/problems/flip-game-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game-ii) | Medium |
+| <span id="293">293</span> | [Flip Game](https://leetcode.com/problems/flip-game) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game) | Easy |
+| <span id="294">294</span> | [Flip Game II](https://leetcode.com/problems/flip-game-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game-ii) | Medium |
 | <span id="295">295</span> | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-median-from-data-stream) | Hard |
-| <span id="296">296</span> | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/best-meeting-point) | Hard |
+| <span id="296">296</span> | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/best-meeting-point) | Hard |
 | <span id="297">297</span> | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-binary-tree) | Hard |
-| <span id="298">298</span> | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence) | Medium |
+| <span id="298">298</span> | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence) | Medium |
 | <span id="299">299</span> | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulls-and-cows) | Medium |
 | <span id="300">300</span> | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-increasing-subsequence) | Medium |
 | <span id="301">301</span> | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-invalid-parentheses) | Hard |
-| <span id="302">302</span> | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rectangle-enclosing-black-pixels) | Hard |
+| <span id="302">302</span> | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rectangle-enclosing-black-pixels) | Hard |
 | <span id="303">303</span> | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-immutable) | Easy |
 | <span id="304">304</span> | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-immutable) | Medium |
-| <span id="305">305</span> | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-islands-ii) | Hard |
+| <span id="305">305</span> | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-islands-ii) | Hard |
 | <span id="306">306</span> | [Additive Number](https://leetcode.com/problems/additive-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/additive-number) | Medium |
 | <span id="307">307</span> | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-mutable) | Medium |
-| <span id="308">308</span> | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-mutable) | Hard |
+| <span id="308">308</span> | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-mutable) | Hard |
 | <span id="309">309</span> | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
 | <span id="310">310</span> | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-height-trees) | Medium |
-| <span id="311">311</span> | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/sparse-matrix-multiplication) | Medium |
+| <span id="311">311</span> | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/sparse-matrix-multiplication) | Medium |
 | <span id="312">312</span> | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/solution/burst-balloons) | Hard |
 | <span id="313">313</span> | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-ugly-number) | Medium |
-| <span id="314">314</span> | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-vertical-order-traversal) | Medium |
+| <span id="314">314</span> | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-vertical-order-traversal) | Medium |
 | <span id="315">315</span> | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-of-smaller-numbers-after-self) | Hard |
 | <span id="316">316</span> | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicate-letters) | Hard |
-| <span id="317">317</span> | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-from-all-buildings) | Hard |
+| <span id="317">317</span> | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-from-all-buildings) | Hard |
 | <span id="318">318</span> | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-word-lengths) | Medium |
 | <span id="319">319</span> | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulb-switcher) | Medium |
-| <span id="320">320</span> | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/generalized-abbreviation) | Medium |
+| <span id="320">320</span> | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/generalized-abbreviation) | Medium |
 | <span id="321">321</span> | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/create-maximum-number) | Hard |
 | <span id="322">322</span> | [Coin Change](https://leetcode.com/problems/coin-change) | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-change) | Medium |
-| <span id="323">323</span> | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-connected-components-in-an-undirected-graph) | Medium |
+| <span id="323">323</span> | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-connected-components-in-an-undirected-graph) | Medium |
 | <span id="324">324</span> | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort-ii) | Medium |
-| <span id="325">325</span> | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-size-subarray-sum-equals-k) | Medium |
+| <span id="325">325</span> | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-size-subarray-sum-equals-k) | Medium |
 | <span id="326">326</span> | [Power of Three](https://leetcode.com/problems/power-of-three) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-three) | Easy |
 | <span id="327">327</span> | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-of-range-sum) | Hard |
 | <span id="328">328</span> | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/odd-even-linked-list) | Medium |
@@ -344,44 +379,44 @@ LeetCode Problems' Solutions
 | <span id="330">330</span> | [Patching Array](https://leetcode.com/problems/patching-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/patching-array) | Hard |
 | <span id="331">331</span> | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-serialization-of-a-binary-tree) | Medium |
 | <span id="332">332</span> | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | [Go](https://github.com/openset/leetcode/tree/master/solution/reconstruct-itinerary) | Medium |
-| <span id="333">333</span> | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-bst-subtree) | Medium |
+| <span id="333">333</span> | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-bst-subtree) | Medium |
 | <span id="334">334</span> | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-triplet-subsequence) | Medium |
 | <span id="335">335</span> | [Self Crossing](https://leetcode.com/problems/self-crossing) | [Go](https://github.com/openset/leetcode/tree/master/solution/self-crossing) | Hard |
 | <span id="336">336</span> | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-pairs) | Hard |
 | <span id="337">337</span> | [House Robber III](https://leetcode.com/problems/house-robber-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/house-robber-iii) | Medium |
 | <span id="338">338</span> | [Counting Bits](https://leetcode.com/problems/counting-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/counting-bits) | Medium |
-| <span id="339">339</span> | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum) | Easy |
-| <span id="340">340</span> | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-k-distinct-characters) | Hard |
+| <span id="339">339</span> | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum) | Easy |
+| <span id="340">340</span> | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-k-distinct-characters) | Hard |
 | <span id="341">341</span> | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-nested-list-iterator) | Medium |
 | <span id="342">342</span> | [Power of Four](https://leetcode.com/problems/power-of-four) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-four) | Easy |
 | <span id="343">343</span> | [Integer Break](https://leetcode.com/problems/integer-break) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-break) | Medium |
 | <span id="344">344</span> | [Reverse String](https://leetcode.com/problems/reverse-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-string) | Easy |
 | <span id="345">345</span> | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-vowels-of-a-string) | Easy |
-| <span id="346">346</span> | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/moving-average-from-data-stream) | Easy |
+| <span id="346">346</span> | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/moving-average-from-data-stream) | Easy |
 | <span id="347">347</span> | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-elements) | Medium |
-| <span id="348">348</span> | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-tic-tac-toe) | Medium |
+| <span id="348">348</span> | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-tic-tac-toe) | Medium |
 | <span id="349">349</span> | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays) | Easy |
 | <span id="350">350</span> | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays-ii) | Easy |
-| <span id="351">351</span> | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/android-unlock-patterns) | Medium |
+| <span id="351">351</span> | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/android-unlock-patterns) | Medium |
 | <span id="352">352</span> | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/data-stream-as-disjoint-intervals) | Hard |
-| <span id="353">353</span> | [Design Snake Game](https://leetcode.com/problems/design-snake-game) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-snake-game) | Medium |
+| <span id="353">353</span> | [Design Snake Game](https://leetcode.com/problems/design-snake-game) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-snake-game) | Medium |
 | <span id="354">354</span> | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | [Go](https://github.com/openset/leetcode/tree/master/solution/russian-doll-envelopes) | Hard |
 | <span id="355">355</span> | [Design Twitter](https://leetcode.com/problems/design-twitter) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-twitter) | Medium |
-| <span id="356">356</span> | [Line Reflection](https://leetcode.com/problems/line-reflection) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/line-reflection) | Medium |
+| <span id="356">356</span> | [Line Reflection](https://leetcode.com/problems/line-reflection) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/line-reflection) | Medium |
 | <span id="357">357</span> | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-numbers-with-unique-digits) | Medium |
-| <span id="358">358</span> | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/rearrange-string-k-distance-apart) | Hard |
-| <span id="359">359</span> | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/logger-rate-limiter) | Easy |
-| <span id="360">360</span> | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-transformed-array) | Medium |
-| <span id="361">361</span> | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/bomb-enemy) | Medium |
-| <span id="362">362</span> | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hit-counter) | Medium |
+| <span id="358">358</span> | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/rearrange-string-k-distance-apart) | Hard |
+| <span id="359">359</span> | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/logger-rate-limiter) | Easy |
+| <span id="360">360</span> | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-transformed-array) | Medium |
+| <span id="361">361</span> | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/bomb-enemy) | Medium |
+| <span id="362">362</span> | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hit-counter) | Medium |
 | <span id="363">363</span> | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-sum-of-rectangle-no-larger-than-k) | Hard |
-| <span id="364">364</span> | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum-ii) | Medium |
+| <span id="364">364</span> | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum-ii) | Medium |
 | <span id="365">365</span> | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem) | [Go](https://github.com/openset/leetcode/tree/master/solution/water-and-jug-problem) | Medium |
-| <span id="366">366</span> | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-leaves-of-binary-tree) | Medium |
+| <span id="366">366</span> | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-leaves-of-binary-tree) | Medium |
 | <span id="367">367</span> | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-perfect-square) | Easy |
 | <span id="368">368</span> | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-divisible-subset) | Medium |
-| <span id="369">369</span> | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/plus-one-linked-list) | Medium |
-| <span id="370">370</span> | [Range Addition](https://leetcode.com/problems/range-addition) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/range-addition) | Medium |
+| <span id="369">369</span> | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/plus-one-linked-list) | Medium |
+| <span id="370">370</span> | [Range Addition](https://leetcode.com/problems/range-addition) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/range-addition) | Medium |
 | <span id="371">371</span> | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-two-integers) | Easy |
 | <span id="372">372</span> | [Super Pow](https://leetcode.com/problems/super-pow) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-pow) | Medium |
 | <span id="373">373</span> | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-pairs-with-smallest-sums) | Medium |
@@ -390,7 +425,7 @@ LeetCode Problems' Solutions
 | <span id="376">376</span> | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-subsequence) | Medium |
 | <span id="377">377</span> | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum-iv) | Medium |
 | <span id="378">378</span> | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-element-in-a-sorted-matrix) | Medium |
-| <span id="379">379</span> | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-phone-directory) | Medium |
+| <span id="379">379</span> | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-phone-directory) | Medium |
 | <span id="380">380</span> | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o1) | Medium |
 | <span id="381">381</span> | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o1-duplicates-allowed) | Hard |
 | <span id="382">382</span> | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-random-node) | Medium |
@@ -419,30 +454,30 @@ LeetCode Problems' Solutions
 | <span id="405">405</span> | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-a-number-to-hexadecimal) | Easy |
 | <span id="406">406</span> | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | [Go](https://github.com/openset/leetcode/tree/master/solution/queue-reconstruction-by-height) | Medium |
 | <span id="407">407</span> | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/trapping-rain-water-ii) | Hard |
-| <span id="408">408</span> | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-abbreviation) | Easy |
+| <span id="408">408</span> | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-abbreviation) | Easy |
 | <span id="409">409</span> | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-palindrome) | Easy |
 | <span id="410">410</span> | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-largest-sum) | Hard |
-| <span id="411">411</span> | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-unique-word-abbreviation) | Hard |
+| <span id="411">411</span> | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-unique-word-abbreviation) | Hard |
 | <span id="412">412</span> | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [Go](https://github.com/openset/leetcode/tree/master/solution/fizz-buzz) | Easy |
 | <span id="413">413</span> | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | [Go](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices) | Medium |
 | <span id="414">414</span> | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/third-maximum-number) | Easy |
 | <span id="415">415</span> | [Add Strings](https://leetcode.com/problems/add-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-strings) | Easy |
 | <span id="416">416</span> | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-equal-subset-sum) | Medium |
 | <span id="417">417</span> | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [Go](https://github.com/openset/leetcode/tree/master/solution/pacific-atlantic-water-flow) | Medium |
-| <span id="418">418</span> | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-screen-fitting) | Medium |
+| <span id="418">418</span> | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-screen-fitting) | Medium |
 | <span id="419">419</span> | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | [Go](https://github.com/openset/leetcode/tree/master/solution/battleships-in-a-board) | Medium |
 | <span id="420">420</span> | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker) | [Go](https://github.com/openset/leetcode/tree/master/solution/strong-password-checker) | Hard |
 | <span id="421">421</span> | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-xor-of-two-numbers-in-an-array) | Medium |
-| <span id="422">422</span> | [Valid Word Square](https://leetcode.com/problems/valid-word-square) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-square) | Easy |
+| <span id="422">422</span> | [Valid Word Square](https://leetcode.com/problems/valid-word-square) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-square) | Easy |
 | <span id="423">423</span> | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english) | [Go](https://github.com/openset/leetcode/tree/master/solution/reconstruct-original-digits-from-english) | Medium |
 | <span id="424">424</span> | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-repeating-character-replacement) | Medium |
-| <span id="425">425</span> | [Word Squares](https://leetcode.com/problems/word-squares) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/word-squares) | Hard |
-| <span id="426">426</span> | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
+| <span id="425">425</span> | [Word Squares](https://leetcode.com/problems/word-squares) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/word-squares) | Hard |
+| <span id="426">426</span> | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
 | <span id="427">427</span> | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-quad-tree) | Easy |
-| <span id="428">428</span> | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-n-ary-tree) | Hard |
+| <span id="428">428</span> | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-n-ary-tree) | Hard |
 | <span id="429">429</span> | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-level-order-traversal) | Easy |
 | <span id="430">430</span> | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-a-multilevel-doubly-linked-list) | Medium |
-| <span id="431">431</span> | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-n-ary-tree-to-binary-tree) | Hard |
+| <span id="431">431</span> | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-n-ary-tree-to-binary-tree) | Hard |
 | <span id="432">432</span> | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-oone-data-structure) | Hard |
 | <span id="433">433</span> | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-genetic-mutation) | Medium |
 | <span id="434">434</span> | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-segments-in-a-string) | Easy |
@@ -450,12 +485,12 @@ LeetCode Problems' Solutions
 | <span id="436">436</span> | [Find Right Interval](https://leetcode.com/problems/find-right-interval) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-right-interval) | Medium |
 | <span id="437">437</span> | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-iii) | Easy |
 | <span id="438">438</span> | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-anagrams-in-a-string) | Easy |
-| <span id="439">439</span> | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/ternary-expression-parser) | Medium |
+| <span id="439">439</span> | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/ternary-expression-parser) | Medium |
 | <span id="440">440</span> | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-smallest-in-lexicographical-order) | Hard |
 | <span id="441">441</span> | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | [Go](https://github.com/openset/leetcode/tree/master/solution/arranging-coins) | Easy |
 | <span id="442">442</span> | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-duplicates-in-an-array) | Medium |
 | <span id="443">443</span> | [String Compression](https://leetcode.com/problems/string-compression) | [Go](https://github.com/openset/leetcode/tree/master/solution/string-compression) | Easy |
-| <span id="444">444</span> | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/sequence-reconstruction) | Medium |
+| <span id="444">444</span> | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/sequence-reconstruction) | Medium |
 | <span id="445">445</span> | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers-ii) | Medium |
 | <span id="446">446</span> | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices-ii-subsequence) | Hard |
 | <span id="447">447</span> | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-boomerangs) | Easy |
@@ -476,13 +511,13 @@ LeetCode Problems' Solutions
 | <span id="462">462</span> | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-moves-to-equal-array-elements-ii) | Medium |
 | <span id="463">463</span> | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | [Go](https://github.com/openset/leetcode/tree/master/solution/island-perimeter) | Easy |
 | <span id="464">464</span> | [Can I Win](https://leetcode.com/problems/can-i-win) | [Go](https://github.com/openset/leetcode/tree/master/solution/can-i-win) | Medium |
-| <span id="465">465</span> | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/optimal-account-balancing) | Hard |
+| <span id="465">465</span> | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/optimal-account-balancing) | Hard |
 | <span id="466">466</span> | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-the-repetitions) | Hard |
 | <span id="467">467</span> | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-substrings-in-wraparound-string) | Medium |
 | <span id="468">468</span> | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [Go](https://github.com/openset/leetcode/tree/master/solution/validate-ip-address) | Medium |
-| <span id="469">469</span> | [Convex Polygon](https://leetcode.com/problems/convex-polygon) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/convex-polygon) | Medium |
+| <span id="469">469</span> | [Convex Polygon](https://leetcode.com/problems/convex-polygon) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/convex-polygon) | Medium |
 | <span id="470">470</span> | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-rand10-using-rand7) | Medium |
-| <span id="471">471</span> | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-string-with-shortest-length) | Hard |
+| <span id="471">471</span> | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-string-with-shortest-length) | Hard |
 | <span id="472">472</span> | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/concatenated-words) | Hard |
 | <span id="473">473</span> | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/matchsticks-to-square) | Medium |
 | <span id="474">474</span> | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/ones-and-zeroes) | Medium |
@@ -495,13 +530,13 @@ LeetCode Problems' Solutions
 | <span id="481">481</span> | [Magical String](https://leetcode.com/problems/magical-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/magical-string) | Medium |
 | <span id="482">482</span> | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [Go](https://github.com/openset/leetcode/tree/master/solution/license-key-formatting) | Easy |
 | <span id="483">483</span> | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-good-base) | Hard |
-| <span id="484">484</span> | [Find Permutation](https://leetcode.com/problems/find-permutation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-permutation) | Medium |
+| <span id="484">484</span> | [Find Permutation](https://leetcode.com/problems/find-permutation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-permutation) | Medium |
 | <span id="485">485</span> | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones) | Easy |
 | <span id="486">486</span> | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | [Go](https://github.com/openset/leetcode/tree/master/solution/predict-the-winner) | Medium |
-| <span id="487">487</span> | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones-ii) | Medium |
+| <span id="487">487</span> | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones-ii) | Medium |
 | <span id="488">488</span> | [Zuma Game](https://leetcode.com/problems/zuma-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/zuma-game) | Hard |
-| <span id="489">489</span> | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/robot-room-cleaner) | Hard |
-| <span id="490">490</span> | [The Maze](https://leetcode.com/problems/the-maze) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze) | Medium |
+| <span id="489">489</span> | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/robot-room-cleaner) | Hard |
+| <span id="490">490</span> | [The Maze](https://leetcode.com/problems/the-maze) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze) | Medium |
 | <span id="491">491</span> | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-subsequences) | Medium |
 | <span id="492">492</span> | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-the-rectangle) | Easy |
 | <span id="493">493</span> | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-pairs) | Hard |
@@ -510,13 +545,13 @@ LeetCode Problems' Solutions
 | <span id="496">496</span> | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-i) | Easy |
 | <span id="497">497</span> | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-point-in-non-overlapping-rectangles) | Medium |
 | <span id="498">498</span> | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | [Go](https://github.com/openset/leetcode/tree/master/solution/diagonal-traverse) | Medium |
-| <span id="499">499</span> | [The Maze III](https://leetcode.com/problems/the-maze-iii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-iii) | Hard |
+| <span id="499">499</span> | [The Maze III](https://leetcode.com/problems/the-maze-iii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-iii) | Hard |
 | <span id="500">500</span> | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | [Go](https://github.com/openset/leetcode/tree/master/solution/keyboard-row) | Easy |
 | <span id="501">501</span> | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-mode-in-binary-search-tree) | Easy |
 | <span id="502">502</span> | [IPO](https://leetcode.com/problems/ipo) | [Go](https://github.com/openset/leetcode/tree/master/solution/ipo) | Hard |
 | <span id="503">503</span> | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-ii) | Medium |
 | <span id="504">504</span> | [Base 7](https://leetcode.com/problems/base-7) | [Go](https://github.com/openset/leetcode/tree/master/solution/base-7) | Easy |
-| <span id="505">505</span> | [The Maze II](https://leetcode.com/problems/the-maze-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-ii) | Medium |
+| <span id="505">505</span> | [The Maze II](https://leetcode.com/problems/the-maze-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-ii) | Medium |
 | <span id="506">506</span> | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | [Go](https://github.com/openset/leetcode/tree/master/solution/relative-ranks) | Easy |
 | <span id="507">507</span> | [Perfect Number](https://leetcode.com/problems/perfect-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-number) | Easy |
 | <span id="508">508</span> | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-frequent-subtree-sum) | Medium |
@@ -534,15 +569,15 @@ LeetCode Problems' Solutions
 | <span id="524">524</span> | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary-through-deleting) | Medium |
 | <span id="525">525</span> | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/contiguous-array) | Medium |
 | <span id="526">526</span> | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement) | Medium |
-| <span id="527">527</span> | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/word-abbreviation) | Hard |
+| <span id="527">527</span> | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/word-abbreviation) | Hard |
 | <span id="528">528</span> | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-weight) | Medium |
 | <span id="529">529</span> | [Minesweeper](https://leetcode.com/problems/minesweeper) | [Go](https://github.com/openset/leetcode/tree/master/solution/minesweeper) | Medium |
 | <span id="530">530</span> | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-absolute-difference-in-bst) | Easy |
-| <span id="531">531</span> | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-i) | Medium |
+| <span id="531">531</span> | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-i) | Medium |
 | <span id="532">532</span> | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-diff-pairs-in-an-array) | Easy |
-| <span id="533">533</span> | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-ii) | Medium |
+| <span id="533">533</span> | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-ii) | Medium |
 | <span id="535">535</span> | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-tinyurl) | Medium |
-| <span id="536">536</span> | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-string) | Medium |
+| <span id="536">536</span> | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-string) | Medium |
 | <span id="537">537</span> | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | [Go](https://github.com/openset/leetcode/tree/master/solution/complex-number-multiplication) | Medium |
 | <span id="538">538</span> | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-bst-to-greater-tree) | Easy |
 | <span id="539">539</span> | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-time-difference) | Medium |
@@ -550,50 +585,50 @@ LeetCode Problems' Solutions
 | <span id="541">541</span> | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-string-ii) | Easy |
 | <span id="542">542</span> | [01 Matrix](https://leetcode.com/problems/01-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/01-matrix) | Medium |
 | <span id="543">543</span> | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/diameter-of-binary-tree) | Easy |
-| <span id="544">544</span> | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/output-contest-matches) | Medium |
-| <span id="545">545</span> | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/boundary-of-binary-tree) | Medium |
+| <span id="544">544</span> | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/output-contest-matches) | Medium |
+| <span id="545">545</span> | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/boundary-of-binary-tree) | Medium |
 | <span id="546">546</span> | [Remove Boxes](https://leetcode.com/problems/remove-boxes) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-boxes) | Hard |
 | <span id="547">547</span> | [Friend Circles](https://leetcode.com/problems/friend-circles) | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-circles) | Medium |
-| <span id="548">548</span> | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-with-equal-sum) | Medium |
-| <span id="549">549</span> | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence-ii) | Medium |
+| <span id="548">548</span> | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-with-equal-sum) | Medium |
+| <span id="549">549</span> | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence-ii) | Medium |
 | <span id="551">551</span> | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-i) | Easy |
 | <span id="552">552</span> | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-ii) | Hard |
 | <span id="553">553</span> | [Optimal Division](https://leetcode.com/problems/optimal-division) | [Go](https://github.com/openset/leetcode/tree/master/solution/optimal-division) | Medium |
 | <span id="554">554</span> | [Brick Wall](https://leetcode.com/problems/brick-wall) | [Go](https://github.com/openset/leetcode/tree/master/solution/brick-wall) | Medium |
-| <span id="555">555</span> | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/split-concatenated-strings) | Medium |
+| <span id="555">555</span> | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/split-concatenated-strings) | Medium |
 | <span id="556">556</span> | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-iii) | Medium |
 | <span id="557">557</span> | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-iii) | Easy |
 | <span id="558">558</span> | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection) | [Go](https://github.com/openset/leetcode/tree/master/solution/quad-tree-intersection) | Easy |
 | <span id="559">559</span> | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-depth-of-n-ary-tree) | Easy |
 | <span id="560">560</span> | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/subarray-sum-equals-k) | Medium |
 | <span id="561">561</span> | [Array Partition I](https://leetcode.com/problems/array-partition-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-partition-i) | Easy |
-| <span id="562">562</span> | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-line-of-consecutive-one-in-matrix) | Medium |
+| <span id="562">562</span> | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-line-of-consecutive-one-in-matrix) | Medium |
 | <span id="563">563</span> | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-tilt) | Easy |
 | <span id="564">564</span> | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-closest-palindrome) | Hard |
 | <span id="565">565</span> | [Array Nesting](https://leetcode.com/problems/array-nesting) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-nesting) | Medium |
 | <span id="566">566</span> | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/reshape-the-matrix) | Easy |
 | <span id="567">567</span> | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutation-in-string) | Medium |
-| <span id="568">568</span> | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-vacation-days) | Hard |
-| <span id="569">569</span> | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/median-employee-salary) | Hard |
-| <span id="570">570</span> | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/managers-with-at-least-5-direct-reports) | Medium |
-| <span id="571">571</span> | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-median-given-frequency-of-numbers) | Hard |
+| <span id="568">568</span> | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-vacation-days) | Hard |
+| <span id="569">569</span> | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/median-employee-salary) | Hard |
+| <span id="570">570</span> | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/managers-with-at-least-5-direct-reports) | Medium |
+| <span id="571">571</span> | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-median-given-frequency-of-numbers) | Hard |
 | <span id="572">572</span> | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/subtree-of-another-tree) | Easy |
-| <span id="573">573</span> | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/squirrel-simulation) | Medium |
-| <span id="574">574</span> | [Winning Candidate](https://leetcode.com/problems/winning-candidate) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/winning-candidate) | Medium |
+| <span id="573">573</span> | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/squirrel-simulation) | Medium |
+| <span id="574">574</span> | [Winning Candidate](https://leetcode.com/problems/winning-candidate) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/winning-candidate) | Medium |
 | <span id="575">575</span> | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | [Go](https://github.com/openset/leetcode/tree/master/solution/distribute-candies) | Easy |
 | <span id="576">576</span> | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/out-of-boundary-paths) | Medium |
-| <span id="577">577</span> | [Employee Bonus](https://leetcode.com/problems/employee-bonus) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-bonus) | Easy |
-| <span id="578">578</span> | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/get-highest-answer-rate-question) | Medium |
-| <span id="579">579</span> | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-cumulative-salary-of-an-employee) | Hard |
-| <span id="580">580</span> | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/count-student-number-in-departments) | Medium |
+| <span id="577">577</span> | [Employee Bonus](https://leetcode.com/problems/employee-bonus) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-bonus) | Easy |
+| <span id="578">578</span> | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/get-highest-answer-rate-question) | Medium |
+| <span id="579">579</span> | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-cumulative-salary-of-an-employee) | Hard |
+| <span id="580">580</span> | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/count-student-number-in-departments) | Medium |
 | <span id="581">581</span> | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-unsorted-continuous-subarray) | Easy |
-| <span id="582">582</span> | [Kill Process](https://leetcode.com/problems/kill-process) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/kill-process) | Medium |
+| <span id="582">582</span> | [Kill Process](https://leetcode.com/problems/kill-process) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/kill-process) | Medium |
 | <span id="583">583</span> | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-operation-for-two-strings) | Medium |
-| <span id="584">584</span> | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-customer-referee) | Easy |
-| <span id="585">585</span> | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/investments-in-2016) | Medium |
-| <span id="586">586</span> | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/customer-placing-the-largest-number-of-orders) | Easy |
+| <span id="584">584</span> | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-customer-referee) | Easy |
+| <span id="585">585</span> | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/investments-in-2016) | Medium |
+| <span id="586">586</span> | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/customer-placing-the-largest-number-of-orders) | Easy |
 | <span id="587">587</span> | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | [Go](https://github.com/openset/leetcode/tree/master/solution/erect-the-fence) | Hard |
-| <span id="588">588</span> | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-in-memory-file-system) | Hard |
+| <span id="588">588</span> | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-in-memory-file-system) | Hard |
 | <span id="589">589</span> | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-preorder-traversal) | Easy |
 | <span id="590">590</span> | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-postorder-traversal) | Easy |
 | <span id="591">591</span> | [Tag Validator](https://leetcode.com/problems/tag-validator) | [Go](https://github.com/openset/leetcode/tree/master/solution/tag-validator) | Hard |
@@ -602,76 +637,76 @@ LeetCode Problems' Solutions
 | <span id="594">594</span> | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-harmonious-subsequence) | Easy |
 | <span id="595">595</span> | [Big Countries](https://leetcode.com/problems/big-countries) | [Go](https://github.com/openset/leetcode/tree/master/solution/big-countries) | Easy |
 | <span id="596">596</span> | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [Go](https://github.com/openset/leetcode/tree/master/solution/classes-more-than-5-students) | Easy |
-| <span id="597">597</span> | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-i-overall-acceptance-rate) | Easy |
+| <span id="597">597</span> | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-i-overall-acceptance-rate) | Easy |
 | <span id="598">598</span> | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-addition-ii) | Easy |
 | <span id="599">599</span> | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-index-sum-of-two-lists) | Easy |
 | <span id="600">600</span> | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-negative-integers-without-consecutive-ones) | Hard |
 | <span id="601">601</span> | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [Go](https://github.com/openset/leetcode/tree/master/solution/human-traffic-of-stadium) | Hard |
-| <span id="602">602</span> | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-ii-who-has-the-most-friends) | Medium |
-| <span id="603">603</span> | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-available-seats) | Easy |
-| <span id="604">604</span> | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-compressed-string-iterator) | Easy |
+| <span id="602">602</span> | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-ii-who-has-the-most-friends) | Medium |
+| <span id="603">603</span> | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-available-seats) | Easy |
+| <span id="604">604</span> | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-compressed-string-iterator) | Easy |
 | <span id="605">605</span> | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [Go](https://github.com/openset/leetcode/tree/master/solution/can-place-flowers) | Easy |
 | <span id="606">606</span> | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-string-from-binary-tree) | Easy |
-| <span id="607">607</span> | [Sales Person](https://leetcode.com/problems/sales-person) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/sales-person) | Easy |
-| <span id="608">608</span> | [Tree Node](https://leetcode.com/problems/tree-node) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/tree-node) | Medium |
+| <span id="607">607</span> | [Sales Person](https://leetcode.com/problems/sales-person) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/sales-person) | Easy |
+| <span id="608">608</span> | [Tree Node](https://leetcode.com/problems/tree-node) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/tree-node) | Medium |
 | <span id="609">609</span> | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-file-in-system) | Medium |
-| <span id="610">610</span> | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/triangle-judgement) | Easy |
+| <span id="610">610</span> | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/triangle-judgement) | Easy |
 | <span id="611">611</span> | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-triangle-number) | Medium |
-| <span id="612">612</span> | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-plane) | Medium |
-| <span id="613">613</span> | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-line) | Easy |
-| <span id="614">614</span> | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/second-degree-follower) | Medium |
-| <span id="615">615</span> | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/average-salary-departments-vs-company) | Hard |
-| <span id="616">616</span> | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/add-bold-tag-in-string) | Medium |
+| <span id="612">612</span> | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-plane) | Medium |
+| <span id="613">613</span> | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-line) | Easy |
+| <span id="614">614</span> | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/second-degree-follower) | Medium |
+| <span id="615">615</span> | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/average-salary-departments-vs-company) | Hard |
+| <span id="616">616</span> | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/add-bold-tag-in-string) | Medium |
 | <span id="617">617</span> | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-two-binary-trees) | Easy |
-| <span id="618">618</span> | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/students-report-by-geography) | Hard |
-| <span id="619">619</span> | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/biggest-single-number) | Easy |
+| <span id="618">618</span> | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/students-report-by-geography) | Hard |
+| <span id="619">619</span> | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/biggest-single-number) | Easy |
 | <span id="620">620</span> | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [Go](https://github.com/openset/leetcode/tree/master/solution/not-boring-movies) | Easy |
 | <span id="621">621</span> | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [Go](https://github.com/openset/leetcode/tree/master/solution/task-scheduler) | Medium |
 | <span id="622">622</span> | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-circular-queue) | Medium |
 | <span id="623">623</span> | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-one-row-to-tree) | Medium |
-| <span id="624">624</span> | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-distance-in-arrays) | Easy |
-| <span id="625">625</span> | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-factorization) | Medium |
+| <span id="624">624</span> | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-distance-in-arrays) | Easy |
+| <span id="625">625</span> | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-factorization) | Medium |
 | <span id="626">626</span> | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [Go](https://github.com/openset/leetcode/tree/master/solution/exchange-seats) | Medium |
 | <span id="627">627</span> | [Swap Salary](https://leetcode.com/problems/swap-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-salary) | Easy |
 | <span id="628">628</span> | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-three-numbers) | Easy |
 | <span id="629">629</span> | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-inverse-pairs-array) | Hard |
 | <span id="630">630</span> | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule-iii) | Hard |
-| <span id="631">631</span> | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-excel-sum-formula) | Hard |
+| <span id="631">631</span> | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-excel-sum-formula) | Hard |
 | <span id="632">632</span> | [Smallest Range](https://leetcode.com/problems/smallest-range) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-range) | Hard |
 | <span id="633">633</span> | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-square-numbers) | Easy |
-| <span id="634">634</span> | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-derangement-of-an-array) | Medium |
-| <span id="635">635</span> | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-log-storage-system) | Medium |
+| <span id="634">634</span> | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-derangement-of-an-array) | Medium |
+| <span id="635">635</span> | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-log-storage-system) | Medium |
 | <span id="636">636</span> | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | [Go](https://github.com/openset/leetcode/tree/master/solution/exclusive-time-of-functions) | Medium |
 | <span id="637">637</span> | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/average-of-levels-in-binary-tree) | Easy |
 | <span id="638">638</span> | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | [Go](https://github.com/openset/leetcode/tree/master/solution/shopping-offers) | Medium |
 | <span id="639">639</span> | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/decode-ways-ii) | Hard |
 | <span id="640">640</span> | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | [Go](https://github.com/openset/leetcode/tree/master/solution/solve-the-equation) | Medium |
 | <span id="641">641</span> | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-circular-deque) | Medium |
-| <span id="642">642</span> | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/design-search-autocomplete-system) | Hard |
+| <span id="642">642</span> | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-search-autocomplete-system) | Hard |
 | <span id="643">643</span> | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-i) | Easy |
-| <span id="644">644</span> | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-ii) | Hard |
+| <span id="644">644</span> | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-ii) | Hard |
 | <span id="645">645</span> | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-mismatch) | Easy |
 | <span id="646">646</span> | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-pair-chain) | Medium |
 | <span id="647">647</span> | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindromic-substrings) | Medium |
 | <span id="648">648</span> | [Replace Words](https://leetcode.com/problems/replace-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/replace-words) | Medium |
 | <span id="649">649</span> | [Dota2 Senate](https://leetcode.com/problems/dota2-senate) | [Go](https://github.com/openset/leetcode/tree/master/solution/dota2-senate) | Medium |
 | <span id="650">650</span> | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/2-keys-keyboard) | Medium |
-| <span id="651">651</span> | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/4-keys-keyboard) | Medium |
+| <span id="651">651</span> | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/4-keys-keyboard) | Medium |
 | <span id="652">652</span> | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-subtrees) | Medium |
 | <span id="653">653</span> | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iv-input-is-a-bst) | Easy |
 | <span id="654">654</span> | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-binary-tree) | Medium |
 | <span id="655">655</span> | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/print-binary-tree) | Medium |
-| <span id="656">656</span> | [Coin Path](https://leetcode.com/problems/coin-path) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-path) | Hard |
+| <span id="656">656</span> | [Coin Path](https://leetcode.com/problems/coin-path) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-path) | Hard |
 | <span id="657">657</span> | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [Go](https://github.com/openset/leetcode/tree/master/solution/robot-return-to-origin) | Easy |
 | <span id="658">658</span> | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-closest-elements) | Medium |
 | <span id="659">659</span> | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-into-consecutive-subsequences) | Medium |
-| <span id="660">660</span> | [Remove 9](https://leetcode.com/problems/remove-9) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-9) | Hard |
+| <span id="660">660</span> | [Remove 9](https://leetcode.com/problems/remove-9) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-9) | Hard |
 | <span id="661">661</span> | [Image Smoother](https://leetcode.com/problems/image-smoother) | [Go](https://github.com/openset/leetcode/tree/master/solution/image-smoother) | Easy |
 | <span id="662">662</span> | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-width-of-binary-tree) | Medium |
-| <span id="663">663</span> | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/equal-tree-partition) | Medium |
+| <span id="663">663</span> | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/equal-tree-partition) | Medium |
 | <span id="664">664</span> | [Strange Printer](https://leetcode.com/problems/strange-printer) | [Go](https://github.com/openset/leetcode/tree/master/solution/strange-printer) | Hard |
 | <span id="665">665</span> | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-decreasing-array) | Easy |
-| <span id="666">666</span> | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-iv) | Medium |
+| <span id="666">666</span> | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-iv) | Medium |
 | <span id="667">667</span> | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement-ii) | Medium |
 | <span id="668">668</span> | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-number-in-multiplication-table) | Hard |
 | <span id="669">669</span> | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/trim-a-binary-search-tree) | Easy |
@@ -686,9 +721,9 @@ LeetCode Problems' Solutions
 | <span id="678">678</span> | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-parenthesis-string) | Medium |
 | <span id="679">679</span> | [24 Game](https://leetcode.com/problems/24-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/24-game) | Hard |
 | <span id="680">680</span> | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-palindrome-ii) | Easy |
-| <span id="681">681</span> | [Next Closest Time](https://leetcode.com/problems/next-closest-time) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/next-closest-time) | Medium |
+| <span id="681">681</span> | [Next Closest Time](https://leetcode.com/problems/next-closest-time) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/next-closest-time) | Medium |
 | <span id="682">682</span> | [Baseball Game](https://leetcode.com/problems/baseball-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/baseball-game) | Easy |
-| <span id="683">683</span> | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/k-empty-slots) | Hard |
+| <span id="683">683</span> | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/k-empty-slots) | Hard |
 | <span id="684">684</span> | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | [Go](https://github.com/openset/leetcode/tree/master/solution/redundant-connection) | Medium |
 | <span id="685">685</span> | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/redundant-connection-ii) | Hard |
 | <span id="686">686</span> | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-string-match) | Easy |
@@ -699,7 +734,7 @@ LeetCode Problems' Solutions
 | <span id="691">691</span> | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/stickers-to-spell-word) | Hard |
 | <span id="692">692</span> | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-words) | Medium |
 | <span id="693">693</span> | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-number-with-alternating-bits) | Easy |
-| <span id="694">694</span> | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands) | Medium |
+| <span id="694">694</span> | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands) | Medium |
 | <span id="695">695</span> | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-area-of-island) | Medium |
 | <span id="696">696</span> | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-binary-substrings) | Easy |
 | <span id="697">697</span> | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/degree-of-an-array) | Easy |
@@ -707,47 +742,47 @@ LeetCode Problems' Solutions
 | <span id="699">699</span> | [Falling Squares](https://leetcode.com/problems/falling-squares) | [Go](https://github.com/openset/leetcode/tree/master/solution/falling-squares) | Hard |
 | <span id="700">700</span> | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-a-binary-search-tree) | Easy |
 | <span id="701">701</span> | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-binary-search-tree) | Medium |
-| <span id="702">702</span> | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-a-sorted-array-of-unknown-size) | Medium |
+| <span id="702">702</span> | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-a-sorted-array-of-unknown-size) | Medium |
 | <span id="703">703</span> | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-largest-element-in-a-stream) | Easy |
 | <span id="704">704</span> | [Binary Search](https://leetcode.com/problems/binary-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-search) | Easy |
 | <span id="705">705</span> | [Design HashSet](https://leetcode.com/problems/design-hashset) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hashset) | Easy |
 | <span id="706">706</span> | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hashmap) | Easy |
 | <span id="707">707</span> | [Design Linked List](https://leetcode.com/problems/design-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-linked-list) | Easy |
-| <span id="708">708</span> | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-cyclic-sorted-list) | Medium |
+| <span id="708">708</span> | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-cyclic-sorted-list) | Medium |
 | <span id="709">709</span> | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [Go](https://github.com/openset/leetcode/tree/master/solution/to-lower-case) | Easy |
 | <span id="710">710</span> | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-blacklist) | Hard |
-| <span id="711">711</span> | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands-ii) | Hard |
+| <span id="711">711</span> | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands-ii) | Hard |
 | <span id="712">712</span> | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-ascii-delete-sum-for-two-strings) | Medium |
 | <span id="713">713</span> | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/subarray-product-less-than-k) | Medium |
 | <span id="714">714</span> | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
 | <span id="715">715</span> | [Range Module](https://leetcode.com/problems/range-module) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-module) | Hard |
-| <span id="716">716</span> | [Max Stack](https://leetcode.com/problems/max-stack) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/max-stack) | Easy |
+| <span id="716">716</span> | [Max Stack](https://leetcode.com/problems/max-stack) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/max-stack) | Easy |
 | <span id="717">717</span> | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/1-bit-and-2-bit-characters) | Easy |
 | <span id="718">718</span> | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-repeated-subarray) | Medium |
 | <span id="719">719</span> | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-th-smallest-pair-distance) | Hard |
 | <span id="720">720</span> | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary) | Easy |
 | <span id="721">721</span> | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | [Go](https://github.com/openset/leetcode/tree/master/solution/accounts-merge) | Medium |
 | <span id="722">722</span> | [Remove Comments](https://leetcode.com/problems/remove-comments) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-comments) | Medium |
-| <span id="723">723</span> | [Candy Crush](https://leetcode.com/problems/candy-crush) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/candy-crush) | Medium |
+| <span id="723">723</span> | [Candy Crush](https://leetcode.com/problems/candy-crush) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/candy-crush) | Medium |
 | <span id="724">724</span> | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-pivot-index) | Easy |
 | <span id="725">725</span> | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-linked-list-in-parts) | Medium |
 | <span id="726">726</span> | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-atoms) | Hard |
-| <span id="727">727</span> | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-window-subsequence) | Hard |
+| <span id="727">727</span> | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-window-subsequence) | Hard |
 | <span id="728">728</span> | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/self-dividing-numbers) | Easy |
 | <span id="729">729</span> | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-i) | Medium |
 | <span id="730">730</span> | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-different-palindromic-subsequences) | Hard |
 | <span id="731">731</span> | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-ii) | Medium |
 | <span id="732">732</span> | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-iii) | Hard |
 | <span id="733">733</span> | [Flood Fill](https://leetcode.com/problems/flood-fill) | [Go](https://github.com/openset/leetcode/tree/master/solution/flood-fill) | Easy |
-| <span id="734">734</span> | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity) | Easy |
+| <span id="734">734</span> | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity) | Easy |
 | <span id="735">735</span> | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [Go](https://github.com/openset/leetcode/tree/master/solution/asteroid-collision) | Medium |
 | <span id="736">736</span> | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression) | [Go](https://github.com/openset/leetcode/tree/master/solution/parse-lisp-expression) | Hard |
-| <span id="737">737</span> | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity-ii) | Medium |
+| <span id="737">737</span> | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity-ii) | Medium |
 | <span id="738">738</span> | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/monotone-increasing-digits) | Medium |
 | <span id="739">739</span> | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [Go](https://github.com/openset/leetcode/tree/master/solution/daily-temperatures) | Medium |
 | <span id="740">740</span> | [Delete and Earn](https://leetcode.com/problems/delete-and-earn) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-and-earn) | Medium |
 | <span id="741">741</span> | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup) | [Go](https://github.com/openset/leetcode/tree/master/solution/cherry-pickup) | Hard |
-| <span id="742">742</span> | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-leaf-in-a-binary-tree) | Medium |
+| <span id="742">742</span> | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-leaf-in-a-binary-tree) | Medium |
 | <span id="743">743</span> | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | [Go](https://github.com/openset/leetcode/tree/master/solution/network-delay-time) | Easy |
 | <span id="744">744</span> | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-smallest-letter-greater-than-target) | Easy |
 | <span id="745">745</span> | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/prefix-and-suffix-search) | Hard |
@@ -755,17 +790,17 @@ LeetCode Problems' Solutions
 | <span id="747">747</span> | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-number-at-least-twice-of-others) | Easy |
 | <span id="748">748</span> | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-completing-word) | Easy |
 | <span id="749">749</span> | [Contain Virus](https://leetcode.com/problems/contain-virus) | [Go](https://github.com/openset/leetcode/tree/master/solution/contain-virus) | Hard |
-| <span id="750">750</span> | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-corner-rectangles) | Medium |
-| <span id="751">751</span> | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/ip-to-cidr) | Easy |
+| <span id="750">750</span> | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-corner-rectangles) | Medium |
+| <span id="751">751</span> | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/ip-to-cidr) | Easy |
 | <span id="752">752</span> | [Open the Lock](https://leetcode.com/problems/open-the-lock) | [Go](https://github.com/openset/leetcode/tree/master/solution/open-the-lock) | Medium |
 | <span id="753">753</span> | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | [Go](https://github.com/openset/leetcode/tree/master/solution/cracking-the-safe) | Hard |
 | <span id="754">754</span> | [Reach a Number](https://leetcode.com/problems/reach-a-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/reach-a-number) | Easy |
-| <span id="755">755</span> | [Pour Water](https://leetcode.com/problems/pour-water) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/pour-water) | Medium |
+| <span id="755">755</span> | [Pour Water](https://leetcode.com/problems/pour-water) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/pour-water) | Medium |
 | <span id="756">756</span> | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/pyramid-transition-matrix) | Medium |
 | <span id="757">757</span> | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-intersection-size-at-least-two) | Hard |
-| <span id="758">758</span> | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/bold-words-in-string) | Easy |
-| <span id="759">759</span> | [Employee Free Time](https://leetcode.com/problems/employee-free-time) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-free-time) | Hard |
-| <span id="760">760</span> | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/find-anagram-mappings) | Easy |
+| <span id="758">758</span> | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/bold-words-in-string) | Easy |
+| <span id="759">759</span> | [Employee Free Time](https://leetcode.com/problems/employee-free-time) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-free-time) | Hard |
+| <span id="760">760</span> | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-anagram-mappings) | Easy |
 | <span id="761">761</span> | [Special Binary String](https://leetcode.com/problems/special-binary-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/special-binary-string) | Hard |
 | <span id="762">762</span> | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [Go](https://github.com/openset/leetcode/tree/master/solution/prime-number-of-set-bits-in-binary-representation) | Easy |
 | <span id="763">763</span> | [Partition Labels](https://leetcode.com/problems/partition-labels) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-labels) | Medium |
@@ -777,11 +812,11 @@ LeetCode Problems' Solutions
 | <span id="769">769</span> | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-chunks-to-make-sorted) | Medium |
 | <span id="770">770</span> | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iv) | Hard |
 | <span id="771">771</span> | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | [Go](https://github.com/openset/leetcode/tree/master/solution/jewels-and-stones) | Easy |
-| <span id="772">772</span> | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iii) | Hard |
+| <span id="772">772</span> | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iii) | Hard |
 | <span id="773">773</span> | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle) | [Go](https://github.com/openset/leetcode/tree/master/solution/sliding-puzzle) | Hard |
-| <span id="774">774</span> | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-max-distance-to-gas-station) | Hard |
+| <span id="774">774</span> | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-max-distance-to-gas-station) | Hard |
 | <span id="775">775</span> | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | [Go](https://github.com/openset/leetcode/tree/master/solution/global-and-local-inversions) | Medium |
-| <span id="776">776</span> | [Split BST](https://leetcode.com/problems/split-bst) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/split-bst) | Medium |
+| <span id="776">776</span> | [Split BST](https://leetcode.com/problems/split-bst) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/split-bst) | Medium |
 | <span id="777">777</span> | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-adjacent-in-lr-string) | Medium |
 | <span id="778">778</span> | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/swim-in-rising-water) | Hard |
 | <span id="779">779</span> | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-symbol-in-grammar) | Medium |
@@ -805,7 +840,7 @@ LeetCode Problems' Solutions
 | <span id="797">797</span> | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-paths-from-source-to-target) | Medium |
 | <span id="798">798</span> | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rotation-with-highest-score) | Hard |
 | <span id="799">799</span> | [Champagne Tower](https://leetcode.com/problems/champagne-tower) | [Go](https://github.com/openset/leetcode/tree/master/solution/champagne-tower) | Medium |
-| <span id="800">800</span> | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/solution/similar-rgb-color) | Easy |
+| <span id="800">800</span> | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/similar-rgb-color) | Easy |
 | <span id="801">801</span> | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-swaps-to-make-sequences-increasing) | Medium |
 | <span id="802">802</span> | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-eventual-safe-states) | Medium |
 | <span id="803">803</span> | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit) | [Go](https://github.com/openset/leetcode/tree/master/solution/bricks-falling-when-hit) | Hard |

From 4bb45427a5a1c44748d40ffc10520e6dd4761baf Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Thu, 20 Dec 2018 18:37:11 +0800
Subject: [PATCH 11/22] Update: PaidOnly

---
 index.md | 324 +++++++++++++++++++++++++++----------------------------
 1 file changed, 162 insertions(+), 162 deletions(-)

diff --git a/index.md b/index.md
index 70d1167c9..174ea72d1 100644
--- a/index.md
+++ b/index.md
@@ -202,21 +202,21 @@ LeetCode Problems' Solutions
 | <span id="153">153</span> | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array) | Medium |
 | <span id="154">154</span> | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array-ii) | Hard |
 | <span id="155">155</span> | [Min Stack](https://leetcode.com/problems/min-stack) | [Go](https://github.com/openset/leetcode/tree/master/solution/min-stack) | Easy |
-| <span id="156">156</span> | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-upside-down) | Medium |
-| <span id="157">157</span> | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4) | Easy |
-| <span id="158">158</span> | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4-ii-call-multiple-times) | Hard |
-| <span id="159">159</span> | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-two-distinct-characters) | Hard |
+| <span id="156">156</span> | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-upside-down) | Medium |
+| <span id="157">157</span> | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4) | Easy |
+| <span id="158">158</span> | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4-ii-call-multiple-times) | Hard |
+| <span id="159">159</span> | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-two-distinct-characters) | Hard |
 | <span id="160">160</span> | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-linked-lists) | Easy |
-| <span id="161">161</span> | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/one-edit-distance) | Medium |
+| <span id="161">161</span> | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/one-edit-distance) | Medium |
 | <span id="162">162</span> | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-peak-element) | Medium |
-| <span id="163">163</span> | [Missing Ranges](https://leetcode.com/problems/missing-ranges) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/missing-ranges) | Medium |
+| <span id="163">163</span> | [Missing Ranges](https://leetcode.com/problems/missing-ranges) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/missing-ranges) | Medium |
 | <span id="164">164</span> | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-gap) | Hard |
 | <span id="165">165</span> | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/compare-version-numbers) | Medium |
 | <span id="166">166</span> | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [Go](https://github.com/openset/leetcode/tree/master/solution/fraction-to-recurring-decimal) | Medium |
 | <span id="167">167</span> | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-ii-input-array-is-sorted) | Easy |
 | <span id="168">168</span> | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [Go](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-title) | Easy |
 | <span id="169">169</span> | [Majority Element](https://leetcode.com/problems/majority-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/majority-element) | Easy |
-| <span id="170">170</span> | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iii-data-structure-design) | Easy |
+| <span id="170">170</span> | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iii-data-structure-design) | Easy |
 | <span id="171">171</span> | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-number) | Easy |
 | <span id="172">172</span> | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/factorial-trailing-zeroes) | Easy |
 | <span id="173">173</span> | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-search-tree-iterator) | Medium |
@@ -232,7 +232,7 @@ LeetCode Problems' Solutions
 | <span id="183">183</span> | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/customers-who-never-order) | Easy |
 | <span id="184">184</span> | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/department-highest-salary) | Medium |
 | <span id="185">185</span> | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [Go](https://github.com/openset/leetcode/tree/master/solution/department-top-three-salaries) | Hard |
-| <span id="186">186</span> | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-ii) | Medium |
+| <span id="186">186</span> | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-ii) | Medium |
 | <span id="187">187</span> | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-dna-sequences) | Medium |
 | <span id="188">188</span> | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iv) | Hard |
 | <span id="189">189</span> | [Rotate Array](https://leetcode.com/problems/rotate-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-array) | Easy |
@@ -289,89 +289,89 @@ LeetCode Problems' Solutions
 | <span id="240">240</span> | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-a-2d-matrix-ii) | Medium |
 | <span id="241">241</span> | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/different-ways-to-add-parentheses) | Medium |
 | <span id="242">242</span> | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-anagram) | Easy |
-| <span id="243">243</span> | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance) | Easy |
-| <span id="244">244</span> | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-ii) | Medium |
-| <span id="245">245</span> | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-iii) | Medium |
-| <span id="246">246</span> | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number) | Easy |
-| <span id="247">247</span> | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-ii) | Medium |
-| <span id="248">248</span> | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-iii) | Hard |
-| <span id="249">249</span> | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/group-shifted-strings) | Medium |
-| <span id="250">250</span> | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/count-univalue-subtrees) | Medium |
-| <span id="251">251</span> | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-2d-vector) | Medium |
-| <span id="252">252</span> | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms) | Easy |
-| <span id="253">253</span> | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms-ii) | Medium |
-| <span id="254">254</span> | [Factor Combinations](https://leetcode.com/problems/factor-combinations) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/factor-combinations) | Medium |
-| <span id="255">255</span> | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-sequence-in-binary-search-tree) | Medium |
-| <span id="256">256</span> | [Paint House](https://leetcode.com/problems/paint-house) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house) | Easy |
+| <span id="243">243</span> | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance) | Easy |
+| <span id="244">244</span> | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-ii) | Medium |
+| <span id="245">245</span> | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-iii) | Medium |
+| <span id="246">246</span> | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number) | Easy |
+| <span id="247">247</span> | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-ii) | Medium |
+| <span id="248">248</span> | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-iii) | Hard |
+| <span id="249">249</span> | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/group-shifted-strings) | Medium |
+| <span id="250">250</span> | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/count-univalue-subtrees) | Medium |
+| <span id="251">251</span> | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-2d-vector) | Medium |
+| <span id="252">252</span> | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms) | Easy |
+| <span id="253">253</span> | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms-ii) | Medium |
+| <span id="254">254</span> | [Factor Combinations](https://leetcode.com/problems/factor-combinations) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/factor-combinations) | Medium |
+| <span id="255">255</span> | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-sequence-in-binary-search-tree) | Medium |
+| <span id="256">256</span> | [Paint House](https://leetcode.com/problems/paint-house) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house) | Easy |
 | <span id="257">257</span> | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-paths) | Easy |
 | <span id="258">258</span> | [Add Digits](https://leetcode.com/problems/add-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-digits) | Easy |
-| <span id="259">259</span> | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-smaller) | Medium |
+| <span id="259">259</span> | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-smaller) | Medium |
 | <span id="260">260</span> | [Single Number III](https://leetcode.com/problems/single-number-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-number-iii) | Medium |
-| <span id="261">261</span> | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/graph-valid-tree) | Medium |
+| <span id="261">261</span> | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/graph-valid-tree) | Medium |
 | <span id="262">262</span> | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [Go](https://github.com/openset/leetcode/tree/master/solution/trips-and-users) | Hard |
 | <span id="263">263</span> | [Ugly Number](https://leetcode.com/problems/ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/ugly-number) | Easy |
 | <span id="264">264</span> | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/ugly-number-ii) | Medium |
-| <span id="265">265</span> | [Paint House II](https://leetcode.com/problems/paint-house-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house-ii) | Hard |
-| <span id="266">266</span> | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation) | Easy |
-| <span id="267">267</span> | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation-ii) | Medium |
+| <span id="265">265</span> | [Paint House II](https://leetcode.com/problems/paint-house-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house-ii) | Hard |
+| <span id="266">266</span> | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation) | Easy |
+| <span id="267">267</span> | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation-ii) | Medium |
 | <span id="268">268</span> | [Missing Number](https://leetcode.com/problems/missing-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/missing-number) | Easy |
-| <span id="269">269</span> | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/alien-dictionary) | Hard |
-| <span id="270">270</span> | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value) | Easy |
-| <span id="271">271</span> | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-strings) | Medium |
-| <span id="272">272</span> | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value-ii) | Hard |
+| <span id="269">269</span> | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/alien-dictionary) | Hard |
+| <span id="270">270</span> | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value) | Easy |
+| <span id="271">271</span> | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-strings) | Medium |
+| <span id="272">272</span> | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value-ii) | Hard |
 | <span id="273">273</span> | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-to-english-words) | Hard |
 | <span id="274">274</span> | [H-Index](https://leetcode.com/problems/h-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/h-index) | Medium |
 | <span id="275">275</span> | [H-Index II](https://leetcode.com/problems/h-index-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/h-index-ii) | Medium |
-| <span id="276">276</span> | [Paint Fence](https://leetcode.com/problems/paint-fence) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-fence) | Easy |
-| <span id="277">277</span> | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-celebrity) | Medium |
+| <span id="276">276</span> | [Paint Fence](https://leetcode.com/problems/paint-fence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-fence) | Easy |
+| <span id="277">277</span> | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-celebrity) | Medium |
 | <span id="278">278</span> | [First Bad Version](https://leetcode.com/problems/first-bad-version) | [Go](https://github.com/openset/leetcode/tree/master/solution/first-bad-version) | Easy |
 | <span id="279">279</span> | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-squares) | Medium |
-| <span id="280">280</span> | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort) | Medium |
-| <span id="281">281</span> | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/zigzag-iterator) | Medium |
+| <span id="280">280</span> | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort) | Medium |
+| <span id="281">281</span> | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/zigzag-iterator) | Medium |
 | <span id="282">282</span> | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | [Go](https://github.com/openset/leetcode/tree/master/solution/expression-add-operators) | Hard |
 | <span id="283">283</span> | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/move-zeroes) | Easy |
 | <span id="284">284</span> | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/peeking-iterator) | Medium |
-| <span id="285">285</span> | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/inorder-successor-in-bst) | Medium |
-| <span id="286">286</span> | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/walls-and-gates) | Medium |
+| <span id="285">285</span> | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/inorder-successor-in-bst) | Medium |
+| <span id="286">286</span> | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/walls-and-gates) | Medium |
 | <span id="287">287</span> | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-duplicate-number) | Medium |
-| <span id="288">288</span> | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-word-abbreviation) | Medium |
+| <span id="288">288</span> | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-word-abbreviation) | Medium |
 | <span id="289">289</span> | [Game of Life](https://leetcode.com/problems/game-of-life) | [Go](https://github.com/openset/leetcode/tree/master/solution/game-of-life) | Medium |
 | <span id="290">290</span> | [Word Pattern](https://leetcode.com/problems/word-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-pattern) | Easy |
-| <span id="291">291</span> | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/word-pattern-ii) | Hard |
+| <span id="291">291</span> | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/word-pattern-ii) | Hard |
 | <span id="292">292</span> | [Nim Game](https://leetcode.com/problems/nim-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/nim-game) | Easy |
-| <span id="293">293</span> | [Flip Game](https://leetcode.com/problems/flip-game) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game) | Easy |
-| <span id="294">294</span> | [Flip Game II](https://leetcode.com/problems/flip-game-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game-ii) | Medium |
+| <span id="293">293</span> | [Flip Game](https://leetcode.com/problems/flip-game) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game) | Easy |
+| <span id="294">294</span> | [Flip Game II](https://leetcode.com/problems/flip-game-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game-ii) | Medium |
 | <span id="295">295</span> | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-median-from-data-stream) | Hard |
-| <span id="296">296</span> | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/best-meeting-point) | Hard |
+| <span id="296">296</span> | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/best-meeting-point) | Hard |
 | <span id="297">297</span> | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-binary-tree) | Hard |
-| <span id="298">298</span> | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence) | Medium |
+| <span id="298">298</span> | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence) | Medium |
 | <span id="299">299</span> | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulls-and-cows) | Medium |
 | <span id="300">300</span> | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-increasing-subsequence) | Medium |
 | <span id="301">301</span> | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-invalid-parentheses) | Hard |
-| <span id="302">302</span> | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rectangle-enclosing-black-pixels) | Hard |
+| <span id="302">302</span> | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rectangle-enclosing-black-pixels) | Hard |
 | <span id="303">303</span> | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-immutable) | Easy |
 | <span id="304">304</span> | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-immutable) | Medium |
-| <span id="305">305</span> | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-islands-ii) | Hard |
+| <span id="305">305</span> | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-islands-ii) | Hard |
 | <span id="306">306</span> | [Additive Number](https://leetcode.com/problems/additive-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/additive-number) | Medium |
 | <span id="307">307</span> | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-mutable) | Medium |
-| <span id="308">308</span> | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-mutable) | Hard |
+| <span id="308">308</span> | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-mutable) | Hard |
 | <span id="309">309</span> | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
 | <span id="310">310</span> | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-height-trees) | Medium |
-| <span id="311">311</span> | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/sparse-matrix-multiplication) | Medium |
+| <span id="311">311</span> | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/sparse-matrix-multiplication) | Medium |
 | <span id="312">312</span> | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/solution/burst-balloons) | Hard |
 | <span id="313">313</span> | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-ugly-number) | Medium |
-| <span id="314">314</span> | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-vertical-order-traversal) | Medium |
+| <span id="314">314</span> | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-vertical-order-traversal) | Medium |
 | <span id="315">315</span> | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-of-smaller-numbers-after-self) | Hard |
 | <span id="316">316</span> | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicate-letters) | Hard |
-| <span id="317">317</span> | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-from-all-buildings) | Hard |
+| <span id="317">317</span> | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-from-all-buildings) | Hard |
 | <span id="318">318</span> | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-word-lengths) | Medium |
 | <span id="319">319</span> | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulb-switcher) | Medium |
-| <span id="320">320</span> | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/generalized-abbreviation) | Medium |
+| <span id="320">320</span> | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/generalized-abbreviation) | Medium |
 | <span id="321">321</span> | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/create-maximum-number) | Hard |
 | <span id="322">322</span> | [Coin Change](https://leetcode.com/problems/coin-change) | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-change) | Medium |
-| <span id="323">323</span> | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-connected-components-in-an-undirected-graph) | Medium |
+| <span id="323">323</span> | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-connected-components-in-an-undirected-graph) | Medium |
 | <span id="324">324</span> | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort-ii) | Medium |
-| <span id="325">325</span> | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-size-subarray-sum-equals-k) | Medium |
+| <span id="325">325</span> | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-size-subarray-sum-equals-k) | Medium |
 | <span id="326">326</span> | [Power of Three](https://leetcode.com/problems/power-of-three) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-three) | Easy |
 | <span id="327">327</span> | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-of-range-sum) | Hard |
 | <span id="328">328</span> | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/odd-even-linked-list) | Medium |
@@ -379,44 +379,44 @@ LeetCode Problems' Solutions
 | <span id="330">330</span> | [Patching Array](https://leetcode.com/problems/patching-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/patching-array) | Hard |
 | <span id="331">331</span> | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-serialization-of-a-binary-tree) | Medium |
 | <span id="332">332</span> | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | [Go](https://github.com/openset/leetcode/tree/master/solution/reconstruct-itinerary) | Medium |
-| <span id="333">333</span> | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-bst-subtree) | Medium |
+| <span id="333">333</span> | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-bst-subtree) | Medium |
 | <span id="334">334</span> | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-triplet-subsequence) | Medium |
 | <span id="335">335</span> | [Self Crossing](https://leetcode.com/problems/self-crossing) | [Go](https://github.com/openset/leetcode/tree/master/solution/self-crossing) | Hard |
 | <span id="336">336</span> | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-pairs) | Hard |
 | <span id="337">337</span> | [House Robber III](https://leetcode.com/problems/house-robber-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/house-robber-iii) | Medium |
 | <span id="338">338</span> | [Counting Bits](https://leetcode.com/problems/counting-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/counting-bits) | Medium |
-| <span id="339">339</span> | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum) | Easy |
-| <span id="340">340</span> | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-k-distinct-characters) | Hard |
+| <span id="339">339</span> | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum) | Easy |
+| <span id="340">340</span> | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-k-distinct-characters) | Hard |
 | <span id="341">341</span> | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-nested-list-iterator) | Medium |
 | <span id="342">342</span> | [Power of Four](https://leetcode.com/problems/power-of-four) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-four) | Easy |
 | <span id="343">343</span> | [Integer Break](https://leetcode.com/problems/integer-break) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-break) | Medium |
 | <span id="344">344</span> | [Reverse String](https://leetcode.com/problems/reverse-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-string) | Easy |
 | <span id="345">345</span> | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-vowels-of-a-string) | Easy |
-| <span id="346">346</span> | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/moving-average-from-data-stream) | Easy |
+| <span id="346">346</span> | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/moving-average-from-data-stream) | Easy |
 | <span id="347">347</span> | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-elements) | Medium |
-| <span id="348">348</span> | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-tic-tac-toe) | Medium |
+| <span id="348">348</span> | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-tic-tac-toe) | Medium |
 | <span id="349">349</span> | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays) | Easy |
 | <span id="350">350</span> | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays-ii) | Easy |
-| <span id="351">351</span> | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/android-unlock-patterns) | Medium |
+| <span id="351">351</span> | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/android-unlock-patterns) | Medium |
 | <span id="352">352</span> | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/data-stream-as-disjoint-intervals) | Hard |
-| <span id="353">353</span> | [Design Snake Game](https://leetcode.com/problems/design-snake-game) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-snake-game) | Medium |
+| <span id="353">353</span> | [Design Snake Game](https://leetcode.com/problems/design-snake-game) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-snake-game) | Medium |
 | <span id="354">354</span> | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | [Go](https://github.com/openset/leetcode/tree/master/solution/russian-doll-envelopes) | Hard |
 | <span id="355">355</span> | [Design Twitter](https://leetcode.com/problems/design-twitter) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-twitter) | Medium |
-| <span id="356">356</span> | [Line Reflection](https://leetcode.com/problems/line-reflection) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/line-reflection) | Medium |
+| <span id="356">356</span> | [Line Reflection](https://leetcode.com/problems/line-reflection) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/line-reflection) | Medium |
 | <span id="357">357</span> | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-numbers-with-unique-digits) | Medium |
-| <span id="358">358</span> | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/rearrange-string-k-distance-apart) | Hard |
-| <span id="359">359</span> | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/logger-rate-limiter) | Easy |
-| <span id="360">360</span> | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-transformed-array) | Medium |
-| <span id="361">361</span> | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/bomb-enemy) | Medium |
-| <span id="362">362</span> | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hit-counter) | Medium |
+| <span id="358">358</span> | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/rearrange-string-k-distance-apart) | Hard |
+| <span id="359">359</span> | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/logger-rate-limiter) | Easy |
+| <span id="360">360</span> | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-transformed-array) | Medium |
+| <span id="361">361</span> | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/bomb-enemy) | Medium |
+| <span id="362">362</span> | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hit-counter) | Medium |
 | <span id="363">363</span> | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-sum-of-rectangle-no-larger-than-k) | Hard |
-| <span id="364">364</span> | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum-ii) | Medium |
+| <span id="364">364</span> | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum-ii) | Medium |
 | <span id="365">365</span> | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem) | [Go](https://github.com/openset/leetcode/tree/master/solution/water-and-jug-problem) | Medium |
-| <span id="366">366</span> | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-leaves-of-binary-tree) | Medium |
+| <span id="366">366</span> | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-leaves-of-binary-tree) | Medium |
 | <span id="367">367</span> | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-perfect-square) | Easy |
 | <span id="368">368</span> | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-divisible-subset) | Medium |
-| <span id="369">369</span> | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/plus-one-linked-list) | Medium |
-| <span id="370">370</span> | [Range Addition](https://leetcode.com/problems/range-addition) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/range-addition) | Medium |
+| <span id="369">369</span> | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/plus-one-linked-list) | Medium |
+| <span id="370">370</span> | [Range Addition](https://leetcode.com/problems/range-addition) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/range-addition) | Medium |
 | <span id="371">371</span> | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-two-integers) | Easy |
 | <span id="372">372</span> | [Super Pow](https://leetcode.com/problems/super-pow) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-pow) | Medium |
 | <span id="373">373</span> | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-pairs-with-smallest-sums) | Medium |
@@ -425,7 +425,7 @@ LeetCode Problems' Solutions
 | <span id="376">376</span> | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-subsequence) | Medium |
 | <span id="377">377</span> | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum-iv) | Medium |
 | <span id="378">378</span> | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-element-in-a-sorted-matrix) | Medium |
-| <span id="379">379</span> | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-phone-directory) | Medium |
+| <span id="379">379</span> | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-phone-directory) | Medium |
 | <span id="380">380</span> | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o1) | Medium |
 | <span id="381">381</span> | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o1-duplicates-allowed) | Hard |
 | <span id="382">382</span> | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-random-node) | Medium |
@@ -454,30 +454,30 @@ LeetCode Problems' Solutions
 | <span id="405">405</span> | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-a-number-to-hexadecimal) | Easy |
 | <span id="406">406</span> | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | [Go](https://github.com/openset/leetcode/tree/master/solution/queue-reconstruction-by-height) | Medium |
 | <span id="407">407</span> | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/trapping-rain-water-ii) | Hard |
-| <span id="408">408</span> | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-abbreviation) | Easy |
+| <span id="408">408</span> | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-abbreviation) | Easy |
 | <span id="409">409</span> | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-palindrome) | Easy |
 | <span id="410">410</span> | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-largest-sum) | Hard |
-| <span id="411">411</span> | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-unique-word-abbreviation) | Hard |
+| <span id="411">411</span> | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-unique-word-abbreviation) | Hard |
 | <span id="412">412</span> | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [Go](https://github.com/openset/leetcode/tree/master/solution/fizz-buzz) | Easy |
 | <span id="413">413</span> | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | [Go](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices) | Medium |
 | <span id="414">414</span> | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/third-maximum-number) | Easy |
 | <span id="415">415</span> | [Add Strings](https://leetcode.com/problems/add-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-strings) | Easy |
 | <span id="416">416</span> | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-equal-subset-sum) | Medium |
 | <span id="417">417</span> | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [Go](https://github.com/openset/leetcode/tree/master/solution/pacific-atlantic-water-flow) | Medium |
-| <span id="418">418</span> | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-screen-fitting) | Medium |
+| <span id="418">418</span> | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-screen-fitting) | Medium |
 | <span id="419">419</span> | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | [Go](https://github.com/openset/leetcode/tree/master/solution/battleships-in-a-board) | Medium |
 | <span id="420">420</span> | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker) | [Go](https://github.com/openset/leetcode/tree/master/solution/strong-password-checker) | Hard |
 | <span id="421">421</span> | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-xor-of-two-numbers-in-an-array) | Medium |
-| <span id="422">422</span> | [Valid Word Square](https://leetcode.com/problems/valid-word-square) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-square) | Easy |
+| <span id="422">422</span> | [Valid Word Square](https://leetcode.com/problems/valid-word-square) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-square) | Easy |
 | <span id="423">423</span> | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english) | [Go](https://github.com/openset/leetcode/tree/master/solution/reconstruct-original-digits-from-english) | Medium |
 | <span id="424">424</span> | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-repeating-character-replacement) | Medium |
-| <span id="425">425</span> | [Word Squares](https://leetcode.com/problems/word-squares) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/word-squares) | Hard |
-| <span id="426">426</span> | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
+| <span id="425">425</span> | [Word Squares](https://leetcode.com/problems/word-squares) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/word-squares) | Hard |
+| <span id="426">426</span> | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
 | <span id="427">427</span> | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-quad-tree) | Easy |
-| <span id="428">428</span> | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-n-ary-tree) | Hard |
+| <span id="428">428</span> | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-n-ary-tree) | Hard |
 | <span id="429">429</span> | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-level-order-traversal) | Easy |
 | <span id="430">430</span> | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-a-multilevel-doubly-linked-list) | Medium |
-| <span id="431">431</span> | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-n-ary-tree-to-binary-tree) | Hard |
+| <span id="431">431</span> | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-n-ary-tree-to-binary-tree) | Hard |
 | <span id="432">432</span> | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-oone-data-structure) | Hard |
 | <span id="433">433</span> | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-genetic-mutation) | Medium |
 | <span id="434">434</span> | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-segments-in-a-string) | Easy |
@@ -485,12 +485,12 @@ LeetCode Problems' Solutions
 | <span id="436">436</span> | [Find Right Interval](https://leetcode.com/problems/find-right-interval) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-right-interval) | Medium |
 | <span id="437">437</span> | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-iii) | Easy |
 | <span id="438">438</span> | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-anagrams-in-a-string) | Easy |
-| <span id="439">439</span> | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/ternary-expression-parser) | Medium |
+| <span id="439">439</span> | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/ternary-expression-parser) | Medium |
 | <span id="440">440</span> | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-smallest-in-lexicographical-order) | Hard |
 | <span id="441">441</span> | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | [Go](https://github.com/openset/leetcode/tree/master/solution/arranging-coins) | Easy |
 | <span id="442">442</span> | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-duplicates-in-an-array) | Medium |
 | <span id="443">443</span> | [String Compression](https://leetcode.com/problems/string-compression) | [Go](https://github.com/openset/leetcode/tree/master/solution/string-compression) | Easy |
-| <span id="444">444</span> | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/sequence-reconstruction) | Medium |
+| <span id="444">444</span> | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/sequence-reconstruction) | Medium |
 | <span id="445">445</span> | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers-ii) | Medium |
 | <span id="446">446</span> | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices-ii-subsequence) | Hard |
 | <span id="447">447</span> | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-boomerangs) | Easy |
@@ -511,13 +511,13 @@ LeetCode Problems' Solutions
 | <span id="462">462</span> | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-moves-to-equal-array-elements-ii) | Medium |
 | <span id="463">463</span> | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | [Go](https://github.com/openset/leetcode/tree/master/solution/island-perimeter) | Easy |
 | <span id="464">464</span> | [Can I Win](https://leetcode.com/problems/can-i-win) | [Go](https://github.com/openset/leetcode/tree/master/solution/can-i-win) | Medium |
-| <span id="465">465</span> | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/optimal-account-balancing) | Hard |
+| <span id="465">465</span> | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/optimal-account-balancing) | Hard |
 | <span id="466">466</span> | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-the-repetitions) | Hard |
 | <span id="467">467</span> | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-substrings-in-wraparound-string) | Medium |
 | <span id="468">468</span> | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [Go](https://github.com/openset/leetcode/tree/master/solution/validate-ip-address) | Medium |
-| <span id="469">469</span> | [Convex Polygon](https://leetcode.com/problems/convex-polygon) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/convex-polygon) | Medium |
+| <span id="469">469</span> | [Convex Polygon](https://leetcode.com/problems/convex-polygon) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/convex-polygon) | Medium |
 | <span id="470">470</span> | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-rand10-using-rand7) | Medium |
-| <span id="471">471</span> | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-string-with-shortest-length) | Hard |
+| <span id="471">471</span> | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-string-with-shortest-length) | Hard |
 | <span id="472">472</span> | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/concatenated-words) | Hard |
 | <span id="473">473</span> | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/matchsticks-to-square) | Medium |
 | <span id="474">474</span> | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/ones-and-zeroes) | Medium |
@@ -530,13 +530,13 @@ LeetCode Problems' Solutions
 | <span id="481">481</span> | [Magical String](https://leetcode.com/problems/magical-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/magical-string) | Medium |
 | <span id="482">482</span> | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [Go](https://github.com/openset/leetcode/tree/master/solution/license-key-formatting) | Easy |
 | <span id="483">483</span> | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-good-base) | Hard |
-| <span id="484">484</span> | [Find Permutation](https://leetcode.com/problems/find-permutation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-permutation) | Medium |
+| <span id="484">484</span> | [Find Permutation](https://leetcode.com/problems/find-permutation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-permutation) | Medium |
 | <span id="485">485</span> | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones) | Easy |
 | <span id="486">486</span> | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | [Go](https://github.com/openset/leetcode/tree/master/solution/predict-the-winner) | Medium |
-| <span id="487">487</span> | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones-ii) | Medium |
+| <span id="487">487</span> | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones-ii) | Medium |
 | <span id="488">488</span> | [Zuma Game](https://leetcode.com/problems/zuma-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/zuma-game) | Hard |
-| <span id="489">489</span> | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/robot-room-cleaner) | Hard |
-| <span id="490">490</span> | [The Maze](https://leetcode.com/problems/the-maze) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze) | Medium |
+| <span id="489">489</span> | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/robot-room-cleaner) | Hard |
+| <span id="490">490</span> | [The Maze](https://leetcode.com/problems/the-maze) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze) | Medium |
 | <span id="491">491</span> | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-subsequences) | Medium |
 | <span id="492">492</span> | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-the-rectangle) | Easy |
 | <span id="493">493</span> | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-pairs) | Hard |
@@ -545,13 +545,13 @@ LeetCode Problems' Solutions
 | <span id="496">496</span> | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-i) | Easy |
 | <span id="497">497</span> | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-point-in-non-overlapping-rectangles) | Medium |
 | <span id="498">498</span> | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | [Go](https://github.com/openset/leetcode/tree/master/solution/diagonal-traverse) | Medium |
-| <span id="499">499</span> | [The Maze III](https://leetcode.com/problems/the-maze-iii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-iii) | Hard |
+| <span id="499">499</span> | [The Maze III](https://leetcode.com/problems/the-maze-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-iii) | Hard |
 | <span id="500">500</span> | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | [Go](https://github.com/openset/leetcode/tree/master/solution/keyboard-row) | Easy |
 | <span id="501">501</span> | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-mode-in-binary-search-tree) | Easy |
 | <span id="502">502</span> | [IPO](https://leetcode.com/problems/ipo) | [Go](https://github.com/openset/leetcode/tree/master/solution/ipo) | Hard |
 | <span id="503">503</span> | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-ii) | Medium |
 | <span id="504">504</span> | [Base 7](https://leetcode.com/problems/base-7) | [Go](https://github.com/openset/leetcode/tree/master/solution/base-7) | Easy |
-| <span id="505">505</span> | [The Maze II](https://leetcode.com/problems/the-maze-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-ii) | Medium |
+| <span id="505">505</span> | [The Maze II](https://leetcode.com/problems/the-maze-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-ii) | Medium |
 | <span id="506">506</span> | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | [Go](https://github.com/openset/leetcode/tree/master/solution/relative-ranks) | Easy |
 | <span id="507">507</span> | [Perfect Number](https://leetcode.com/problems/perfect-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-number) | Easy |
 | <span id="508">508</span> | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-frequent-subtree-sum) | Medium |
@@ -569,15 +569,15 @@ LeetCode Problems' Solutions
 | <span id="524">524</span> | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary-through-deleting) | Medium |
 | <span id="525">525</span> | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/contiguous-array) | Medium |
 | <span id="526">526</span> | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement) | Medium |
-| <span id="527">527</span> | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/word-abbreviation) | Hard |
+| <span id="527">527</span> | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/word-abbreviation) | Hard |
 | <span id="528">528</span> | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-weight) | Medium |
 | <span id="529">529</span> | [Minesweeper](https://leetcode.com/problems/minesweeper) | [Go](https://github.com/openset/leetcode/tree/master/solution/minesweeper) | Medium |
 | <span id="530">530</span> | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-absolute-difference-in-bst) | Easy |
-| <span id="531">531</span> | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-i) | Medium |
+| <span id="531">531</span> | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-i) | Medium |
 | <span id="532">532</span> | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-diff-pairs-in-an-array) | Easy |
-| <span id="533">533</span> | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-ii) | Medium |
+| <span id="533">533</span> | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-ii) | Medium |
 | <span id="535">535</span> | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-tinyurl) | Medium |
-| <span id="536">536</span> | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-string) | Medium |
+| <span id="536">536</span> | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-string) | Medium |
 | <span id="537">537</span> | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | [Go](https://github.com/openset/leetcode/tree/master/solution/complex-number-multiplication) | Medium |
 | <span id="538">538</span> | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-bst-to-greater-tree) | Easy |
 | <span id="539">539</span> | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-time-difference) | Medium |
@@ -585,50 +585,50 @@ LeetCode Problems' Solutions
 | <span id="541">541</span> | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-string-ii) | Easy |
 | <span id="542">542</span> | [01 Matrix](https://leetcode.com/problems/01-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/01-matrix) | Medium |
 | <span id="543">543</span> | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/diameter-of-binary-tree) | Easy |
-| <span id="544">544</span> | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/output-contest-matches) | Medium |
-| <span id="545">545</span> | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/boundary-of-binary-tree) | Medium |
+| <span id="544">544</span> | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/output-contest-matches) | Medium |
+| <span id="545">545</span> | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/boundary-of-binary-tree) | Medium |
 | <span id="546">546</span> | [Remove Boxes](https://leetcode.com/problems/remove-boxes) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-boxes) | Hard |
 | <span id="547">547</span> | [Friend Circles](https://leetcode.com/problems/friend-circles) | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-circles) | Medium |
-| <span id="548">548</span> | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-with-equal-sum) | Medium |
-| <span id="549">549</span> | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence-ii) | Medium |
+| <span id="548">548</span> | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-with-equal-sum) | Medium |
+| <span id="549">549</span> | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence-ii) | Medium |
 | <span id="551">551</span> | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-i) | Easy |
 | <span id="552">552</span> | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-ii) | Hard |
 | <span id="553">553</span> | [Optimal Division](https://leetcode.com/problems/optimal-division) | [Go](https://github.com/openset/leetcode/tree/master/solution/optimal-division) | Medium |
 | <span id="554">554</span> | [Brick Wall](https://leetcode.com/problems/brick-wall) | [Go](https://github.com/openset/leetcode/tree/master/solution/brick-wall) | Medium |
-| <span id="555">555</span> | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/split-concatenated-strings) | Medium |
+| <span id="555">555</span> | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/split-concatenated-strings) | Medium |
 | <span id="556">556</span> | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-iii) | Medium |
 | <span id="557">557</span> | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-iii) | Easy |
 | <span id="558">558</span> | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection) | [Go](https://github.com/openset/leetcode/tree/master/solution/quad-tree-intersection) | Easy |
 | <span id="559">559</span> | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-depth-of-n-ary-tree) | Easy |
 | <span id="560">560</span> | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/subarray-sum-equals-k) | Medium |
 | <span id="561">561</span> | [Array Partition I](https://leetcode.com/problems/array-partition-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-partition-i) | Easy |
-| <span id="562">562</span> | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-line-of-consecutive-one-in-matrix) | Medium |
+| <span id="562">562</span> | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-line-of-consecutive-one-in-matrix) | Medium |
 | <span id="563">563</span> | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-tilt) | Easy |
 | <span id="564">564</span> | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-closest-palindrome) | Hard |
 | <span id="565">565</span> | [Array Nesting](https://leetcode.com/problems/array-nesting) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-nesting) | Medium |
 | <span id="566">566</span> | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/reshape-the-matrix) | Easy |
 | <span id="567">567</span> | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutation-in-string) | Medium |
-| <span id="568">568</span> | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-vacation-days) | Hard |
-| <span id="569">569</span> | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/median-employee-salary) | Hard |
-| <span id="570">570</span> | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/managers-with-at-least-5-direct-reports) | Medium |
-| <span id="571">571</span> | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-median-given-frequency-of-numbers) | Hard |
+| <span id="568">568</span> | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-vacation-days) | Hard |
+| <span id="569">569</span> | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/median-employee-salary) | Hard |
+| <span id="570">570</span> | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/managers-with-at-least-5-direct-reports) | Medium |
+| <span id="571">571</span> | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-median-given-frequency-of-numbers) | Hard |
 | <span id="572">572</span> | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/subtree-of-another-tree) | Easy |
-| <span id="573">573</span> | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/squirrel-simulation) | Medium |
-| <span id="574">574</span> | [Winning Candidate](https://leetcode.com/problems/winning-candidate) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/winning-candidate) | Medium |
+| <span id="573">573</span> | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/squirrel-simulation) | Medium |
+| <span id="574">574</span> | [Winning Candidate](https://leetcode.com/problems/winning-candidate) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/winning-candidate) | Medium |
 | <span id="575">575</span> | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | [Go](https://github.com/openset/leetcode/tree/master/solution/distribute-candies) | Easy |
 | <span id="576">576</span> | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/out-of-boundary-paths) | Medium |
-| <span id="577">577</span> | [Employee Bonus](https://leetcode.com/problems/employee-bonus) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-bonus) | Easy |
-| <span id="578">578</span> | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/get-highest-answer-rate-question) | Medium |
-| <span id="579">579</span> | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-cumulative-salary-of-an-employee) | Hard |
-| <span id="580">580</span> | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/count-student-number-in-departments) | Medium |
+| <span id="577">577</span> | [Employee Bonus](https://leetcode.com/problems/employee-bonus) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-bonus) | Easy |
+| <span id="578">578</span> | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/get-highest-answer-rate-question) | Medium |
+| <span id="579">579</span> | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-cumulative-salary-of-an-employee) | Hard |
+| <span id="580">580</span> | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/count-student-number-in-departments) | Medium |
 | <span id="581">581</span> | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-unsorted-continuous-subarray) | Easy |
-| <span id="582">582</span> | [Kill Process](https://leetcode.com/problems/kill-process) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/kill-process) | Medium |
+| <span id="582">582</span> | [Kill Process](https://leetcode.com/problems/kill-process) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/kill-process) | Medium |
 | <span id="583">583</span> | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-operation-for-two-strings) | Medium |
-| <span id="584">584</span> | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-customer-referee) | Easy |
-| <span id="585">585</span> | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/investments-in-2016) | Medium |
-| <span id="586">586</span> | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/customer-placing-the-largest-number-of-orders) | Easy |
+| <span id="584">584</span> | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-customer-referee) | Easy |
+| <span id="585">585</span> | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/investments-in-2016) | Medium |
+| <span id="586">586</span> | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/customer-placing-the-largest-number-of-orders) | Easy |
 | <span id="587">587</span> | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | [Go](https://github.com/openset/leetcode/tree/master/solution/erect-the-fence) | Hard |
-| <span id="588">588</span> | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-in-memory-file-system) | Hard |
+| <span id="588">588</span> | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-in-memory-file-system) | Hard |
 | <span id="589">589</span> | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-preorder-traversal) | Easy |
 | <span id="590">590</span> | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-postorder-traversal) | Easy |
 | <span id="591">591</span> | [Tag Validator](https://leetcode.com/problems/tag-validator) | [Go](https://github.com/openset/leetcode/tree/master/solution/tag-validator) | Hard |
@@ -637,76 +637,76 @@ LeetCode Problems' Solutions
 | <span id="594">594</span> | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-harmonious-subsequence) | Easy |
 | <span id="595">595</span> | [Big Countries](https://leetcode.com/problems/big-countries) | [Go](https://github.com/openset/leetcode/tree/master/solution/big-countries) | Easy |
 | <span id="596">596</span> | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [Go](https://github.com/openset/leetcode/tree/master/solution/classes-more-than-5-students) | Easy |
-| <span id="597">597</span> | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-i-overall-acceptance-rate) | Easy |
+| <span id="597">597</span> | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-i-overall-acceptance-rate) | Easy |
 | <span id="598">598</span> | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-addition-ii) | Easy |
 | <span id="599">599</span> | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-index-sum-of-two-lists) | Easy |
 | <span id="600">600</span> | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-negative-integers-without-consecutive-ones) | Hard |
 | <span id="601">601</span> | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [Go](https://github.com/openset/leetcode/tree/master/solution/human-traffic-of-stadium) | Hard |
-| <span id="602">602</span> | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-ii-who-has-the-most-friends) | Medium |
-| <span id="603">603</span> | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-available-seats) | Easy |
-| <span id="604">604</span> | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-compressed-string-iterator) | Easy |
+| <span id="602">602</span> | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-ii-who-has-the-most-friends) | Medium |
+| <span id="603">603</span> | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-available-seats) | Easy |
+| <span id="604">604</span> | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-compressed-string-iterator) | Easy |
 | <span id="605">605</span> | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [Go](https://github.com/openset/leetcode/tree/master/solution/can-place-flowers) | Easy |
 | <span id="606">606</span> | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-string-from-binary-tree) | Easy |
-| <span id="607">607</span> | [Sales Person](https://leetcode.com/problems/sales-person) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/sales-person) | Easy |
-| <span id="608">608</span> | [Tree Node](https://leetcode.com/problems/tree-node) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/tree-node) | Medium |
+| <span id="607">607</span> | [Sales Person](https://leetcode.com/problems/sales-person) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/sales-person) | Easy |
+| <span id="608">608</span> | [Tree Node](https://leetcode.com/problems/tree-node) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/tree-node) | Medium |
 | <span id="609">609</span> | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-file-in-system) | Medium |
-| <span id="610">610</span> | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/triangle-judgement) | Easy |
+| <span id="610">610</span> | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/triangle-judgement) | Easy |
 | <span id="611">611</span> | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-triangle-number) | Medium |
-| <span id="612">612</span> | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-plane) | Medium |
-| <span id="613">613</span> | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-line) | Easy |
-| <span id="614">614</span> | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/second-degree-follower) | Medium |
-| <span id="615">615</span> | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/average-salary-departments-vs-company) | Hard |
-| <span id="616">616</span> | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/add-bold-tag-in-string) | Medium |
+| <span id="612">612</span> | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-plane) | Medium |
+| <span id="613">613</span> | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-line) | Easy |
+| <span id="614">614</span> | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/second-degree-follower) | Medium |
+| <span id="615">615</span> | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/average-salary-departments-vs-company) | Hard |
+| <span id="616">616</span> | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/add-bold-tag-in-string) | Medium |
 | <span id="617">617</span> | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-two-binary-trees) | Easy |
-| <span id="618">618</span> | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/students-report-by-geography) | Hard |
-| <span id="619">619</span> | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/biggest-single-number) | Easy |
+| <span id="618">618</span> | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/students-report-by-geography) | Hard |
+| <span id="619">619</span> | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/biggest-single-number) | Easy |
 | <span id="620">620</span> | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [Go](https://github.com/openset/leetcode/tree/master/solution/not-boring-movies) | Easy |
 | <span id="621">621</span> | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [Go](https://github.com/openset/leetcode/tree/master/solution/task-scheduler) | Medium |
 | <span id="622">622</span> | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-circular-queue) | Medium |
 | <span id="623">623</span> | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-one-row-to-tree) | Medium |
-| <span id="624">624</span> | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-distance-in-arrays) | Easy |
-| <span id="625">625</span> | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-factorization) | Medium |
+| <span id="624">624</span> | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-distance-in-arrays) | Easy |
+| <span id="625">625</span> | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-factorization) | Medium |
 | <span id="626">626</span> | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [Go](https://github.com/openset/leetcode/tree/master/solution/exchange-seats) | Medium |
 | <span id="627">627</span> | [Swap Salary](https://leetcode.com/problems/swap-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-salary) | Easy |
 | <span id="628">628</span> | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-three-numbers) | Easy |
 | <span id="629">629</span> | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-inverse-pairs-array) | Hard |
 | <span id="630">630</span> | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule-iii) | Hard |
-| <span id="631">631</span> | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-excel-sum-formula) | Hard |
+| <span id="631">631</span> | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-excel-sum-formula) | Hard |
 | <span id="632">632</span> | [Smallest Range](https://leetcode.com/problems/smallest-range) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-range) | Hard |
 | <span id="633">633</span> | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-square-numbers) | Easy |
-| <span id="634">634</span> | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-derangement-of-an-array) | Medium |
-| <span id="635">635</span> | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-log-storage-system) | Medium |
+| <span id="634">634</span> | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-derangement-of-an-array) | Medium |
+| <span id="635">635</span> | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-log-storage-system) | Medium |
 | <span id="636">636</span> | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | [Go](https://github.com/openset/leetcode/tree/master/solution/exclusive-time-of-functions) | Medium |
 | <span id="637">637</span> | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/average-of-levels-in-binary-tree) | Easy |
 | <span id="638">638</span> | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | [Go](https://github.com/openset/leetcode/tree/master/solution/shopping-offers) | Medium |
 | <span id="639">639</span> | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/decode-ways-ii) | Hard |
 | <span id="640">640</span> | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | [Go](https://github.com/openset/leetcode/tree/master/solution/solve-the-equation) | Medium |
 | <span id="641">641</span> | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-circular-deque) | Medium |
-| <span id="642">642</span> | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/design-search-autocomplete-system) | Hard |
+| <span id="642">642</span> | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-search-autocomplete-system) | Hard |
 | <span id="643">643</span> | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-i) | Easy |
-| <span id="644">644</span> | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-ii) | Hard |
+| <span id="644">644</span> | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-ii) | Hard |
 | <span id="645">645</span> | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-mismatch) | Easy |
 | <span id="646">646</span> | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-pair-chain) | Medium |
 | <span id="647">647</span> | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindromic-substrings) | Medium |
 | <span id="648">648</span> | [Replace Words](https://leetcode.com/problems/replace-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/replace-words) | Medium |
 | <span id="649">649</span> | [Dota2 Senate](https://leetcode.com/problems/dota2-senate) | [Go](https://github.com/openset/leetcode/tree/master/solution/dota2-senate) | Medium |
 | <span id="650">650</span> | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/2-keys-keyboard) | Medium |
-| <span id="651">651</span> | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/4-keys-keyboard) | Medium |
+| <span id="651">651</span> | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/4-keys-keyboard) | Medium |
 | <span id="652">652</span> | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-subtrees) | Medium |
 | <span id="653">653</span> | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iv-input-is-a-bst) | Easy |
 | <span id="654">654</span> | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-binary-tree) | Medium |
 | <span id="655">655</span> | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/print-binary-tree) | Medium |
-| <span id="656">656</span> | [Coin Path](https://leetcode.com/problems/coin-path) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-path) | Hard |
+| <span id="656">656</span> | [Coin Path](https://leetcode.com/problems/coin-path) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-path) | Hard |
 | <span id="657">657</span> | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [Go](https://github.com/openset/leetcode/tree/master/solution/robot-return-to-origin) | Easy |
 | <span id="658">658</span> | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-closest-elements) | Medium |
 | <span id="659">659</span> | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-into-consecutive-subsequences) | Medium |
-| <span id="660">660</span> | [Remove 9](https://leetcode.com/problems/remove-9) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-9) | Hard |
+| <span id="660">660</span> | [Remove 9](https://leetcode.com/problems/remove-9) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-9) | Hard |
 | <span id="661">661</span> | [Image Smoother](https://leetcode.com/problems/image-smoother) | [Go](https://github.com/openset/leetcode/tree/master/solution/image-smoother) | Easy |
 | <span id="662">662</span> | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-width-of-binary-tree) | Medium |
-| <span id="663">663</span> | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/equal-tree-partition) | Medium |
+| <span id="663">663</span> | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/equal-tree-partition) | Medium |
 | <span id="664">664</span> | [Strange Printer](https://leetcode.com/problems/strange-printer) | [Go](https://github.com/openset/leetcode/tree/master/solution/strange-printer) | Hard |
 | <span id="665">665</span> | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-decreasing-array) | Easy |
-| <span id="666">666</span> | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-iv) | Medium |
+| <span id="666">666</span> | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-iv) | Medium |
 | <span id="667">667</span> | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement-ii) | Medium |
 | <span id="668">668</span> | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-number-in-multiplication-table) | Hard |
 | <span id="669">669</span> | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/trim-a-binary-search-tree) | Easy |
@@ -721,9 +721,9 @@ LeetCode Problems' Solutions
 | <span id="678">678</span> | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-parenthesis-string) | Medium |
 | <span id="679">679</span> | [24 Game](https://leetcode.com/problems/24-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/24-game) | Hard |
 | <span id="680">680</span> | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-palindrome-ii) | Easy |
-| <span id="681">681</span> | [Next Closest Time](https://leetcode.com/problems/next-closest-time) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/next-closest-time) | Medium |
+| <span id="681">681</span> | [Next Closest Time](https://leetcode.com/problems/next-closest-time) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/next-closest-time) | Medium |
 | <span id="682">682</span> | [Baseball Game](https://leetcode.com/problems/baseball-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/baseball-game) | Easy |
-| <span id="683">683</span> | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/k-empty-slots) | Hard |
+| <span id="683">683</span> | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/k-empty-slots) | Hard |
 | <span id="684">684</span> | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | [Go](https://github.com/openset/leetcode/tree/master/solution/redundant-connection) | Medium |
 | <span id="685">685</span> | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/redundant-connection-ii) | Hard |
 | <span id="686">686</span> | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-string-match) | Easy |
@@ -734,7 +734,7 @@ LeetCode Problems' Solutions
 | <span id="691">691</span> | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/stickers-to-spell-word) | Hard |
 | <span id="692">692</span> | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-words) | Medium |
 | <span id="693">693</span> | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-number-with-alternating-bits) | Easy |
-| <span id="694">694</span> | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands) | Medium |
+| <span id="694">694</span> | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands) | Medium |
 | <span id="695">695</span> | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-area-of-island) | Medium |
 | <span id="696">696</span> | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-binary-substrings) | Easy |
 | <span id="697">697</span> | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/degree-of-an-array) | Easy |
@@ -742,47 +742,47 @@ LeetCode Problems' Solutions
 | <span id="699">699</span> | [Falling Squares](https://leetcode.com/problems/falling-squares) | [Go](https://github.com/openset/leetcode/tree/master/solution/falling-squares) | Hard |
 | <span id="700">700</span> | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-a-binary-search-tree) | Easy |
 | <span id="701">701</span> | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-binary-search-tree) | Medium |
-| <span id="702">702</span> | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-a-sorted-array-of-unknown-size) | Medium |
+| <span id="702">702</span> | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-a-sorted-array-of-unknown-size) | Medium |
 | <span id="703">703</span> | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-largest-element-in-a-stream) | Easy |
 | <span id="704">704</span> | [Binary Search](https://leetcode.com/problems/binary-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-search) | Easy |
 | <span id="705">705</span> | [Design HashSet](https://leetcode.com/problems/design-hashset) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hashset) | Easy |
 | <span id="706">706</span> | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hashmap) | Easy |
 | <span id="707">707</span> | [Design Linked List](https://leetcode.com/problems/design-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-linked-list) | Easy |
-| <span id="708">708</span> | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-cyclic-sorted-list) | Medium |
+| <span id="708">708</span> | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-cyclic-sorted-list) | Medium |
 | <span id="709">709</span> | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [Go](https://github.com/openset/leetcode/tree/master/solution/to-lower-case) | Easy |
 | <span id="710">710</span> | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-blacklist) | Hard |
-| <span id="711">711</span> | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands-ii) | Hard |
+| <span id="711">711</span> | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands-ii) | Hard |
 | <span id="712">712</span> | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-ascii-delete-sum-for-two-strings) | Medium |
 | <span id="713">713</span> | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/subarray-product-less-than-k) | Medium |
 | <span id="714">714</span> | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
 | <span id="715">715</span> | [Range Module](https://leetcode.com/problems/range-module) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-module) | Hard |
-| <span id="716">716</span> | [Max Stack](https://leetcode.com/problems/max-stack) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/max-stack) | Easy |
+| <span id="716">716</span> | [Max Stack](https://leetcode.com/problems/max-stack) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/max-stack) | Easy |
 | <span id="717">717</span> | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/1-bit-and-2-bit-characters) | Easy |
 | <span id="718">718</span> | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-repeated-subarray) | Medium |
 | <span id="719">719</span> | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-th-smallest-pair-distance) | Hard |
 | <span id="720">720</span> | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary) | Easy |
 | <span id="721">721</span> | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | [Go](https://github.com/openset/leetcode/tree/master/solution/accounts-merge) | Medium |
 | <span id="722">722</span> | [Remove Comments](https://leetcode.com/problems/remove-comments) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-comments) | Medium |
-| <span id="723">723</span> | [Candy Crush](https://leetcode.com/problems/candy-crush) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/candy-crush) | Medium |
+| <span id="723">723</span> | [Candy Crush](https://leetcode.com/problems/candy-crush) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/candy-crush) | Medium |
 | <span id="724">724</span> | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-pivot-index) | Easy |
 | <span id="725">725</span> | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-linked-list-in-parts) | Medium |
 | <span id="726">726</span> | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-atoms) | Hard |
-| <span id="727">727</span> | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-window-subsequence) | Hard |
+| <span id="727">727</span> | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-window-subsequence) | Hard |
 | <span id="728">728</span> | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/self-dividing-numbers) | Easy |
 | <span id="729">729</span> | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-i) | Medium |
 | <span id="730">730</span> | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-different-palindromic-subsequences) | Hard |
 | <span id="731">731</span> | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-ii) | Medium |
 | <span id="732">732</span> | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-iii) | Hard |
 | <span id="733">733</span> | [Flood Fill](https://leetcode.com/problems/flood-fill) | [Go](https://github.com/openset/leetcode/tree/master/solution/flood-fill) | Easy |
-| <span id="734">734</span> | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity) | Easy |
+| <span id="734">734</span> | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity) | Easy |
 | <span id="735">735</span> | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [Go](https://github.com/openset/leetcode/tree/master/solution/asteroid-collision) | Medium |
 | <span id="736">736</span> | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression) | [Go](https://github.com/openset/leetcode/tree/master/solution/parse-lisp-expression) | Hard |
-| <span id="737">737</span> | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity-ii) | Medium |
+| <span id="737">737</span> | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity-ii) | Medium |
 | <span id="738">738</span> | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/monotone-increasing-digits) | Medium |
 | <span id="739">739</span> | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [Go](https://github.com/openset/leetcode/tree/master/solution/daily-temperatures) | Medium |
 | <span id="740">740</span> | [Delete and Earn](https://leetcode.com/problems/delete-and-earn) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-and-earn) | Medium |
 | <span id="741">741</span> | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup) | [Go](https://github.com/openset/leetcode/tree/master/solution/cherry-pickup) | Hard |
-| <span id="742">742</span> | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-leaf-in-a-binary-tree) | Medium |
+| <span id="742">742</span> | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-leaf-in-a-binary-tree) | Medium |
 | <span id="743">743</span> | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | [Go](https://github.com/openset/leetcode/tree/master/solution/network-delay-time) | Easy |
 | <span id="744">744</span> | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-smallest-letter-greater-than-target) | Easy |
 | <span id="745">745</span> | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/prefix-and-suffix-search) | Hard |
@@ -790,17 +790,17 @@ LeetCode Problems' Solutions
 | <span id="747">747</span> | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-number-at-least-twice-of-others) | Easy |
 | <span id="748">748</span> | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-completing-word) | Easy |
 | <span id="749">749</span> | [Contain Virus](https://leetcode.com/problems/contain-virus) | [Go](https://github.com/openset/leetcode/tree/master/solution/contain-virus) | Hard |
-| <span id="750">750</span> | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-corner-rectangles) | Medium |
-| <span id="751">751</span> | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/ip-to-cidr) | Easy |
+| <span id="750">750</span> | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-corner-rectangles) | Medium |
+| <span id="751">751</span> | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/ip-to-cidr) | Easy |
 | <span id="752">752</span> | [Open the Lock](https://leetcode.com/problems/open-the-lock) | [Go](https://github.com/openset/leetcode/tree/master/solution/open-the-lock) | Medium |
 | <span id="753">753</span> | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | [Go](https://github.com/openset/leetcode/tree/master/solution/cracking-the-safe) | Hard |
 | <span id="754">754</span> | [Reach a Number](https://leetcode.com/problems/reach-a-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/reach-a-number) | Easy |
-| <span id="755">755</span> | [Pour Water](https://leetcode.com/problems/pour-water) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/pour-water) | Medium |
+| <span id="755">755</span> | [Pour Water](https://leetcode.com/problems/pour-water) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/pour-water) | Medium |
 | <span id="756">756</span> | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/pyramid-transition-matrix) | Medium |
 | <span id="757">757</span> | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-intersection-size-at-least-two) | Hard |
-| <span id="758">758</span> | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/bold-words-in-string) | Easy |
-| <span id="759">759</span> | [Employee Free Time](https://leetcode.com/problems/employee-free-time) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-free-time) | Hard |
-| <span id="760">760</span> | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/find-anagram-mappings) | Easy |
+| <span id="758">758</span> | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/bold-words-in-string) | Easy |
+| <span id="759">759</span> | [Employee Free Time](https://leetcode.com/problems/employee-free-time) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-free-time) | Hard |
+| <span id="760">760</span> | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-anagram-mappings) | Easy |
 | <span id="761">761</span> | [Special Binary String](https://leetcode.com/problems/special-binary-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/special-binary-string) | Hard |
 | <span id="762">762</span> | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [Go](https://github.com/openset/leetcode/tree/master/solution/prime-number-of-set-bits-in-binary-representation) | Easy |
 | <span id="763">763</span> | [Partition Labels](https://leetcode.com/problems/partition-labels) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-labels) | Medium |
@@ -812,11 +812,11 @@ LeetCode Problems' Solutions
 | <span id="769">769</span> | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-chunks-to-make-sorted) | Medium |
 | <span id="770">770</span> | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iv) | Hard |
 | <span id="771">771</span> | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | [Go](https://github.com/openset/leetcode/tree/master/solution/jewels-and-stones) | Easy |
-| <span id="772">772</span> | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iii) | Hard |
+| <span id="772">772</span> | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iii) | Hard |
 | <span id="773">773</span> | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle) | [Go](https://github.com/openset/leetcode/tree/master/solution/sliding-puzzle) | Hard |
-| <span id="774">774</span> | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-max-distance-to-gas-station) | Hard |
+| <span id="774">774</span> | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-max-distance-to-gas-station) | Hard |
 | <span id="775">775</span> | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | [Go](https://github.com/openset/leetcode/tree/master/solution/global-and-local-inversions) | Medium |
-| <span id="776">776</span> | [Split BST](https://leetcode.com/problems/split-bst) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/split-bst) | Medium |
+| <span id="776">776</span> | [Split BST](https://leetcode.com/problems/split-bst) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/split-bst) | Medium |
 | <span id="777">777</span> | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-adjacent-in-lr-string) | Medium |
 | <span id="778">778</span> | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/swim-in-rising-water) | Hard |
 | <span id="779">779</span> | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-symbol-in-grammar) | Medium |
@@ -840,7 +840,7 @@ LeetCode Problems' Solutions
 | <span id="797">797</span> | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-paths-from-source-to-target) | Medium |
 | <span id="798">798</span> | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rotation-with-highest-score) | Hard |
 | <span id="799">799</span> | [Champagne Tower](https://leetcode.com/problems/champagne-tower) | [Go](https://github.com/openset/leetcode/tree/master/solution/champagne-tower) | Medium |
-| <span id="800">800</span> | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) ðŸ”’ | [Go](https://github.com/openset/leetcode/tree/master/solution/similar-rgb-color) | Easy |
+| <span id="800">800</span> | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/similar-rgb-color) | Easy |
 | <span id="801">801</span> | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-swaps-to-make-sequences-increasing) | Medium |
 | <span id="802">802</span> | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-eventual-safe-states) | Medium |
 | <span id="803">803</span> | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit) | [Go](https://github.com/openset/leetcode/tree/master/solution/bricks-falling-when-hit) | Hard |

From ebd3882c5ef744cf6730e2399c6dc8fd5c5d8f51 Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Fri, 21 Dec 2018 10:10:11 +0800
Subject: [PATCH 12/22] Add: note

---
 index.md | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/index.md b/index.md
index 174ea72d1..db79a5415 100644
--- a/index.md
+++ b/index.md
@@ -1,4 +1,9 @@
-<!--This file generated by command(leetcode readme); DO NOT EDIT.-->
+<!--|This file generated by command(leetcode page); DO NOT EDIT.           |-->
+<!--+----------------------------------------------------------------------+-->
+<!--|@author    Openset <openset.wang@gmail.com>                           |-->
+<!--|@link      https://github.com/openset                                 |-->
+<!--|@home      https://github.com/openset/leetcode                        |-->
+<!--+----------------------------------------------------------------------+-->
 
 # [LeetCode](https://openset.github.io/leetcode)
 LeetCode Problems' Solutions

From a3d1c8ba9cc61dc4fdea22d686736ab19edde107 Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Sun, 23 Dec 2018 19:15:59 +0800
Subject: [PATCH 13/22] Update: problems

---
 index.md | 1910 +++++++++++++++++++++++++++---------------------------
 1 file changed, 957 insertions(+), 953 deletions(-)

diff --git a/index.md b/index.md
index db79a5415..7eae62758 100644
--- a/index.md
+++ b/index.md
@@ -52,956 +52,960 @@ LeetCode Problems' Solutions
 
 | # | Title | Solution | Difficulty |
 | :-: | - | - | :-: |
-| <span id="1">1</span> | [Two Sum](https://leetcode.com/problems/two-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum) | Easy |
-| <span id="2">2</span> | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers) | Medium |
-| <span id="3">3</span> | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-without-repeating-characters) | Medium |
-| <span id="4">4</span> | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/median-of-two-sorted-arrays) | Hard |
-| <span id="5">5</span> | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-palindromic-substring) | Medium |
-| <span id="6">6</span> | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | [Go](https://github.com/openset/leetcode/tree/master/solution/zigzag-conversion) | Medium |
-| <span id="7">7</span> | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-integer) | Easy |
-| <span id="8">8</span> | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | [Go](https://github.com/openset/leetcode/tree/master/solution/string-to-integer-atoi) | Medium |
-| <span id="9">9</span> | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-number) | Easy |
-| <span id="10">10</span> | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | [Go](https://github.com/openset/leetcode/tree/master/solution/regular-expression-matching) | Hard |
-| <span id="11">11</span> | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/container-with-most-water) | Medium |
-| <span id="12">12</span> | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-to-roman) | Medium |
-| <span id="13">13</span> | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | [Go](https://github.com/openset/leetcode/tree/master/solution/roman-to-integer) | Easy |
-| <span id="14">14</span> | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-common-prefix) | Easy |
-| <span id="15">15</span> | [3Sum](https://leetcode.com/problems/3sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum) | Medium |
-| <span id="16">16</span> | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-closest) | Medium |
-| <span id="17">17</span> | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/letter-combinations-of-a-phone-number) | Medium |
-| <span id="18">18</span> | [4Sum](https://leetcode.com/problems/4sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/4sum) | Medium |
-| <span id="19">19</span> | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-nth-node-from-end-of-list) | Medium |
-| <span id="20">20</span> | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-parentheses) | Easy |
-| <span id="21">21</span> | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-two-sorted-lists) | Easy |
-| <span id="22">22</span> | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/generate-parentheses) | Medium |
-| <span id="23">23</span> | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-k-sorted-lists) | Hard |
-| <span id="24">24</span> | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-nodes-in-pairs) | Medium |
-| <span id="25">25</span> | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-nodes-in-k-group) | Hard |
-| <span id="26">26</span> | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-array) | Easy |
-| <span id="27">27</span> | [Remove Element](https://leetcode.com/problems/remove-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-element) | Easy |
-| <span id="28">28</span> | [Implement strStr()](https://leetcode.com/problems/implement-strstr) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-strstr) | Easy |
-| <span id="29">29</span> | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/solution/divide-two-integers) | Medium |
-| <span id="30">30</span> | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/substring-with-concatenation-of-all-words) | Hard |
-| <span id="31">31</span> | [Next Permutation](https://leetcode.com/problems/next-permutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-permutation) | Medium |
-| <span id="32">32</span> | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-valid-parentheses) | Hard |
-| <span id="33">33</span> | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-rotated-sorted-array) | Medium |
-| <span id="34">34</span> | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-first-and-last-position-of-element-in-sorted-array) | Medium |
-| <span id="35">35</span> | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-insert-position) | Easy |
-| <span id="36">36</span> | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-sudoku) | Medium |
-| <span id="37">37</span> | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | [Go](https://github.com/openset/leetcode/tree/master/solution/sudoku-solver) | Hard |
-| <span id="38">38</span> | [Count and Say](https://leetcode.com/problems/count-and-say) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-and-say) | Easy |
-| <span id="39">39</span> | [Combination Sum](https://leetcode.com/problems/combination-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum) | Medium |
-| <span id="40">40</span> | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum-ii) | Medium |
-| <span id="41">41</span> | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | [Go](https://github.com/openset/leetcode/tree/master/solution/first-missing-positive) | Hard |
-| <span id="42">42</span> | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/trapping-rain-water) | Hard |
-| <span id="43">43</span> | [Multiply Strings](https://leetcode.com/problems/multiply-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/multiply-strings) | Medium |
-| <span id="44">44</span> | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | [Go](https://github.com/openset/leetcode/tree/master/solution/wildcard-matching) | Hard |
-| <span id="45">45</span> | [Jump Game II](https://leetcode.com/problems/jump-game-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/jump-game-ii) | Hard |
-| <span id="46">46</span> | [Permutations](https://leetcode.com/problems/permutations) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutations) | Medium |
-| <span id="47">47</span> | [Permutations II](https://leetcode.com/problems/permutations-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutations-ii) | Medium |
-| <span id="48">48</span> | [Rotate Image](https://leetcode.com/problems/rotate-image) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-image) | Medium |
-| <span id="49">49</span> | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | [Go](https://github.com/openset/leetcode/tree/master/solution/group-anagrams) | Medium |
-| <span id="50">50</span> | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [Go](https://github.com/openset/leetcode/tree/master/solution/powx-n) | Medium |
-| <span id="51">51</span> | [N-Queens](https://leetcode.com/problems/n-queens) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-queens) | Hard |
-| <span id="52">52</span> | [N-Queens II](https://leetcode.com/problems/n-queens-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-queens-ii) | Hard |
-| <span id="53">53</span> | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-subarray) | Easy |
-| <span id="54">54</span> | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix) | Medium |
-| <span id="55">55</span> | [Jump Game](https://leetcode.com/problems/jump-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/jump-game) | Medium |
-| <span id="56">56</span> | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-intervals) | Medium |
-| <span id="57">57</span> | [Insert Interval](https://leetcode.com/problems/insert-interval) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-interval) | Hard |
-| <span id="58">58</span> | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/length-of-last-word) | Easy |
-| <span id="59">59</span> | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix-ii) | Medium |
-| <span id="60">60</span> | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutation-sequence) | Medium |
-| <span id="61">61</span> | [Rotate List](https://leetcode.com/problems/rotate-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-list) | Medium |
-| <span id="62">62</span> | [Unique Paths](https://leetcode.com/problems/unique-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-paths) | Medium |
-| <span id="63">63</span> | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-paths-ii) | Medium |
-| <span id="64">64</span> | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-path-sum) | Medium |
-| <span id="65">65</span> | [Valid Number](https://leetcode.com/problems/valid-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-number) | Hard |
-| <span id="66">66</span> | [Plus One](https://leetcode.com/problems/plus-one) | [Go](https://github.com/openset/leetcode/tree/master/solution/plus-one) | Easy |
-| <span id="67">67</span> | [Add Binary](https://leetcode.com/problems/add-binary) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-binary) | Easy |
-| <span id="68">68</span> | [Text Justification](https://leetcode.com/problems/text-justification) | [Go](https://github.com/openset/leetcode/tree/master/solution/text-justification) | Hard |
-| <span id="69">69</span> | [Sqrt(x)](https://leetcode.com/problems/sqrtx) | [Go](https://github.com/openset/leetcode/tree/master/solution/sqrtx) | Easy |
-| <span id="70">70</span> | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/climbing-stairs) | Easy |
-| <span id="71">71</span> | [Simplify Path](https://leetcode.com/problems/simplify-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/simplify-path) | Medium |
-| <span id="72">72</span> | [Edit Distance](https://leetcode.com/problems/edit-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/edit-distance) | Hard |
-| <span id="73">73</span> | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-matrix-zeroes) | Medium |
-| <span id="74">74</span> | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-a-2d-matrix) | Medium |
-| <span id="75">75</span> | [Sort Colors](https://leetcode.com/problems/sort-colors) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-colors) | Medium |
-| <span id="76">76</span> | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-window-substring) | Hard |
-| <span id="77">77</span> | [Combinations](https://leetcode.com/problems/combinations) | [Go](https://github.com/openset/leetcode/tree/master/solution/combinations) | Medium |
-| <span id="78">78</span> | [Subsets](https://leetcode.com/problems/subsets) | [Go](https://github.com/openset/leetcode/tree/master/solution/subsets) | Medium |
-| <span id="79">79</span> | [Word Search](https://leetcode.com/problems/word-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-search) | Medium |
-| <span id="80">80</span> | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-array-ii) | Medium |
-| <span id="81">81</span> | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-rotated-sorted-array-ii) | Medium |
-| <span id="82">82</span> | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-list-ii) | Medium |
-| <span id="83">83</span> | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicates-from-sorted-list) | Easy |
-| <span id="84">84</span> | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-rectangle-in-histogram) | Hard |
-| <span id="85">85</span> | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximal-rectangle) | Hard |
-| <span id="86">86</span> | [Partition List](https://leetcode.com/problems/partition-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-list) | Medium |
-| <span id="87">87</span> | [Scramble String](https://leetcode.com/problems/scramble-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/scramble-string) | Hard |
-| <span id="88">88</span> | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-sorted-array) | Easy |
-| <span id="89">89</span> | [Gray Code](https://leetcode.com/problems/gray-code) | [Go](https://github.com/openset/leetcode/tree/master/solution/gray-code) | Medium |
-| <span id="90">90</span> | [Subsets II](https://leetcode.com/problems/subsets-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/subsets-ii) | Medium |
-| <span id="91">91</span> | [Decode Ways](https://leetcode.com/problems/decode-ways) | [Go](https://github.com/openset/leetcode/tree/master/solution/decode-ways) | Medium |
-| <span id="92">92</span> | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-linked-list-ii) | Medium |
-| <span id="93">93</span> | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | [Go](https://github.com/openset/leetcode/tree/master/solution/restore-ip-addresses) | Medium |
-| <span id="94">94</span> | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-inorder-traversal) | Medium |
-| <span id="95">95</span> | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-binary-search-trees-ii) | Medium |
-| <span id="96">96</span> | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-binary-search-trees) | Medium |
-| <span id="97">97</span> | [Interleaving String](https://leetcode.com/problems/interleaving-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/interleaving-string) | Hard |
-| <span id="98">98</span> | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/validate-binary-search-tree) | Medium |
-| <span id="99">99</span> | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/recover-binary-search-tree) | Hard |
-| <span id="100">100</span> | [Same Tree](https://leetcode.com/problems/same-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/same-tree) | Easy |
-| <span id="101">101</span> | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/symmetric-tree) | Easy |
-| <span id="102">102</span> | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-level-order-traversal) | Medium |
-| <span id="103">103</span> | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-zigzag-level-order-traversal) | Medium |
-| <span id="104">104</span> | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-depth-of-binary-tree) | Easy |
-| <span id="105">105</span> | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium |
-| <span id="106">106</span> | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-inorder-and-postorder-traversal) | Medium |
-| <span id="107">107</span> | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-level-order-traversal-ii) | Easy |
-| <span id="108">108</span> | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-sorted-array-to-binary-search-tree) | Easy |
-| <span id="109">109</span> | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-sorted-list-to-binary-search-tree) | Medium |
-| <span id="110">110</span> | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/balanced-binary-tree) | Easy |
-| <span id="111">111</span> | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-depth-of-binary-tree) | Easy |
-| <span id="112">112</span> | [Path Sum](https://leetcode.com/problems/path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum) | Easy |
-| <span id="113">113</span> | [Path Sum II](https://leetcode.com/problems/path-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-ii) | Medium |
-| <span id="114">114</span> | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-binary-tree-to-linked-list) | Medium |
-| <span id="115">115</span> | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/distinct-subsequences) | Hard |
-| <span id="116">116</span> | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | [Go](https://github.com/openset/leetcode/tree/master/solution/populating-next-right-pointers-in-each-node) | Medium |
-| <span id="117">117</span> | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/populating-next-right-pointers-in-each-node-ii) | Medium |
-| <span id="118">118</span> | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/pascals-triangle) | Easy |
-| <span id="119">119</span> | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/pascals-triangle-ii) | Easy |
-| <span id="120">120</span> | [Triangle](https://leetcode.com/problems/triangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/triangle) | Medium |
-| <span id="121">121</span> | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock) | Easy |
-| <span id="122">122</span> | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-ii) | Easy |
-| <span id="123">123</span> | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iii) | Hard |
-| <span id="124">124</span> | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-maximum-path-sum) | Hard |
-| <span id="125">125</span> | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-palindrome) | Easy |
-| <span id="126">126</span> | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-ladder-ii) | Hard |
-| <span id="127">127</span> | [Word Ladder](https://leetcode.com/problems/word-ladder) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-ladder) | Medium |
-| <span id="128">128</span> | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-consecutive-sequence) | Hard |
-| <span id="129">129</span> | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-root-to-leaf-numbers) | Medium |
-| <span id="130">130</span> | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions) | [Go](https://github.com/openset/leetcode/tree/master/solution/surrounded-regions) | Medium |
-| <span id="131">131</span> | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-partitioning) | Medium |
-| <span id="132">132</span> | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-partitioning-ii) | Hard |
-| <span id="133">133</span> | [Clone Graph](https://leetcode.com/problems/clone-graph) | [Go](https://github.com/openset/leetcode/tree/master/solution/clone-graph) | Medium |
-| <span id="134">134</span> | [Gas Station](https://leetcode.com/problems/gas-station) | [Go](https://github.com/openset/leetcode/tree/master/solution/gas-station) | Medium |
-| <span id="135">135</span> | [Candy](https://leetcode.com/problems/candy) | [Go](https://github.com/openset/leetcode/tree/master/solution/candy) | Hard |
-| <span id="136">136</span> | [Single Number](https://leetcode.com/problems/single-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-number) | Easy |
-| <span id="137">137</span> | [Single Number II](https://leetcode.com/problems/single-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-number-ii) | Medium |
-| <span id="138">138</span> | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | [Go](https://github.com/openset/leetcode/tree/master/solution/copy-list-with-random-pointer) | Medium |
-| <span id="139">139</span> | [Word Break](https://leetcode.com/problems/word-break) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-break) | Medium |
-| <span id="140">140</span> | [Word Break II](https://leetcode.com/problems/word-break-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-break-ii) | Hard |
-| <span id="141">141</span> | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-cycle) | Easy |
-| <span id="142">142</span> | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-cycle-ii) | Medium |
-| <span id="143">143</span> | [Reorder List](https://leetcode.com/problems/reorder-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/reorder-list) | Medium |
-| <span id="144">144</span> | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-preorder-traversal) | Medium |
-| <span id="145">145</span> | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-postorder-traversal) | Hard |
-| <span id="146">146</span> | [LRU Cache](https://leetcode.com/problems/lru-cache) | [Go](https://github.com/openset/leetcode/tree/master/solution/lru-cache) | Hard |
-| <span id="147">147</span> | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/insertion-sort-list) | Medium |
-| <span id="148">148</span> | [Sort List](https://leetcode.com/problems/sort-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-list) | Medium |
-| <span id="149">149</span> | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-points-on-a-line) | Hard |
-| <span id="150">150</span> | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | [Go](https://github.com/openset/leetcode/tree/master/solution/evaluate-reverse-polish-notation) | Medium |
-| <span id="151">151</span> | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string) | Medium |
-| <span id="152">152</span> | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-subarray) | Medium |
-| <span id="153">153</span> | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array) | Medium |
-| <span id="154">154</span> | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-minimum-in-rotated-sorted-array-ii) | Hard |
-| <span id="155">155</span> | [Min Stack](https://leetcode.com/problems/min-stack) | [Go](https://github.com/openset/leetcode/tree/master/solution/min-stack) | Easy |
-| <span id="156">156</span> | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-upside-down) | Medium |
-| <span id="157">157</span> | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4) | Easy |
-| <span id="158">158</span> | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/read-n-characters-given-read4-ii-call-multiple-times) | Hard |
-| <span id="159">159</span> | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-two-distinct-characters) | Hard |
-| <span id="160">160</span> | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-linked-lists) | Easy |
-| <span id="161">161</span> | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/one-edit-distance) | Medium |
-| <span id="162">162</span> | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-peak-element) | Medium |
-| <span id="163">163</span> | [Missing Ranges](https://leetcode.com/problems/missing-ranges) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/missing-ranges) | Medium |
-| <span id="164">164</span> | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-gap) | Hard |
-| <span id="165">165</span> | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/compare-version-numbers) | Medium |
-| <span id="166">166</span> | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [Go](https://github.com/openset/leetcode/tree/master/solution/fraction-to-recurring-decimal) | Medium |
-| <span id="167">167</span> | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-ii-input-array-is-sorted) | Easy |
-| <span id="168">168</span> | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [Go](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-title) | Easy |
-| <span id="169">169</span> | [Majority Element](https://leetcode.com/problems/majority-element) | [Go](https://github.com/openset/leetcode/tree/master/solution/majority-element) | Easy |
-| <span id="170">170</span> | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iii-data-structure-design) | Easy |
-| <span id="171">171</span> | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/excel-sheet-column-number) | Easy |
-| <span id="172">172</span> | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/factorial-trailing-zeroes) | Easy |
-| <span id="173">173</span> | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-search-tree-iterator) | Medium |
-| <span id="174">174</span> | [Dungeon Game](https://leetcode.com/problems/dungeon-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/dungeon-game) | Hard |
-| <span id="175">175</span> | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | [Go](https://github.com/openset/leetcode/tree/master/solution/combine-two-tables) | Easy |
-| <span id="176">176</span> | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/second-highest-salary) | Easy |
-| <span id="177">177</span> | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/nth-highest-salary) | Medium |
-| <span id="178">178</span> | [Rank Scores](https://leetcode.com/problems/rank-scores) | [Go](https://github.com/openset/leetcode/tree/master/solution/rank-scores) | Medium |
-| <span id="179">179</span> | [Largest Number](https://leetcode.com/problems/largest-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-number) | Medium |
-| <span id="180">180</span> | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-numbers) | Medium |
-| <span id="181">181</span> | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | [Go](https://github.com/openset/leetcode/tree/master/solution/employees-earning-more-than-their-managers) | Easy |
-| <span id="182">182</span> | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/solution/duplicate-emails) | Easy |
-| <span id="183">183</span> | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/customers-who-never-order) | Easy |
-| <span id="184">184</span> | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/department-highest-salary) | Medium |
-| <span id="185">185</span> | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [Go](https://github.com/openset/leetcode/tree/master/solution/department-top-three-salaries) | Hard |
-| <span id="186">186</span> | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-ii) | Medium |
-| <span id="187">187</span> | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-dna-sequences) | Medium |
-| <span id="188">188</span> | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iv) | Hard |
-| <span id="189">189</span> | [Rotate Array](https://leetcode.com/problems/rotate-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-array) | Easy |
-| <span id="190">190</span> | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-bits) | Easy |
-| <span id="191">191</span> | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-1-bits) | Easy |
-| <span id="192">192</span> | [Word Frequency](https://leetcode.com/problems/word-frequency) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-frequency) | Medium |
-| <span id="193">193</span> | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-phone-numbers) | Easy |
-| <span id="194">194</span> | [Transpose File](https://leetcode.com/problems/transpose-file) | [Go](https://github.com/openset/leetcode/tree/master/solution/transpose-file) | Medium |
-| <span id="195">195</span> | [Tenth Line](https://leetcode.com/problems/tenth-line) | [Go](https://github.com/openset/leetcode/tree/master/solution/tenth-line) | Easy |
-| <span id="196">196</span> | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-duplicate-emails) | Easy |
-| <span id="197">197</span> | [Rising Temperature](https://leetcode.com/problems/rising-temperature) | [Go](https://github.com/openset/leetcode/tree/master/solution/rising-temperature) | Easy |
-| <span id="198">198</span> | [House Robber](https://leetcode.com/problems/house-robber) | [Go](https://github.com/openset/leetcode/tree/master/solution/house-robber) | Easy |
-| <span id="199">199</span> | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-right-side-view) | Medium |
-| <span id="200">200</span> | [Number of Islands](https://leetcode.com/problems/number-of-islands) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-islands) | Medium |
-| <span id="201">201</span> | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | [Go](https://github.com/openset/leetcode/tree/master/solution/bitwise-and-of-numbers-range) | Medium |
-| <span id="202">202</span> | [Happy Number](https://leetcode.com/problems/happy-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/happy-number) | Easy |
-| <span id="203">203</span> | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-linked-list-elements) | Easy |
-| <span id="204">204</span> | [Count Primes](https://leetcode.com/problems/count-primes) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-primes) | Easy |
-| <span id="205">205</span> | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/isomorphic-strings) | Easy |
-| <span id="206">206</span> | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-linked-list) | Easy |
-| <span id="207">207</span> | [Course Schedule](https://leetcode.com/problems/course-schedule) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule) | Medium |
-| <span id="208">208</span> | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-trie-prefix-tree) | Medium |
-| <span id="209">209</span> | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-size-subarray-sum) | Medium |
-| <span id="210">210</span> | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule-ii) | Medium |
-| <span id="211">211</span> | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-and-search-word-data-structure-design) | Medium |
-| <span id="212">212</span> | [Word Search II](https://leetcode.com/problems/word-search-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-search-ii) | Hard |
-| <span id="213">213</span> | [House Robber II](https://leetcode.com/problems/house-robber-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/house-robber-ii) | Medium |
-| <span id="214">214</span> | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-palindrome) | Hard |
-| <span id="215">215</span> | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-largest-element-in-an-array) | Medium |
-| <span id="216">216</span> | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum-iii) | Medium |
-| <span id="217">217</span> | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [Go](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate) | Easy |
-| <span id="218">218</span> | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | [Go](https://github.com/openset/leetcode/tree/master/solution/the-skyline-problem) | Hard |
-| <span id="219">219</span> | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate-ii) | Easy |
-| <span id="220">220</span> | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/contains-duplicate-iii) | Medium |
-| <span id="221">221</span> | [Maximal Square](https://leetcode.com/problems/maximal-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximal-square) | Medium |
-| <span id="222">222</span> | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-complete-tree-nodes) | Medium |
-| <span id="223">223</span> | [Rectangle Area](https://leetcode.com/problems/rectangle-area) | [Go](https://github.com/openset/leetcode/tree/master/solution/rectangle-area) | Medium |
-| <span id="224">224</span> | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator) | Hard |
-| <span id="225">225</span> | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-stack-using-queues) | Easy |
-| <span id="226">226</span> | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/invert-binary-tree) | Easy |
-| <span id="227">227</span> | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-ii) | Medium |
-| <span id="228">228</span> | [Summary Ranges](https://leetcode.com/problems/summary-ranges) | [Go](https://github.com/openset/leetcode/tree/master/solution/summary-ranges) | Medium |
-| <span id="229">229</span> | [Majority Element II](https://leetcode.com/problems/majority-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/majority-element-ii) | Medium |
-| <span id="230">230</span> | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-element-in-a-bst) | Medium |
-| <span id="231">231</span> | [Power of Two](https://leetcode.com/problems/power-of-two) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-two) | Easy |
-| <span id="232">232</span> | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-queue-using-stacks) | Easy |
-| <span id="233">233</span> | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-digit-one) | Hard |
-| <span id="234">234</span> | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-linked-list) | Easy |
-| <span id="235">235</span> | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/lowest-common-ancestor-of-a-binary-search-tree) | Easy |
-| <span id="236">236</span> | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/lowest-common-ancestor-of-a-binary-tree) | Medium |
-| <span id="237">237</span> | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-node-in-a-linked-list) | Easy |
-| <span id="238">238</span> | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | [Go](https://github.com/openset/leetcode/tree/master/solution/product-of-array-except-self) | Medium |
-| <span id="239">239</span> | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | [Go](https://github.com/openset/leetcode/tree/master/solution/sliding-window-maximum) | Hard |
-| <span id="240">240</span> | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-a-2d-matrix-ii) | Medium |
-| <span id="241">241</span> | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/different-ways-to-add-parentheses) | Medium |
-| <span id="242">242</span> | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-anagram) | Easy |
-| <span id="243">243</span> | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance) | Easy |
-| <span id="244">244</span> | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-ii) | Medium |
-| <span id="245">245</span> | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-word-distance-iii) | Medium |
-| <span id="246">246</span> | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number) | Easy |
-| <span id="247">247</span> | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-ii) | Medium |
-| <span id="248">248</span> | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/strobogrammatic-number-iii) | Hard |
-| <span id="249">249</span> | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/group-shifted-strings) | Medium |
-| <span id="250">250</span> | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/count-univalue-subtrees) | Medium |
-| <span id="251">251</span> | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-2d-vector) | Medium |
-| <span id="252">252</span> | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms) | Easy |
-| <span id="253">253</span> | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/meeting-rooms-ii) | Medium |
-| <span id="254">254</span> | [Factor Combinations](https://leetcode.com/problems/factor-combinations) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/factor-combinations) | Medium |
-| <span id="255">255</span> | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-sequence-in-binary-search-tree) | Medium |
-| <span id="256">256</span> | [Paint House](https://leetcode.com/problems/paint-house) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house) | Easy |
-| <span id="257">257</span> | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-paths) | Easy |
-| <span id="258">258</span> | [Add Digits](https://leetcode.com/problems/add-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-digits) | Easy |
-| <span id="259">259</span> | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-smaller) | Medium |
-| <span id="260">260</span> | [Single Number III](https://leetcode.com/problems/single-number-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-number-iii) | Medium |
-| <span id="261">261</span> | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/graph-valid-tree) | Medium |
-| <span id="262">262</span> | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [Go](https://github.com/openset/leetcode/tree/master/solution/trips-and-users) | Hard |
-| <span id="263">263</span> | [Ugly Number](https://leetcode.com/problems/ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/ugly-number) | Easy |
-| <span id="264">264</span> | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/ugly-number-ii) | Medium |
-| <span id="265">265</span> | [Paint House II](https://leetcode.com/problems/paint-house-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-house-ii) | Hard |
-| <span id="266">266</span> | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation) | Easy |
-| <span id="267">267</span> | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-permutation-ii) | Medium |
-| <span id="268">268</span> | [Missing Number](https://leetcode.com/problems/missing-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/missing-number) | Easy |
-| <span id="269">269</span> | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/alien-dictionary) | Hard |
-| <span id="270">270</span> | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value) | Easy |
-| <span id="271">271</span> | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-strings) | Medium |
-| <span id="272">272</span> | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-binary-search-tree-value-ii) | Hard |
-| <span id="273">273</span> | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-to-english-words) | Hard |
-| <span id="274">274</span> | [H-Index](https://leetcode.com/problems/h-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/h-index) | Medium |
-| <span id="275">275</span> | [H-Index II](https://leetcode.com/problems/h-index-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/h-index-ii) | Medium |
-| <span id="276">276</span> | [Paint Fence](https://leetcode.com/problems/paint-fence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/paint-fence) | Easy |
-| <span id="277">277</span> | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-celebrity) | Medium |
-| <span id="278">278</span> | [First Bad Version](https://leetcode.com/problems/first-bad-version) | [Go](https://github.com/openset/leetcode/tree/master/solution/first-bad-version) | Easy |
-| <span id="279">279</span> | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-squares) | Medium |
-| <span id="280">280</span> | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort) | Medium |
-| <span id="281">281</span> | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/zigzag-iterator) | Medium |
-| <span id="282">282</span> | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | [Go](https://github.com/openset/leetcode/tree/master/solution/expression-add-operators) | Hard |
-| <span id="283">283</span> | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/move-zeroes) | Easy |
-| <span id="284">284</span> | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/peeking-iterator) | Medium |
-| <span id="285">285</span> | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/inorder-successor-in-bst) | Medium |
-| <span id="286">286</span> | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/walls-and-gates) | Medium |
-| <span id="287">287</span> | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-duplicate-number) | Medium |
-| <span id="288">288</span> | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-word-abbreviation) | Medium |
-| <span id="289">289</span> | [Game of Life](https://leetcode.com/problems/game-of-life) | [Go](https://github.com/openset/leetcode/tree/master/solution/game-of-life) | Medium |
-| <span id="290">290</span> | [Word Pattern](https://leetcode.com/problems/word-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-pattern) | Easy |
-| <span id="291">291</span> | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/word-pattern-ii) | Hard |
-| <span id="292">292</span> | [Nim Game](https://leetcode.com/problems/nim-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/nim-game) | Easy |
-| <span id="293">293</span> | [Flip Game](https://leetcode.com/problems/flip-game) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game) | Easy |
-| <span id="294">294</span> | [Flip Game II](https://leetcode.com/problems/flip-game-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-game-ii) | Medium |
-| <span id="295">295</span> | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-median-from-data-stream) | Hard |
-| <span id="296">296</span> | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/best-meeting-point) | Hard |
-| <span id="297">297</span> | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-binary-tree) | Hard |
-| <span id="298">298</span> | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence) | Medium |
-| <span id="299">299</span> | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulls-and-cows) | Medium |
-| <span id="300">300</span> | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-increasing-subsequence) | Medium |
-| <span id="301">301</span> | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-invalid-parentheses) | Hard |
-| <span id="302">302</span> | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rectangle-enclosing-black-pixels) | Hard |
-| <span id="303">303</span> | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-immutable) | Easy |
-| <span id="304">304</span> | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-immutable) | Medium |
-| <span id="305">305</span> | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-islands-ii) | Hard |
-| <span id="306">306</span> | [Additive Number](https://leetcode.com/problems/additive-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/additive-number) | Medium |
-| <span id="307">307</span> | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-mutable) | Medium |
-| <span id="308">308</span> | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-query-2d-mutable) | Hard |
-| <span id="309">309</span> | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
-| <span id="310">310</span> | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-height-trees) | Medium |
-| <span id="311">311</span> | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/sparse-matrix-multiplication) | Medium |
-| <span id="312">312</span> | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/solution/burst-balloons) | Hard |
-| <span id="313">313</span> | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-ugly-number) | Medium |
-| <span id="314">314</span> | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-vertical-order-traversal) | Medium |
-| <span id="315">315</span> | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-of-smaller-numbers-after-self) | Hard |
-| <span id="316">316</span> | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-duplicate-letters) | Hard |
-| <span id="317">317</span> | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-from-all-buildings) | Hard |
-| <span id="318">318</span> | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-word-lengths) | Medium |
-| <span id="319">319</span> | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulb-switcher) | Medium |
-| <span id="320">320</span> | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/generalized-abbreviation) | Medium |
-| <span id="321">321</span> | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/create-maximum-number) | Hard |
-| <span id="322">322</span> | [Coin Change](https://leetcode.com/problems/coin-change) | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-change) | Medium |
-| <span id="323">323</span> | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-connected-components-in-an-undirected-graph) | Medium |
-| <span id="324">324</span> | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-sort-ii) | Medium |
-| <span id="325">325</span> | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-size-subarray-sum-equals-k) | Medium |
-| <span id="326">326</span> | [Power of Three](https://leetcode.com/problems/power-of-three) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-three) | Easy |
-| <span id="327">327</span> | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-of-range-sum) | Hard |
-| <span id="328">328</span> | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/odd-even-linked-list) | Medium |
-| <span id="329">329</span> | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-increasing-path-in-a-matrix) | Hard |
-| <span id="330">330</span> | [Patching Array](https://leetcode.com/problems/patching-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/patching-array) | Hard |
-| <span id="331">331</span> | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/verify-preorder-serialization-of-a-binary-tree) | Medium |
-| <span id="332">332</span> | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | [Go](https://github.com/openset/leetcode/tree/master/solution/reconstruct-itinerary) | Medium |
-| <span id="333">333</span> | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-bst-subtree) | Medium |
-| <span id="334">334</span> | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-triplet-subsequence) | Medium |
-| <span id="335">335</span> | [Self Crossing](https://leetcode.com/problems/self-crossing) | [Go](https://github.com/openset/leetcode/tree/master/solution/self-crossing) | Hard |
-| <span id="336">336</span> | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindrome-pairs) | Hard |
-| <span id="337">337</span> | [House Robber III](https://leetcode.com/problems/house-robber-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/house-robber-iii) | Medium |
-| <span id="338">338</span> | [Counting Bits](https://leetcode.com/problems/counting-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/counting-bits) | Medium |
-| <span id="339">339</span> | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum) | Easy |
-| <span id="340">340</span> | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-most-k-distinct-characters) | Hard |
-| <span id="341">341</span> | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-nested-list-iterator) | Medium |
-| <span id="342">342</span> | [Power of Four](https://leetcode.com/problems/power-of-four) | [Go](https://github.com/openset/leetcode/tree/master/solution/power-of-four) | Easy |
-| <span id="343">343</span> | [Integer Break](https://leetcode.com/problems/integer-break) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-break) | Medium |
-| <span id="344">344</span> | [Reverse String](https://leetcode.com/problems/reverse-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-string) | Easy |
-| <span id="345">345</span> | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-vowels-of-a-string) | Easy |
-| <span id="346">346</span> | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/moving-average-from-data-stream) | Easy |
-| <span id="347">347</span> | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-elements) | Medium |
-| <span id="348">348</span> | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-tic-tac-toe) | Medium |
-| <span id="349">349</span> | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays) | Easy |
-| <span id="350">350</span> | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/intersection-of-two-arrays-ii) | Easy |
-| <span id="351">351</span> | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/android-unlock-patterns) | Medium |
-| <span id="352">352</span> | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/data-stream-as-disjoint-intervals) | Hard |
-| <span id="353">353</span> | [Design Snake Game](https://leetcode.com/problems/design-snake-game) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-snake-game) | Medium |
-| <span id="354">354</span> | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | [Go](https://github.com/openset/leetcode/tree/master/solution/russian-doll-envelopes) | Hard |
-| <span id="355">355</span> | [Design Twitter](https://leetcode.com/problems/design-twitter) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-twitter) | Medium |
-| <span id="356">356</span> | [Line Reflection](https://leetcode.com/problems/line-reflection) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/line-reflection) | Medium |
-| <span id="357">357</span> | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-numbers-with-unique-digits) | Medium |
-| <span id="358">358</span> | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/rearrange-string-k-distance-apart) | Hard |
-| <span id="359">359</span> | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/logger-rate-limiter) | Easy |
-| <span id="360">360</span> | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-transformed-array) | Medium |
-| <span id="361">361</span> | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/bomb-enemy) | Medium |
-| <span id="362">362</span> | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hit-counter) | Medium |
-| <span id="363">363</span> | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-sum-of-rectangle-no-larger-than-k) | Hard |
-| <span id="364">364</span> | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum-ii) | Medium |
-| <span id="365">365</span> | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem) | [Go](https://github.com/openset/leetcode/tree/master/solution/water-and-jug-problem) | Medium |
-| <span id="366">366</span> | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-leaves-of-binary-tree) | Medium |
-| <span id="367">367</span> | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-perfect-square) | Easy |
-| <span id="368">368</span> | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-divisible-subset) | Medium |
-| <span id="369">369</span> | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/plus-one-linked-list) | Medium |
-| <span id="370">370</span> | [Range Addition](https://leetcode.com/problems/range-addition) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/range-addition) | Medium |
-| <span id="371">371</span> | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-two-integers) | Easy |
-| <span id="372">372</span> | [Super Pow](https://leetcode.com/problems/super-pow) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-pow) | Medium |
-| <span id="373">373</span> | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-pairs-with-smallest-sums) | Medium |
-| <span id="374">374</span> | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | [Go](https://github.com/openset/leetcode/tree/master/solution/guess-number-higher-or-lower) | Easy |
-| <span id="375">375</span> | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/guess-number-higher-or-lower-ii) | Medium |
-| <span id="376">376</span> | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/wiggle-subsequence) | Medium |
-| <span id="377">377</span> | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/combination-sum-iv) | Medium |
-| <span id="378">378</span> | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-element-in-a-sorted-matrix) | Medium |
-| <span id="379">379</span> | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-phone-directory) | Medium |
-| <span id="380">380</span> | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o1) | Medium |
-| <span id="381">381</span> | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-delete-getrandom-o1-duplicates-allowed) | Hard |
-| <span id="382">382</span> | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-random-node) | Medium |
-| <span id="383">383</span> | [Ransom Note](https://leetcode.com/problems/ransom-note) | [Go](https://github.com/openset/leetcode/tree/master/solution/ransom-note) | Easy |
-| <span id="384">384</span> | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/shuffle-an-array) | Medium |
-| <span id="385">385</span> | [Mini Parser](https://leetcode.com/problems/mini-parser) | [Go](https://github.com/openset/leetcode/tree/master/solution/mini-parser) | Medium |
-| <span id="386">386</span> | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/lexicographical-numbers) | Medium |
-| <span id="387">387</span> | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/first-unique-character-in-a-string) | Easy |
-| <span id="388">388</span> | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-absolute-file-path) | Medium |
-| <span id="389">389</span> | [Find the Difference](https://leetcode.com/problems/find-the-difference) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-difference) | Easy |
-| <span id="390">390</span> | [Elimination Game](https://leetcode.com/problems/elimination-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/elimination-game) | Medium |
-| <span id="391">391</span> | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-rectangle) | Hard |
-| <span id="392">392</span> | [Is Subsequence](https://leetcode.com/problems/is-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/is-subsequence) | Medium |
-| <span id="393">393</span> | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation) | [Go](https://github.com/openset/leetcode/tree/master/solution/utf-8-validation) | Medium |
-| <span id="394">394</span> | [Decode String](https://leetcode.com/problems/decode-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/decode-string) | Medium |
-| <span id="395">395</span> | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-substring-with-at-least-k-repeating-characters) | Medium |
-| <span id="396">396</span> | [Rotate Function](https://leetcode.com/problems/rotate-function) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-function) | Medium |
-| <span id="397">397</span> | [Integer Replacement](https://leetcode.com/problems/integer-replacement) | [Go](https://github.com/openset/leetcode/tree/master/solution/integer-replacement) | Medium |
-| <span id="398">398</span> | [Random Pick Index](https://leetcode.com/problems/random-pick-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-index) | Medium |
-| <span id="399">399</span> | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | [Go](https://github.com/openset/leetcode/tree/master/solution/evaluate-division) | Medium |
-| <span id="400">400</span> | [Nth Digit](https://leetcode.com/problems/nth-digit) | [Go](https://github.com/openset/leetcode/tree/master/solution/nth-digit) | Easy |
-| <span id="401">401</span> | [Binary Watch](https://leetcode.com/problems/binary-watch) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-watch) | Easy |
-| <span id="402">402</span> | [Remove K Digits](https://leetcode.com/problems/remove-k-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-k-digits) | Medium |
-| <span id="403">403</span> | [Frog Jump](https://leetcode.com/problems/frog-jump) | [Go](https://github.com/openset/leetcode/tree/master/solution/frog-jump) | Hard |
-| <span id="404">404</span> | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-left-leaves) | Easy |
-| <span id="405">405</span> | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-a-number-to-hexadecimal) | Easy |
-| <span id="406">406</span> | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | [Go](https://github.com/openset/leetcode/tree/master/solution/queue-reconstruction-by-height) | Medium |
-| <span id="407">407</span> | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/trapping-rain-water-ii) | Hard |
-| <span id="408">408</span> | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-abbreviation) | Easy |
-| <span id="409">409</span> | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-palindrome) | Easy |
-| <span id="410">410</span> | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-largest-sum) | Hard |
-| <span id="411">411</span> | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-unique-word-abbreviation) | Hard |
-| <span id="412">412</span> | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [Go](https://github.com/openset/leetcode/tree/master/solution/fizz-buzz) | Easy |
-| <span id="413">413</span> | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | [Go](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices) | Medium |
-| <span id="414">414</span> | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/third-maximum-number) | Easy |
-| <span id="415">415</span> | [Add Strings](https://leetcode.com/problems/add-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-strings) | Easy |
-| <span id="416">416</span> | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-equal-subset-sum) | Medium |
-| <span id="417">417</span> | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [Go](https://github.com/openset/leetcode/tree/master/solution/pacific-atlantic-water-flow) | Medium |
-| <span id="418">418</span> | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-screen-fitting) | Medium |
-| <span id="419">419</span> | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | [Go](https://github.com/openset/leetcode/tree/master/solution/battleships-in-a-board) | Medium |
-| <span id="420">420</span> | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker) | [Go](https://github.com/openset/leetcode/tree/master/solution/strong-password-checker) | Hard |
-| <span id="421">421</span> | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-xor-of-two-numbers-in-an-array) | Medium |
-| <span id="422">422</span> | [Valid Word Square](https://leetcode.com/problems/valid-word-square) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-word-square) | Easy |
-| <span id="423">423</span> | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english) | [Go](https://github.com/openset/leetcode/tree/master/solution/reconstruct-original-digits-from-english) | Medium |
-| <span id="424">424</span> | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-repeating-character-replacement) | Medium |
-| <span id="425">425</span> | [Word Squares](https://leetcode.com/problems/word-squares) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/word-squares) | Hard |
-| <span id="426">426</span> | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
-| <span id="427">427</span> | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-quad-tree) | Easy |
-| <span id="428">428</span> | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-n-ary-tree) | Hard |
-| <span id="429">429</span> | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-level-order-traversal) | Easy |
-| <span id="430">430</span> | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/flatten-a-multilevel-doubly-linked-list) | Medium |
-| <span id="431">431</span> | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-n-ary-tree-to-binary-tree) | Hard |
-| <span id="432">432</span> | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-oone-data-structure) | Hard |
-| <span id="433">433</span> | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-genetic-mutation) | Medium |
-| <span id="434">434</span> | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-segments-in-a-string) | Easy |
-| <span id="435">435</span> | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-overlapping-intervals) | Medium |
-| <span id="436">436</span> | [Find Right Interval](https://leetcode.com/problems/find-right-interval) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-right-interval) | Medium |
-| <span id="437">437</span> | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-iii) | Easy |
-| <span id="438">438</span> | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-anagrams-in-a-string) | Easy |
-| <span id="439">439</span> | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/ternary-expression-parser) | Medium |
-| <span id="440">440</span> | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-smallest-in-lexicographical-order) | Hard |
-| <span id="441">441</span> | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | [Go](https://github.com/openset/leetcode/tree/master/solution/arranging-coins) | Easy |
-| <span id="442">442</span> | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-duplicates-in-an-array) | Medium |
-| <span id="443">443</span> | [String Compression](https://leetcode.com/problems/string-compression) | [Go](https://github.com/openset/leetcode/tree/master/solution/string-compression) | Easy |
-| <span id="444">444</span> | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/sequence-reconstruction) | Medium |
-| <span id="445">445</span> | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers-ii) | Medium |
-| <span id="446">446</span> | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices-ii-subsequence) | Hard |
-| <span id="447">447</span> | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-boomerangs) | Easy |
-| <span id="448">448</span> | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-all-numbers-disappeared-in-an-array) | Easy |
-| <span id="449">449</span> | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/serialize-and-deserialize-bst) | Medium |
-| <span id="450">450</span> | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-node-in-a-bst) | Medium |
-| <span id="451">451</span> | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-characters-by-frequency) | Medium |
-| <span id="452">452</span> | [Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-number-of-arrows-to-burst-balloons) | Medium |
-| <span id="453">453</span> | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-moves-to-equal-array-elements) | Easy |
-| <span id="454">454</span> | [4Sum II](https://leetcode.com/problems/4sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/4sum-ii) | Medium |
-| <span id="455">455</span> | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | [Go](https://github.com/openset/leetcode/tree/master/solution/assign-cookies) | Easy |
-| <span id="456">456</span> | [132 Pattern](https://leetcode.com/problems/132-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/132-pattern) | Medium |
-| <span id="457">457</span> | [Circular Array Loop](https://leetcode.com/problems/circular-array-loop) | [Go](https://github.com/openset/leetcode/tree/master/solution/circular-array-loop) | Medium |
-| <span id="458">458</span> | [Poor Pigs](https://leetcode.com/problems/poor-pigs) | [Go](https://github.com/openset/leetcode/tree/master/solution/poor-pigs) | Easy |
-| <span id="459">459</span> | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-substring-pattern) | Easy |
-| <span id="460">460</span> | [LFU Cache](https://leetcode.com/problems/lfu-cache) | [Go](https://github.com/openset/leetcode/tree/master/solution/lfu-cache) | Hard |
-| <span id="461">461</span> | [Hamming Distance](https://leetcode.com/problems/hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/hamming-distance) | Easy |
-| <span id="462">462</span> | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-moves-to-equal-array-elements-ii) | Medium |
-| <span id="463">463</span> | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | [Go](https://github.com/openset/leetcode/tree/master/solution/island-perimeter) | Easy |
-| <span id="464">464</span> | [Can I Win](https://leetcode.com/problems/can-i-win) | [Go](https://github.com/openset/leetcode/tree/master/solution/can-i-win) | Medium |
-| <span id="465">465</span> | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/optimal-account-balancing) | Hard |
-| <span id="466">466</span> | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-the-repetitions) | Hard |
-| <span id="467">467</span> | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-substrings-in-wraparound-string) | Medium |
-| <span id="468">468</span> | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [Go](https://github.com/openset/leetcode/tree/master/solution/validate-ip-address) | Medium |
-| <span id="469">469</span> | [Convex Polygon](https://leetcode.com/problems/convex-polygon) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/convex-polygon) | Medium |
-| <span id="470">470</span> | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-rand10-using-rand7) | Medium |
-| <span id="471">471</span> | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-string-with-shortest-length) | Hard |
-| <span id="472">472</span> | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/concatenated-words) | Hard |
-| <span id="473">473</span> | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/matchsticks-to-square) | Medium |
-| <span id="474">474</span> | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/solution/ones-and-zeroes) | Medium |
-| <span id="475">475</span> | [Heaters](https://leetcode.com/problems/heaters) | [Go](https://github.com/openset/leetcode/tree/master/solution/heaters) | Easy |
-| <span id="476">476</span> | [Number Complement](https://leetcode.com/problems/number-complement) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-complement) | Easy |
-| <span id="477">477</span> | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/total-hamming-distance) | Medium |
-| <span id="478">478</span> | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle) | [Go](https://github.com/openset/leetcode/tree/master/solution/generate-random-point-in-a-circle) | Medium |
-| <span id="479">479</span> | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-palindrome-product) | Easy |
-| <span id="480">480</span> | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median) | [Go](https://github.com/openset/leetcode/tree/master/solution/sliding-window-median) | Hard |
-| <span id="481">481</span> | [Magical String](https://leetcode.com/problems/magical-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/magical-string) | Medium |
-| <span id="482">482</span> | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [Go](https://github.com/openset/leetcode/tree/master/solution/license-key-formatting) | Easy |
-| <span id="483">483</span> | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-good-base) | Hard |
-| <span id="484">484</span> | [Find Permutation](https://leetcode.com/problems/find-permutation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-permutation) | Medium |
-| <span id="485">485</span> | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones) | Easy |
-| <span id="486">486</span> | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | [Go](https://github.com/openset/leetcode/tree/master/solution/predict-the-winner) | Medium |
-| <span id="487">487</span> | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/max-consecutive-ones-ii) | Medium |
-| <span id="488">488</span> | [Zuma Game](https://leetcode.com/problems/zuma-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/zuma-game) | Hard |
-| <span id="489">489</span> | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/robot-room-cleaner) | Hard |
-| <span id="490">490</span> | [The Maze](https://leetcode.com/problems/the-maze) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze) | Medium |
-| <span id="491">491</span> | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-subsequences) | Medium |
-| <span id="492">492</span> | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-the-rectangle) | Easy |
-| <span id="493">493</span> | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-pairs) | Hard |
-| <span id="494">494</span> | [Target Sum](https://leetcode.com/problems/target-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/target-sum) | Medium |
-| <span id="495">495</span> | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking) | [Go](https://github.com/openset/leetcode/tree/master/solution/teemo-attacking) | Medium |
-| <span id="496">496</span> | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-i) | Easy |
-| <span id="497">497</span> | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-point-in-non-overlapping-rectangles) | Medium |
-| <span id="498">498</span> | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | [Go](https://github.com/openset/leetcode/tree/master/solution/diagonal-traverse) | Medium |
-| <span id="499">499</span> | [The Maze III](https://leetcode.com/problems/the-maze-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-iii) | Hard |
-| <span id="500">500</span> | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | [Go](https://github.com/openset/leetcode/tree/master/solution/keyboard-row) | Easy |
-| <span id="501">501</span> | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-mode-in-binary-search-tree) | Easy |
-| <span id="502">502</span> | [IPO](https://leetcode.com/problems/ipo) | [Go](https://github.com/openset/leetcode/tree/master/solution/ipo) | Hard |
-| <span id="503">503</span> | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-ii) | Medium |
-| <span id="504">504</span> | [Base 7](https://leetcode.com/problems/base-7) | [Go](https://github.com/openset/leetcode/tree/master/solution/base-7) | Easy |
-| <span id="505">505</span> | [The Maze II](https://leetcode.com/problems/the-maze-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/the-maze-ii) | Medium |
-| <span id="506">506</span> | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | [Go](https://github.com/openset/leetcode/tree/master/solution/relative-ranks) | Easy |
-| <span id="507">507</span> | [Perfect Number](https://leetcode.com/problems/perfect-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/perfect-number) | Easy |
-| <span id="508">508</span> | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-frequent-subtree-sum) | Medium |
-| <span id="513">513</span> | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-bottom-left-tree-value) | Medium |
-| <span id="514">514</span> | [Freedom Trail](https://leetcode.com/problems/freedom-trail) | [Go](https://github.com/openset/leetcode/tree/master/solution/freedom-trail) | Hard |
-| <span id="515">515</span> | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-largest-value-in-each-tree-row) | Medium |
-| <span id="516">516</span> | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-palindromic-subsequence) | Medium |
-| <span id="517">517</span> | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-washing-machines) | Hard |
-| <span id="518">518</span> | [Coin Change 2](https://leetcode.com/problems/coin-change-2) | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-change-2) | Medium |
-| <span id="519">519</span> | [Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-flip-matrix) | Medium |
-| <span id="520">520</span> | [Detect Capital](https://leetcode.com/problems/detect-capital) | [Go](https://github.com/openset/leetcode/tree/master/solution/detect-capital) | Easy |
-| <span id="521">521</span> | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-uncommon-subsequence-i) | Easy |
-| <span id="522">522</span> | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-uncommon-subsequence-ii) | Medium |
-| <span id="523">523</span> | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/continuous-subarray-sum) | Medium |
-| <span id="524">524</span> | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary-through-deleting) | Medium |
-| <span id="525">525</span> | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/contiguous-array) | Medium |
-| <span id="526">526</span> | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement) | Medium |
-| <span id="527">527</span> | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/word-abbreviation) | Hard |
-| <span id="528">528</span> | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-weight) | Medium |
-| <span id="529">529</span> | [Minesweeper](https://leetcode.com/problems/minesweeper) | [Go](https://github.com/openset/leetcode/tree/master/solution/minesweeper) | Medium |
-| <span id="530">530</span> | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-absolute-difference-in-bst) | Easy |
-| <span id="531">531</span> | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-i) | Medium |
-| <span id="532">532</span> | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-diff-pairs-in-an-array) | Easy |
-| <span id="533">533</span> | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/lonely-pixel-ii) | Medium |
-| <span id="535">535</span> | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | [Go](https://github.com/openset/leetcode/tree/master/solution/encode-and-decode-tinyurl) | Medium |
-| <span id="536">536</span> | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-string) | Medium |
-| <span id="537">537</span> | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | [Go](https://github.com/openset/leetcode/tree/master/solution/complex-number-multiplication) | Medium |
-| <span id="538">538</span> | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/convert-bst-to-greater-tree) | Easy |
-| <span id="539">539</span> | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-time-difference) | Medium |
-| <span id="540">540</span> | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/single-element-in-a-sorted-array) | Medium |
-| <span id="541">541</span> | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-string-ii) | Easy |
-| <span id="542">542</span> | [01 Matrix](https://leetcode.com/problems/01-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/01-matrix) | Medium |
-| <span id="543">543</span> | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/diameter-of-binary-tree) | Easy |
-| <span id="544">544</span> | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/output-contest-matches) | Medium |
-| <span id="545">545</span> | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/boundary-of-binary-tree) | Medium |
-| <span id="546">546</span> | [Remove Boxes](https://leetcode.com/problems/remove-boxes) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-boxes) | Hard |
-| <span id="547">547</span> | [Friend Circles](https://leetcode.com/problems/friend-circles) | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-circles) | Medium |
-| <span id="548">548</span> | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-with-equal-sum) | Medium |
-| <span id="549">549</span> | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-longest-consecutive-sequence-ii) | Medium |
-| <span id="551">551</span> | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-i) | Easy |
-| <span id="552">552</span> | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/student-attendance-record-ii) | Hard |
-| <span id="553">553</span> | [Optimal Division](https://leetcode.com/problems/optimal-division) | [Go](https://github.com/openset/leetcode/tree/master/solution/optimal-division) | Medium |
-| <span id="554">554</span> | [Brick Wall](https://leetcode.com/problems/brick-wall) | [Go](https://github.com/openset/leetcode/tree/master/solution/brick-wall) | Medium |
-| <span id="555">555</span> | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/split-concatenated-strings) | Medium |
-| <span id="556">556</span> | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/next-greater-element-iii) | Medium |
-| <span id="557">557</span> | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-words-in-a-string-iii) | Easy |
-| <span id="558">558</span> | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection) | [Go](https://github.com/openset/leetcode/tree/master/solution/quad-tree-intersection) | Easy |
-| <span id="559">559</span> | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-depth-of-n-ary-tree) | Easy |
-| <span id="560">560</span> | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/subarray-sum-equals-k) | Medium |
-| <span id="561">561</span> | [Array Partition I](https://leetcode.com/problems/array-partition-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-partition-i) | Easy |
-| <span id="562">562</span> | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-line-of-consecutive-one-in-matrix) | Medium |
-| <span id="563">563</span> | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-tilt) | Easy |
-| <span id="564">564</span> | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-closest-palindrome) | Hard |
-| <span id="565">565</span> | [Array Nesting](https://leetcode.com/problems/array-nesting) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-nesting) | Medium |
-| <span id="566">566</span> | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/reshape-the-matrix) | Easy |
-| <span id="567">567</span> | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/permutation-in-string) | Medium |
-| <span id="568">568</span> | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-vacation-days) | Hard |
-| <span id="569">569</span> | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/median-employee-salary) | Hard |
-| <span id="570">570</span> | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/managers-with-at-least-5-direct-reports) | Medium |
-| <span id="571">571</span> | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-median-given-frequency-of-numbers) | Hard |
-| <span id="572">572</span> | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/subtree-of-another-tree) | Easy |
-| <span id="573">573</span> | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/squirrel-simulation) | Medium |
-| <span id="574">574</span> | [Winning Candidate](https://leetcode.com/problems/winning-candidate) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/winning-candidate) | Medium |
-| <span id="575">575</span> | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | [Go](https://github.com/openset/leetcode/tree/master/solution/distribute-candies) | Easy |
-| <span id="576">576</span> | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [Go](https://github.com/openset/leetcode/tree/master/solution/out-of-boundary-paths) | Medium |
-| <span id="577">577</span> | [Employee Bonus](https://leetcode.com/problems/employee-bonus) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-bonus) | Easy |
-| <span id="578">578</span> | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/get-highest-answer-rate-question) | Medium |
-| <span id="579">579</span> | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-cumulative-salary-of-an-employee) | Hard |
-| <span id="580">580</span> | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/count-student-number-in-departments) | Medium |
-| <span id="581">581</span> | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-unsorted-continuous-subarray) | Easy |
-| <span id="582">582</span> | [Kill Process](https://leetcode.com/problems/kill-process) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/kill-process) | Medium |
-| <span id="583">583</span> | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-operation-for-two-strings) | Medium |
-| <span id="584">584</span> | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-customer-referee) | Easy |
-| <span id="585">585</span> | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/investments-in-2016) | Medium |
-| <span id="586">586</span> | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/customer-placing-the-largest-number-of-orders) | Easy |
-| <span id="587">587</span> | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | [Go](https://github.com/openset/leetcode/tree/master/solution/erect-the-fence) | Hard |
-| <span id="588">588</span> | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-in-memory-file-system) | Hard |
-| <span id="589">589</span> | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-preorder-traversal) | Easy |
-| <span id="590">590</span> | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/n-ary-tree-postorder-traversal) | Easy |
-| <span id="591">591</span> | [Tag Validator](https://leetcode.com/problems/tag-validator) | [Go](https://github.com/openset/leetcode/tree/master/solution/tag-validator) | Hard |
-| <span id="592">592</span> | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction) | [Go](https://github.com/openset/leetcode/tree/master/solution/fraction-addition-and-subtraction) | Medium |
-| <span id="593">593</span> | [Valid Square](https://leetcode.com/problems/valid-square) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-square) | Medium |
-| <span id="594">594</span> | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-harmonious-subsequence) | Easy |
-| <span id="595">595</span> | [Big Countries](https://leetcode.com/problems/big-countries) | [Go](https://github.com/openset/leetcode/tree/master/solution/big-countries) | Easy |
-| <span id="596">596</span> | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [Go](https://github.com/openset/leetcode/tree/master/solution/classes-more-than-5-students) | Easy |
-| <span id="597">597</span> | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-i-overall-acceptance-rate) | Easy |
-| <span id="598">598</span> | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-addition-ii) | Easy |
-| <span id="599">599</span> | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-index-sum-of-two-lists) | Easy |
-| <span id="600">600</span> | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-negative-integers-without-consecutive-ones) | Hard |
-| <span id="601">601</span> | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [Go](https://github.com/openset/leetcode/tree/master/solution/human-traffic-of-stadium) | Hard |
-| <span id="602">602</span> | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/friend-requests-ii-who-has-the-most-friends) | Medium |
-| <span id="603">603</span> | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-available-seats) | Easy |
-| <span id="604">604</span> | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-compressed-string-iterator) | Easy |
-| <span id="605">605</span> | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [Go](https://github.com/openset/leetcode/tree/master/solution/can-place-flowers) | Easy |
-| <span id="606">606</span> | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-string-from-binary-tree) | Easy |
-| <span id="607">607</span> | [Sales Person](https://leetcode.com/problems/sales-person) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/sales-person) | Easy |
-| <span id="608">608</span> | [Tree Node](https://leetcode.com/problems/tree-node) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/tree-node) | Medium |
-| <span id="609">609</span> | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-file-in-system) | Medium |
-| <span id="610">610</span> | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/triangle-judgement) | Easy |
-| <span id="611">611</span> | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-triangle-number) | Medium |
-| <span id="612">612</span> | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-plane) | Medium |
-| <span id="613">613</span> | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-in-a-line) | Easy |
-| <span id="614">614</span> | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/second-degree-follower) | Medium |
-| <span id="615">615</span> | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/average-salary-departments-vs-company) | Hard |
-| <span id="616">616</span> | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/add-bold-tag-in-string) | Medium |
-| <span id="617">617</span> | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/merge-two-binary-trees) | Easy |
-| <span id="618">618</span> | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/students-report-by-geography) | Hard |
-| <span id="619">619</span> | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/biggest-single-number) | Easy |
-| <span id="620">620</span> | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [Go](https://github.com/openset/leetcode/tree/master/solution/not-boring-movies) | Easy |
-| <span id="621">621</span> | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [Go](https://github.com/openset/leetcode/tree/master/solution/task-scheduler) | Medium |
-| <span id="622">622</span> | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-circular-queue) | Medium |
-| <span id="623">623</span> | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/add-one-row-to-tree) | Medium |
-| <span id="624">624</span> | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-distance-in-arrays) | Easy |
-| <span id="625">625</span> | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-factorization) | Medium |
-| <span id="626">626</span> | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [Go](https://github.com/openset/leetcode/tree/master/solution/exchange-seats) | Medium |
-| <span id="627">627</span> | [Swap Salary](https://leetcode.com/problems/swap-salary) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-salary) | Easy |
-| <span id="628">628</span> | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-product-of-three-numbers) | Easy |
-| <span id="629">629</span> | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-inverse-pairs-array) | Hard |
-| <span id="630">630</span> | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/course-schedule-iii) | Hard |
-| <span id="631">631</span> | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-excel-sum-formula) | Hard |
-| <span id="632">632</span> | [Smallest Range](https://leetcode.com/problems/smallest-range) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-range) | Hard |
-| <span id="633">633</span> | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-square-numbers) | Easy |
-| <span id="634">634</span> | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-derangement-of-an-array) | Medium |
-| <span id="635">635</span> | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-log-storage-system) | Medium |
-| <span id="636">636</span> | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | [Go](https://github.com/openset/leetcode/tree/master/solution/exclusive-time-of-functions) | Medium |
-| <span id="637">637</span> | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/average-of-levels-in-binary-tree) | Easy |
-| <span id="638">638</span> | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | [Go](https://github.com/openset/leetcode/tree/master/solution/shopping-offers) | Medium |
-| <span id="639">639</span> | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/decode-ways-ii) | Hard |
-| <span id="640">640</span> | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | [Go](https://github.com/openset/leetcode/tree/master/solution/solve-the-equation) | Medium |
-| <span id="641">641</span> | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-circular-deque) | Medium |
-| <span id="642">642</span> | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/design-search-autocomplete-system) | Hard |
-| <span id="643">643</span> | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-i) | Easy |
-| <span id="644">644</span> | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-average-subarray-ii) | Hard |
-| <span id="645">645</span> | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-mismatch) | Easy |
-| <span id="646">646</span> | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-pair-chain) | Medium |
-| <span id="647">647</span> | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | [Go](https://github.com/openset/leetcode/tree/master/solution/palindromic-substrings) | Medium |
-| <span id="648">648</span> | [Replace Words](https://leetcode.com/problems/replace-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/replace-words) | Medium |
-| <span id="649">649</span> | [Dota2 Senate](https://leetcode.com/problems/dota2-senate) | [Go](https://github.com/openset/leetcode/tree/master/solution/dota2-senate) | Medium |
-| <span id="650">650</span> | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/2-keys-keyboard) | Medium |
-| <span id="651">651</span> | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/4-keys-keyboard) | Medium |
-| <span id="652">652</span> | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-duplicate-subtrees) | Medium |
-| <span id="653">653</span> | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/two-sum-iv-input-is-a-bst) | Easy |
-| <span id="654">654</span> | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-binary-tree) | Medium |
-| <span id="655">655</span> | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/print-binary-tree) | Medium |
-| <span id="656">656</span> | [Coin Path](https://leetcode.com/problems/coin-path) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/coin-path) | Hard |
-| <span id="657">657</span> | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [Go](https://github.com/openset/leetcode/tree/master/solution/robot-return-to-origin) | Easy |
-| <span id="658">658</span> | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-closest-elements) | Medium |
-| <span id="659">659</span> | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-into-consecutive-subsequences) | Medium |
-| <span id="660">660</span> | [Remove 9](https://leetcode.com/problems/remove-9) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-9) | Hard |
-| <span id="661">661</span> | [Image Smoother](https://leetcode.com/problems/image-smoother) | [Go](https://github.com/openset/leetcode/tree/master/solution/image-smoother) | Easy |
-| <span id="662">662</span> | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-width-of-binary-tree) | Medium |
-| <span id="663">663</span> | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/equal-tree-partition) | Medium |
-| <span id="664">664</span> | [Strange Printer](https://leetcode.com/problems/strange-printer) | [Go](https://github.com/openset/leetcode/tree/master/solution/strange-printer) | Hard |
-| <span id="665">665</span> | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/non-decreasing-array) | Easy |
-| <span id="666">666</span> | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/path-sum-iv) | Medium |
-| <span id="667">667</span> | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement-ii) | Medium |
-| <span id="668">668</span> | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-smallest-number-in-multiplication-table) | Hard |
-| <span id="669">669</span> | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/trim-a-binary-search-tree) | Easy |
-| <span id="670">670</span> | [Maximum Swap](https://leetcode.com/problems/maximum-swap) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-swap) | Medium |
-| <span id="671">671</span> | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/second-minimum-node-in-a-binary-tree) | Easy |
-| <span id="672">672</span> | [Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/bulb-switcher-ii) | Medium |
-| <span id="673">673</span> | [Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-longest-increasing-subsequence) | Medium |
-| <span id="674">674</span> | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-continuous-increasing-subsequence) | Easy |
-| <span id="675">675</span> | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event) | [Go](https://github.com/openset/leetcode/tree/master/solution/cut-off-trees-for-golf-event) | Hard |
-| <span id="676">676</span> | [Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/implement-magic-dictionary) | Medium |
-| <span id="677">677</span> | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/map-sum-pairs) | Medium |
-| <span id="678">678</span> | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-parenthesis-string) | Medium |
-| <span id="679">679</span> | [24 Game](https://leetcode.com/problems/24-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/24-game) | Hard |
-| <span id="680">680</span> | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-palindrome-ii) | Easy |
-| <span id="681">681</span> | [Next Closest Time](https://leetcode.com/problems/next-closest-time) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/next-closest-time) | Medium |
-| <span id="682">682</span> | [Baseball Game](https://leetcode.com/problems/baseball-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/baseball-game) | Easy |
-| <span id="683">683</span> | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/k-empty-slots) | Hard |
-| <span id="684">684</span> | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | [Go](https://github.com/openset/leetcode/tree/master/solution/redundant-connection) | Medium |
-| <span id="685">685</span> | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/redundant-connection-ii) | Hard |
-| <span id="686">686</span> | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | [Go](https://github.com/openset/leetcode/tree/master/solution/repeated-string-match) | Easy |
-| <span id="687">687</span> | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-univalue-path) | Easy |
-| <span id="688">688</span> | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/knight-probability-in-chessboard) | Medium |
-| <span id="689">689</span> | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-sum-of-3-non-overlapping-subarrays) | Hard |
-| <span id="690">690</span> | [Employee Importance](https://leetcode.com/problems/employee-importance) | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-importance) | Easy |
-| <span id="691">691</span> | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/stickers-to-spell-word) | Hard |
-| <span id="692">692</span> | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/top-k-frequent-words) | Medium |
-| <span id="693">693</span> | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-number-with-alternating-bits) | Easy |
-| <span id="694">694</span> | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands) | Medium |
-| <span id="695">695</span> | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-area-of-island) | Medium |
-| <span id="696">696</span> | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-binary-substrings) | Easy |
-| <span id="697">697</span> | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/degree-of-an-array) | Easy |
-| <span id="698">698</span> | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-to-k-equal-sum-subsets) | Medium |
-| <span id="699">699</span> | [Falling Squares](https://leetcode.com/problems/falling-squares) | [Go](https://github.com/openset/leetcode/tree/master/solution/falling-squares) | Hard |
-| <span id="700">700</span> | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-a-binary-search-tree) | Easy |
-| <span id="701">701</span> | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-binary-search-tree) | Medium |
-| <span id="702">702</span> | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/search-in-a-sorted-array-of-unknown-size) | Medium |
-| <span id="703">703</span> | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [Go](https://github.com/openset/leetcode/tree/master/solution/kth-largest-element-in-a-stream) | Easy |
-| <span id="704">704</span> | [Binary Search](https://leetcode.com/problems/binary-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-search) | Easy |
-| <span id="705">705</span> | [Design HashSet](https://leetcode.com/problems/design-hashset) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hashset) | Easy |
-| <span id="706">706</span> | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-hashmap) | Easy |
-| <span id="707">707</span> | [Design Linked List](https://leetcode.com/problems/design-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/design-linked-list) | Easy |
-| <span id="708">708</span> | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/insert-into-a-cyclic-sorted-list) | Medium |
-| <span id="709">709</span> | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [Go](https://github.com/openset/leetcode/tree/master/solution/to-lower-case) | Easy |
-| <span id="710">710</span> | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist) | [Go](https://github.com/openset/leetcode/tree/master/solution/random-pick-with-blacklist) | Hard |
-| <span id="711">711</span> | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-distinct-islands-ii) | Hard |
-| <span id="712">712</span> | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-ascii-delete-sum-for-two-strings) | Medium |
-| <span id="713">713</span> | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/subarray-product-less-than-k) | Medium |
-| <span id="714">714</span> | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [Go](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
-| <span id="715">715</span> | [Range Module](https://leetcode.com/problems/range-module) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-module) | Hard |
-| <span id="716">716</span> | [Max Stack](https://leetcode.com/problems/max-stack) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/max-stack) | Easy |
-| <span id="717">717</span> | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | [Go](https://github.com/openset/leetcode/tree/master/solution/1-bit-and-2-bit-characters) | Easy |
-| <span id="718">718</span> | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-length-of-repeated-subarray) | Medium |
-| <span id="719">719</span> | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-k-th-smallest-pair-distance) | Hard |
-| <span id="720">720</span> | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-word-in-dictionary) | Easy |
-| <span id="721">721</span> | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | [Go](https://github.com/openset/leetcode/tree/master/solution/accounts-merge) | Medium |
-| <span id="722">722</span> | [Remove Comments](https://leetcode.com/problems/remove-comments) | [Go](https://github.com/openset/leetcode/tree/master/solution/remove-comments) | Medium |
-| <span id="723">723</span> | [Candy Crush](https://leetcode.com/problems/candy-crush) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/candy-crush) | Medium |
-| <span id="724">724</span> | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-pivot-index) | Easy |
-| <span id="725">725</span> | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-linked-list-in-parts) | Medium |
-| <span id="726">726</span> | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-atoms) | Hard |
-| <span id="727">727</span> | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-window-subsequence) | Hard |
-| <span id="728">728</span> | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers) | [Go](https://github.com/openset/leetcode/tree/master/solution/self-dividing-numbers) | Easy |
-| <span id="729">729</span> | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-i) | Medium |
-| <span id="730">730</span> | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/count-different-palindromic-subsequences) | Hard |
-| <span id="731">731</span> | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-ii) | Medium |
-| <span id="732">732</span> | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/my-calendar-iii) | Hard |
-| <span id="733">733</span> | [Flood Fill](https://leetcode.com/problems/flood-fill) | [Go](https://github.com/openset/leetcode/tree/master/solution/flood-fill) | Easy |
-| <span id="734">734</span> | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity) | Easy |
-| <span id="735">735</span> | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [Go](https://github.com/openset/leetcode/tree/master/solution/asteroid-collision) | Medium |
-| <span id="736">736</span> | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression) | [Go](https://github.com/openset/leetcode/tree/master/solution/parse-lisp-expression) | Hard |
-| <span id="737">737</span> | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity-ii) | Medium |
-| <span id="738">738</span> | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/monotone-increasing-digits) | Medium |
-| <span id="739">739</span> | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [Go](https://github.com/openset/leetcode/tree/master/solution/daily-temperatures) | Medium |
-| <span id="740">740</span> | [Delete and Earn](https://leetcode.com/problems/delete-and-earn) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-and-earn) | Medium |
-| <span id="741">741</span> | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup) | [Go](https://github.com/openset/leetcode/tree/master/solution/cherry-pickup) | Hard |
-| <span id="742">742</span> | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/closest-leaf-in-a-binary-tree) | Medium |
-| <span id="743">743</span> | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | [Go](https://github.com/openset/leetcode/tree/master/solution/network-delay-time) | Easy |
-| <span id="744">744</span> | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-smallest-letter-greater-than-target) | Easy |
-| <span id="745">745</span> | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search) | [Go](https://github.com/openset/leetcode/tree/master/solution/prefix-and-suffix-search) | Hard |
-| <span id="746">746</span> | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/min-cost-climbing-stairs) | Easy |
-| <span id="747">747</span> | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-number-at-least-twice-of-others) | Easy |
-| <span id="748">748</span> | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-completing-word) | Easy |
-| <span id="749">749</span> | [Contain Virus](https://leetcode.com/problems/contain-virus) | [Go](https://github.com/openset/leetcode/tree/master/solution/contain-virus) | Hard |
-| <span id="750">750</span> | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-corner-rectangles) | Medium |
-| <span id="751">751</span> | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/ip-to-cidr) | Easy |
-| <span id="752">752</span> | [Open the Lock](https://leetcode.com/problems/open-the-lock) | [Go](https://github.com/openset/leetcode/tree/master/solution/open-the-lock) | Medium |
-| <span id="753">753</span> | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | [Go](https://github.com/openset/leetcode/tree/master/solution/cracking-the-safe) | Hard |
-| <span id="754">754</span> | [Reach a Number](https://leetcode.com/problems/reach-a-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/reach-a-number) | Easy |
-| <span id="755">755</span> | [Pour Water](https://leetcode.com/problems/pour-water) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/pour-water) | Medium |
-| <span id="756">756</span> | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/pyramid-transition-matrix) | Medium |
-| <span id="757">757</span> | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two) | [Go](https://github.com/openset/leetcode/tree/master/solution/set-intersection-size-at-least-two) | Hard |
-| <span id="758">758</span> | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/bold-words-in-string) | Easy |
-| <span id="759">759</span> | [Employee Free Time](https://leetcode.com/problems/employee-free-time) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/employee-free-time) | Hard |
-| <span id="760">760</span> | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/find-anagram-mappings) | Easy |
-| <span id="761">761</span> | [Special Binary String](https://leetcode.com/problems/special-binary-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/special-binary-string) | Hard |
-| <span id="762">762</span> | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [Go](https://github.com/openset/leetcode/tree/master/solution/prime-number-of-set-bits-in-binary-representation) | Easy |
-| <span id="763">763</span> | [Partition Labels](https://leetcode.com/problems/partition-labels) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-labels) | Medium |
-| <span id="764">764</span> | [Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-plus-sign) | Medium |
-| <span id="765">765</span> | [Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands) | [Go](https://github.com/openset/leetcode/tree/master/solution/couples-holding-hands) | Hard |
-| <span id="766">766</span> | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/toeplitz-matrix) | Easy |
-| <span id="767">767</span> | [Reorganize String](https://leetcode.com/problems/reorganize-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/reorganize-string) | Medium |
-| <span id="768">768</span> | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-chunks-to-make-sorted-ii) | Hard |
-| <span id="769">769</span> | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-chunks-to-make-sorted) | Medium |
-| <span id="770">770</span> | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv) | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iv) | Hard |
-| <span id="771">771</span> | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | [Go](https://github.com/openset/leetcode/tree/master/solution/jewels-and-stones) | Easy |
-| <span id="772">772</span> | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iii) | Hard |
-| <span id="773">773</span> | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle) | [Go](https://github.com/openset/leetcode/tree/master/solution/sliding-puzzle) | Hard |
-| <span id="774">774</span> | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-max-distance-to-gas-station) | Hard |
-| <span id="775">775</span> | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | [Go](https://github.com/openset/leetcode/tree/master/solution/global-and-local-inversions) | Medium |
-| <span id="776">776</span> | [Split BST](https://leetcode.com/problems/split-bst) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/split-bst) | Medium |
-| <span id="777">777</span> | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/swap-adjacent-in-lr-string) | Medium |
-| <span id="778">778</span> | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water) | [Go](https://github.com/openset/leetcode/tree/master/solution/swim-in-rising-water) | Hard |
-| <span id="779">779</span> | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-symbol-in-grammar) | Medium |
-| <span id="780">780</span> | [Reaching Points](https://leetcode.com/problems/reaching-points) | [Go](https://github.com/openset/leetcode/tree/master/solution/reaching-points) | Hard |
-| <span id="781">781</span> | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest) | [Go](https://github.com/openset/leetcode/tree/master/solution/rabbits-in-forest) | Medium |
-| <span id="782">782</span> | [Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/transform-to-chessboard) | Hard |
-| <span id="783">783</span> | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-distance-between-bst-nodes) | Easy |
-| <span id="784">784</span> | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation) | [Go](https://github.com/openset/leetcode/tree/master/solution/letter-case-permutation) | Easy |
-| <span id="785">785</span> | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite) | [Go](https://github.com/openset/leetcode/tree/master/solution/is-graph-bipartite) | Medium |
-| <span id="786">786</span> | [K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-th-smallest-prime-fraction) | Hard |
-| <span id="787">787</span> | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops) | [Go](https://github.com/openset/leetcode/tree/master/solution/cheapest-flights-within-k-stops) | Medium |
-| <span id="788">788</span> | [Rotated Digits](https://leetcode.com/problems/rotated-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotated-digits) | Easy |
-| <span id="789">789</span> | [Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts) | [Go](https://github.com/openset/leetcode/tree/master/solution/escape-the-ghosts) | Medium |
-| <span id="790">790</span> | [Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling) | [Go](https://github.com/openset/leetcode/tree/master/solution/domino-and-tromino-tiling) | Medium |
-| <span id="791">791</span> | [Custom Sort String](https://leetcode.com/problems/custom-sort-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/custom-sort-string) | Medium |
-| <span id="792">792</span> | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-matching-subsequences) | Medium |
-| <span id="793">793</span> | [Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function) | [Go](https://github.com/openset/leetcode/tree/master/solution/preimage-size-of-factorial-zeroes-function) | Hard |
-| <span id="794">794</span> | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-tic-tac-toe-state) | Medium |
-| <span id="795">795</span> | [Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-subarrays-with-bounded-maximum) | Medium |
-| <span id="796">796</span> | [Rotate String](https://leetcode.com/problems/rotate-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/rotate-string) | Easy |
-| <span id="797">797</span> | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-paths-from-source-to-target) | Medium |
-| <span id="798">798</span> | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-rotation-with-highest-score) | Hard |
-| <span id="799">799</span> | [Champagne Tower](https://leetcode.com/problems/champagne-tower) | [Go](https://github.com/openset/leetcode/tree/master/solution/champagne-tower) | Medium |
-| <span id="800">800</span> | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/solution/similar-rgb-color) | Easy |
-| <span id="801">801</span> | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-swaps-to-make-sequences-increasing) | Medium |
-| <span id="802">802</span> | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-eventual-safe-states) | Medium |
-| <span id="803">803</span> | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit) | [Go](https://github.com/openset/leetcode/tree/master/solution/bricks-falling-when-hit) | Hard |
-| <span id="804">804</span> | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-morse-code-words) | Easy |
-| <span id="805">805</span> | [Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-with-same-average) | Hard |
-| <span id="806">806</span> | [Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-lines-to-write-string) | Easy |
-| <span id="807">807</span> | [Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline) | [Go](https://github.com/openset/leetcode/tree/master/solution/max-increase-to-keep-city-skyline) | Medium |
-| <span id="808">808</span> | [Soup Servings](https://leetcode.com/problems/soup-servings) | [Go](https://github.com/openset/leetcode/tree/master/solution/soup-servings) | Medium |
-| <span id="809">809</span> | [Expressive Words](https://leetcode.com/problems/expressive-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/expressive-words) | Medium |
-| <span id="810">810</span> | [Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/chalkboard-xor-game) | Hard |
-| <span id="811">811</span> | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count) | [Go](https://github.com/openset/leetcode/tree/master/solution/subdomain-visit-count) | Easy |
-| <span id="812">812</span> | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-triangle-area) | Easy |
-| <span id="813">813</span> | [Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-sum-of-averages) | Medium |
-| <span id="814">814</span> | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-tree-pruning) | Medium |
-| <span id="815">815</span> | [Bus Routes](https://leetcode.com/problems/bus-routes) | [Go](https://github.com/openset/leetcode/tree/master/solution/bus-routes) | Hard |
-| <span id="816">816</span> | [Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates) | [Go](https://github.com/openset/leetcode/tree/master/solution/ambiguous-coordinates) | Medium |
-| <span id="817">817</span> | [Linked List Components](https://leetcode.com/problems/linked-list-components) | [Go](https://github.com/openset/leetcode/tree/master/solution/linked-list-components) | Medium |
-| <span id="818">818</span> | [Race Car](https://leetcode.com/problems/race-car) | [Go](https://github.com/openset/leetcode/tree/master/solution/race-car) | Hard |
-| <span id="819">819</span> | [Most Common Word](https://leetcode.com/problems/most-common-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-common-word) | Easy |
-| <span id="820">820</span> | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words) | [Go](https://github.com/openset/leetcode/tree/master/solution/short-encoding-of-words) | Medium |
-| <span id="821">821</span> | [Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-distance-to-a-character) | Easy |
-| <span id="822">822</span> | [Card Flipping Game](https://leetcode.com/problems/card-flipping-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/card-flipping-game) | Medium |
-| <span id="823">823</span> | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-trees-with-factors) | Medium |
-| <span id="824">824</span> | [Goat Latin](https://leetcode.com/problems/goat-latin) | [Go](https://github.com/openset/leetcode/tree/master/solution/goat-latin) | Easy |
-| <span id="825">825</span> | [Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages) | [Go](https://github.com/openset/leetcode/tree/master/solution/friends-of-appropriate-ages) | Medium |
-| <span id="826">826</span> | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-profit-assigning-work) | Medium |
-| <span id="827">827</span> | [Making A Large Island](https://leetcode.com/problems/making-a-large-island) | [Go](https://github.com/openset/leetcode/tree/master/solution/making-a-large-island) | Hard |
-| <span id="828">828</span> | [Unique Letter String](https://leetcode.com/problems/unique-letter-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-letter-string) | Hard |
-| <span id="829">829</span> | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/consecutive-numbers-sum) | Hard |
-| <span id="830">830</span> | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups) | [Go](https://github.com/openset/leetcode/tree/master/solution/positions-of-large-groups) | Easy |
-| <span id="831">831</span> | [Masking Personal Information](https://leetcode.com/problems/masking-personal-information) | [Go](https://github.com/openset/leetcode/tree/master/solution/masking-personal-information) | Medium |
-| <span id="832">832</span> | [Flipping an Image](https://leetcode.com/problems/flipping-an-image) | [Go](https://github.com/openset/leetcode/tree/master/solution/flipping-an-image) | Easy |
-| <span id="833">833</span> | [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-and-replace-in-string) | Medium |
-| <span id="834">834</span> | [Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-distances-in-tree) | Hard |
-| <span id="835">835</span> | [Image Overlap](https://leetcode.com/problems/image-overlap) | [Go](https://github.com/openset/leetcode/tree/master/solution/image-overlap) | Medium |
-| <span id="836">836</span> | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | [Go](https://github.com/openset/leetcode/tree/master/solution/rectangle-overlap) | Easy |
-| <span id="837">837</span> | [New 21 Game](https://leetcode.com/problems/new-21-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/new-21-game) | Medium |
-| <span id="838">838</span> | [Push Dominoes](https://leetcode.com/problems/push-dominoes) | [Go](https://github.com/openset/leetcode/tree/master/solution/push-dominoes) | Medium |
-| <span id="839">839</span> | [Similar String Groups](https://leetcode.com/problems/similar-string-groups) | [Go](https://github.com/openset/leetcode/tree/master/solution/similar-string-groups) | Hard |
-| <span id="840">840</span> | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid) | [Go](https://github.com/openset/leetcode/tree/master/solution/magic-squares-in-grid) | Easy |
-| <span id="841">841</span> | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms) | [Go](https://github.com/openset/leetcode/tree/master/solution/keys-and-rooms) | Medium |
-| <span id="842">842</span> | [Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/split-array-into-fibonacci-sequence) | Medium |
-| <span id="843">843</span> | [Guess the Word](https://leetcode.com/problems/guess-the-word) | [Go](https://github.com/openset/leetcode/tree/master/solution/guess-the-word) | Hard |
-| <span id="844">844</span> | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | [Go](https://github.com/openset/leetcode/tree/master/solution/backspace-string-compare) | Easy |
-| <span id="845">845</span> | [Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/longest-mountain-in-array) | Medium |
-| <span id="846">846</span> | [Hand of Straights](https://leetcode.com/problems/hand-of-straights) | [Go](https://github.com/openset/leetcode/tree/master/solution/hand-of-straights) | Medium |
-| <span id="847">847</span> | [Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-path-visiting-all-nodes) | Hard |
-| <span id="848">848</span> | [Shifting Letters](https://leetcode.com/problems/shifting-letters) | [Go](https://github.com/openset/leetcode/tree/master/solution/shifting-letters) | Medium |
-| <span id="849">849</span> | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximize-distance-to-closest-person) | Easy |
-| <span id="850">850</span> | [Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/rectangle-area-ii) | Hard |
-| <span id="851">851</span> | [Loud and Rich](https://leetcode.com/problems/loud-and-rich) | [Go](https://github.com/openset/leetcode/tree/master/solution/loud-and-rich) | Medium |
-| <span id="852">852</span> | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/peak-index-in-a-mountain-array) | Easy |
-| <span id="853">853</span> | [Car Fleet](https://leetcode.com/problems/car-fleet) | [Go](https://github.com/openset/leetcode/tree/master/solution/car-fleet) | Medium |
-| <span id="854">854</span> | [K-Similar Strings](https://leetcode.com/problems/k-similar-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/k-similar-strings) | Hard |
-| <span id="855">855</span> | [Exam Room](https://leetcode.com/problems/exam-room) | [Go](https://github.com/openset/leetcode/tree/master/solution/exam-room) | Medium |
-| <span id="856">856</span> | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/solution/score-of-parentheses) | Medium |
-| <span id="857">857</span> | [Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-cost-to-hire-k-workers) | Hard |
-| <span id="858">858</span> | [Mirror Reflection](https://leetcode.com/problems/mirror-reflection) | [Go](https://github.com/openset/leetcode/tree/master/solution/mirror-reflection) | Medium |
-| <span id="859">859</span> | [Buddy Strings](https://leetcode.com/problems/buddy-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/buddy-strings) | Easy |
-| <span id="860">860</span> | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [Go](https://github.com/openset/leetcode/tree/master/solution/lemonade-change) | Easy |
-| <span id="861">861</span> | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/score-after-flipping-matrix) | Medium |
-| <span id="862">862</span> | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-subarray-with-sum-at-least-k) | Hard |
-| <span id="863">863</span> | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-nodes-distance-k-in-binary-tree) | Medium |
-| <span id="864">864</span> | [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-path-to-get-all-keys) | Hard |
-| <span id="865">865</span> | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-subtree-with-all-the-deepest-nodes) | Medium |
-| <span id="866">866</span> | [Prime Palindrome](https://leetcode.com/problems/prime-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/solution/prime-palindrome) | Medium |
-| <span id="867">867</span> | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | [Go](https://github.com/openset/leetcode/tree/master/solution/transpose-matrix) | Easy |
-| <span id="868">868</span> | [Binary Gap](https://leetcode.com/problems/binary-gap) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-gap) | Easy |
-| <span id="869">869</span> | [Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2) | [Go](https://github.com/openset/leetcode/tree/master/solution/reordered-power-of-2) | Medium |
-| <span id="870">870</span> | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle) | [Go](https://github.com/openset/leetcode/tree/master/solution/advantage-shuffle) | Medium |
-| <span id="871">871</span> | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-number-of-refueling-stops) | Hard |
-| <span id="872">872</span> | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/leaf-similar-trees) | Easy |
-| <span id="873">873</span> | [Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/length-of-longest-fibonacci-subsequence) | Medium |
-| <span id="874">874</span> | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation) | [Go](https://github.com/openset/leetcode/tree/master/solution/walking-robot-simulation) | Easy |
-| <span id="875">875</span> | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas) | [Go](https://github.com/openset/leetcode/tree/master/solution/koko-eating-bananas) | Medium |
-| <span id="876">876</span> | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/solution/middle-of-the-linked-list) | Easy |
-| <span id="877">877</span> | [Stone Game](https://leetcode.com/problems/stone-game) | [Go](https://github.com/openset/leetcode/tree/master/solution/stone-game) | Medium |
-| <span id="878">878</span> | [Nth Magical Number](https://leetcode.com/problems/nth-magical-number) | [Go](https://github.com/openset/leetcode/tree/master/solution/nth-magical-number) | Hard |
-| <span id="879">879</span> | [Profitable Schemes](https://leetcode.com/problems/profitable-schemes) | [Go](https://github.com/openset/leetcode/tree/master/solution/profitable-schemes) | Hard |
-| <span id="880">880</span> | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index) | [Go](https://github.com/openset/leetcode/tree/master/solution/decoded-string-at-index) | Medium |
-| <span id="881">881</span> | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people) | [Go](https://github.com/openset/leetcode/tree/master/solution/boats-to-save-people) | Medium |
-| <span id="882">882</span> | [Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph) | [Go](https://github.com/openset/leetcode/tree/master/solution/reachable-nodes-in-subdivided-graph) | Hard |
-| <span id="883">883</span> | [Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/solution/projection-area-of-3d-shapes) | Easy |
-| <span id="884">884</span> | [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences) | [Go](https://github.com/openset/leetcode/tree/master/solution/uncommon-words-from-two-sentences) | Easy |
-| <span id="885">885</span> | [Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/spiral-matrix-iii) | Medium |
-| <span id="886">886</span> | [Possible Bipartition](https://leetcode.com/problems/possible-bipartition) | [Go](https://github.com/openset/leetcode/tree/master/solution/possible-bipartition) | Medium |
-| <span id="887">887</span> | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-egg-drop) | Hard |
-| <span id="888">888</span> | [Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap) | [Go](https://github.com/openset/leetcode/tree/master/solution/fair-candy-swap) | Easy |
-| <span id="889">889</span> | [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/solution/construct-binary-tree-from-preorder-and-postorder-traversal) | Medium |
-| <span id="890">890</span> | [Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-and-replace-pattern) | Medium |
-| <span id="891">891</span> | [Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-subsequence-widths) | Hard |
-| <span id="892">892</span> | [Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/solution/surface-area-of-3d-shapes) | Easy |
-| <span id="893">893</span> | [Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings) | [Go](https://github.com/openset/leetcode/tree/master/solution/groups-of-special-equivalent-strings) | Easy |
-| <span id="894">894</span> | [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/all-possible-full-binary-trees) | Medium |
-| <span id="895">895</span> | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-frequency-stack) | Hard |
-| <span id="896">896</span> | [Monotonic Array](https://leetcode.com/problems/monotonic-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/monotonic-array) | Easy |
-| <span id="897">897</span> | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/increasing-order-search-tree) | Easy |
-| <span id="898">898</span> | [Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/solution/bitwise-ors-of-subarrays) | Medium |
-| <span id="899">899</span> | [Orderly Queue](https://leetcode.com/problems/orderly-queue) | [Go](https://github.com/openset/leetcode/tree/master/solution/orderly-queue) | Hard |
-| <span id="900">900</span> | [RLE Iterator](https://leetcode.com/problems/rle-iterator) | [Go](https://github.com/openset/leetcode/tree/master/solution/rle-iterator) | Medium |
-| <span id="901">901</span> | [Online Stock Span](https://leetcode.com/problems/online-stock-span) | [Go](https://github.com/openset/leetcode/tree/master/solution/online-stock-span) | Medium |
-| <span id="902">902</span> | [Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set) | [Go](https://github.com/openset/leetcode/tree/master/solution/numbers-at-most-n-given-digit-set) | Hard |
-| <span id="903">903</span> | [Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-permutations-for-di-sequence) | Hard |
-| <span id="904">904</span> | [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets) | [Go](https://github.com/openset/leetcode/tree/master/solution/fruit-into-baskets) | Medium |
-| <span id="905">905</span> | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-array-by-parity) | Easy |
-| <span id="906">906</span> | [Super Palindromes](https://leetcode.com/problems/super-palindromes) | [Go](https://github.com/openset/leetcode/tree/master/solution/super-palindromes) | Hard |
-| <span id="907">907</span> | [Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums) | [Go](https://github.com/openset/leetcode/tree/master/solution/sum-of-subarray-minimums) | Medium |
-| <span id="908">908</span> | [Smallest Range I](https://leetcode.com/problems/smallest-range-i) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-range-i) | Easy |
-| <span id="909">909</span> | [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders) | [Go](https://github.com/openset/leetcode/tree/master/solution/snakes-and-ladders) | Medium |
-| <span id="910">910</span> | [Smallest Range II](https://leetcode.com/problems/smallest-range-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/smallest-range-ii) | Medium |
-| <span id="911">911</span> | [Online Election](https://leetcode.com/problems/online-election) | [Go](https://github.com/openset/leetcode/tree/master/solution/online-election) | Medium |
-| <span id="913">913</span> | [Cat and Mouse](https://leetcode.com/problems/cat-and-mouse) | [Go](https://github.com/openset/leetcode/tree/master/solution/cat-and-mouse) | Hard |
-| <span id="914">914</span> | [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | [Go](https://github.com/openset/leetcode/tree/master/solution/x-of-a-kind-in-a-deck-of-cards) | Easy |
-| <span id="915">915</span> | [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/solution/partition-array-into-disjoint-intervals) | Medium |
-| <span id="916">916</span> | [Word Subsets](https://leetcode.com/problems/word-subsets) | [Go](https://github.com/openset/leetcode/tree/master/solution/word-subsets) | Medium |
-| <span id="917">917</span> | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters) | [Go](https://github.com/openset/leetcode/tree/master/solution/reverse-only-letters) | Easy |
-| <span id="918">918</span> | [Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray) | [Go](https://github.com/openset/leetcode/tree/master/solution/maximum-sum-circular-subarray) | Medium |
-| <span id="919">919</span> | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter) | [Go](https://github.com/openset/leetcode/tree/master/solution/complete-binary-tree-inserter) | Medium |
-| <span id="920">920</span> | [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-music-playlists) | Hard |
-| <span id="921">921</span> | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-add-to-make-parentheses-valid) | Medium |
-| <span id="922">922</span> | [Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/sort-array-by-parity-ii) | Easy |
-| <span id="923">923</span> | [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity) | [Go](https://github.com/openset/leetcode/tree/master/solution/3sum-with-multiplicity) | Medium |
-| <span id="924">924</span> | [Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-malware-spread) | Hard |
-| <span id="925">925</span> | [Long Pressed Name](https://leetcode.com/problems/long-pressed-name) | [Go](https://github.com/openset/leetcode/tree/master/solution/long-pressed-name) | Easy |
-| <span id="926">926</span> | [Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing) | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-string-to-monotone-increasing) | Medium |
-| <span id="927">927</span> | [Three Equal Parts](https://leetcode.com/problems/three-equal-parts) | [Go](https://github.com/openset/leetcode/tree/master/solution/three-equal-parts) | Hard |
-| <span id="928">928</span> | [Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimize-malware-spread-ii) | Hard |
-| <span id="929">929</span> | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses) | [Go](https://github.com/openset/leetcode/tree/master/solution/unique-email-addresses) | Easy |
-| <span id="930">930</span> | [Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/binary-subarrays-with-sum) | Medium |
-| <span id="931">931</span> | [Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-falling-path-sum) | Medium |
-| <span id="932">932</span> | [Beautiful Array](https://leetcode.com/problems/beautiful-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/beautiful-array) | Medium |
-| <span id="933">933</span> | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls) | [Go](https://github.com/openset/leetcode/tree/master/solution/number-of-recent-calls) | Easy |
-| <span id="934">934</span> | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge) | [Go](https://github.com/openset/leetcode/tree/master/solution/shortest-bridge) | Medium |
-| <span id="935">935</span> | [Knight Dialer](https://leetcode.com/problems/knight-dialer) | [Go](https://github.com/openset/leetcode/tree/master/solution/knight-dialer) | Medium |
-| <span id="936">936</span> | [Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence) | [Go](https://github.com/openset/leetcode/tree/master/solution/stamping-the-sequence) | Hard |
-| <span id="937">937</span> | [Reorder Log Files](https://leetcode.com/problems/reorder-log-files) | [Go](https://github.com/openset/leetcode/tree/master/solution/reorder-log-files) | Easy |
-| <span id="938">938</span> | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | [Go](https://github.com/openset/leetcode/tree/master/solution/range-sum-of-bst) | Medium |
-| <span id="939">939</span> | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-area-rectangle) | Medium |
-| <span id="940">940</span> | [Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/distinct-subsequences-ii) | Hard |
-| <span id="941">941</span> | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/solution/valid-mountain-array) | Easy |
-| <span id="942">942</span> | [DI String Match](https://leetcode.com/problems/di-string-match) | [Go](https://github.com/openset/leetcode/tree/master/solution/di-string-match) | Easy |
-| <span id="943">943</span> | [Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring) | [Go](https://github.com/openset/leetcode/tree/master/solution/find-the-shortest-superstring) | Hard |
-| <span id="944">944</span> | [Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted) | Easy |
-| <span id="945">945</span> | [Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique) | [Go](https://github.com/openset/leetcode/tree/master/solution/minimum-increment-to-make-array-unique) | Medium |
-| <span id="946">946</span> | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences) | [Go](https://github.com/openset/leetcode/tree/master/solution/validate-stack-sequences) | Medium |
-| <span id="947">947</span> | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column) | [Go](https://github.com/openset/leetcode/tree/master/solution/most-stones-removed-with-same-row-or-column) | Medium |
-| <span id="948">948</span> | [Bag of Tokens](https://leetcode.com/problems/bag-of-tokens) | [Go](https://github.com/openset/leetcode/tree/master/solution/bag-of-tokens) | Medium |
-| <span id="949">949</span> | [Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-time-for-given-digits) | Easy |
-| <span id="950">950</span> | [Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order) | [Go](https://github.com/openset/leetcode/tree/master/solution/reveal-cards-in-increasing-order) | Medium |
-| <span id="951">951</span> | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/solution/flip-equivalent-binary-trees) | Medium |
-| <span id="952">952</span> | [Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor) | [Go](https://github.com/openset/leetcode/tree/master/solution/largest-component-size-by-common-factor) | Hard |
-| <span id="953">953</span> | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/solution/verifying-an-alien-dictionary) | Easy |
-| <span id="954">954</span> | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs) | [Go](https://github.com/openset/leetcode/tree/master/solution/array-of-doubled-pairs) | Medium |
-| <span id="955">955</span> | [Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted-ii) | Medium |
-| <span id="956">956</span> | [Tallest Billboard](https://leetcode.com/problems/tallest-billboard) | [Go](https://github.com/openset/leetcode/tree/master/solution/tallest-billboard) | Hard |
-| <span id="957">957</span> | [Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days) | [Go](https://github.com/openset/leetcode/tree/master/solution/prison-cells-after-n-days) | Medium |
-| <span id="958">958</span> | [Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/solution/check-completeness-of-a-binary-tree) | Medium |
-| <span id="959">959</span> | [Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes) | [Go](https://github.com/openset/leetcode/tree/master/solution/regions-cut-by-slashes) | Medium |
-| <span id="960">960</span> | [Delete Columns to Make Sorted III](https://leetcode.com/problems/delete-columns-to-make-sorted-iii) | [Go](https://github.com/openset/leetcode/tree/master/solution/delete-columns-to-make-sorted-iii) | Hard |
+| <span id="1">1</span> | [Two Sum](https://leetcode.com/problems/two-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum) | Easy |
+| <span id="2">2</span> | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers) | Medium |
+| <span id="3">3</span> | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-without-repeating-characters) | Medium |
+| <span id="4">4</span> | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/median-of-two-sorted-arrays) | Hard |
+| <span id="5">5</span> | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-substring) | Medium |
+| <span id="6">6</span> | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | [Go](https://github.com/openset/leetcode/tree/master/problems/zigzag-conversion) | Medium |
+| <span id="7">7</span> | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-integer) | Easy |
+| <span id="8">8</span> | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | [Go](https://github.com/openset/leetcode/tree/master/problems/string-to-integer-atoi) | Medium |
+| <span id="9">9</span> | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-number) | Easy |
+| <span id="10">10</span> | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | [Go](https://github.com/openset/leetcode/tree/master/problems/regular-expression-matching) | Hard |
+| <span id="11">11</span> | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [Go](https://github.com/openset/leetcode/tree/master/problems/container-with-most-water) | Medium |
+| <span id="12">12</span> | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-to-roman) | Medium |
+| <span id="13">13</span> | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | [Go](https://github.com/openset/leetcode/tree/master/problems/roman-to-integer) | Easy |
+| <span id="14">14</span> | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-common-prefix) | Easy |
+| <span id="15">15</span> | [3Sum](https://leetcode.com/problems/3sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum) | Medium |
+| <span id="16">16</span> | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-closest) | Medium |
+| <span id="17">17</span> | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/letter-combinations-of-a-phone-number) | Medium |
+| <span id="18">18</span> | [4Sum](https://leetcode.com/problems/4sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/4sum) | Medium |
+| <span id="19">19</span> | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-nth-node-from-end-of-list) | Medium |
+| <span id="20">20</span> | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-parentheses) | Easy |
+| <span id="21">21</span> | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-two-sorted-lists) | Easy |
+| <span id="22">22</span> | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/generate-parentheses) | Medium |
+| <span id="23">23</span> | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-k-sorted-lists) | Hard |
+| <span id="24">24</span> | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-nodes-in-pairs) | Medium |
+| <span id="25">25</span> | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-nodes-in-k-group) | Hard |
+| <span id="26">26</span> | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array) | Easy |
+| <span id="27">27</span> | [Remove Element](https://leetcode.com/problems/remove-element) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-element) | Easy |
+| <span id="28">28</span> | [Implement strStr()](https://leetcode.com/problems/implement-strstr) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-strstr) | Easy |
+| <span id="29">29</span> | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/problems/divide-two-integers) | Medium |
+| <span id="30">30</span> | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/substring-with-concatenation-of-all-words) | Hard |
+| <span id="31">31</span> | [Next Permutation](https://leetcode.com/problems/next-permutation) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-permutation) | Medium |
+| <span id="32">32</span> | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-valid-parentheses) | Hard |
+| <span id="33">33</span> | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array) | Medium |
+| <span id="34">34</span> | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-first-and-last-position-of-element-in-sorted-array) | Medium |
+| <span id="35">35</span> | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-insert-position) | Easy |
+| <span id="36">36</span> | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-sudoku) | Medium |
+| <span id="37">37</span> | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | [Go](https://github.com/openset/leetcode/tree/master/problems/sudoku-solver) | Hard |
+| <span id="38">38</span> | [Count and Say](https://leetcode.com/problems/count-and-say) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-and-say) | Easy |
+| <span id="39">39</span> | [Combination Sum](https://leetcode.com/problems/combination-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum) | Medium |
+| <span id="40">40</span> | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-ii) | Medium |
+| <span id="41">41</span> | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | [Go](https://github.com/openset/leetcode/tree/master/problems/first-missing-positive) | Hard |
+| <span id="42">42</span> | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | [Go](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water) | Hard |
+| <span id="43">43</span> | [Multiply Strings](https://leetcode.com/problems/multiply-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/multiply-strings) | Medium |
+| <span id="44">44</span> | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | [Go](https://github.com/openset/leetcode/tree/master/problems/wildcard-matching) | Hard |
+| <span id="45">45</span> | [Jump Game II](https://leetcode.com/problems/jump-game-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/jump-game-ii) | Hard |
+| <span id="46">46</span> | [Permutations](https://leetcode.com/problems/permutations) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutations) | Medium |
+| <span id="47">47</span> | [Permutations II](https://leetcode.com/problems/permutations-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutations-ii) | Medium |
+| <span id="48">48</span> | [Rotate Image](https://leetcode.com/problems/rotate-image) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-image) | Medium |
+| <span id="49">49</span> | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | [Go](https://github.com/openset/leetcode/tree/master/problems/group-anagrams) | Medium |
+| <span id="50">50</span> | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [Go](https://github.com/openset/leetcode/tree/master/problems/powx-n) | Medium |
+| <span id="51">51</span> | [N-Queens](https://leetcode.com/problems/n-queens) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-queens) | Hard |
+| <span id="52">52</span> | [N-Queens II](https://leetcode.com/problems/n-queens-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-queens-ii) | Hard |
+| <span id="53">53</span> | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray) | Easy |
+| <span id="54">54</span> | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix) | Medium |
+| <span id="55">55</span> | [Jump Game](https://leetcode.com/problems/jump-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/jump-game) | Medium |
+| <span id="56">56</span> | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) | Medium |
+| <span id="57">57</span> | [Insert Interval](https://leetcode.com/problems/insert-interval) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-interval) | Hard |
+| <span id="58">58</span> | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/length-of-last-word) | Easy |
+| <span id="59">59</span> | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-ii) | Medium |
+| <span id="60">60</span> | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutation-sequence) | Medium |
+| <span id="61">61</span> | [Rotate List](https://leetcode.com/problems/rotate-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-list) | Medium |
+| <span id="62">62</span> | [Unique Paths](https://leetcode.com/problems/unique-paths) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-paths) | Medium |
+| <span id="63">63</span> | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-paths-ii) | Medium |
+| <span id="64">64</span> | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-path-sum) | Medium |
+| <span id="65">65</span> | [Valid Number](https://leetcode.com/problems/valid-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-number) | Hard |
+| <span id="66">66</span> | [Plus One](https://leetcode.com/problems/plus-one) | [Go](https://github.com/openset/leetcode/tree/master/problems/plus-one) | Easy |
+| <span id="67">67</span> | [Add Binary](https://leetcode.com/problems/add-binary) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-binary) | Easy |
+| <span id="68">68</span> | [Text Justification](https://leetcode.com/problems/text-justification) | [Go](https://github.com/openset/leetcode/tree/master/problems/text-justification) | Hard |
+| <span id="69">69</span> | [Sqrt(x)](https://leetcode.com/problems/sqrtx) | [Go](https://github.com/openset/leetcode/tree/master/problems/sqrtx) | Easy |
+| <span id="70">70</span> | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/climbing-stairs) | Easy |
+| <span id="71">71</span> | [Simplify Path](https://leetcode.com/problems/simplify-path) | [Go](https://github.com/openset/leetcode/tree/master/problems/simplify-path) | Medium |
+| <span id="72">72</span> | [Edit Distance](https://leetcode.com/problems/edit-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/edit-distance) | Hard |
+| <span id="73">73</span> | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/set-matrix-zeroes) | Medium |
+| <span id="74">74</span> | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix) | Medium |
+| <span id="75">75</span> | [Sort Colors](https://leetcode.com/problems/sort-colors) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-colors) | Medium |
+| <span id="76">76</span> | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring) | Hard |
+| <span id="77">77</span> | [Combinations](https://leetcode.com/problems/combinations) | [Go](https://github.com/openset/leetcode/tree/master/problems/combinations) | Medium |
+| <span id="78">78</span> | [Subsets](https://leetcode.com/problems/subsets) | [Go](https://github.com/openset/leetcode/tree/master/problems/subsets) | Medium |
+| <span id="79">79</span> | [Word Search](https://leetcode.com/problems/word-search) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-search) | Medium |
+| <span id="80">80</span> | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array-ii) | Medium |
+| <span id="81">81</span> | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array-ii) | Medium |
+| <span id="82">82</span> | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list-ii) | Medium |
+| <span id="83">83</span> | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list) | Easy |
+| <span id="84">84</span> | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-rectangle-in-histogram) | Hard |
+| <span id="85">85</span> | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximal-rectangle) | Hard |
+| <span id="86">86</span> | [Partition List](https://leetcode.com/problems/partition-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-list) | Medium |
+| <span id="87">87</span> | [Scramble String](https://leetcode.com/problems/scramble-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/scramble-string) | Hard |
+| <span id="88">88</span> | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-sorted-array) | Easy |
+| <span id="89">89</span> | [Gray Code](https://leetcode.com/problems/gray-code) | [Go](https://github.com/openset/leetcode/tree/master/problems/gray-code) | Medium |
+| <span id="90">90</span> | [Subsets II](https://leetcode.com/problems/subsets-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/subsets-ii) | Medium |
+| <span id="91">91</span> | [Decode Ways](https://leetcode.com/problems/decode-ways) | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-ways) | Medium |
+| <span id="92">92</span> | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list-ii) | Medium |
+| <span id="93">93</span> | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | [Go](https://github.com/openset/leetcode/tree/master/problems/restore-ip-addresses) | Medium |
+| <span id="94">94</span> | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) | Medium |
+| <span id="95">95</span> | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees-ii) | Medium |
+| <span id="96">96</span> | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees) | Medium |
+| <span id="97">97</span> | [Interleaving String](https://leetcode.com/problems/interleaving-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/interleaving-string) | Hard |
+| <span id="98">98</span> | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-binary-search-tree) | Medium |
+| <span id="99">99</span> | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/recover-binary-search-tree) | Hard |
+| <span id="100">100</span> | [Same Tree](https://leetcode.com/problems/same-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/same-tree) | Easy |
+| <span id="101">101</span> | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/symmetric-tree) | Easy |
+| <span id="102">102</span> | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal) | Medium |
+| <span id="103">103</span> | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-zigzag-level-order-traversal) | Medium |
+| <span id="104">104</span> | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-binary-tree) | Easy |
+| <span id="105">105</span> | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium |
+| <span id="106">106</span> | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | Medium |
+| <span id="107">107</span> | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal-ii) | Easy |
+| <span id="108">108</span> | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-array-to-binary-search-tree) | Easy |
+| <span id="109">109</span> | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-list-to-binary-search-tree) | Medium |
+| <span id="110">110</span> | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/balanced-binary-tree) | Easy |
+| <span id="111">111</span> | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-depth-of-binary-tree) | Easy |
+| <span id="112">112</span> | [Path Sum](https://leetcode.com/problems/path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum) | Easy |
+| <span id="113">113</span> | [Path Sum II](https://leetcode.com/problems/path-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-ii) | Medium |
+| <span id="114">114</span> | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-binary-tree-to-linked-list) | Medium |
+| <span id="115">115</span> | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences) | Hard |
+| <span id="116">116</span> | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | [Go](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node) | Medium |
+| <span id="117">117</span> | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node-ii) | Medium |
+| <span id="118">118</span> | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle) | Easy |
+| <span id="119">119</span> | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle-ii) | Easy |
+| <span id="120">120</span> | [Triangle](https://leetcode.com/problems/triangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/triangle) | Medium |
+| <span id="121">121</span> | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) | Easy |
+| <span id="122">122</span> | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) | Easy |
+| <span id="123">123</span> | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii) | Hard |
+| <span id="124">124</span> | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-maximum-path-sum) | Hard |
+| <span id="125">125</span> | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome) | Easy |
+| <span id="126">126</span> | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-ladder-ii) | Hard |
+| <span id="127">127</span> | [Word Ladder](https://leetcode.com/problems/word-ladder) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-ladder) | Medium |
+| <span id="128">128</span> | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-consecutive-sequence) | Hard |
+| <span id="129">129</span> | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-root-to-leaf-numbers) | Medium |
+| <span id="130">130</span> | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions) | [Go](https://github.com/openset/leetcode/tree/master/problems/surrounded-regions) | Medium |
+| <span id="131">131</span> | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning) | Medium |
+| <span id="132">132</span> | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning-ii) | Hard |
+| <span id="133">133</span> | [Clone Graph](https://leetcode.com/problems/clone-graph) | [Go](https://github.com/openset/leetcode/tree/master/problems/clone-graph) | Medium |
+| <span id="134">134</span> | [Gas Station](https://leetcode.com/problems/gas-station) | [Go](https://github.com/openset/leetcode/tree/master/problems/gas-station) | Medium |
+| <span id="135">135</span> | [Candy](https://leetcode.com/problems/candy) | [Go](https://github.com/openset/leetcode/tree/master/problems/candy) | Hard |
+| <span id="136">136</span> | [Single Number](https://leetcode.com/problems/single-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number) | Easy |
+| <span id="137">137</span> | [Single Number II](https://leetcode.com/problems/single-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number-ii) | Medium |
+| <span id="138">138</span> | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | [Go](https://github.com/openset/leetcode/tree/master/problems/copy-list-with-random-pointer) | Medium |
+| <span id="139">139</span> | [Word Break](https://leetcode.com/problems/word-break) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-break) | Medium |
+| <span id="140">140</span> | [Word Break II](https://leetcode.com/problems/word-break-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-break-ii) | Hard |
+| <span id="141">141</span> | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle) | Easy |
+| <span id="142">142</span> | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle-ii) | Medium |
+| <span id="143">143</span> | [Reorder List](https://leetcode.com/problems/reorder-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/reorder-list) | Medium |
+| <span id="144">144</span> | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-preorder-traversal) | Medium |
+| <span id="145">145</span> | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-postorder-traversal) | Hard |
+| <span id="146">146</span> | [LRU Cache](https://leetcode.com/problems/lru-cache) | [Go](https://github.com/openset/leetcode/tree/master/problems/lru-cache) | Hard |
+| <span id="147">147</span> | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/insertion-sort-list) | Medium |
+| <span id="148">148</span> | [Sort List](https://leetcode.com/problems/sort-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-list) | Medium |
+| <span id="149">149</span> | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-points-on-a-line) | Hard |
+| <span id="150">150</span> | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | [Go](https://github.com/openset/leetcode/tree/master/problems/evaluate-reverse-polish-notation) | Medium |
+| <span id="151">151</span> | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string) | Medium |
+| <span id="152">152</span> | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-subarray) | Medium |
+| <span id="153">153</span> | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array) | Medium |
+| <span id="154">154</span> | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array-ii) | Hard |
+| <span id="155">155</span> | [Min Stack](https://leetcode.com/problems/min-stack) | [Go](https://github.com/openset/leetcode/tree/master/problems/min-stack) | Easy |
+| <span id="156">156</span> | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-upside-down) | Medium |
+| <span id="157">157</span> | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4) | Easy |
+| <span id="158">158</span> | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4-ii-call-multiple-times) | Hard |
+| <span id="159">159</span> | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters) | Hard |
+| <span id="160">160</span> | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-linked-lists) | Easy |
+| <span id="161">161</span> | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/one-edit-distance) | Medium |
+| <span id="162">162</span> | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-peak-element) | Medium |
+| <span id="163">163</span> | [Missing Ranges](https://leetcode.com/problems/missing-ranges) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/missing-ranges) | Medium |
+| <span id="164">164</span> | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-gap) | Hard |
+| <span id="165">165</span> | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/compare-version-numbers) | Medium |
+| <span id="166">166</span> | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [Go](https://github.com/openset/leetcode/tree/master/problems/fraction-to-recurring-decimal) | Medium |
+| <span id="167">167</span> | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-ii-input-array-is-sorted) | Easy |
+| <span id="168">168</span> | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [Go](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-title) | Easy |
+| <span id="169">169</span> | [Majority Element](https://leetcode.com/problems/majority-element) | [Go](https://github.com/openset/leetcode/tree/master/problems/majority-element) | Easy |
+| <span id="170">170</span> | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-iii-data-structure-design) | Easy |
+| <span id="171">171</span> | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-number) | Easy |
+| <span id="172">172</span> | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/factorial-trailing-zeroes) | Easy |
+| <span id="173">173</span> | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator) | Medium |
+| <span id="174">174</span> | [Dungeon Game](https://leetcode.com/problems/dungeon-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/dungeon-game) | Hard |
+| <span id="175">175</span> | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | [Go](https://github.com/openset/leetcode/tree/master/problems/combine-two-tables) | Easy |
+| <span id="176">176</span> | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/second-highest-salary) | Easy |
+| <span id="177">177</span> | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/nth-highest-salary) | Medium |
+| <span id="178">178</span> | [Rank Scores](https://leetcode.com/problems/rank-scores) | [Go](https://github.com/openset/leetcode/tree/master/problems/rank-scores) | Medium |
+| <span id="179">179</span> | [Largest Number](https://leetcode.com/problems/largest-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-number) | Medium |
+| <span id="180">180</span> | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers) | Medium |
+| <span id="181">181</span> | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | [Go](https://github.com/openset/leetcode/tree/master/problems/employees-earning-more-than-their-managers) | Easy |
+| <span id="182">182</span> | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/problems/duplicate-emails) | Easy |
+| <span id="183">183</span> | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [Go](https://github.com/openset/leetcode/tree/master/problems/customers-who-never-order) | Easy |
+| <span id="184">184</span> | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/department-highest-salary) | Medium |
+| <span id="185">185</span> | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [Go](https://github.com/openset/leetcode/tree/master/problems/department-top-three-salaries) | Hard |
+| <span id="186">186</span> | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-ii) | Medium |
+| <span id="187">187</span> | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-dna-sequences) | Medium |
+| <span id="188">188</span> | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv) | Hard |
+| <span id="189">189</span> | [Rotate Array](https://leetcode.com/problems/rotate-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-array) | Easy |
+| <span id="190">190</span> | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-bits) | Easy |
+| <span id="191">191</span> | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits) | Easy |
+| <span id="192">192</span> | [Word Frequency](https://leetcode.com/problems/word-frequency) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-frequency) | Medium |
+| <span id="193">193</span> | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-phone-numbers) | Easy |
+| <span id="194">194</span> | [Transpose File](https://leetcode.com/problems/transpose-file) | [Go](https://github.com/openset/leetcode/tree/master/problems/transpose-file) | Medium |
+| <span id="195">195</span> | [Tenth Line](https://leetcode.com/problems/tenth-line) | [Bash](https://github.com/openset/leetcode/tree/master/problems/tenth-line) | Easy |
+| <span id="196">196</span> | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-duplicate-emails) | Easy |
+| <span id="197">197</span> | [Rising Temperature](https://leetcode.com/problems/rising-temperature) | [Go](https://github.com/openset/leetcode/tree/master/problems/rising-temperature) | Easy |
+| <span id="198">198</span> | [House Robber](https://leetcode.com/problems/house-robber) | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber) | Easy |
+| <span id="199">199</span> | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-right-side-view) | Medium |
+| <span id="200">200</span> | [Number of Islands](https://leetcode.com/problems/number-of-islands) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-islands) | Medium |
+| <span id="201">201</span> | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | [Go](https://github.com/openset/leetcode/tree/master/problems/bitwise-and-of-numbers-range) | Medium |
+| <span id="202">202</span> | [Happy Number](https://leetcode.com/problems/happy-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/happy-number) | Easy |
+| <span id="203">203</span> | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-linked-list-elements) | Easy |
+| <span id="204">204</span> | [Count Primes](https://leetcode.com/problems/count-primes) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-primes) | Easy |
+| <span id="205">205</span> | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/isomorphic-strings) | Easy |
+| <span id="206">206</span> | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list) | Easy |
+| <span id="207">207</span> | [Course Schedule](https://leetcode.com/problems/course-schedule) | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule) | Medium |
+| <span id="208">208</span> | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree) | Medium |
+| <span id="209">209</span> | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-size-subarray-sum) | Medium |
+| <span id="210">210</span> | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii) | Medium |
+| <span id="211">211</span> | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-and-search-word-data-structure-design) | Medium |
+| <span id="212">212</span> | [Word Search II](https://leetcode.com/problems/word-search-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-search-ii) | Hard |
+| <span id="213">213</span> | [House Robber II](https://leetcode.com/problems/house-robber-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber-ii) | Medium |
+| <span id="214">214</span> | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-palindrome) | Hard |
+| <span id="215">215</span> | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-an-array) | Medium |
+| <span id="216">216</span> | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iii) | Medium |
+| <span id="217">217</span> | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [Go](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate) | Easy |
+| <span id="218">218</span> | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | [Go](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem) | Hard |
+| <span id="219">219</span> | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-ii) | Easy |
+| <span id="220">220</span> | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii) | Medium |
+| <span id="221">221</span> | [Maximal Square](https://leetcode.com/problems/maximal-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximal-square) | Medium |
+| <span id="222">222</span> | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-complete-tree-nodes) | Medium |
+| <span id="223">223</span> | [Rectangle Area](https://leetcode.com/problems/rectangle-area) | [Go](https://github.com/openset/leetcode/tree/master/problems/rectangle-area) | Medium |
+| <span id="224">224</span> | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator) | Hard |
+| <span id="225">225</span> | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-stack-using-queues) | Easy |
+| <span id="226">226</span> | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/invert-binary-tree) | Easy |
+| <span id="227">227</span> | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-ii) | Medium |
+| <span id="228">228</span> | [Summary Ranges](https://leetcode.com/problems/summary-ranges) | [Go](https://github.com/openset/leetcode/tree/master/problems/summary-ranges) | Medium |
+| <span id="229">229</span> | [Majority Element II](https://leetcode.com/problems/majority-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/majority-element-ii) | Medium |
+| <span id="230">230</span> | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-bst) | Medium |
+| <span id="231">231</span> | [Power of Two](https://leetcode.com/problems/power-of-two) | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-two) | Easy |
+| <span id="232">232</span> | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-queue-using-stacks) | Easy |
+| <span id="233">233</span> | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-digit-one) | Hard |
+| <span id="234">234</span> | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-linked-list) | Easy |
+| <span id="235">235</span> | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-search-tree) | Easy |
+| <span id="236">236</span> | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-tree) | Medium |
+| <span id="237">237</span> | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-linked-list) | Easy |
+| <span id="238">238</span> | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | [Go](https://github.com/openset/leetcode/tree/master/problems/product-of-array-except-self) | Medium |
+| <span id="239">239</span> | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-window-maximum) | Hard |
+| <span id="240">240</span> | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix-ii) | Medium |
+| <span id="241">241</span> | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/different-ways-to-add-parentheses) | Medium |
+| <span id="242">242</span> | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-anagram) | Easy |
+| <span id="243">243</span> | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance) | Easy |
+| <span id="244">244</span> | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-ii) | Medium |
+| <span id="245">245</span> | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-iii) | Medium |
+| <span id="246">246</span> | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number) | Easy |
+| <span id="247">247</span> | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-ii) | Medium |
+| <span id="248">248</span> | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-iii) | Hard |
+| <span id="249">249</span> | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/group-shifted-strings) | Medium |
+| <span id="250">250</span> | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/count-univalue-subtrees) | Medium |
+| <span id="251">251</span> | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector) | Medium |
+| <span id="252">252</span> | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms) | Easy |
+| <span id="253">253</span> | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii) | Medium |
+| <span id="254">254</span> | [Factor Combinations](https://leetcode.com/problems/factor-combinations) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/factor-combinations) | Medium |
+| <span id="255">255</span> | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-sequence-in-binary-search-tree) | Medium |
+| <span id="256">256</span> | [Paint House](https://leetcode.com/problems/paint-house) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-house) | Easy |
+| <span id="257">257</span> | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-paths) | Easy |
+| <span id="258">258</span> | [Add Digits](https://leetcode.com/problems/add-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-digits) | Easy |
+| <span id="259">259</span> | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) | Medium |
+| <span id="260">260</span> | [Single Number III](https://leetcode.com/problems/single-number-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number-iii) | Medium |
+| <span id="261">261</span> | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree) | Medium |
+| <span id="262">262</span> | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [Go](https://github.com/openset/leetcode/tree/master/problems/trips-and-users) | Hard |
+| <span id="263">263</span> | [Ugly Number](https://leetcode.com/problems/ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/ugly-number) | Easy |
+| <span id="264">264</span> | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii) | Medium |
+| <span id="265">265</span> | [Paint House II](https://leetcode.com/problems/paint-house-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii) | Hard |
+| <span id="266">266</span> | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation) | Easy |
+| <span id="267">267</span> | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation-ii) | Medium |
+| <span id="268">268</span> | [Missing Number](https://leetcode.com/problems/missing-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/missing-number) | Easy |
+| <span id="269">269</span> | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/alien-dictionary) | Hard |
+| <span id="270">270</span> | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value) | Easy |
+| <span id="271">271</span> | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-strings) | Medium |
+| <span id="272">272</span> | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value-ii) | Hard |
+| <span id="273">273</span> | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-to-english-words) | Hard |
+| <span id="274">274</span> | [H-Index](https://leetcode.com/problems/h-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/h-index) | Medium |
+| <span id="275">275</span> | [H-Index II](https://leetcode.com/problems/h-index-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/h-index-ii) | Medium |
+| <span id="276">276</span> | [Paint Fence](https://leetcode.com/problems/paint-fence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-fence) | Easy |
+| <span id="277">277</span> | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-celebrity) | Medium |
+| <span id="278">278</span> | [First Bad Version](https://leetcode.com/problems/first-bad-version) | [Go](https://github.com/openset/leetcode/tree/master/problems/first-bad-version) | Easy |
+| <span id="279">279</span> | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-squares) | Medium |
+| <span id="280">280</span> | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort) | Medium |
+| <span id="281">281</span> | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/zigzag-iterator) | Medium |
+| <span id="282">282</span> | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | [Go](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators) | Hard |
+| <span id="283">283</span> | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/move-zeroes) | Easy |
+| <span id="284">284</span> | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/peeking-iterator) | Medium |
+| <span id="285">285</span> | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst) | Medium |
+| <span id="286">286</span> | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates) | Medium |
+| <span id="287">287</span> | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number) | Medium |
+| <span id="288">288</span> | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-word-abbreviation) | Medium |
+| <span id="289">289</span> | [Game of Life](https://leetcode.com/problems/game-of-life) | [Go](https://github.com/openset/leetcode/tree/master/problems/game-of-life) | Medium |
+| <span id="290">290</span> | [Word Pattern](https://leetcode.com/problems/word-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-pattern) | Easy |
+| <span id="291">291</span> | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-pattern-ii) | Hard |
+| <span id="292">292</span> | [Nim Game](https://leetcode.com/problems/nim-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/nim-game) | Easy |
+| <span id="293">293</span> | [Flip Game](https://leetcode.com/problems/flip-game) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-game) | Easy |
+| <span id="294">294</span> | [Flip Game II](https://leetcode.com/problems/flip-game-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii) | Medium |
+| <span id="295">295</span> | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-median-from-data-stream) | Hard |
+| <span id="296">296</span> | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/best-meeting-point) | Hard |
+| <span id="297">297</span> | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-binary-tree) | Hard |
+| <span id="298">298</span> | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence) | Medium |
+| <span id="299">299</span> | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | [Go](https://github.com/openset/leetcode/tree/master/problems/bulls-and-cows) | Medium |
+| <span id="300">300</span> | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence) | Medium |
+| <span id="301">301</span> | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-invalid-parentheses) | Hard |
+| <span id="302">302</span> | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-rectangle-enclosing-black-pixels) | Hard |
+| <span id="303">303</span> | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-immutable) | Easy |
+| <span id="304">304</span> | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-immutable) | Medium |
+| <span id="305">305</span> | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-islands-ii) | Hard |
+| <span id="306">306</span> | [Additive Number](https://leetcode.com/problems/additive-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/additive-number) | Medium |
+| <span id="307">307</span> | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable) | Medium |
+| <span id="308">308</span> | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) | Hard |
+| <span id="309">309</span> | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
+| <span id="310">310</span> | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees) | Medium |
+| <span id="311">311</span> | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sparse-matrix-multiplication) | Medium |
+| <span id="312">312</span> | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/problems/burst-balloons) | Hard |
+| <span id="313">313</span> | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-ugly-number) | Medium |
+| <span id="314">314</span> | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal) | Medium |
+| <span id="315">315</span> | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | Hard |
+| <span id="316">316</span> | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicate-letters) | Hard |
+| <span id="317">317</span> | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) | Hard |
+| <span id="318">318</span> | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-word-lengths) | Medium |
+| <span id="319">319</span> | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [Go](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher) | Medium |
+| <span id="320">320</span> | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) | Medium |
+| <span id="321">321</span> | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/create-maximum-number) | Hard |
+| <span id="322">322</span> | [Coin Change](https://leetcode.com/problems/coin-change) | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-change) | Medium |
+| <span id="323">323</span> | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) | Medium |
+| <span id="324">324</span> | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort-ii) | Medium |
+| <span id="325">325</span> | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-size-subarray-sum-equals-k) | Medium |
+| <span id="326">326</span> | [Power of Three](https://leetcode.com/problems/power-of-three) | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-three) | Easy |
+| <span id="327">327</span> | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) | Hard |
+| <span id="328">328</span> | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/odd-even-linked-list) | Medium |
+| <span id="329">329</span> | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-path-in-a-matrix) | Hard |
+| <span id="330">330</span> | [Patching Array](https://leetcode.com/problems/patching-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/patching-array) | Hard |
+| <span id="331">331</span> | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-serialization-of-a-binary-tree) | Medium |
+| <span id="332">332</span> | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | [Go](https://github.com/openset/leetcode/tree/master/problems/reconstruct-itinerary) | Medium |
+| <span id="333">333</span> | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-bst-subtree) | Medium |
+| <span id="334">334</span> | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-triplet-subsequence) | Medium |
+| <span id="335">335</span> | [Self Crossing](https://leetcode.com/problems/self-crossing) | [Go](https://github.com/openset/leetcode/tree/master/problems/self-crossing) | Hard |
+| <span id="336">336</span> | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-pairs) | Hard |
+| <span id="337">337</span> | [House Robber III](https://leetcode.com/problems/house-robber-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber-iii) | Medium |
+| <span id="338">338</span> | [Counting Bits](https://leetcode.com/problems/counting-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/counting-bits) | Medium |
+| <span id="339">339</span> | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum) | Easy |
+| <span id="340">340</span> | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters) | Hard |
+| <span id="341">341</span> | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator) | Medium |
+| <span id="342">342</span> | [Power of Four](https://leetcode.com/problems/power-of-four) | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-four) | Easy |
+| <span id="343">343</span> | [Integer Break](https://leetcode.com/problems/integer-break) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-break) | Medium |
+| <span id="344">344</span> | [Reverse String](https://leetcode.com/problems/reverse-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-string) | Easy |
+| <span id="345">345</span> | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-vowels-of-a-string) | Easy |
+| <span id="346">346</span> | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/moving-average-from-data-stream) | Easy |
+| <span id="347">347</span> | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements) | Medium |
+| <span id="348">348</span> | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-tic-tac-toe) | Medium |
+| <span id="349">349</span> | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays) | Easy |
+| <span id="350">350</span> | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii) | Easy |
+| <span id="351">351</span> | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns) | Medium |
+| <span id="352">352</span> | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals) | Hard |
+| <span id="353">353</span> | [Design Snake Game](https://leetcode.com/problems/design-snake-game) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-snake-game) | Medium |
+| <span id="354">354</span> | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | [Go](https://github.com/openset/leetcode/tree/master/problems/russian-doll-envelopes) | Hard |
+| <span id="355">355</span> | [Design Twitter](https://leetcode.com/problems/design-twitter) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-twitter) | Medium |
+| <span id="356">356</span> | [Line Reflection](https://leetcode.com/problems/line-reflection) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/line-reflection) | Medium |
+| <span id="357">357</span> | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-numbers-with-unique-digits) | Medium |
+| <span id="358">358</span> | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart) | Hard |
+| <span id="359">359</span> | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/logger-rate-limiter) | Easy |
+| <span id="360">360</span> | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-transformed-array) | Medium |
+| <span id="361">361</span> | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/bomb-enemy) | Medium |
+| <span id="362">362</span> | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hit-counter) | Medium |
+| <span id="363">363</span> | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-sum-of-rectangle-no-larger-than-k) | Hard |
+| <span id="364">364</span> | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum-ii) | Medium |
+| <span id="365">365</span> | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem) | [Go](https://github.com/openset/leetcode/tree/master/problems/water-and-jug-problem) | Medium |
+| <span id="366">366</span> | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-leaves-of-binary-tree) | Medium |
+| <span id="367">367</span> | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-perfect-square) | Easy |
+| <span id="368">368</span> | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-divisible-subset) | Medium |
+| <span id="369">369</span> | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/plus-one-linked-list) | Medium |
+| <span id="370">370</span> | [Range Addition](https://leetcode.com/problems/range-addition) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/range-addition) | Medium |
+| <span id="371">371</span> | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-two-integers) | Easy |
+| <span id="372">372</span> | [Super Pow](https://leetcode.com/problems/super-pow) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-pow) | Medium |
+| <span id="373">373</span> | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-pairs-with-smallest-sums) | Medium |
+| <span id="374">374</span> | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | [Go](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower) | Easy |
+| <span id="375">375</span> | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower-ii) | Medium |
+| <span id="376">376</span> | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-subsequence) | Medium |
+| <span id="377">377</span> | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iv) | Medium |
+| <span id="378">378</span> | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-sorted-matrix) | Medium |
+| <span id="379">379</span> | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-phone-directory) | Medium |
+| <span id="380">380</span> | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1) | Medium |
+| <span id="381">381</span> | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1-duplicates-allowed) | Hard |
+| <span id="382">382</span> | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-random-node) | Medium |
+| <span id="383">383</span> | [Ransom Note](https://leetcode.com/problems/ransom-note) | [Go](https://github.com/openset/leetcode/tree/master/problems/ransom-note) | Easy |
+| <span id="384">384</span> | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/shuffle-an-array) | Medium |
+| <span id="385">385</span> | [Mini Parser](https://leetcode.com/problems/mini-parser) | [Go](https://github.com/openset/leetcode/tree/master/problems/mini-parser) | Medium |
+| <span id="386">386</span> | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/lexicographical-numbers) | Medium |
+| <span id="387">387</span> | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/first-unique-character-in-a-string) | Easy |
+| <span id="388">388</span> | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-absolute-file-path) | Medium |
+| <span id="389">389</span> | [Find the Difference](https://leetcode.com/problems/find-the-difference) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-difference) | Easy |
+| <span id="390">390</span> | [Elimination Game](https://leetcode.com/problems/elimination-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/elimination-game) | Medium |
+| <span id="391">391</span> | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-rectangle) | Hard |
+| <span id="392">392</span> | [Is Subsequence](https://leetcode.com/problems/is-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/is-subsequence) | Medium |
+| <span id="393">393</span> | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation) | [Go](https://github.com/openset/leetcode/tree/master/problems/utf-8-validation) | Medium |
+| <span id="394">394</span> | [Decode String](https://leetcode.com/problems/decode-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-string) | Medium |
+| <span id="395">395</span> | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-least-k-repeating-characters) | Medium |
+| <span id="396">396</span> | [Rotate Function](https://leetcode.com/problems/rotate-function) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-function) | Medium |
+| <span id="397">397</span> | [Integer Replacement](https://leetcode.com/problems/integer-replacement) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-replacement) | Medium |
+| <span id="398">398</span> | [Random Pick Index](https://leetcode.com/problems/random-pick-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-index) | Medium |
+| <span id="399">399</span> | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | [Go](https://github.com/openset/leetcode/tree/master/problems/evaluate-division) | Medium |
+| <span id="400">400</span> | [Nth Digit](https://leetcode.com/problems/nth-digit) | [Go](https://github.com/openset/leetcode/tree/master/problems/nth-digit) | Easy |
+| <span id="401">401</span> | [Binary Watch](https://leetcode.com/problems/binary-watch) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-watch) | Easy |
+| <span id="402">402</span> | [Remove K Digits](https://leetcode.com/problems/remove-k-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-k-digits) | Medium |
+| <span id="403">403</span> | [Frog Jump](https://leetcode.com/problems/frog-jump) | [Go](https://github.com/openset/leetcode/tree/master/problems/frog-jump) | Hard |
+| <span id="404">404</span> | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-left-leaves) | Easy |
+| <span id="405">405</span> | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-a-number-to-hexadecimal) | Easy |
+| <span id="406">406</span> | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | [Go](https://github.com/openset/leetcode/tree/master/problems/queue-reconstruction-by-height) | Medium |
+| <span id="407">407</span> | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water-ii) | Hard |
+| <span id="408">408</span> | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-word-abbreviation) | Easy |
+| <span id="409">409</span> | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindrome) | Easy |
+| <span id="410">410</span> | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-largest-sum) | Hard |
+| <span id="411">411</span> | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-unique-word-abbreviation) | Hard |
+| <span id="412">412</span> | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [Go](https://github.com/openset/leetcode/tree/master/problems/fizz-buzz) | Easy |
+| <span id="413">413</span> | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | [Go](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices) | Medium |
+| <span id="414">414</span> | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/third-maximum-number) | Easy |
+| <span id="415">415</span> | [Add Strings](https://leetcode.com/problems/add-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-strings) | Easy |
+| <span id="416">416</span> | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-equal-subset-sum) | Medium |
+| <span id="417">417</span> | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [Go](https://github.com/openset/leetcode/tree/master/problems/pacific-atlantic-water-flow) | Medium |
+| <span id="418">418</span> | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-screen-fitting) | Medium |
+| <span id="419">419</span> | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | [Go](https://github.com/openset/leetcode/tree/master/problems/battleships-in-a-board) | Medium |
+| <span id="420">420</span> | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker) | [Go](https://github.com/openset/leetcode/tree/master/problems/strong-password-checker) | Hard |
+| <span id="421">421</span> | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-xor-of-two-numbers-in-an-array) | Medium |
+| <span id="422">422</span> | [Valid Word Square](https://leetcode.com/problems/valid-word-square) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-word-square) | Easy |
+| <span id="423">423</span> | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english) | [Go](https://github.com/openset/leetcode/tree/master/problems/reconstruct-original-digits-from-english) | Medium |
+| <span id="424">424</span> | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-character-replacement) | Medium |
+| <span id="425">425</span> | [Word Squares](https://leetcode.com/problems/word-squares) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-squares) | Hard |
+| <span id="426">426</span> | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
+| <span id="427">427</span> | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-quad-tree) | Easy |
+| <span id="428">428</span> | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree) | Hard |
+| <span id="429">429</span> | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-level-order-traversal) | Easy |
+| <span id="430">430</span> | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-a-multilevel-doubly-linked-list) | Medium |
+| <span id="431">431</span> | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-n-ary-tree-to-binary-tree) | Hard |
+| <span id="432">432</span> | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-oone-data-structure) | Hard |
+| <span id="433">433</span> | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-genetic-mutation) | Medium |
+| <span id="434">434</span> | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-segments-in-a-string) | Easy |
+| <span id="435">435</span> | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/non-overlapping-intervals) | Medium |
+| <span id="436">436</span> | [Find Right Interval](https://leetcode.com/problems/find-right-interval) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-right-interval) | Medium |
+| <span id="437">437</span> | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-iii) | Easy |
+| <span id="438">438</span> | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-anagrams-in-a-string) | Easy |
+| <span id="439">439</span> | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser) | Medium |
+| <span id="440">440</span> | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-in-lexicographical-order) | Hard |
+| <span id="441">441</span> | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | [Go](https://github.com/openset/leetcode/tree/master/problems/arranging-coins) | Easy |
+| <span id="442">442</span> | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-duplicates-in-an-array) | Medium |
+| <span id="443">443</span> | [String Compression](https://leetcode.com/problems/string-compression) | [Go](https://github.com/openset/leetcode/tree/master/problems/string-compression) | Easy |
+| <span id="444">444</span> | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sequence-reconstruction) | Medium |
+| <span id="445">445</span> | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers-ii) | Medium |
+| <span id="446">446</span> | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices-ii-subsequence) | Hard |
+| <span id="447">447</span> | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-boomerangs) | Easy |
+| <span id="448">448</span> | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-numbers-disappeared-in-an-array) | Easy |
+| <span id="449">449</span> | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-bst) | Medium |
+| <span id="450">450</span> | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-bst) | Medium |
+| <span id="451">451</span> | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-characters-by-frequency) | Medium |
+| <span id="452">452</span> | [Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-arrows-to-burst-balloons) | Medium |
+| <span id="453">453</span> | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements) | Easy |
+| <span id="454">454</span> | [4Sum II](https://leetcode.com/problems/4sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/4sum-ii) | Medium |
+| <span id="455">455</span> | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | [Go](https://github.com/openset/leetcode/tree/master/problems/assign-cookies) | Easy |
+| <span id="456">456</span> | [132 Pattern](https://leetcode.com/problems/132-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/132-pattern) | Medium |
+| <span id="457">457</span> | [Circular Array Loop](https://leetcode.com/problems/circular-array-loop) | [Go](https://github.com/openset/leetcode/tree/master/problems/circular-array-loop) | Medium |
+| <span id="458">458</span> | [Poor Pigs](https://leetcode.com/problems/poor-pigs) | [Go](https://github.com/openset/leetcode/tree/master/problems/poor-pigs) | Easy |
+| <span id="459">459</span> | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-substring-pattern) | Easy |
+| <span id="460">460</span> | [LFU Cache](https://leetcode.com/problems/lfu-cache) | [Go](https://github.com/openset/leetcode/tree/master/problems/lfu-cache) | Hard |
+| <span id="461">461</span> | [Hamming Distance](https://leetcode.com/problems/hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/hamming-distance) | Easy |
+| <span id="462">462</span> | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements-ii) | Medium |
+| <span id="463">463</span> | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | [Go](https://github.com/openset/leetcode/tree/master/problems/island-perimeter) | Easy |
+| <span id="464">464</span> | [Can I Win](https://leetcode.com/problems/can-i-win) | [Go](https://github.com/openset/leetcode/tree/master/problems/can-i-win) | Medium |
+| <span id="465">465</span> | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/optimal-account-balancing) | Hard |
+| <span id="466">466</span> | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-the-repetitions) | Hard |
+| <span id="467">467</span> | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-substrings-in-wraparound-string) | Medium |
+| <span id="468">468</span> | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-ip-address) | Medium |
+| <span id="469">469</span> | [Convex Polygon](https://leetcode.com/problems/convex-polygon) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/convex-polygon) | Medium |
+| <span id="470">470</span> | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-rand10-using-rand7) | Medium |
+| <span id="471">471</span> | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length) | Hard |
+| <span id="472">472</span> | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/concatenated-words) | Hard |
+| <span id="473">473</span> | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/matchsticks-to-square) | Medium |
+| <span id="474">474</span> | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/ones-and-zeroes) | Medium |
+| <span id="475">475</span> | [Heaters](https://leetcode.com/problems/heaters) | [Go](https://github.com/openset/leetcode/tree/master/problems/heaters) | Easy |
+| <span id="476">476</span> | [Number Complement](https://leetcode.com/problems/number-complement) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-complement) | Easy |
+| <span id="477">477</span> | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/total-hamming-distance) | Medium |
+| <span id="478">478</span> | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle) | [Go](https://github.com/openset/leetcode/tree/master/problems/generate-random-point-in-a-circle) | Medium |
+| <span id="479">479</span> | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-palindrome-product) | Easy |
+| <span id="480">480</span> | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median) | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-window-median) | Hard |
+| <span id="481">481</span> | [Magical String](https://leetcode.com/problems/magical-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/magical-string) | Medium |
+| <span id="482">482</span> | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [Go](https://github.com/openset/leetcode/tree/master/problems/license-key-formatting) | Easy |
+| <span id="483">483</span> | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-good-base) | Hard |
+| <span id="484">484</span> | [Find Permutation](https://leetcode.com/problems/find-permutation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-permutation) | Medium |
+| <span id="485">485</span> | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones) | Easy |
+| <span id="486">486</span> | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | [Go](https://github.com/openset/leetcode/tree/master/problems/predict-the-winner) | Medium |
+| <span id="487">487</span> | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-ii) | Medium |
+| <span id="488">488</span> | [Zuma Game](https://leetcode.com/problems/zuma-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/zuma-game) | Hard |
+| <span id="489">489</span> | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/robot-room-cleaner) | Hard |
+| <span id="490">490</span> | [The Maze](https://leetcode.com/problems/the-maze) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze) | Medium |
+| <span id="491">491</span> | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-subsequences) | Medium |
+| <span id="492">492</span> | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-the-rectangle) | Easy |
+| <span id="493">493</span> | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | Hard |
+| <span id="494">494</span> | [Target Sum](https://leetcode.com/problems/target-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/target-sum) | Medium |
+| <span id="495">495</span> | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking) | [Go](https://github.com/openset/leetcode/tree/master/problems/teemo-attacking) | Medium |
+| <span id="496">496</span> | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-i) | Easy |
+| <span id="497">497</span> | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-point-in-non-overlapping-rectangles) | Medium |
+| <span id="498">498</span> | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | [Go](https://github.com/openset/leetcode/tree/master/problems/diagonal-traverse) | Medium |
+| <span id="499">499</span> | [The Maze III](https://leetcode.com/problems/the-maze-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii) | Hard |
+| <span id="500">500</span> | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | [Go](https://github.com/openset/leetcode/tree/master/problems/keyboard-row) | Easy |
+| <span id="501">501</span> | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-mode-in-binary-search-tree) | Easy |
+| <span id="502">502</span> | [IPO](https://leetcode.com/problems/ipo) | [Go](https://github.com/openset/leetcode/tree/master/problems/ipo) | Hard |
+| <span id="503">503</span> | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-ii) | Medium |
+| <span id="504">504</span> | [Base 7](https://leetcode.com/problems/base-7) | [Go](https://github.com/openset/leetcode/tree/master/problems/base-7) | Easy |
+| <span id="505">505</span> | [The Maze II](https://leetcode.com/problems/the-maze-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii) | Medium |
+| <span id="506">506</span> | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | [Go](https://github.com/openset/leetcode/tree/master/problems/relative-ranks) | Easy |
+| <span id="507">507</span> | [Perfect Number](https://leetcode.com/problems/perfect-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-number) | Easy |
+| <span id="508">508</span> | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-frequent-subtree-sum) | Medium |
+| <span id="513">513</span> | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value) | Medium |
+| <span id="514">514</span> | [Freedom Trail](https://leetcode.com/problems/freedom-trail) | [Go](https://github.com/openset/leetcode/tree/master/problems/freedom-trail) | Hard |
+| <span id="515">515</span> | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row) | Medium |
+| <span id="516">516</span> | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-subsequence) | Medium |
+| <span id="517">517</span> | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-washing-machines) | Hard |
+| <span id="518">518</span> | [Coin Change 2](https://leetcode.com/problems/coin-change-2) | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-change-2) | Medium |
+| <span id="519">519</span> | [Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-flip-matrix) | Medium |
+| <span id="520">520</span> | [Detect Capital](https://leetcode.com/problems/detect-capital) | [Go](https://github.com/openset/leetcode/tree/master/problems/detect-capital) | Easy |
+| <span id="521">521</span> | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-i) | Easy |
+| <span id="522">522</span> | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-ii) | Medium |
+| <span id="523">523</span> | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/continuous-subarray-sum) | Medium |
+| <span id="524">524</span> | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary-through-deleting) | Medium |
+| <span id="525">525</span> | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/contiguous-array) | Medium |
+| <span id="526">526</span> | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement) | Medium |
+| <span id="527">527</span> | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation) | Hard |
+| <span id="528">528</span> | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-weight) | Medium |
+| <span id="529">529</span> | [Minesweeper](https://leetcode.com/problems/minesweeper) | [Go](https://github.com/openset/leetcode/tree/master/problems/minesweeper) | Medium |
+| <span id="530">530</span> | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst) | Easy |
+| <span id="531">531</span> | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i) | Medium |
+| <span id="532">532</span> | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-diff-pairs-in-an-array) | Easy |
+| <span id="533">533</span> | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii) | Medium |
+| <span id="535">535</span> | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-tinyurl) | Medium |
+| <span id="536">536</span> | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-string) | Medium |
+| <span id="537">537</span> | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | [Go](https://github.com/openset/leetcode/tree/master/problems/complex-number-multiplication) | Medium |
+| <span id="538">538</span> | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-bst-to-greater-tree) | Easy |
+| <span id="539">539</span> | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-time-difference) | Medium |
+| <span id="540">540</span> | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-element-in-a-sorted-array) | Medium |
+| <span id="541">541</span> | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-string-ii) | Easy |
+| <span id="542">542</span> | [01 Matrix](https://leetcode.com/problems/01-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/01-matrix) | Medium |
+| <span id="543">543</span> | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/diameter-of-binary-tree) | Easy |
+| <span id="544">544</span> | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/output-contest-matches) | Medium |
+| <span id="545">545</span> | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/boundary-of-binary-tree) | Medium |
+| <span id="546">546</span> | [Remove Boxes](https://leetcode.com/problems/remove-boxes) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-boxes) | Hard |
+| <span id="547">547</span> | [Friend Circles](https://leetcode.com/problems/friend-circles) | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-circles) | Medium |
+| <span id="548">548</span> | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-with-equal-sum) | Medium |
+| <span id="549">549</span> | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence-ii) | Medium |
+| <span id="551">551</span> | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-i) | Easy |
+| <span id="552">552</span> | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-ii) | Hard |
+| <span id="553">553</span> | [Optimal Division](https://leetcode.com/problems/optimal-division) | [Go](https://github.com/openset/leetcode/tree/master/problems/optimal-division) | Medium |
+| <span id="554">554</span> | [Brick Wall](https://leetcode.com/problems/brick-wall) | [Go](https://github.com/openset/leetcode/tree/master/problems/brick-wall) | Medium |
+| <span id="555">555</span> | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-concatenated-strings) | Medium |
+| <span id="556">556</span> | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-iii) | Medium |
+| <span id="557">557</span> | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-iii) | Easy |
+| <span id="558">558</span> | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection) | [Go](https://github.com/openset/leetcode/tree/master/problems/quad-tree-intersection) | Easy |
+| <span id="559">559</span> | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-n-ary-tree) | Easy |
+| <span id="560">560</span> | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k) | Medium |
+| <span id="561">561</span> | [Array Partition I](https://leetcode.com/problems/array-partition-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/array-partition-i) | Easy |
+| <span id="562">562</span> | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-line-of-consecutive-one-in-matrix) | Medium |
+| <span id="563">563</span> | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-tilt) | Easy |
+| <span id="564">564</span> | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-closest-palindrome) | Hard |
+| <span id="565">565</span> | [Array Nesting](https://leetcode.com/problems/array-nesting) | [Go](https://github.com/openset/leetcode/tree/master/problems/array-nesting) | Medium |
+| <span id="566">566</span> | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/reshape-the-matrix) | Easy |
+| <span id="567">567</span> | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutation-in-string) | Medium |
+| <span id="568">568</span> | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-vacation-days) | Hard |
+| <span id="569">569</span> | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/median-employee-salary) | Hard |
+| <span id="570">570</span> | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/managers-with-at-least-5-direct-reports) | Medium |
+| <span id="571">571</span> | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-median-given-frequency-of-numbers) | Hard |
+| <span id="572">572</span> | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/subtree-of-another-tree) | Easy |
+| <span id="573">573</span> | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/squirrel-simulation) | Medium |
+| <span id="574">574</span> | [Winning Candidate](https://leetcode.com/problems/winning-candidate) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/winning-candidate) | Medium |
+| <span id="575">575</span> | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | [Go](https://github.com/openset/leetcode/tree/master/problems/distribute-candies) | Easy |
+| <span id="576">576</span> | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [Go](https://github.com/openset/leetcode/tree/master/problems/out-of-boundary-paths) | Medium |
+| <span id="577">577</span> | [Employee Bonus](https://leetcode.com/problems/employee-bonus) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-bonus) | Easy |
+| <span id="578">578</span> | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/get-highest-answer-rate-question) | Medium |
+| <span id="579">579</span> | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-cumulative-salary-of-an-employee) | Hard |
+| <span id="580">580</span> | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/count-student-number-in-departments) | Medium |
+| <span id="581">581</span> | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-unsorted-continuous-subarray) | Easy |
+| <span id="582">582</span> | [Kill Process](https://leetcode.com/problems/kill-process) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/kill-process) | Medium |
+| <span id="583">583</span> | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-operation-for-two-strings) | Medium |
+| <span id="584">584</span> | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-customer-referee) | Easy |
+| <span id="585">585</span> | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/investments-in-2016) | Medium |
+| <span id="586">586</span> | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/customer-placing-the-largest-number-of-orders) | Easy |
+| <span id="587">587</span> | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | [Go](https://github.com/openset/leetcode/tree/master/problems/erect-the-fence) | Hard |
+| <span id="588">588</span> | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system) | Hard |
+| <span id="589">589</span> | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-preorder-traversal) | Easy |
+| <span id="590">590</span> | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-postorder-traversal) | Easy |
+| <span id="591">591</span> | [Tag Validator](https://leetcode.com/problems/tag-validator) | [Go](https://github.com/openset/leetcode/tree/master/problems/tag-validator) | Hard |
+| <span id="592">592</span> | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction) | [Go](https://github.com/openset/leetcode/tree/master/problems/fraction-addition-and-subtraction) | Medium |
+| <span id="593">593</span> | [Valid Square](https://leetcode.com/problems/valid-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-square) | Medium |
+| <span id="594">594</span> | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-harmonious-subsequence) | Easy |
+| <span id="595">595</span> | [Big Countries](https://leetcode.com/problems/big-countries) | [Go](https://github.com/openset/leetcode/tree/master/problems/big-countries) | Easy |
+| <span id="596">596</span> | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [Go](https://github.com/openset/leetcode/tree/master/problems/classes-more-than-5-students) | Easy |
+| <span id="597">597</span> | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-i-overall-acceptance-rate) | Easy |
+| <span id="598">598</span> | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-addition-ii) | Easy |
+| <span id="599">599</span> | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-index-sum-of-two-lists) | Easy |
+| <span id="600">600</span> | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/problems/non-negative-integers-without-consecutive-ones) | Hard |
+| <span id="601">601</span> | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [Go](https://github.com/openset/leetcode/tree/master/problems/human-traffic-of-stadium) | Hard |
+| <span id="602">602</span> | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-ii-who-has-the-most-friends) | Medium |
+| <span id="603">603</span> | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-available-seats) | Easy |
+| <span id="604">604</span> | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-compressed-string-iterator) | Easy |
+| <span id="605">605</span> | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [Go](https://github.com/openset/leetcode/tree/master/problems/can-place-flowers) | Easy |
+| <span id="606">606</span> | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-string-from-binary-tree) | Easy |
+| <span id="607">607</span> | [Sales Person](https://leetcode.com/problems/sales-person) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sales-person) | Easy |
+| <span id="608">608</span> | [Tree Node](https://leetcode.com/problems/tree-node) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/tree-node) | Medium |
+| <span id="609">609</span> | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-file-in-system) | Medium |
+| <span id="610">610</span> | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/triangle-judgement) | Easy |
+| <span id="611">611</span> | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-triangle-number) | Medium |
+| <span id="612">612</span> | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-plane) | Medium |
+| <span id="613">613</span> | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-line) | Easy |
+| <span id="614">614</span> | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/second-degree-follower) | Medium |
+| <span id="615">615</span> | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/average-salary-departments-vs-company) | Hard |
+| <span id="616">616</span> | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/add-bold-tag-in-string) | Medium |
+| <span id="617">617</span> | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-two-binary-trees) | Easy |
+| <span id="618">618</span> | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/students-report-by-geography) | Hard |
+| <span id="619">619</span> | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/biggest-single-number) | Easy |
+| <span id="620">620</span> | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [Go](https://github.com/openset/leetcode/tree/master/problems/not-boring-movies) | Easy |
+| <span id="621">621</span> | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [Go](https://github.com/openset/leetcode/tree/master/problems/task-scheduler) | Medium |
+| <span id="622">622</span> | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue) | Medium |
+| <span id="623">623</span> | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-one-row-to-tree) | Medium |
+| <span id="624">624</span> | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-distance-in-arrays) | Easy |
+| <span id="625">625</span> | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization) | Medium |
+| <span id="626">626</span> | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [Go](https://github.com/openset/leetcode/tree/master/problems/exchange-seats) | Medium |
+| <span id="627">627</span> | [Swap Salary](https://leetcode.com/problems/swap-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-salary) | Easy |
+| <span id="628">628</span> | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers) | Easy |
+| <span id="629">629</span> | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-inverse-pairs-array) | Hard |
+| <span id="630">630</span> | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule-iii) | Hard |
+| <span id="631">631</span> | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-excel-sum-formula) | Hard |
+| <span id="632">632</span> | [Smallest Range](https://leetcode.com/problems/smallest-range) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range) | Hard |
+| <span id="633">633</span> | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-square-numbers) | Easy |
+| <span id="634">634</span> | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-derangement-of-an-array) | Medium |
+| <span id="635">635</span> | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-log-storage-system) | Medium |
+| <span id="636">636</span> | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | [Go](https://github.com/openset/leetcode/tree/master/problems/exclusive-time-of-functions) | Medium |
+| <span id="637">637</span> | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/average-of-levels-in-binary-tree) | Easy |
+| <span id="638">638</span> | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | [Go](https://github.com/openset/leetcode/tree/master/problems/shopping-offers) | Medium |
+| <span id="639">639</span> | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-ways-ii) | Hard |
+| <span id="640">640</span> | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | [Go](https://github.com/openset/leetcode/tree/master/problems/solve-the-equation) | Medium |
+| <span id="641">641</span> | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-circular-deque) | Medium |
+| <span id="642">642</span> | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-search-autocomplete-system) | Hard |
+| <span id="643">643</span> | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-i) | Easy |
+| <span id="644">644</span> | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-ii) | Hard |
+| <span id="645">645</span> | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [Go](https://github.com/openset/leetcode/tree/master/problems/set-mismatch) | Easy |
+| <span id="646">646</span> | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-pair-chain) | Medium |
+| <span id="647">647</span> | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindromic-substrings) | Medium |
+| <span id="648">648</span> | [Replace Words](https://leetcode.com/problems/replace-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/replace-words) | Medium |
+| <span id="649">649</span> | [Dota2 Senate](https://leetcode.com/problems/dota2-senate) | [Go](https://github.com/openset/leetcode/tree/master/problems/dota2-senate) | Medium |
+| <span id="650">650</span> | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/2-keys-keyboard) | Medium |
+| <span id="651">651</span> | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard) | Medium |
+| <span id="652">652</span> | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-subtrees) | Medium |
+| <span id="653">653</span> | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-iv-input-is-a-bst) | Easy |
+| <span id="654">654</span> | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-binary-tree) | Medium |
+| <span id="655">655</span> | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/print-binary-tree) | Medium |
+| <span id="656">656</span> | [Coin Path](https://leetcode.com/problems/coin-path) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-path) | Hard |
+| <span id="657">657</span> | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [Go](https://github.com/openset/leetcode/tree/master/problems/robot-return-to-origin) | Easy |
+| <span id="658">658</span> | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-closest-elements) | Medium |
+| <span id="659">659</span> | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-into-consecutive-subsequences) | Medium |
+| <span id="660">660</span> | [Remove 9](https://leetcode.com/problems/remove-9) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-9) | Hard |
+| <span id="661">661</span> | [Image Smoother](https://leetcode.com/problems/image-smoother) | [Go](https://github.com/openset/leetcode/tree/master/problems/image-smoother) | Easy |
+| <span id="662">662</span> | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-width-of-binary-tree) | Medium |
+| <span id="663">663</span> | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/equal-tree-partition) | Medium |
+| <span id="664">664</span> | [Strange Printer](https://leetcode.com/problems/strange-printer) | [Go](https://github.com/openset/leetcode/tree/master/problems/strange-printer) | Hard |
+| <span id="665">665</span> | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/non-decreasing-array) | Easy |
+| <span id="666">666</span> | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) | Medium |
+| <span id="667">667</span> | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement-ii) | Medium |
+| <span id="668">668</span> | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-number-in-multiplication-table) | Hard |
+| <span id="669">669</span> | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/trim-a-binary-search-tree) | Easy |
+| <span id="670">670</span> | [Maximum Swap](https://leetcode.com/problems/maximum-swap) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-swap) | Medium |
+| <span id="671">671</span> | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/second-minimum-node-in-a-binary-tree) | Easy |
+| <span id="672">672</span> | [Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher-ii) | Medium |
+| <span id="673">673</span> | [Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-longest-increasing-subsequence) | Medium |
+| <span id="674">674</span> | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-continuous-increasing-subsequence) | Easy |
+| <span id="675">675</span> | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event) | [Go](https://github.com/openset/leetcode/tree/master/problems/cut-off-trees-for-golf-event) | Hard |
+| <span id="676">676</span> | [Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-magic-dictionary) | Medium |
+| <span id="677">677</span> | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/map-sum-pairs) | Medium |
+| <span id="678">678</span> | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-parenthesis-string) | Medium |
+| <span id="679">679</span> | [24 Game](https://leetcode.com/problems/24-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/24-game) | Hard |
+| <span id="680">680</span> | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-ii) | Easy |
+| <span id="681">681</span> | [Next Closest Time](https://leetcode.com/problems/next-closest-time) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/next-closest-time) | Medium |
+| <span id="682">682</span> | [Baseball Game](https://leetcode.com/problems/baseball-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/baseball-game) | Easy |
+| <span id="683">683</span> | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots) | Hard |
+| <span id="684">684</span> | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | [Go](https://github.com/openset/leetcode/tree/master/problems/redundant-connection) | Medium |
+| <span id="685">685</span> | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii) | Hard |
+| <span id="686">686</span> | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-string-match) | Easy |
+| <span id="687">687</span> | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-univalue-path) | Easy |
+| <span id="688">688</span> | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/knight-probability-in-chessboard) | Medium |
+| <span id="689">689</span> | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-3-non-overlapping-subarrays) | Hard |
+| <span id="690">690</span> | [Employee Importance](https://leetcode.com/problems/employee-importance) | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-importance) | Easy |
+| <span id="691">691</span> | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/stickers-to-spell-word) | Hard |
+| <span id="692">692</span> | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-words) | Medium |
+| <span id="693">693</span> | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-number-with-alternating-bits) | Easy |
+| <span id="694">694</span> | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands) | Medium |
+| <span id="695">695</span> | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-area-of-island) | Medium |
+| <span id="696">696</span> | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-binary-substrings) | Easy |
+| <span id="697">697</span> | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/degree-of-an-array) | Easy |
+| <span id="698">698</span> | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-to-k-equal-sum-subsets) | Medium |
+| <span id="699">699</span> | [Falling Squares](https://leetcode.com/problems/falling-squares) | [Go](https://github.com/openset/leetcode/tree/master/problems/falling-squares) | Hard |
+| <span id="700">700</span> | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-a-binary-search-tree) | Easy |
+| <span id="701">701</span> | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-binary-search-tree) | Medium |
+| <span id="702">702</span> | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-a-sorted-array-of-unknown-size) | Medium |
+| <span id="703">703</span> | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-a-stream) | Easy |
+| <span id="704">704</span> | [Binary Search](https://leetcode.com/problems/binary-search) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-search) | Easy |
+| <span id="705">705</span> | [Design HashSet](https://leetcode.com/problems/design-hashset) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hashset) | Easy |
+| <span id="706">706</span> | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hashmap) | Easy |
+| <span id="707">707</span> | [Design Linked List](https://leetcode.com/problems/design-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-linked-list) | Easy |
+| <span id="708">708</span> | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-cyclic-sorted-list) | Medium |
+| <span id="709">709</span> | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [Go](https://github.com/openset/leetcode/tree/master/problems/to-lower-case) | Easy |
+| <span id="710">710</span> | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-blacklist) | Hard |
+| <span id="711">711</span> | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii) | Hard |
+| <span id="712">712</span> | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-ascii-delete-sum-for-two-strings) | Medium |
+| <span id="713">713</span> | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k) | Medium |
+| <span id="714">714</span> | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
+| <span id="715">715</span> | [Range Module](https://leetcode.com/problems/range-module) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-module) | Hard |
+| <span id="716">716</span> | [Max Stack](https://leetcode.com/problems/max-stack) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/max-stack) | Easy |
+| <span id="717">717</span> | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | [Go](https://github.com/openset/leetcode/tree/master/problems/1-bit-and-2-bit-characters) | Easy |
+| <span id="718">718</span> | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-repeated-subarray) | Medium |
+| <span id="719">719</span> | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance) | Hard |
+| <span id="720">720</span> | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary) | Easy |
+| <span id="721">721</span> | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | [Go](https://github.com/openset/leetcode/tree/master/problems/accounts-merge) | Medium |
+| <span id="722">722</span> | [Remove Comments](https://leetcode.com/problems/remove-comments) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-comments) | Medium |
+| <span id="723">723</span> | [Candy Crush](https://leetcode.com/problems/candy-crush) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/candy-crush) | Medium |
+| <span id="724">724</span> | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-pivot-index) | Easy |
+| <span id="725">725</span> | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-linked-list-in-parts) | Medium |
+| <span id="726">726</span> | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms) | Hard |
+| <span id="727">727</span> | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-window-subsequence) | Hard |
+| <span id="728">728</span> | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/self-dividing-numbers) | Easy |
+| <span id="729">729</span> | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-i) | Medium |
+| <span id="730">730</span> | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-different-palindromic-subsequences) | Hard |
+| <span id="731">731</span> | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii) | Medium |
+| <span id="732">732</span> | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii) | Hard |
+| <span id="733">733</span> | [Flood Fill](https://leetcode.com/problems/flood-fill) | [Go](https://github.com/openset/leetcode/tree/master/problems/flood-fill) | Easy |
+| <span id="734">734</span> | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity) | Easy |
+| <span id="735">735</span> | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [Go](https://github.com/openset/leetcode/tree/master/problems/asteroid-collision) | Medium |
+| <span id="736">736</span> | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression) | [Go](https://github.com/openset/leetcode/tree/master/problems/parse-lisp-expression) | Hard |
+| <span id="737">737</span> | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii) | Medium |
+| <span id="738">738</span> | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/monotone-increasing-digits) | Medium |
+| <span id="739">739</span> | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [Go](https://github.com/openset/leetcode/tree/master/problems/daily-temperatures) | Medium |
+| <span id="740">740</span> | [Delete and Earn](https://leetcode.com/problems/delete-and-earn) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-and-earn) | Medium |
+| <span id="741">741</span> | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup) | [Go](https://github.com/openset/leetcode/tree/master/problems/cherry-pickup) | Hard |
+| <span id="742">742</span> | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-leaf-in-a-binary-tree) | Medium |
+| <span id="743">743</span> | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | [Go](https://github.com/openset/leetcode/tree/master/problems/network-delay-time) | Easy |
+| <span id="744">744</span> | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-smallest-letter-greater-than-target) | Easy |
+| <span id="745">745</span> | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search) | [Go](https://github.com/openset/leetcode/tree/master/problems/prefix-and-suffix-search) | Hard |
+| <span id="746">746</span> | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/min-cost-climbing-stairs) | Easy |
+| <span id="747">747</span> | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-number-at-least-twice-of-others) | Easy |
+| <span id="748">748</span> | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-completing-word) | Easy |
+| <span id="749">749</span> | [Contain Virus](https://leetcode.com/problems/contain-virus) | [Go](https://github.com/openset/leetcode/tree/master/problems/contain-virus) | Hard |
+| <span id="750">750</span> | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-corner-rectangles) | Medium |
+| <span id="751">751</span> | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/ip-to-cidr) | Easy |
+| <span id="752">752</span> | [Open the Lock](https://leetcode.com/problems/open-the-lock) | [Go](https://github.com/openset/leetcode/tree/master/problems/open-the-lock) | Medium |
+| <span id="753">753</span> | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | [Go](https://github.com/openset/leetcode/tree/master/problems/cracking-the-safe) | Hard |
+| <span id="754">754</span> | [Reach a Number](https://leetcode.com/problems/reach-a-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/reach-a-number) | Easy |
+| <span id="755">755</span> | [Pour Water](https://leetcode.com/problems/pour-water) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/pour-water) | Medium |
+| <span id="756">756</span> | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/pyramid-transition-matrix) | Medium |
+| <span id="757">757</span> | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two) | [Go](https://github.com/openset/leetcode/tree/master/problems/set-intersection-size-at-least-two) | Hard |
+| <span id="758">758</span> | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/bold-words-in-string) | Easy |
+| <span id="759">759</span> | [Employee Free Time](https://leetcode.com/problems/employee-free-time) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-free-time) | Hard |
+| <span id="760">760</span> | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-anagram-mappings) | Easy |
+| <span id="761">761</span> | [Special Binary String](https://leetcode.com/problems/special-binary-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/special-binary-string) | Hard |
+| <span id="762">762</span> | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [Go](https://github.com/openset/leetcode/tree/master/problems/prime-number-of-set-bits-in-binary-representation) | Easy |
+| <span id="763">763</span> | [Partition Labels](https://leetcode.com/problems/partition-labels) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-labels) | Medium |
+| <span id="764">764</span> | [Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-plus-sign) | Medium |
+| <span id="765">765</span> | [Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands) | [Go](https://github.com/openset/leetcode/tree/master/problems/couples-holding-hands) | Hard |
+| <span id="766">766</span> | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/toeplitz-matrix) | Easy |
+| <span id="767">767</span> | [Reorganize String](https://leetcode.com/problems/reorganize-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reorganize-string) | Medium |
+| <span id="768">768</span> | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted-ii) | Hard |
+| <span id="769">769</span> | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted) | Medium |
+| <span id="770">770</span> | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv) | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iv) | Hard |
+| <span id="771">771</span> | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | [Go](https://github.com/openset/leetcode/tree/master/problems/jewels-and-stones) | Easy |
+| <span id="772">772</span> | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) | Hard |
+| <span id="773">773</span> | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle) | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-puzzle) | Hard |
+| <span id="774">774</span> | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station) | Hard |
+| <span id="775">775</span> | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | [Go](https://github.com/openset/leetcode/tree/master/problems/global-and-local-inversions) | Medium |
+| <span id="776">776</span> | [Split BST](https://leetcode.com/problems/split-bst) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-bst) | Medium |
+| <span id="777">777</span> | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-adjacent-in-lr-string) | Medium |
+| <span id="778">778</span> | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water) | [Go](https://github.com/openset/leetcode/tree/master/problems/swim-in-rising-water) | Hard |
+| <span id="779">779</span> | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-symbol-in-grammar) | Medium |
+| <span id="780">780</span> | [Reaching Points](https://leetcode.com/problems/reaching-points) | [Go](https://github.com/openset/leetcode/tree/master/problems/reaching-points) | Hard |
+| <span id="781">781</span> | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest) | [Go](https://github.com/openset/leetcode/tree/master/problems/rabbits-in-forest) | Medium |
+| <span id="782">782</span> | [Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/transform-to-chessboard) | Hard |
+| <span id="783">783</span> | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes) | Easy |
+| <span id="784">784</span> | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation) | [Go](https://github.com/openset/leetcode/tree/master/problems/letter-case-permutation) | Easy |
+| <span id="785">785</span> | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite) | [Go](https://github.com/openset/leetcode/tree/master/problems/is-graph-bipartite) | Medium |
+| <span id="786">786</span> | [K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-prime-fraction) | Hard |
+| <span id="787">787</span> | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops) | [Go](https://github.com/openset/leetcode/tree/master/problems/cheapest-flights-within-k-stops) | Medium |
+| <span id="788">788</span> | [Rotated Digits](https://leetcode.com/problems/rotated-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotated-digits) | Easy |
+| <span id="789">789</span> | [Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts) | [Go](https://github.com/openset/leetcode/tree/master/problems/escape-the-ghosts) | Medium |
+| <span id="790">790</span> | [Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling) | [Go](https://github.com/openset/leetcode/tree/master/problems/domino-and-tromino-tiling) | Medium |
+| <span id="791">791</span> | [Custom Sort String](https://leetcode.com/problems/custom-sort-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/custom-sort-string) | Medium |
+| <span id="792">792</span> | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-matching-subsequences) | Medium |
+| <span id="793">793</span> | [Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function) | [Go](https://github.com/openset/leetcode/tree/master/problems/preimage-size-of-factorial-zeroes-function) | Hard |
+| <span id="794">794</span> | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-tic-tac-toe-state) | Medium |
+| <span id="795">795</span> | [Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-subarrays-with-bounded-maximum) | Medium |
+| <span id="796">796</span> | [Rotate String](https://leetcode.com/problems/rotate-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-string) | Easy |
+| <span id="797">797</span> | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-paths-from-source-to-target) | Medium |
+| <span id="798">798</span> | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-rotation-with-highest-score) | Hard |
+| <span id="799">799</span> | [Champagne Tower](https://leetcode.com/problems/champagne-tower) | [Go](https://github.com/openset/leetcode/tree/master/problems/champagne-tower) | Medium |
+| <span id="800">800</span> | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color) | Easy |
+| <span id="801">801</span> | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-make-sequences-increasing) | Medium |
+| <span id="802">802</span> | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-eventual-safe-states) | Medium |
+| <span id="803">803</span> | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit) | [Go](https://github.com/openset/leetcode/tree/master/problems/bricks-falling-when-hit) | Hard |
+| <span id="804">804</span> | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-morse-code-words) | Easy |
+| <span id="805">805</span> | [Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-with-same-average) | Hard |
+| <span id="806">806</span> | [Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-lines-to-write-string) | Easy |
+| <span id="807">807</span> | [Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-increase-to-keep-city-skyline) | Medium |
+| <span id="808">808</span> | [Soup Servings](https://leetcode.com/problems/soup-servings) | [Go](https://github.com/openset/leetcode/tree/master/problems/soup-servings) | Medium |
+| <span id="809">809</span> | [Expressive Words](https://leetcode.com/problems/expressive-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/expressive-words) | Medium |
+| <span id="810">810</span> | [Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/chalkboard-xor-game) | Hard |
+| <span id="811">811</span> | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count) | [Go](https://github.com/openset/leetcode/tree/master/problems/subdomain-visit-count) | Easy |
+| <span id="812">812</span> | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-triangle-area) | Easy |
+| <span id="813">813</span> | [Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-sum-of-averages) | Medium |
+| <span id="814">814</span> | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-pruning) | Medium |
+| <span id="815">815</span> | [Bus Routes](https://leetcode.com/problems/bus-routes) | [Go](https://github.com/openset/leetcode/tree/master/problems/bus-routes) | Hard |
+| <span id="816">816</span> | [Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates) | [Go](https://github.com/openset/leetcode/tree/master/problems/ambiguous-coordinates) | Medium |
+| <span id="817">817</span> | [Linked List Components](https://leetcode.com/problems/linked-list-components) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-components) | Medium |
+| <span id="818">818</span> | [Race Car](https://leetcode.com/problems/race-car) | [Go](https://github.com/openset/leetcode/tree/master/problems/race-car) | Hard |
+| <span id="819">819</span> | [Most Common Word](https://leetcode.com/problems/most-common-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-common-word) | Easy |
+| <span id="820">820</span> | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/short-encoding-of-words) | Medium |
+| <span id="821">821</span> | [Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-to-a-character) | Easy |
+| <span id="822">822</span> | [Card Flipping Game](https://leetcode.com/problems/card-flipping-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/card-flipping-game) | Medium |
+| <span id="823">823</span> | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-trees-with-factors) | Medium |
+| <span id="824">824</span> | [Goat Latin](https://leetcode.com/problems/goat-latin) | [Go](https://github.com/openset/leetcode/tree/master/problems/goat-latin) | Easy |
+| <span id="825">825</span> | [Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages) | [Go](https://github.com/openset/leetcode/tree/master/problems/friends-of-appropriate-ages) | Medium |
+| <span id="826">826</span> | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-profit-assigning-work) | Medium |
+| <span id="827">827</span> | [Making A Large Island](https://leetcode.com/problems/making-a-large-island) | [Go](https://github.com/openset/leetcode/tree/master/problems/making-a-large-island) | Hard |
+| <span id="828">828</span> | [Unique Letter String](https://leetcode.com/problems/unique-letter-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-letter-string) | Hard |
+| <span id="829">829</span> | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers-sum) | Hard |
+| <span id="830">830</span> | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups) | [Go](https://github.com/openset/leetcode/tree/master/problems/positions-of-large-groups) | Easy |
+| <span id="831">831</span> | [Masking Personal Information](https://leetcode.com/problems/masking-personal-information) | [Go](https://github.com/openset/leetcode/tree/master/problems/masking-personal-information) | Medium |
+| <span id="832">832</span> | [Flipping an Image](https://leetcode.com/problems/flipping-an-image) | [Go](https://github.com/openset/leetcode/tree/master/problems/flipping-an-image) | Easy |
+| <span id="833">833</span> | [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-in-string) | Medium |
+| <span id="834">834</span> | [Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-distances-in-tree) | Hard |
+| <span id="835">835</span> | [Image Overlap](https://leetcode.com/problems/image-overlap) | [Go](https://github.com/openset/leetcode/tree/master/problems/image-overlap) | Medium |
+| <span id="836">836</span> | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | [Go](https://github.com/openset/leetcode/tree/master/problems/rectangle-overlap) | Easy |
+| <span id="837">837</span> | [New 21 Game](https://leetcode.com/problems/new-21-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/new-21-game) | Medium |
+| <span id="838">838</span> | [Push Dominoes](https://leetcode.com/problems/push-dominoes) | [Go](https://github.com/openset/leetcode/tree/master/problems/push-dominoes) | Medium |
+| <span id="839">839</span> | [Similar String Groups](https://leetcode.com/problems/similar-string-groups) | [Go](https://github.com/openset/leetcode/tree/master/problems/similar-string-groups) | Hard |
+| <span id="840">840</span> | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid) | [Go](https://github.com/openset/leetcode/tree/master/problems/magic-squares-in-grid) | Easy |
+| <span id="841">841</span> | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms) | [Go](https://github.com/openset/leetcode/tree/master/problems/keys-and-rooms) | Medium |
+| <span id="842">842</span> | [Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-into-fibonacci-sequence) | Medium |
+| <span id="843">843</span> | [Guess the Word](https://leetcode.com/problems/guess-the-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/guess-the-word) | Hard |
+| <span id="844">844</span> | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | [Go](https://github.com/openset/leetcode/tree/master/problems/backspace-string-compare) | Easy |
+| <span id="845">845</span> | [Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-mountain-in-array) | Medium |
+| <span id="846">846</span> | [Hand of Straights](https://leetcode.com/problems/hand-of-straights) | [Go](https://github.com/openset/leetcode/tree/master/problems/hand-of-straights) | Medium |
+| <span id="847">847</span> | [Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-path-visiting-all-nodes) | Hard |
+| <span id="848">848</span> | [Shifting Letters](https://leetcode.com/problems/shifting-letters) | [Go](https://github.com/openset/leetcode/tree/master/problems/shifting-letters) | Medium |
+| <span id="849">849</span> | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximize-distance-to-closest-person) | Easy |
+| <span id="850">850</span> | [Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/rectangle-area-ii) | Hard |
+| <span id="851">851</span> | [Loud and Rich](https://leetcode.com/problems/loud-and-rich) | [Go](https://github.com/openset/leetcode/tree/master/problems/loud-and-rich) | Medium |
+| <span id="852">852</span> | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/peak-index-in-a-mountain-array) | Easy |
+| <span id="853">853</span> | [Car Fleet](https://leetcode.com/problems/car-fleet) | [Go](https://github.com/openset/leetcode/tree/master/problems/car-fleet) | Medium |
+| <span id="854">854</span> | [K-Similar Strings](https://leetcode.com/problems/k-similar-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-similar-strings) | Hard |
+| <span id="855">855</span> | [Exam Room](https://leetcode.com/problems/exam-room) | [Go](https://github.com/openset/leetcode/tree/master/problems/exam-room) | Medium |
+| <span id="856">856</span> | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/score-of-parentheses) | Medium |
+| <span id="857">857</span> | [Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-hire-k-workers) | Hard |
+| <span id="858">858</span> | [Mirror Reflection](https://leetcode.com/problems/mirror-reflection) | [Go](https://github.com/openset/leetcode/tree/master/problems/mirror-reflection) | Medium |
+| <span id="859">859</span> | [Buddy Strings](https://leetcode.com/problems/buddy-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/buddy-strings) | Easy |
+| <span id="860">860</span> | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [Go](https://github.com/openset/leetcode/tree/master/problems/lemonade-change) | Easy |
+| <span id="861">861</span> | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/score-after-flipping-matrix) | Medium |
+| <span id="862">862</span> | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-subarray-with-sum-at-least-k) | Hard |
+| <span id="863">863</span> | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-nodes-distance-k-in-binary-tree) | Medium |
+| <span id="864">864</span> | [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-path-to-get-all-keys) | Hard |
+| <span id="865">865</span> | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-subtree-with-all-the-deepest-nodes) | Medium |
+| <span id="866">866</span> | [Prime Palindrome](https://leetcode.com/problems/prime-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/prime-palindrome) | Medium |
+| <span id="867">867</span> | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/transpose-matrix) | Easy |
+| <span id="868">868</span> | [Binary Gap](https://leetcode.com/problems/binary-gap) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-gap) | Easy |
+| <span id="869">869</span> | [Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2) | [Go](https://github.com/openset/leetcode/tree/master/problems/reordered-power-of-2) | Medium |
+| <span id="870">870</span> | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle) | [Go](https://github.com/openset/leetcode/tree/master/problems/advantage-shuffle) | Medium |
+| <span id="871">871</span> | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-refueling-stops) | Hard |
+| <span id="872">872</span> | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/leaf-similar-trees) | Easy |
+| <span id="873">873</span> | [Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/length-of-longest-fibonacci-subsequence) | Medium |
+| <span id="874">874</span> | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation) | [Go](https://github.com/openset/leetcode/tree/master/problems/walking-robot-simulation) | Easy |
+| <span id="875">875</span> | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas) | [Go](https://github.com/openset/leetcode/tree/master/problems/koko-eating-bananas) | Medium |
+| <span id="876">876</span> | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/middle-of-the-linked-list) | Easy |
+| <span id="877">877</span> | [Stone Game](https://leetcode.com/problems/stone-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/stone-game) | Medium |
+| <span id="878">878</span> | [Nth Magical Number](https://leetcode.com/problems/nth-magical-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/nth-magical-number) | Hard |
+| <span id="879">879</span> | [Profitable Schemes](https://leetcode.com/problems/profitable-schemes) | [Go](https://github.com/openset/leetcode/tree/master/problems/profitable-schemes) | Hard |
+| <span id="880">880</span> | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/decoded-string-at-index) | Medium |
+| <span id="881">881</span> | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people) | [Go](https://github.com/openset/leetcode/tree/master/problems/boats-to-save-people) | Medium |
+| <span id="882">882</span> | [Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph) | [Go](https://github.com/openset/leetcode/tree/master/problems/reachable-nodes-in-subdivided-graph) | Hard |
+| <span id="883">883</span> | [Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/problems/projection-area-of-3d-shapes) | Easy |
+| <span id="884">884</span> | [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences) | [Go](https://github.com/openset/leetcode/tree/master/problems/uncommon-words-from-two-sentences) | Easy |
+| <span id="885">885</span> | [Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-iii) | Medium |
+| <span id="886">886</span> | [Possible Bipartition](https://leetcode.com/problems/possible-bipartition) | [Go](https://github.com/openset/leetcode/tree/master/problems/possible-bipartition) | Medium |
+| <span id="887">887</span> | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-egg-drop) | Hard |
+| <span id="888">888</span> | [Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap) | [Go](https://github.com/openset/leetcode/tree/master/problems/fair-candy-swap) | Easy |
+| <span id="889">889</span> | [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | Medium |
+| <span id="890">890</span> | [Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-pattern) | Medium |
+| <span id="891">891</span> | [Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-subsequence-widths) | Hard |
+| <span id="892">892</span> | [Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/problems/surface-area-of-3d-shapes) | Easy |
+| <span id="893">893</span> | [Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/groups-of-special-equivalent-strings) | Easy |
+| <span id="894">894</span> | [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-possible-full-binary-trees) | Medium |
+| <span id="895">895</span> | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-frequency-stack) | Hard |
+| <span id="896">896</span> | [Monotonic Array](https://leetcode.com/problems/monotonic-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/monotonic-array) | Easy |
+| <span id="897">897</span> | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-order-search-tree) | Easy |
+| <span id="898">898</span> | [Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/bitwise-ors-of-subarrays) | Medium |
+| <span id="899">899</span> | [Orderly Queue](https://leetcode.com/problems/orderly-queue) | [Go](https://github.com/openset/leetcode/tree/master/problems/orderly-queue) | Hard |
+| <span id="900">900</span> | [RLE Iterator](https://leetcode.com/problems/rle-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/rle-iterator) | Medium |
+| <span id="901">901</span> | [Online Stock Span](https://leetcode.com/problems/online-stock-span) | [Go](https://github.com/openset/leetcode/tree/master/problems/online-stock-span) | Medium |
+| <span id="902">902</span> | [Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set) | [Go](https://github.com/openset/leetcode/tree/master/problems/numbers-at-most-n-given-digit-set) | Hard |
+| <span id="903">903</span> | [Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-permutations-for-di-sequence) | Hard |
+| <span id="904">904</span> | [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets) | [Go](https://github.com/openset/leetcode/tree/master/problems/fruit-into-baskets) | Medium |
+| <span id="905">905</span> | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity) | Easy |
+| <span id="906">906</span> | [Super Palindromes](https://leetcode.com/problems/super-palindromes) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-palindromes) | Hard |
+| <span id="907">907</span> | [Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-subarray-minimums) | Medium |
+| <span id="908">908</span> | [Smallest Range I](https://leetcode.com/problems/smallest-range-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range-i) | Easy |
+| <span id="909">909</span> | [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders) | [Go](https://github.com/openset/leetcode/tree/master/problems/snakes-and-ladders) | Medium |
+| <span id="910">910</span> | [Smallest Range II](https://leetcode.com/problems/smallest-range-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range-ii) | Medium |
+| <span id="911">911</span> | [Online Election](https://leetcode.com/problems/online-election) | [Go](https://github.com/openset/leetcode/tree/master/problems/online-election) | Medium |
+| <span id="913">913</span> | [Cat and Mouse](https://leetcode.com/problems/cat-and-mouse) | [Go](https://github.com/openset/leetcode/tree/master/problems/cat-and-mouse) | Hard |
+| <span id="914">914</span> | [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | [Go](https://github.com/openset/leetcode/tree/master/problems/x-of-a-kind-in-a-deck-of-cards) | Easy |
+| <span id="915">915</span> | [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-array-into-disjoint-intervals) | Medium |
+| <span id="916">916</span> | [Word Subsets](https://leetcode.com/problems/word-subsets) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-subsets) | Medium |
+| <span id="917">917</span> | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-only-letters) | Easy |
+| <span id="918">918</span> | [Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-circular-subarray) | Medium |
+| <span id="919">919</span> | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter) | [Go](https://github.com/openset/leetcode/tree/master/problems/complete-binary-tree-inserter) | Medium |
+| <span id="920">920</span> | [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-music-playlists) | Hard |
+| <span id="921">921</span> | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-add-to-make-parentheses-valid) | Medium |
+| <span id="922">922</span> | [Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity-ii) | Easy |
+| <span id="923">923</span> | [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity) | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-with-multiplicity) | Medium |
+| <span id="924">924</span> | [Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread) | Hard |
+| <span id="925">925</span> | [Long Pressed Name](https://leetcode.com/problems/long-pressed-name) | [Go](https://github.com/openset/leetcode/tree/master/problems/long-pressed-name) | Easy |
+| <span id="926">926</span> | [Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing) | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-string-to-monotone-increasing) | Medium |
+| <span id="927">927</span> | [Three Equal Parts](https://leetcode.com/problems/three-equal-parts) | [Go](https://github.com/openset/leetcode/tree/master/problems/three-equal-parts) | Hard |
+| <span id="928">928</span> | [Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread-ii) | Hard |
+| <span id="929">929</span> | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-email-addresses) | Easy |
+| <span id="930">930</span> | [Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-subarrays-with-sum) | Medium |
+| <span id="931">931</span> | [Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-falling-path-sum) | Medium |
+| <span id="932">932</span> | [Beautiful Array](https://leetcode.com/problems/beautiful-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-array) | Medium |
+| <span id="933">933</span> | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-recent-calls) | Easy |
+| <span id="934">934</span> | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-bridge) | Medium |
+| <span id="935">935</span> | [Knight Dialer](https://leetcode.com/problems/knight-dialer) | [Go](https://github.com/openset/leetcode/tree/master/problems/knight-dialer) | Medium |
+| <span id="936">936</span> | [Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/stamping-the-sequence) | Hard |
+| <span id="937">937</span> | [Reorder Log Files](https://leetcode.com/problems/reorder-log-files) | [Go](https://github.com/openset/leetcode/tree/master/problems/reorder-log-files) | Easy |
+| <span id="938">938</span> | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-of-bst) | Medium |
+| <span id="939">939</span> | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle) | Medium |
+| <span id="940">940</span> | [Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences-ii) | Hard |
+| <span id="941">941</span> | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-mountain-array) | Easy |
+| <span id="942">942</span> | [DI String Match](https://leetcode.com/problems/di-string-match) | [Go](https://github.com/openset/leetcode/tree/master/problems/di-string-match) | Easy |
+| <span id="943">943</span> | [Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-shortest-superstring) | Hard |
+| <span id="944">944</span> | [Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted) | Easy |
+| <span id="945">945</span> | [Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-increment-to-make-array-unique) | Medium |
+| <span id="946">946</span> | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-stack-sequences) | Medium |
+| <span id="947">947</span> | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-stones-removed-with-same-row-or-column) | Medium |
+| <span id="948">948</span> | [Bag of Tokens](https://leetcode.com/problems/bag-of-tokens) | [Go](https://github.com/openset/leetcode/tree/master/problems/bag-of-tokens) | Medium |
+| <span id="949">949</span> | [Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-time-for-given-digits) | Easy |
+| <span id="950">950</span> | [Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order) | [Go](https://github.com/openset/leetcode/tree/master/problems/reveal-cards-in-increasing-order) | Medium |
+| <span id="951">951</span> | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-equivalent-binary-trees) | Medium |
+| <span id="952">952</span> | [Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-component-size-by-common-factor) | Hard |
+| <span id="953">953</span> | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/problems/verifying-an-alien-dictionary) | Easy |
+| <span id="954">954</span> | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/array-of-doubled-pairs) | Medium |
+| <span id="955">955</span> | [Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-ii) | Medium |
+| <span id="956">956</span> | [Tallest Billboard](https://leetcode.com/problems/tallest-billboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/tallest-billboard) | Hard |
+| <span id="957">957</span> | [Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days) | [Go](https://github.com/openset/leetcode/tree/master/problems/prison-cells-after-n-days) | Medium |
+| <span id="958">958</span> | [Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/check-completeness-of-a-binary-tree) | Medium |
+| <span id="959">959</span> | [Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes) | [Go](https://github.com/openset/leetcode/tree/master/problems/regions-cut-by-slashes) | Medium |
+| <span id="960">960</span> | [Delete Columns to Make Sorted III](https://leetcode.com/problems/delete-columns-to-make-sorted-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-iii) | Hard |
+| <span id="961">961</span> | [N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-repeated-element-in-size-2n-array) | Easy |
+| <span id="962">962</span> | [Maximum Width Ramp](https://leetcode.com/problems/maximum-width-ramp) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-width-ramp) | Medium |
+| <span id="963">963</span> | [Minimum Area Rectangle II](https://leetcode.com/problems/minimum-area-rectangle-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle-ii) | Medium |
+| <span id="964">964</span> | [Least Operators to Express Number](https://leetcode.com/problems/least-operators-to-express-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/least-operators-to-express-number) | Hard |

From 73eb5b730b4628d6c3f86759d2a68b97e5ba4beb Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Mon, 24 Dec 2018 13:45:06 +0800
Subject: [PATCH 14/22] Add: tags

---
 index.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/index.md b/index.md
index 7eae62758..1567736f7 100644
--- a/index.md
+++ b/index.md
@@ -7,6 +7,7 @@
 
 # [LeetCode](https://openset.github.io/leetcode)
 LeetCode Problems' Solutions
+[[话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md)]
 
 [![Build Status](https://travis-ci.org/openset/leetcode.svg?branch=master)](https://travis-ci.org/openset/leetcode)
 [![codecov](https://codecov.io/gh/openset/leetcode/branch/master/graph/badge.svg)](https://codecov.io/gh/openset/leetcode)

From bf6ccdc91f08c8c848c5d7900fb773c8272e9efb Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Wed, 2 Jan 2019 09:07:58 +0800
Subject: [PATCH 15/22] Update: page

---
 index.md | 1916 +++++++++++++++++++++++++++---------------------------
 1 file changed, 960 insertions(+), 956 deletions(-)

diff --git a/index.md b/index.md
index 1567736f7..efe67f1bc 100644
--- a/index.md
+++ b/index.md
@@ -53,960 +53,964 @@ LeetCode Problems' Solutions
 
 | # | Title | Solution | Difficulty |
 | :-: | - | - | :-: |
-| <span id="1">1</span> | [Two Sum](https://leetcode.com/problems/two-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum) | Easy |
-| <span id="2">2</span> | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers) | Medium |
-| <span id="3">3</span> | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-without-repeating-characters) | Medium |
-| <span id="4">4</span> | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/median-of-two-sorted-arrays) | Hard |
-| <span id="5">5</span> | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-substring) | Medium |
-| <span id="6">6</span> | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | [Go](https://github.com/openset/leetcode/tree/master/problems/zigzag-conversion) | Medium |
-| <span id="7">7</span> | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-integer) | Easy |
-| <span id="8">8</span> | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | [Go](https://github.com/openset/leetcode/tree/master/problems/string-to-integer-atoi) | Medium |
-| <span id="9">9</span> | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-number) | Easy |
-| <span id="10">10</span> | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | [Go](https://github.com/openset/leetcode/tree/master/problems/regular-expression-matching) | Hard |
-| <span id="11">11</span> | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [Go](https://github.com/openset/leetcode/tree/master/problems/container-with-most-water) | Medium |
-| <span id="12">12</span> | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-to-roman) | Medium |
-| <span id="13">13</span> | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | [Go](https://github.com/openset/leetcode/tree/master/problems/roman-to-integer) | Easy |
-| <span id="14">14</span> | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-common-prefix) | Easy |
-| <span id="15">15</span> | [3Sum](https://leetcode.com/problems/3sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum) | Medium |
-| <span id="16">16</span> | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-closest) | Medium |
-| <span id="17">17</span> | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/letter-combinations-of-a-phone-number) | Medium |
-| <span id="18">18</span> | [4Sum](https://leetcode.com/problems/4sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/4sum) | Medium |
-| <span id="19">19</span> | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-nth-node-from-end-of-list) | Medium |
-| <span id="20">20</span> | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-parentheses) | Easy |
-| <span id="21">21</span> | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-two-sorted-lists) | Easy |
-| <span id="22">22</span> | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/generate-parentheses) | Medium |
-| <span id="23">23</span> | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-k-sorted-lists) | Hard |
-| <span id="24">24</span> | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-nodes-in-pairs) | Medium |
-| <span id="25">25</span> | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-nodes-in-k-group) | Hard |
-| <span id="26">26</span> | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array) | Easy |
-| <span id="27">27</span> | [Remove Element](https://leetcode.com/problems/remove-element) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-element) | Easy |
-| <span id="28">28</span> | [Implement strStr()](https://leetcode.com/problems/implement-strstr) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-strstr) | Easy |
-| <span id="29">29</span> | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/problems/divide-two-integers) | Medium |
-| <span id="30">30</span> | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/substring-with-concatenation-of-all-words) | Hard |
-| <span id="31">31</span> | [Next Permutation](https://leetcode.com/problems/next-permutation) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-permutation) | Medium |
-| <span id="32">32</span> | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-valid-parentheses) | Hard |
-| <span id="33">33</span> | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array) | Medium |
-| <span id="34">34</span> | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-first-and-last-position-of-element-in-sorted-array) | Medium |
-| <span id="35">35</span> | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-insert-position) | Easy |
-| <span id="36">36</span> | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-sudoku) | Medium |
-| <span id="37">37</span> | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | [Go](https://github.com/openset/leetcode/tree/master/problems/sudoku-solver) | Hard |
-| <span id="38">38</span> | [Count and Say](https://leetcode.com/problems/count-and-say) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-and-say) | Easy |
-| <span id="39">39</span> | [Combination Sum](https://leetcode.com/problems/combination-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum) | Medium |
-| <span id="40">40</span> | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-ii) | Medium |
-| <span id="41">41</span> | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | [Go](https://github.com/openset/leetcode/tree/master/problems/first-missing-positive) | Hard |
-| <span id="42">42</span> | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | [Go](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water) | Hard |
-| <span id="43">43</span> | [Multiply Strings](https://leetcode.com/problems/multiply-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/multiply-strings) | Medium |
-| <span id="44">44</span> | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | [Go](https://github.com/openset/leetcode/tree/master/problems/wildcard-matching) | Hard |
-| <span id="45">45</span> | [Jump Game II](https://leetcode.com/problems/jump-game-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/jump-game-ii) | Hard |
-| <span id="46">46</span> | [Permutations](https://leetcode.com/problems/permutations) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutations) | Medium |
-| <span id="47">47</span> | [Permutations II](https://leetcode.com/problems/permutations-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutations-ii) | Medium |
-| <span id="48">48</span> | [Rotate Image](https://leetcode.com/problems/rotate-image) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-image) | Medium |
-| <span id="49">49</span> | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | [Go](https://github.com/openset/leetcode/tree/master/problems/group-anagrams) | Medium |
-| <span id="50">50</span> | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [Go](https://github.com/openset/leetcode/tree/master/problems/powx-n) | Medium |
-| <span id="51">51</span> | [N-Queens](https://leetcode.com/problems/n-queens) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-queens) | Hard |
-| <span id="52">52</span> | [N-Queens II](https://leetcode.com/problems/n-queens-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-queens-ii) | Hard |
-| <span id="53">53</span> | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray) | Easy |
-| <span id="54">54</span> | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix) | Medium |
-| <span id="55">55</span> | [Jump Game](https://leetcode.com/problems/jump-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/jump-game) | Medium |
-| <span id="56">56</span> | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) | Medium |
-| <span id="57">57</span> | [Insert Interval](https://leetcode.com/problems/insert-interval) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-interval) | Hard |
-| <span id="58">58</span> | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/length-of-last-word) | Easy |
-| <span id="59">59</span> | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-ii) | Medium |
-| <span id="60">60</span> | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutation-sequence) | Medium |
-| <span id="61">61</span> | [Rotate List](https://leetcode.com/problems/rotate-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-list) | Medium |
-| <span id="62">62</span> | [Unique Paths](https://leetcode.com/problems/unique-paths) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-paths) | Medium |
-| <span id="63">63</span> | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-paths-ii) | Medium |
-| <span id="64">64</span> | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-path-sum) | Medium |
-| <span id="65">65</span> | [Valid Number](https://leetcode.com/problems/valid-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-number) | Hard |
-| <span id="66">66</span> | [Plus One](https://leetcode.com/problems/plus-one) | [Go](https://github.com/openset/leetcode/tree/master/problems/plus-one) | Easy |
-| <span id="67">67</span> | [Add Binary](https://leetcode.com/problems/add-binary) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-binary) | Easy |
-| <span id="68">68</span> | [Text Justification](https://leetcode.com/problems/text-justification) | [Go](https://github.com/openset/leetcode/tree/master/problems/text-justification) | Hard |
-| <span id="69">69</span> | [Sqrt(x)](https://leetcode.com/problems/sqrtx) | [Go](https://github.com/openset/leetcode/tree/master/problems/sqrtx) | Easy |
-| <span id="70">70</span> | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/climbing-stairs) | Easy |
-| <span id="71">71</span> | [Simplify Path](https://leetcode.com/problems/simplify-path) | [Go](https://github.com/openset/leetcode/tree/master/problems/simplify-path) | Medium |
-| <span id="72">72</span> | [Edit Distance](https://leetcode.com/problems/edit-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/edit-distance) | Hard |
-| <span id="73">73</span> | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/set-matrix-zeroes) | Medium |
-| <span id="74">74</span> | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix) | Medium |
-| <span id="75">75</span> | [Sort Colors](https://leetcode.com/problems/sort-colors) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-colors) | Medium |
-| <span id="76">76</span> | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring) | Hard |
-| <span id="77">77</span> | [Combinations](https://leetcode.com/problems/combinations) | [Go](https://github.com/openset/leetcode/tree/master/problems/combinations) | Medium |
-| <span id="78">78</span> | [Subsets](https://leetcode.com/problems/subsets) | [Go](https://github.com/openset/leetcode/tree/master/problems/subsets) | Medium |
-| <span id="79">79</span> | [Word Search](https://leetcode.com/problems/word-search) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-search) | Medium |
-| <span id="80">80</span> | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array-ii) | Medium |
-| <span id="81">81</span> | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array-ii) | Medium |
-| <span id="82">82</span> | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list-ii) | Medium |
-| <span id="83">83</span> | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list) | Easy |
-| <span id="84">84</span> | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-rectangle-in-histogram) | Hard |
-| <span id="85">85</span> | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximal-rectangle) | Hard |
-| <span id="86">86</span> | [Partition List](https://leetcode.com/problems/partition-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-list) | Medium |
-| <span id="87">87</span> | [Scramble String](https://leetcode.com/problems/scramble-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/scramble-string) | Hard |
-| <span id="88">88</span> | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-sorted-array) | Easy |
-| <span id="89">89</span> | [Gray Code](https://leetcode.com/problems/gray-code) | [Go](https://github.com/openset/leetcode/tree/master/problems/gray-code) | Medium |
-| <span id="90">90</span> | [Subsets II](https://leetcode.com/problems/subsets-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/subsets-ii) | Medium |
-| <span id="91">91</span> | [Decode Ways](https://leetcode.com/problems/decode-ways) | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-ways) | Medium |
-| <span id="92">92</span> | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list-ii) | Medium |
-| <span id="93">93</span> | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | [Go](https://github.com/openset/leetcode/tree/master/problems/restore-ip-addresses) | Medium |
-| <span id="94">94</span> | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) | Medium |
-| <span id="95">95</span> | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees-ii) | Medium |
-| <span id="96">96</span> | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees) | Medium |
-| <span id="97">97</span> | [Interleaving String](https://leetcode.com/problems/interleaving-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/interleaving-string) | Hard |
-| <span id="98">98</span> | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-binary-search-tree) | Medium |
-| <span id="99">99</span> | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/recover-binary-search-tree) | Hard |
-| <span id="100">100</span> | [Same Tree](https://leetcode.com/problems/same-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/same-tree) | Easy |
-| <span id="101">101</span> | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/symmetric-tree) | Easy |
-| <span id="102">102</span> | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal) | Medium |
-| <span id="103">103</span> | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-zigzag-level-order-traversal) | Medium |
-| <span id="104">104</span> | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-binary-tree) | Easy |
-| <span id="105">105</span> | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium |
-| <span id="106">106</span> | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | Medium |
-| <span id="107">107</span> | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal-ii) | Easy |
-| <span id="108">108</span> | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-array-to-binary-search-tree) | Easy |
-| <span id="109">109</span> | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-list-to-binary-search-tree) | Medium |
-| <span id="110">110</span> | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/balanced-binary-tree) | Easy |
-| <span id="111">111</span> | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-depth-of-binary-tree) | Easy |
-| <span id="112">112</span> | [Path Sum](https://leetcode.com/problems/path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum) | Easy |
-| <span id="113">113</span> | [Path Sum II](https://leetcode.com/problems/path-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-ii) | Medium |
-| <span id="114">114</span> | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-binary-tree-to-linked-list) | Medium |
-| <span id="115">115</span> | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences) | Hard |
-| <span id="116">116</span> | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | [Go](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node) | Medium |
-| <span id="117">117</span> | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node-ii) | Medium |
-| <span id="118">118</span> | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle) | Easy |
-| <span id="119">119</span> | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle-ii) | Easy |
-| <span id="120">120</span> | [Triangle](https://leetcode.com/problems/triangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/triangle) | Medium |
-| <span id="121">121</span> | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) | Easy |
-| <span id="122">122</span> | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) | Easy |
-| <span id="123">123</span> | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii) | Hard |
-| <span id="124">124</span> | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-maximum-path-sum) | Hard |
-| <span id="125">125</span> | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome) | Easy |
-| <span id="126">126</span> | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-ladder-ii) | Hard |
-| <span id="127">127</span> | [Word Ladder](https://leetcode.com/problems/word-ladder) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-ladder) | Medium |
-| <span id="128">128</span> | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-consecutive-sequence) | Hard |
-| <span id="129">129</span> | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-root-to-leaf-numbers) | Medium |
-| <span id="130">130</span> | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions) | [Go](https://github.com/openset/leetcode/tree/master/problems/surrounded-regions) | Medium |
-| <span id="131">131</span> | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning) | Medium |
-| <span id="132">132</span> | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning-ii) | Hard |
-| <span id="133">133</span> | [Clone Graph](https://leetcode.com/problems/clone-graph) | [Go](https://github.com/openset/leetcode/tree/master/problems/clone-graph) | Medium |
-| <span id="134">134</span> | [Gas Station](https://leetcode.com/problems/gas-station) | [Go](https://github.com/openset/leetcode/tree/master/problems/gas-station) | Medium |
-| <span id="135">135</span> | [Candy](https://leetcode.com/problems/candy) | [Go](https://github.com/openset/leetcode/tree/master/problems/candy) | Hard |
-| <span id="136">136</span> | [Single Number](https://leetcode.com/problems/single-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number) | Easy |
-| <span id="137">137</span> | [Single Number II](https://leetcode.com/problems/single-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number-ii) | Medium |
-| <span id="138">138</span> | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | [Go](https://github.com/openset/leetcode/tree/master/problems/copy-list-with-random-pointer) | Medium |
-| <span id="139">139</span> | [Word Break](https://leetcode.com/problems/word-break) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-break) | Medium |
-| <span id="140">140</span> | [Word Break II](https://leetcode.com/problems/word-break-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-break-ii) | Hard |
-| <span id="141">141</span> | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle) | Easy |
-| <span id="142">142</span> | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle-ii) | Medium |
-| <span id="143">143</span> | [Reorder List](https://leetcode.com/problems/reorder-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/reorder-list) | Medium |
-| <span id="144">144</span> | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-preorder-traversal) | Medium |
-| <span id="145">145</span> | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-postorder-traversal) | Hard |
-| <span id="146">146</span> | [LRU Cache](https://leetcode.com/problems/lru-cache) | [Go](https://github.com/openset/leetcode/tree/master/problems/lru-cache) | Hard |
-| <span id="147">147</span> | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/insertion-sort-list) | Medium |
-| <span id="148">148</span> | [Sort List](https://leetcode.com/problems/sort-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-list) | Medium |
-| <span id="149">149</span> | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-points-on-a-line) | Hard |
-| <span id="150">150</span> | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | [Go](https://github.com/openset/leetcode/tree/master/problems/evaluate-reverse-polish-notation) | Medium |
-| <span id="151">151</span> | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string) | Medium |
-| <span id="152">152</span> | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-subarray) | Medium |
-| <span id="153">153</span> | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array) | Medium |
-| <span id="154">154</span> | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array-ii) | Hard |
-| <span id="155">155</span> | [Min Stack](https://leetcode.com/problems/min-stack) | [Go](https://github.com/openset/leetcode/tree/master/problems/min-stack) | Easy |
-| <span id="156">156</span> | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-upside-down) | Medium |
-| <span id="157">157</span> | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4) | Easy |
-| <span id="158">158</span> | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4-ii-call-multiple-times) | Hard |
-| <span id="159">159</span> | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters) | Hard |
-| <span id="160">160</span> | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-linked-lists) | Easy |
-| <span id="161">161</span> | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/one-edit-distance) | Medium |
-| <span id="162">162</span> | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-peak-element) | Medium |
-| <span id="163">163</span> | [Missing Ranges](https://leetcode.com/problems/missing-ranges) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/missing-ranges) | Medium |
-| <span id="164">164</span> | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-gap) | Hard |
-| <span id="165">165</span> | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/compare-version-numbers) | Medium |
-| <span id="166">166</span> | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [Go](https://github.com/openset/leetcode/tree/master/problems/fraction-to-recurring-decimal) | Medium |
-| <span id="167">167</span> | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-ii-input-array-is-sorted) | Easy |
-| <span id="168">168</span> | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [Go](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-title) | Easy |
-| <span id="169">169</span> | [Majority Element](https://leetcode.com/problems/majority-element) | [Go](https://github.com/openset/leetcode/tree/master/problems/majority-element) | Easy |
-| <span id="170">170</span> | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-iii-data-structure-design) | Easy |
-| <span id="171">171</span> | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-number) | Easy |
-| <span id="172">172</span> | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/factorial-trailing-zeroes) | Easy |
-| <span id="173">173</span> | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator) | Medium |
-| <span id="174">174</span> | [Dungeon Game](https://leetcode.com/problems/dungeon-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/dungeon-game) | Hard |
-| <span id="175">175</span> | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | [Go](https://github.com/openset/leetcode/tree/master/problems/combine-two-tables) | Easy |
-| <span id="176">176</span> | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/second-highest-salary) | Easy |
-| <span id="177">177</span> | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/nth-highest-salary) | Medium |
-| <span id="178">178</span> | [Rank Scores](https://leetcode.com/problems/rank-scores) | [Go](https://github.com/openset/leetcode/tree/master/problems/rank-scores) | Medium |
-| <span id="179">179</span> | [Largest Number](https://leetcode.com/problems/largest-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-number) | Medium |
-| <span id="180">180</span> | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers) | Medium |
-| <span id="181">181</span> | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | [Go](https://github.com/openset/leetcode/tree/master/problems/employees-earning-more-than-their-managers) | Easy |
-| <span id="182">182</span> | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/problems/duplicate-emails) | Easy |
-| <span id="183">183</span> | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [Go](https://github.com/openset/leetcode/tree/master/problems/customers-who-never-order) | Easy |
-| <span id="184">184</span> | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/department-highest-salary) | Medium |
-| <span id="185">185</span> | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [Go](https://github.com/openset/leetcode/tree/master/problems/department-top-three-salaries) | Hard |
-| <span id="186">186</span> | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-ii) | Medium |
-| <span id="187">187</span> | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-dna-sequences) | Medium |
-| <span id="188">188</span> | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv) | Hard |
-| <span id="189">189</span> | [Rotate Array](https://leetcode.com/problems/rotate-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-array) | Easy |
-| <span id="190">190</span> | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-bits) | Easy |
-| <span id="191">191</span> | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits) | Easy |
-| <span id="192">192</span> | [Word Frequency](https://leetcode.com/problems/word-frequency) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-frequency) | Medium |
-| <span id="193">193</span> | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-phone-numbers) | Easy |
-| <span id="194">194</span> | [Transpose File](https://leetcode.com/problems/transpose-file) | [Go](https://github.com/openset/leetcode/tree/master/problems/transpose-file) | Medium |
-| <span id="195">195</span> | [Tenth Line](https://leetcode.com/problems/tenth-line) | [Bash](https://github.com/openset/leetcode/tree/master/problems/tenth-line) | Easy |
-| <span id="196">196</span> | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-duplicate-emails) | Easy |
-| <span id="197">197</span> | [Rising Temperature](https://leetcode.com/problems/rising-temperature) | [Go](https://github.com/openset/leetcode/tree/master/problems/rising-temperature) | Easy |
-| <span id="198">198</span> | [House Robber](https://leetcode.com/problems/house-robber) | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber) | Easy |
-| <span id="199">199</span> | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-right-side-view) | Medium |
-| <span id="200">200</span> | [Number of Islands](https://leetcode.com/problems/number-of-islands) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-islands) | Medium |
-| <span id="201">201</span> | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | [Go](https://github.com/openset/leetcode/tree/master/problems/bitwise-and-of-numbers-range) | Medium |
-| <span id="202">202</span> | [Happy Number](https://leetcode.com/problems/happy-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/happy-number) | Easy |
-| <span id="203">203</span> | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-linked-list-elements) | Easy |
-| <span id="204">204</span> | [Count Primes](https://leetcode.com/problems/count-primes) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-primes) | Easy |
-| <span id="205">205</span> | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/isomorphic-strings) | Easy |
-| <span id="206">206</span> | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list) | Easy |
-| <span id="207">207</span> | [Course Schedule](https://leetcode.com/problems/course-schedule) | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule) | Medium |
-| <span id="208">208</span> | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree) | Medium |
-| <span id="209">209</span> | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-size-subarray-sum) | Medium |
-| <span id="210">210</span> | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii) | Medium |
-| <span id="211">211</span> | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-and-search-word-data-structure-design) | Medium |
-| <span id="212">212</span> | [Word Search II](https://leetcode.com/problems/word-search-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-search-ii) | Hard |
-| <span id="213">213</span> | [House Robber II](https://leetcode.com/problems/house-robber-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber-ii) | Medium |
-| <span id="214">214</span> | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-palindrome) | Hard |
-| <span id="215">215</span> | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-an-array) | Medium |
-| <span id="216">216</span> | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iii) | Medium |
-| <span id="217">217</span> | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [Go](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate) | Easy |
-| <span id="218">218</span> | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | [Go](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem) | Hard |
-| <span id="219">219</span> | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-ii) | Easy |
-| <span id="220">220</span> | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii) | Medium |
-| <span id="221">221</span> | [Maximal Square](https://leetcode.com/problems/maximal-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximal-square) | Medium |
-| <span id="222">222</span> | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-complete-tree-nodes) | Medium |
-| <span id="223">223</span> | [Rectangle Area](https://leetcode.com/problems/rectangle-area) | [Go](https://github.com/openset/leetcode/tree/master/problems/rectangle-area) | Medium |
-| <span id="224">224</span> | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator) | Hard |
-| <span id="225">225</span> | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-stack-using-queues) | Easy |
-| <span id="226">226</span> | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/invert-binary-tree) | Easy |
-| <span id="227">227</span> | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-ii) | Medium |
-| <span id="228">228</span> | [Summary Ranges](https://leetcode.com/problems/summary-ranges) | [Go](https://github.com/openset/leetcode/tree/master/problems/summary-ranges) | Medium |
-| <span id="229">229</span> | [Majority Element II](https://leetcode.com/problems/majority-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/majority-element-ii) | Medium |
-| <span id="230">230</span> | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-bst) | Medium |
-| <span id="231">231</span> | [Power of Two](https://leetcode.com/problems/power-of-two) | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-two) | Easy |
-| <span id="232">232</span> | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-queue-using-stacks) | Easy |
-| <span id="233">233</span> | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-digit-one) | Hard |
-| <span id="234">234</span> | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-linked-list) | Easy |
-| <span id="235">235</span> | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-search-tree) | Easy |
-| <span id="236">236</span> | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-tree) | Medium |
-| <span id="237">237</span> | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-linked-list) | Easy |
-| <span id="238">238</span> | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | [Go](https://github.com/openset/leetcode/tree/master/problems/product-of-array-except-self) | Medium |
-| <span id="239">239</span> | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-window-maximum) | Hard |
-| <span id="240">240</span> | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix-ii) | Medium |
-| <span id="241">241</span> | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/different-ways-to-add-parentheses) | Medium |
-| <span id="242">242</span> | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-anagram) | Easy |
-| <span id="243">243</span> | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance) | Easy |
-| <span id="244">244</span> | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-ii) | Medium |
-| <span id="245">245</span> | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-iii) | Medium |
-| <span id="246">246</span> | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number) | Easy |
-| <span id="247">247</span> | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-ii) | Medium |
-| <span id="248">248</span> | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-iii) | Hard |
-| <span id="249">249</span> | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/group-shifted-strings) | Medium |
-| <span id="250">250</span> | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/count-univalue-subtrees) | Medium |
-| <span id="251">251</span> | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector) | Medium |
-| <span id="252">252</span> | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms) | Easy |
-| <span id="253">253</span> | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii) | Medium |
-| <span id="254">254</span> | [Factor Combinations](https://leetcode.com/problems/factor-combinations) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/factor-combinations) | Medium |
-| <span id="255">255</span> | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-sequence-in-binary-search-tree) | Medium |
-| <span id="256">256</span> | [Paint House](https://leetcode.com/problems/paint-house) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-house) | Easy |
-| <span id="257">257</span> | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-paths) | Easy |
-| <span id="258">258</span> | [Add Digits](https://leetcode.com/problems/add-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-digits) | Easy |
-| <span id="259">259</span> | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) | Medium |
-| <span id="260">260</span> | [Single Number III](https://leetcode.com/problems/single-number-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number-iii) | Medium |
-| <span id="261">261</span> | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree) | Medium |
-| <span id="262">262</span> | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [Go](https://github.com/openset/leetcode/tree/master/problems/trips-and-users) | Hard |
-| <span id="263">263</span> | [Ugly Number](https://leetcode.com/problems/ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/ugly-number) | Easy |
-| <span id="264">264</span> | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii) | Medium |
-| <span id="265">265</span> | [Paint House II](https://leetcode.com/problems/paint-house-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii) | Hard |
-| <span id="266">266</span> | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation) | Easy |
-| <span id="267">267</span> | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation-ii) | Medium |
-| <span id="268">268</span> | [Missing Number](https://leetcode.com/problems/missing-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/missing-number) | Easy |
-| <span id="269">269</span> | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/alien-dictionary) | Hard |
-| <span id="270">270</span> | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value) | Easy |
-| <span id="271">271</span> | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-strings) | Medium |
-| <span id="272">272</span> | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value-ii) | Hard |
-| <span id="273">273</span> | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-to-english-words) | Hard |
-| <span id="274">274</span> | [H-Index](https://leetcode.com/problems/h-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/h-index) | Medium |
-| <span id="275">275</span> | [H-Index II](https://leetcode.com/problems/h-index-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/h-index-ii) | Medium |
-| <span id="276">276</span> | [Paint Fence](https://leetcode.com/problems/paint-fence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-fence) | Easy |
-| <span id="277">277</span> | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-celebrity) | Medium |
-| <span id="278">278</span> | [First Bad Version](https://leetcode.com/problems/first-bad-version) | [Go](https://github.com/openset/leetcode/tree/master/problems/first-bad-version) | Easy |
-| <span id="279">279</span> | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-squares) | Medium |
-| <span id="280">280</span> | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort) | Medium |
-| <span id="281">281</span> | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/zigzag-iterator) | Medium |
-| <span id="282">282</span> | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | [Go](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators) | Hard |
-| <span id="283">283</span> | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/move-zeroes) | Easy |
-| <span id="284">284</span> | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/peeking-iterator) | Medium |
-| <span id="285">285</span> | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst) | Medium |
-| <span id="286">286</span> | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates) | Medium |
-| <span id="287">287</span> | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number) | Medium |
-| <span id="288">288</span> | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-word-abbreviation) | Medium |
-| <span id="289">289</span> | [Game of Life](https://leetcode.com/problems/game-of-life) | [Go](https://github.com/openset/leetcode/tree/master/problems/game-of-life) | Medium |
-| <span id="290">290</span> | [Word Pattern](https://leetcode.com/problems/word-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-pattern) | Easy |
-| <span id="291">291</span> | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-pattern-ii) | Hard |
-| <span id="292">292</span> | [Nim Game](https://leetcode.com/problems/nim-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/nim-game) | Easy |
-| <span id="293">293</span> | [Flip Game](https://leetcode.com/problems/flip-game) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-game) | Easy |
-| <span id="294">294</span> | [Flip Game II](https://leetcode.com/problems/flip-game-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii) | Medium |
-| <span id="295">295</span> | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-median-from-data-stream) | Hard |
-| <span id="296">296</span> | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/best-meeting-point) | Hard |
-| <span id="297">297</span> | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-binary-tree) | Hard |
-| <span id="298">298</span> | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence) | Medium |
-| <span id="299">299</span> | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | [Go](https://github.com/openset/leetcode/tree/master/problems/bulls-and-cows) | Medium |
-| <span id="300">300</span> | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence) | Medium |
-| <span id="301">301</span> | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-invalid-parentheses) | Hard |
-| <span id="302">302</span> | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-rectangle-enclosing-black-pixels) | Hard |
-| <span id="303">303</span> | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-immutable) | Easy |
-| <span id="304">304</span> | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-immutable) | Medium |
-| <span id="305">305</span> | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-islands-ii) | Hard |
-| <span id="306">306</span> | [Additive Number](https://leetcode.com/problems/additive-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/additive-number) | Medium |
-| <span id="307">307</span> | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable) | Medium |
-| <span id="308">308</span> | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) | Hard |
-| <span id="309">309</span> | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
-| <span id="310">310</span> | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees) | Medium |
-| <span id="311">311</span> | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sparse-matrix-multiplication) | Medium |
-| <span id="312">312</span> | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/problems/burst-balloons) | Hard |
-| <span id="313">313</span> | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-ugly-number) | Medium |
-| <span id="314">314</span> | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal) | Medium |
-| <span id="315">315</span> | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | Hard |
-| <span id="316">316</span> | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicate-letters) | Hard |
-| <span id="317">317</span> | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) | Hard |
-| <span id="318">318</span> | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-word-lengths) | Medium |
-| <span id="319">319</span> | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [Go](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher) | Medium |
-| <span id="320">320</span> | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) | Medium |
-| <span id="321">321</span> | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/create-maximum-number) | Hard |
-| <span id="322">322</span> | [Coin Change](https://leetcode.com/problems/coin-change) | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-change) | Medium |
-| <span id="323">323</span> | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) | Medium |
-| <span id="324">324</span> | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort-ii) | Medium |
-| <span id="325">325</span> | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-size-subarray-sum-equals-k) | Medium |
-| <span id="326">326</span> | [Power of Three](https://leetcode.com/problems/power-of-three) | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-three) | Easy |
-| <span id="327">327</span> | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) | Hard |
-| <span id="328">328</span> | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/odd-even-linked-list) | Medium |
-| <span id="329">329</span> | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-path-in-a-matrix) | Hard |
-| <span id="330">330</span> | [Patching Array](https://leetcode.com/problems/patching-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/patching-array) | Hard |
-| <span id="331">331</span> | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-serialization-of-a-binary-tree) | Medium |
-| <span id="332">332</span> | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | [Go](https://github.com/openset/leetcode/tree/master/problems/reconstruct-itinerary) | Medium |
-| <span id="333">333</span> | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-bst-subtree) | Medium |
-| <span id="334">334</span> | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-triplet-subsequence) | Medium |
-| <span id="335">335</span> | [Self Crossing](https://leetcode.com/problems/self-crossing) | [Go](https://github.com/openset/leetcode/tree/master/problems/self-crossing) | Hard |
-| <span id="336">336</span> | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-pairs) | Hard |
-| <span id="337">337</span> | [House Robber III](https://leetcode.com/problems/house-robber-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber-iii) | Medium |
-| <span id="338">338</span> | [Counting Bits](https://leetcode.com/problems/counting-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/counting-bits) | Medium |
-| <span id="339">339</span> | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum) | Easy |
-| <span id="340">340</span> | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters) | Hard |
-| <span id="341">341</span> | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator) | Medium |
-| <span id="342">342</span> | [Power of Four](https://leetcode.com/problems/power-of-four) | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-four) | Easy |
-| <span id="343">343</span> | [Integer Break](https://leetcode.com/problems/integer-break) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-break) | Medium |
-| <span id="344">344</span> | [Reverse String](https://leetcode.com/problems/reverse-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-string) | Easy |
-| <span id="345">345</span> | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-vowels-of-a-string) | Easy |
-| <span id="346">346</span> | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/moving-average-from-data-stream) | Easy |
-| <span id="347">347</span> | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements) | Medium |
-| <span id="348">348</span> | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-tic-tac-toe) | Medium |
-| <span id="349">349</span> | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays) | Easy |
-| <span id="350">350</span> | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii) | Easy |
-| <span id="351">351</span> | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns) | Medium |
-| <span id="352">352</span> | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals) | Hard |
-| <span id="353">353</span> | [Design Snake Game](https://leetcode.com/problems/design-snake-game) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-snake-game) | Medium |
-| <span id="354">354</span> | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | [Go](https://github.com/openset/leetcode/tree/master/problems/russian-doll-envelopes) | Hard |
-| <span id="355">355</span> | [Design Twitter](https://leetcode.com/problems/design-twitter) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-twitter) | Medium |
-| <span id="356">356</span> | [Line Reflection](https://leetcode.com/problems/line-reflection) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/line-reflection) | Medium |
-| <span id="357">357</span> | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-numbers-with-unique-digits) | Medium |
-| <span id="358">358</span> | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart) | Hard |
-| <span id="359">359</span> | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/logger-rate-limiter) | Easy |
-| <span id="360">360</span> | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-transformed-array) | Medium |
-| <span id="361">361</span> | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/bomb-enemy) | Medium |
-| <span id="362">362</span> | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hit-counter) | Medium |
-| <span id="363">363</span> | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-sum-of-rectangle-no-larger-than-k) | Hard |
-| <span id="364">364</span> | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum-ii) | Medium |
-| <span id="365">365</span> | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem) | [Go](https://github.com/openset/leetcode/tree/master/problems/water-and-jug-problem) | Medium |
-| <span id="366">366</span> | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-leaves-of-binary-tree) | Medium |
-| <span id="367">367</span> | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-perfect-square) | Easy |
-| <span id="368">368</span> | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-divisible-subset) | Medium |
-| <span id="369">369</span> | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/plus-one-linked-list) | Medium |
-| <span id="370">370</span> | [Range Addition](https://leetcode.com/problems/range-addition) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/range-addition) | Medium |
-| <span id="371">371</span> | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-two-integers) | Easy |
-| <span id="372">372</span> | [Super Pow](https://leetcode.com/problems/super-pow) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-pow) | Medium |
-| <span id="373">373</span> | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-pairs-with-smallest-sums) | Medium |
-| <span id="374">374</span> | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | [Go](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower) | Easy |
-| <span id="375">375</span> | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower-ii) | Medium |
-| <span id="376">376</span> | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-subsequence) | Medium |
-| <span id="377">377</span> | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iv) | Medium |
-| <span id="378">378</span> | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-sorted-matrix) | Medium |
-| <span id="379">379</span> | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-phone-directory) | Medium |
-| <span id="380">380</span> | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1) | Medium |
-| <span id="381">381</span> | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1-duplicates-allowed) | Hard |
-| <span id="382">382</span> | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-random-node) | Medium |
-| <span id="383">383</span> | [Ransom Note](https://leetcode.com/problems/ransom-note) | [Go](https://github.com/openset/leetcode/tree/master/problems/ransom-note) | Easy |
-| <span id="384">384</span> | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/shuffle-an-array) | Medium |
-| <span id="385">385</span> | [Mini Parser](https://leetcode.com/problems/mini-parser) | [Go](https://github.com/openset/leetcode/tree/master/problems/mini-parser) | Medium |
-| <span id="386">386</span> | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/lexicographical-numbers) | Medium |
-| <span id="387">387</span> | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/first-unique-character-in-a-string) | Easy |
-| <span id="388">388</span> | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-absolute-file-path) | Medium |
-| <span id="389">389</span> | [Find the Difference](https://leetcode.com/problems/find-the-difference) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-difference) | Easy |
-| <span id="390">390</span> | [Elimination Game](https://leetcode.com/problems/elimination-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/elimination-game) | Medium |
-| <span id="391">391</span> | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-rectangle) | Hard |
-| <span id="392">392</span> | [Is Subsequence](https://leetcode.com/problems/is-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/is-subsequence) | Medium |
-| <span id="393">393</span> | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation) | [Go](https://github.com/openset/leetcode/tree/master/problems/utf-8-validation) | Medium |
-| <span id="394">394</span> | [Decode String](https://leetcode.com/problems/decode-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-string) | Medium |
-| <span id="395">395</span> | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-least-k-repeating-characters) | Medium |
-| <span id="396">396</span> | [Rotate Function](https://leetcode.com/problems/rotate-function) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-function) | Medium |
-| <span id="397">397</span> | [Integer Replacement](https://leetcode.com/problems/integer-replacement) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-replacement) | Medium |
-| <span id="398">398</span> | [Random Pick Index](https://leetcode.com/problems/random-pick-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-index) | Medium |
-| <span id="399">399</span> | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | [Go](https://github.com/openset/leetcode/tree/master/problems/evaluate-division) | Medium |
-| <span id="400">400</span> | [Nth Digit](https://leetcode.com/problems/nth-digit) | [Go](https://github.com/openset/leetcode/tree/master/problems/nth-digit) | Easy |
-| <span id="401">401</span> | [Binary Watch](https://leetcode.com/problems/binary-watch) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-watch) | Easy |
-| <span id="402">402</span> | [Remove K Digits](https://leetcode.com/problems/remove-k-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-k-digits) | Medium |
-| <span id="403">403</span> | [Frog Jump](https://leetcode.com/problems/frog-jump) | [Go](https://github.com/openset/leetcode/tree/master/problems/frog-jump) | Hard |
-| <span id="404">404</span> | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-left-leaves) | Easy |
-| <span id="405">405</span> | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-a-number-to-hexadecimal) | Easy |
-| <span id="406">406</span> | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | [Go](https://github.com/openset/leetcode/tree/master/problems/queue-reconstruction-by-height) | Medium |
-| <span id="407">407</span> | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water-ii) | Hard |
-| <span id="408">408</span> | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-word-abbreviation) | Easy |
-| <span id="409">409</span> | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindrome) | Easy |
-| <span id="410">410</span> | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-largest-sum) | Hard |
-| <span id="411">411</span> | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-unique-word-abbreviation) | Hard |
-| <span id="412">412</span> | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [Go](https://github.com/openset/leetcode/tree/master/problems/fizz-buzz) | Easy |
-| <span id="413">413</span> | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | [Go](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices) | Medium |
-| <span id="414">414</span> | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/third-maximum-number) | Easy |
-| <span id="415">415</span> | [Add Strings](https://leetcode.com/problems/add-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-strings) | Easy |
-| <span id="416">416</span> | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-equal-subset-sum) | Medium |
-| <span id="417">417</span> | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [Go](https://github.com/openset/leetcode/tree/master/problems/pacific-atlantic-water-flow) | Medium |
-| <span id="418">418</span> | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-screen-fitting) | Medium |
-| <span id="419">419</span> | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | [Go](https://github.com/openset/leetcode/tree/master/problems/battleships-in-a-board) | Medium |
-| <span id="420">420</span> | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker) | [Go](https://github.com/openset/leetcode/tree/master/problems/strong-password-checker) | Hard |
-| <span id="421">421</span> | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-xor-of-two-numbers-in-an-array) | Medium |
-| <span id="422">422</span> | [Valid Word Square](https://leetcode.com/problems/valid-word-square) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-word-square) | Easy |
-| <span id="423">423</span> | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english) | [Go](https://github.com/openset/leetcode/tree/master/problems/reconstruct-original-digits-from-english) | Medium |
-| <span id="424">424</span> | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-character-replacement) | Medium |
-| <span id="425">425</span> | [Word Squares](https://leetcode.com/problems/word-squares) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-squares) | Hard |
-| <span id="426">426</span> | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
-| <span id="427">427</span> | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-quad-tree) | Easy |
-| <span id="428">428</span> | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree) | Hard |
-| <span id="429">429</span> | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-level-order-traversal) | Easy |
-| <span id="430">430</span> | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-a-multilevel-doubly-linked-list) | Medium |
-| <span id="431">431</span> | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-n-ary-tree-to-binary-tree) | Hard |
-| <span id="432">432</span> | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-oone-data-structure) | Hard |
-| <span id="433">433</span> | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-genetic-mutation) | Medium |
-| <span id="434">434</span> | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-segments-in-a-string) | Easy |
-| <span id="435">435</span> | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/non-overlapping-intervals) | Medium |
-| <span id="436">436</span> | [Find Right Interval](https://leetcode.com/problems/find-right-interval) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-right-interval) | Medium |
-| <span id="437">437</span> | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-iii) | Easy |
-| <span id="438">438</span> | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-anagrams-in-a-string) | Easy |
-| <span id="439">439</span> | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser) | Medium |
-| <span id="440">440</span> | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-in-lexicographical-order) | Hard |
-| <span id="441">441</span> | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | [Go](https://github.com/openset/leetcode/tree/master/problems/arranging-coins) | Easy |
-| <span id="442">442</span> | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-duplicates-in-an-array) | Medium |
-| <span id="443">443</span> | [String Compression](https://leetcode.com/problems/string-compression) | [Go](https://github.com/openset/leetcode/tree/master/problems/string-compression) | Easy |
-| <span id="444">444</span> | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sequence-reconstruction) | Medium |
-| <span id="445">445</span> | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers-ii) | Medium |
-| <span id="446">446</span> | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices-ii-subsequence) | Hard |
-| <span id="447">447</span> | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-boomerangs) | Easy |
-| <span id="448">448</span> | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-numbers-disappeared-in-an-array) | Easy |
-| <span id="449">449</span> | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-bst) | Medium |
-| <span id="450">450</span> | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-bst) | Medium |
-| <span id="451">451</span> | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-characters-by-frequency) | Medium |
-| <span id="452">452</span> | [Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-arrows-to-burst-balloons) | Medium |
-| <span id="453">453</span> | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements) | Easy |
-| <span id="454">454</span> | [4Sum II](https://leetcode.com/problems/4sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/4sum-ii) | Medium |
-| <span id="455">455</span> | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | [Go](https://github.com/openset/leetcode/tree/master/problems/assign-cookies) | Easy |
-| <span id="456">456</span> | [132 Pattern](https://leetcode.com/problems/132-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/132-pattern) | Medium |
-| <span id="457">457</span> | [Circular Array Loop](https://leetcode.com/problems/circular-array-loop) | [Go](https://github.com/openset/leetcode/tree/master/problems/circular-array-loop) | Medium |
-| <span id="458">458</span> | [Poor Pigs](https://leetcode.com/problems/poor-pigs) | [Go](https://github.com/openset/leetcode/tree/master/problems/poor-pigs) | Easy |
-| <span id="459">459</span> | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-substring-pattern) | Easy |
-| <span id="460">460</span> | [LFU Cache](https://leetcode.com/problems/lfu-cache) | [Go](https://github.com/openset/leetcode/tree/master/problems/lfu-cache) | Hard |
-| <span id="461">461</span> | [Hamming Distance](https://leetcode.com/problems/hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/hamming-distance) | Easy |
-| <span id="462">462</span> | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements-ii) | Medium |
-| <span id="463">463</span> | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | [Go](https://github.com/openset/leetcode/tree/master/problems/island-perimeter) | Easy |
-| <span id="464">464</span> | [Can I Win](https://leetcode.com/problems/can-i-win) | [Go](https://github.com/openset/leetcode/tree/master/problems/can-i-win) | Medium |
-| <span id="465">465</span> | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/optimal-account-balancing) | Hard |
-| <span id="466">466</span> | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-the-repetitions) | Hard |
-| <span id="467">467</span> | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-substrings-in-wraparound-string) | Medium |
-| <span id="468">468</span> | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-ip-address) | Medium |
-| <span id="469">469</span> | [Convex Polygon](https://leetcode.com/problems/convex-polygon) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/convex-polygon) | Medium |
-| <span id="470">470</span> | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-rand10-using-rand7) | Medium |
-| <span id="471">471</span> | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length) | Hard |
-| <span id="472">472</span> | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/concatenated-words) | Hard |
-| <span id="473">473</span> | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/matchsticks-to-square) | Medium |
-| <span id="474">474</span> | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/ones-and-zeroes) | Medium |
-| <span id="475">475</span> | [Heaters](https://leetcode.com/problems/heaters) | [Go](https://github.com/openset/leetcode/tree/master/problems/heaters) | Easy |
-| <span id="476">476</span> | [Number Complement](https://leetcode.com/problems/number-complement) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-complement) | Easy |
-| <span id="477">477</span> | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/total-hamming-distance) | Medium |
-| <span id="478">478</span> | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle) | [Go](https://github.com/openset/leetcode/tree/master/problems/generate-random-point-in-a-circle) | Medium |
-| <span id="479">479</span> | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-palindrome-product) | Easy |
-| <span id="480">480</span> | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median) | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-window-median) | Hard |
-| <span id="481">481</span> | [Magical String](https://leetcode.com/problems/magical-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/magical-string) | Medium |
-| <span id="482">482</span> | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [Go](https://github.com/openset/leetcode/tree/master/problems/license-key-formatting) | Easy |
-| <span id="483">483</span> | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-good-base) | Hard |
-| <span id="484">484</span> | [Find Permutation](https://leetcode.com/problems/find-permutation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-permutation) | Medium |
-| <span id="485">485</span> | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones) | Easy |
-| <span id="486">486</span> | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | [Go](https://github.com/openset/leetcode/tree/master/problems/predict-the-winner) | Medium |
-| <span id="487">487</span> | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-ii) | Medium |
-| <span id="488">488</span> | [Zuma Game](https://leetcode.com/problems/zuma-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/zuma-game) | Hard |
-| <span id="489">489</span> | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/robot-room-cleaner) | Hard |
-| <span id="490">490</span> | [The Maze](https://leetcode.com/problems/the-maze) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze) | Medium |
-| <span id="491">491</span> | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-subsequences) | Medium |
-| <span id="492">492</span> | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-the-rectangle) | Easy |
-| <span id="493">493</span> | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | Hard |
-| <span id="494">494</span> | [Target Sum](https://leetcode.com/problems/target-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/target-sum) | Medium |
-| <span id="495">495</span> | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking) | [Go](https://github.com/openset/leetcode/tree/master/problems/teemo-attacking) | Medium |
-| <span id="496">496</span> | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-i) | Easy |
-| <span id="497">497</span> | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-point-in-non-overlapping-rectangles) | Medium |
-| <span id="498">498</span> | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | [Go](https://github.com/openset/leetcode/tree/master/problems/diagonal-traverse) | Medium |
-| <span id="499">499</span> | [The Maze III](https://leetcode.com/problems/the-maze-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii) | Hard |
-| <span id="500">500</span> | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | [Go](https://github.com/openset/leetcode/tree/master/problems/keyboard-row) | Easy |
-| <span id="501">501</span> | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-mode-in-binary-search-tree) | Easy |
-| <span id="502">502</span> | [IPO](https://leetcode.com/problems/ipo) | [Go](https://github.com/openset/leetcode/tree/master/problems/ipo) | Hard |
-| <span id="503">503</span> | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-ii) | Medium |
-| <span id="504">504</span> | [Base 7](https://leetcode.com/problems/base-7) | [Go](https://github.com/openset/leetcode/tree/master/problems/base-7) | Easy |
-| <span id="505">505</span> | [The Maze II](https://leetcode.com/problems/the-maze-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii) | Medium |
-| <span id="506">506</span> | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | [Go](https://github.com/openset/leetcode/tree/master/problems/relative-ranks) | Easy |
-| <span id="507">507</span> | [Perfect Number](https://leetcode.com/problems/perfect-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-number) | Easy |
-| <span id="508">508</span> | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-frequent-subtree-sum) | Medium |
-| <span id="513">513</span> | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value) | Medium |
-| <span id="514">514</span> | [Freedom Trail](https://leetcode.com/problems/freedom-trail) | [Go](https://github.com/openset/leetcode/tree/master/problems/freedom-trail) | Hard |
-| <span id="515">515</span> | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row) | Medium |
-| <span id="516">516</span> | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-subsequence) | Medium |
-| <span id="517">517</span> | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-washing-machines) | Hard |
-| <span id="518">518</span> | [Coin Change 2](https://leetcode.com/problems/coin-change-2) | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-change-2) | Medium |
-| <span id="519">519</span> | [Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-flip-matrix) | Medium |
-| <span id="520">520</span> | [Detect Capital](https://leetcode.com/problems/detect-capital) | [Go](https://github.com/openset/leetcode/tree/master/problems/detect-capital) | Easy |
-| <span id="521">521</span> | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-i) | Easy |
-| <span id="522">522</span> | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-ii) | Medium |
-| <span id="523">523</span> | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/continuous-subarray-sum) | Medium |
-| <span id="524">524</span> | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary-through-deleting) | Medium |
-| <span id="525">525</span> | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/contiguous-array) | Medium |
-| <span id="526">526</span> | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement) | Medium |
-| <span id="527">527</span> | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation) | Hard |
-| <span id="528">528</span> | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-weight) | Medium |
-| <span id="529">529</span> | [Minesweeper](https://leetcode.com/problems/minesweeper) | [Go](https://github.com/openset/leetcode/tree/master/problems/minesweeper) | Medium |
-| <span id="530">530</span> | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst) | Easy |
-| <span id="531">531</span> | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i) | Medium |
-| <span id="532">532</span> | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-diff-pairs-in-an-array) | Easy |
-| <span id="533">533</span> | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii) | Medium |
-| <span id="535">535</span> | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-tinyurl) | Medium |
-| <span id="536">536</span> | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-string) | Medium |
-| <span id="537">537</span> | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | [Go](https://github.com/openset/leetcode/tree/master/problems/complex-number-multiplication) | Medium |
-| <span id="538">538</span> | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-bst-to-greater-tree) | Easy |
-| <span id="539">539</span> | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-time-difference) | Medium |
-| <span id="540">540</span> | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-element-in-a-sorted-array) | Medium |
-| <span id="541">541</span> | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-string-ii) | Easy |
-| <span id="542">542</span> | [01 Matrix](https://leetcode.com/problems/01-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/01-matrix) | Medium |
-| <span id="543">543</span> | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/diameter-of-binary-tree) | Easy |
-| <span id="544">544</span> | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/output-contest-matches) | Medium |
-| <span id="545">545</span> | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/boundary-of-binary-tree) | Medium |
-| <span id="546">546</span> | [Remove Boxes](https://leetcode.com/problems/remove-boxes) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-boxes) | Hard |
-| <span id="547">547</span> | [Friend Circles](https://leetcode.com/problems/friend-circles) | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-circles) | Medium |
-| <span id="548">548</span> | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-with-equal-sum) | Medium |
-| <span id="549">549</span> | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence-ii) | Medium |
-| <span id="551">551</span> | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-i) | Easy |
-| <span id="552">552</span> | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-ii) | Hard |
-| <span id="553">553</span> | [Optimal Division](https://leetcode.com/problems/optimal-division) | [Go](https://github.com/openset/leetcode/tree/master/problems/optimal-division) | Medium |
-| <span id="554">554</span> | [Brick Wall](https://leetcode.com/problems/brick-wall) | [Go](https://github.com/openset/leetcode/tree/master/problems/brick-wall) | Medium |
-| <span id="555">555</span> | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-concatenated-strings) | Medium |
-| <span id="556">556</span> | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-iii) | Medium |
-| <span id="557">557</span> | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-iii) | Easy |
-| <span id="558">558</span> | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection) | [Go](https://github.com/openset/leetcode/tree/master/problems/quad-tree-intersection) | Easy |
-| <span id="559">559</span> | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-n-ary-tree) | Easy |
-| <span id="560">560</span> | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k) | Medium |
-| <span id="561">561</span> | [Array Partition I](https://leetcode.com/problems/array-partition-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/array-partition-i) | Easy |
-| <span id="562">562</span> | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-line-of-consecutive-one-in-matrix) | Medium |
-| <span id="563">563</span> | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-tilt) | Easy |
-| <span id="564">564</span> | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-closest-palindrome) | Hard |
-| <span id="565">565</span> | [Array Nesting](https://leetcode.com/problems/array-nesting) | [Go](https://github.com/openset/leetcode/tree/master/problems/array-nesting) | Medium |
-| <span id="566">566</span> | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/reshape-the-matrix) | Easy |
-| <span id="567">567</span> | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutation-in-string) | Medium |
-| <span id="568">568</span> | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-vacation-days) | Hard |
-| <span id="569">569</span> | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/median-employee-salary) | Hard |
-| <span id="570">570</span> | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/managers-with-at-least-5-direct-reports) | Medium |
-| <span id="571">571</span> | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-median-given-frequency-of-numbers) | Hard |
-| <span id="572">572</span> | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/subtree-of-another-tree) | Easy |
-| <span id="573">573</span> | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/squirrel-simulation) | Medium |
-| <span id="574">574</span> | [Winning Candidate](https://leetcode.com/problems/winning-candidate) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/winning-candidate) | Medium |
-| <span id="575">575</span> | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | [Go](https://github.com/openset/leetcode/tree/master/problems/distribute-candies) | Easy |
-| <span id="576">576</span> | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [Go](https://github.com/openset/leetcode/tree/master/problems/out-of-boundary-paths) | Medium |
-| <span id="577">577</span> | [Employee Bonus](https://leetcode.com/problems/employee-bonus) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-bonus) | Easy |
-| <span id="578">578</span> | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/get-highest-answer-rate-question) | Medium |
-| <span id="579">579</span> | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-cumulative-salary-of-an-employee) | Hard |
-| <span id="580">580</span> | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/count-student-number-in-departments) | Medium |
-| <span id="581">581</span> | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-unsorted-continuous-subarray) | Easy |
-| <span id="582">582</span> | [Kill Process](https://leetcode.com/problems/kill-process) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/kill-process) | Medium |
-| <span id="583">583</span> | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-operation-for-two-strings) | Medium |
-| <span id="584">584</span> | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-customer-referee) | Easy |
-| <span id="585">585</span> | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/investments-in-2016) | Medium |
-| <span id="586">586</span> | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/customer-placing-the-largest-number-of-orders) | Easy |
-| <span id="587">587</span> | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | [Go](https://github.com/openset/leetcode/tree/master/problems/erect-the-fence) | Hard |
-| <span id="588">588</span> | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system) | Hard |
-| <span id="589">589</span> | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-preorder-traversal) | Easy |
-| <span id="590">590</span> | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-postorder-traversal) | Easy |
-| <span id="591">591</span> | [Tag Validator](https://leetcode.com/problems/tag-validator) | [Go](https://github.com/openset/leetcode/tree/master/problems/tag-validator) | Hard |
-| <span id="592">592</span> | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction) | [Go](https://github.com/openset/leetcode/tree/master/problems/fraction-addition-and-subtraction) | Medium |
-| <span id="593">593</span> | [Valid Square](https://leetcode.com/problems/valid-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-square) | Medium |
-| <span id="594">594</span> | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-harmonious-subsequence) | Easy |
-| <span id="595">595</span> | [Big Countries](https://leetcode.com/problems/big-countries) | [Go](https://github.com/openset/leetcode/tree/master/problems/big-countries) | Easy |
-| <span id="596">596</span> | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [Go](https://github.com/openset/leetcode/tree/master/problems/classes-more-than-5-students) | Easy |
-| <span id="597">597</span> | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-i-overall-acceptance-rate) | Easy |
-| <span id="598">598</span> | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-addition-ii) | Easy |
-| <span id="599">599</span> | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-index-sum-of-two-lists) | Easy |
-| <span id="600">600</span> | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/problems/non-negative-integers-without-consecutive-ones) | Hard |
-| <span id="601">601</span> | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [Go](https://github.com/openset/leetcode/tree/master/problems/human-traffic-of-stadium) | Hard |
-| <span id="602">602</span> | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-ii-who-has-the-most-friends) | Medium |
-| <span id="603">603</span> | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-available-seats) | Easy |
-| <span id="604">604</span> | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-compressed-string-iterator) | Easy |
-| <span id="605">605</span> | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [Go](https://github.com/openset/leetcode/tree/master/problems/can-place-flowers) | Easy |
-| <span id="606">606</span> | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-string-from-binary-tree) | Easy |
-| <span id="607">607</span> | [Sales Person](https://leetcode.com/problems/sales-person) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sales-person) | Easy |
-| <span id="608">608</span> | [Tree Node](https://leetcode.com/problems/tree-node) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/tree-node) | Medium |
-| <span id="609">609</span> | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-file-in-system) | Medium |
-| <span id="610">610</span> | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/triangle-judgement) | Easy |
-| <span id="611">611</span> | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-triangle-number) | Medium |
-| <span id="612">612</span> | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-plane) | Medium |
-| <span id="613">613</span> | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-line) | Easy |
-| <span id="614">614</span> | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/second-degree-follower) | Medium |
-| <span id="615">615</span> | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/average-salary-departments-vs-company) | Hard |
-| <span id="616">616</span> | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/add-bold-tag-in-string) | Medium |
-| <span id="617">617</span> | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-two-binary-trees) | Easy |
-| <span id="618">618</span> | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/students-report-by-geography) | Hard |
-| <span id="619">619</span> | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/biggest-single-number) | Easy |
-| <span id="620">620</span> | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [Go](https://github.com/openset/leetcode/tree/master/problems/not-boring-movies) | Easy |
-| <span id="621">621</span> | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [Go](https://github.com/openset/leetcode/tree/master/problems/task-scheduler) | Medium |
-| <span id="622">622</span> | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue) | Medium |
-| <span id="623">623</span> | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-one-row-to-tree) | Medium |
-| <span id="624">624</span> | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-distance-in-arrays) | Easy |
-| <span id="625">625</span> | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization) | Medium |
-| <span id="626">626</span> | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [Go](https://github.com/openset/leetcode/tree/master/problems/exchange-seats) | Medium |
-| <span id="627">627</span> | [Swap Salary](https://leetcode.com/problems/swap-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-salary) | Easy |
-| <span id="628">628</span> | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers) | Easy |
-| <span id="629">629</span> | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-inverse-pairs-array) | Hard |
-| <span id="630">630</span> | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule-iii) | Hard |
-| <span id="631">631</span> | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-excel-sum-formula) | Hard |
-| <span id="632">632</span> | [Smallest Range](https://leetcode.com/problems/smallest-range) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range) | Hard |
-| <span id="633">633</span> | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-square-numbers) | Easy |
-| <span id="634">634</span> | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-derangement-of-an-array) | Medium |
-| <span id="635">635</span> | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-log-storage-system) | Medium |
-| <span id="636">636</span> | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | [Go](https://github.com/openset/leetcode/tree/master/problems/exclusive-time-of-functions) | Medium |
-| <span id="637">637</span> | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/average-of-levels-in-binary-tree) | Easy |
-| <span id="638">638</span> | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | [Go](https://github.com/openset/leetcode/tree/master/problems/shopping-offers) | Medium |
-| <span id="639">639</span> | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-ways-ii) | Hard |
-| <span id="640">640</span> | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | [Go](https://github.com/openset/leetcode/tree/master/problems/solve-the-equation) | Medium |
-| <span id="641">641</span> | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-circular-deque) | Medium |
-| <span id="642">642</span> | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-search-autocomplete-system) | Hard |
-| <span id="643">643</span> | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-i) | Easy |
-| <span id="644">644</span> | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-ii) | Hard |
-| <span id="645">645</span> | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [Go](https://github.com/openset/leetcode/tree/master/problems/set-mismatch) | Easy |
-| <span id="646">646</span> | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-pair-chain) | Medium |
-| <span id="647">647</span> | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindromic-substrings) | Medium |
-| <span id="648">648</span> | [Replace Words](https://leetcode.com/problems/replace-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/replace-words) | Medium |
-| <span id="649">649</span> | [Dota2 Senate](https://leetcode.com/problems/dota2-senate) | [Go](https://github.com/openset/leetcode/tree/master/problems/dota2-senate) | Medium |
-| <span id="650">650</span> | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/2-keys-keyboard) | Medium |
-| <span id="651">651</span> | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard) | Medium |
-| <span id="652">652</span> | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-subtrees) | Medium |
-| <span id="653">653</span> | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-iv-input-is-a-bst) | Easy |
-| <span id="654">654</span> | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-binary-tree) | Medium |
-| <span id="655">655</span> | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/print-binary-tree) | Medium |
-| <span id="656">656</span> | [Coin Path](https://leetcode.com/problems/coin-path) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-path) | Hard |
-| <span id="657">657</span> | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [Go](https://github.com/openset/leetcode/tree/master/problems/robot-return-to-origin) | Easy |
-| <span id="658">658</span> | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-closest-elements) | Medium |
-| <span id="659">659</span> | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-into-consecutive-subsequences) | Medium |
-| <span id="660">660</span> | [Remove 9](https://leetcode.com/problems/remove-9) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-9) | Hard |
-| <span id="661">661</span> | [Image Smoother](https://leetcode.com/problems/image-smoother) | [Go](https://github.com/openset/leetcode/tree/master/problems/image-smoother) | Easy |
-| <span id="662">662</span> | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-width-of-binary-tree) | Medium |
-| <span id="663">663</span> | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/equal-tree-partition) | Medium |
-| <span id="664">664</span> | [Strange Printer](https://leetcode.com/problems/strange-printer) | [Go](https://github.com/openset/leetcode/tree/master/problems/strange-printer) | Hard |
-| <span id="665">665</span> | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/non-decreasing-array) | Easy |
-| <span id="666">666</span> | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) | Medium |
-| <span id="667">667</span> | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement-ii) | Medium |
-| <span id="668">668</span> | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-number-in-multiplication-table) | Hard |
-| <span id="669">669</span> | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/trim-a-binary-search-tree) | Easy |
-| <span id="670">670</span> | [Maximum Swap](https://leetcode.com/problems/maximum-swap) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-swap) | Medium |
-| <span id="671">671</span> | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/second-minimum-node-in-a-binary-tree) | Easy |
-| <span id="672">672</span> | [Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher-ii) | Medium |
-| <span id="673">673</span> | [Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-longest-increasing-subsequence) | Medium |
-| <span id="674">674</span> | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-continuous-increasing-subsequence) | Easy |
-| <span id="675">675</span> | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event) | [Go](https://github.com/openset/leetcode/tree/master/problems/cut-off-trees-for-golf-event) | Hard |
-| <span id="676">676</span> | [Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-magic-dictionary) | Medium |
-| <span id="677">677</span> | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/map-sum-pairs) | Medium |
-| <span id="678">678</span> | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-parenthesis-string) | Medium |
-| <span id="679">679</span> | [24 Game](https://leetcode.com/problems/24-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/24-game) | Hard |
-| <span id="680">680</span> | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-ii) | Easy |
-| <span id="681">681</span> | [Next Closest Time](https://leetcode.com/problems/next-closest-time) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/next-closest-time) | Medium |
-| <span id="682">682</span> | [Baseball Game](https://leetcode.com/problems/baseball-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/baseball-game) | Easy |
-| <span id="683">683</span> | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots) | Hard |
-| <span id="684">684</span> | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | [Go](https://github.com/openset/leetcode/tree/master/problems/redundant-connection) | Medium |
-| <span id="685">685</span> | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii) | Hard |
-| <span id="686">686</span> | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-string-match) | Easy |
-| <span id="687">687</span> | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-univalue-path) | Easy |
-| <span id="688">688</span> | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/knight-probability-in-chessboard) | Medium |
-| <span id="689">689</span> | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-3-non-overlapping-subarrays) | Hard |
-| <span id="690">690</span> | [Employee Importance](https://leetcode.com/problems/employee-importance) | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-importance) | Easy |
-| <span id="691">691</span> | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/stickers-to-spell-word) | Hard |
-| <span id="692">692</span> | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-words) | Medium |
-| <span id="693">693</span> | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-number-with-alternating-bits) | Easy |
-| <span id="694">694</span> | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands) | Medium |
-| <span id="695">695</span> | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-area-of-island) | Medium |
-| <span id="696">696</span> | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-binary-substrings) | Easy |
-| <span id="697">697</span> | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/degree-of-an-array) | Easy |
-| <span id="698">698</span> | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-to-k-equal-sum-subsets) | Medium |
-| <span id="699">699</span> | [Falling Squares](https://leetcode.com/problems/falling-squares) | [Go](https://github.com/openset/leetcode/tree/master/problems/falling-squares) | Hard |
-| <span id="700">700</span> | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-a-binary-search-tree) | Easy |
-| <span id="701">701</span> | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-binary-search-tree) | Medium |
-| <span id="702">702</span> | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-a-sorted-array-of-unknown-size) | Medium |
-| <span id="703">703</span> | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-a-stream) | Easy |
-| <span id="704">704</span> | [Binary Search](https://leetcode.com/problems/binary-search) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-search) | Easy |
-| <span id="705">705</span> | [Design HashSet](https://leetcode.com/problems/design-hashset) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hashset) | Easy |
-| <span id="706">706</span> | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hashmap) | Easy |
-| <span id="707">707</span> | [Design Linked List](https://leetcode.com/problems/design-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-linked-list) | Easy |
-| <span id="708">708</span> | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-cyclic-sorted-list) | Medium |
-| <span id="709">709</span> | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [Go](https://github.com/openset/leetcode/tree/master/problems/to-lower-case) | Easy |
-| <span id="710">710</span> | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-blacklist) | Hard |
-| <span id="711">711</span> | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii) | Hard |
-| <span id="712">712</span> | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-ascii-delete-sum-for-two-strings) | Medium |
-| <span id="713">713</span> | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k) | Medium |
-| <span id="714">714</span> | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
-| <span id="715">715</span> | [Range Module](https://leetcode.com/problems/range-module) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-module) | Hard |
-| <span id="716">716</span> | [Max Stack](https://leetcode.com/problems/max-stack) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/max-stack) | Easy |
-| <span id="717">717</span> | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | [Go](https://github.com/openset/leetcode/tree/master/problems/1-bit-and-2-bit-characters) | Easy |
-| <span id="718">718</span> | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-repeated-subarray) | Medium |
-| <span id="719">719</span> | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance) | Hard |
-| <span id="720">720</span> | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary) | Easy |
-| <span id="721">721</span> | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | [Go](https://github.com/openset/leetcode/tree/master/problems/accounts-merge) | Medium |
-| <span id="722">722</span> | [Remove Comments](https://leetcode.com/problems/remove-comments) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-comments) | Medium |
-| <span id="723">723</span> | [Candy Crush](https://leetcode.com/problems/candy-crush) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/candy-crush) | Medium |
-| <span id="724">724</span> | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-pivot-index) | Easy |
-| <span id="725">725</span> | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-linked-list-in-parts) | Medium |
-| <span id="726">726</span> | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms) | Hard |
-| <span id="727">727</span> | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-window-subsequence) | Hard |
-| <span id="728">728</span> | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/self-dividing-numbers) | Easy |
-| <span id="729">729</span> | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-i) | Medium |
-| <span id="730">730</span> | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-different-palindromic-subsequences) | Hard |
-| <span id="731">731</span> | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii) | Medium |
-| <span id="732">732</span> | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii) | Hard |
-| <span id="733">733</span> | [Flood Fill](https://leetcode.com/problems/flood-fill) | [Go](https://github.com/openset/leetcode/tree/master/problems/flood-fill) | Easy |
-| <span id="734">734</span> | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity) | Easy |
-| <span id="735">735</span> | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [Go](https://github.com/openset/leetcode/tree/master/problems/asteroid-collision) | Medium |
-| <span id="736">736</span> | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression) | [Go](https://github.com/openset/leetcode/tree/master/problems/parse-lisp-expression) | Hard |
-| <span id="737">737</span> | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii) | Medium |
-| <span id="738">738</span> | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/monotone-increasing-digits) | Medium |
-| <span id="739">739</span> | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [Go](https://github.com/openset/leetcode/tree/master/problems/daily-temperatures) | Medium |
-| <span id="740">740</span> | [Delete and Earn](https://leetcode.com/problems/delete-and-earn) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-and-earn) | Medium |
-| <span id="741">741</span> | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup) | [Go](https://github.com/openset/leetcode/tree/master/problems/cherry-pickup) | Hard |
-| <span id="742">742</span> | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-leaf-in-a-binary-tree) | Medium |
-| <span id="743">743</span> | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | [Go](https://github.com/openset/leetcode/tree/master/problems/network-delay-time) | Easy |
-| <span id="744">744</span> | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-smallest-letter-greater-than-target) | Easy |
-| <span id="745">745</span> | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search) | [Go](https://github.com/openset/leetcode/tree/master/problems/prefix-and-suffix-search) | Hard |
-| <span id="746">746</span> | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/min-cost-climbing-stairs) | Easy |
-| <span id="747">747</span> | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-number-at-least-twice-of-others) | Easy |
-| <span id="748">748</span> | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-completing-word) | Easy |
-| <span id="749">749</span> | [Contain Virus](https://leetcode.com/problems/contain-virus) | [Go](https://github.com/openset/leetcode/tree/master/problems/contain-virus) | Hard |
-| <span id="750">750</span> | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-corner-rectangles) | Medium |
-| <span id="751">751</span> | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/ip-to-cidr) | Easy |
-| <span id="752">752</span> | [Open the Lock](https://leetcode.com/problems/open-the-lock) | [Go](https://github.com/openset/leetcode/tree/master/problems/open-the-lock) | Medium |
-| <span id="753">753</span> | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | [Go](https://github.com/openset/leetcode/tree/master/problems/cracking-the-safe) | Hard |
-| <span id="754">754</span> | [Reach a Number](https://leetcode.com/problems/reach-a-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/reach-a-number) | Easy |
-| <span id="755">755</span> | [Pour Water](https://leetcode.com/problems/pour-water) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/pour-water) | Medium |
-| <span id="756">756</span> | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/pyramid-transition-matrix) | Medium |
-| <span id="757">757</span> | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two) | [Go](https://github.com/openset/leetcode/tree/master/problems/set-intersection-size-at-least-two) | Hard |
-| <span id="758">758</span> | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/bold-words-in-string) | Easy |
-| <span id="759">759</span> | [Employee Free Time](https://leetcode.com/problems/employee-free-time) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-free-time) | Hard |
-| <span id="760">760</span> | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-anagram-mappings) | Easy |
-| <span id="761">761</span> | [Special Binary String](https://leetcode.com/problems/special-binary-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/special-binary-string) | Hard |
-| <span id="762">762</span> | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [Go](https://github.com/openset/leetcode/tree/master/problems/prime-number-of-set-bits-in-binary-representation) | Easy |
-| <span id="763">763</span> | [Partition Labels](https://leetcode.com/problems/partition-labels) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-labels) | Medium |
-| <span id="764">764</span> | [Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-plus-sign) | Medium |
-| <span id="765">765</span> | [Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands) | [Go](https://github.com/openset/leetcode/tree/master/problems/couples-holding-hands) | Hard |
-| <span id="766">766</span> | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/toeplitz-matrix) | Easy |
-| <span id="767">767</span> | [Reorganize String](https://leetcode.com/problems/reorganize-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reorganize-string) | Medium |
-| <span id="768">768</span> | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted-ii) | Hard |
-| <span id="769">769</span> | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted) | Medium |
-| <span id="770">770</span> | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv) | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iv) | Hard |
-| <span id="771">771</span> | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | [Go](https://github.com/openset/leetcode/tree/master/problems/jewels-and-stones) | Easy |
-| <span id="772">772</span> | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) | Hard |
-| <span id="773">773</span> | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle) | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-puzzle) | Hard |
-| <span id="774">774</span> | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station) | Hard |
-| <span id="775">775</span> | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | [Go](https://github.com/openset/leetcode/tree/master/problems/global-and-local-inversions) | Medium |
-| <span id="776">776</span> | [Split BST](https://leetcode.com/problems/split-bst) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-bst) | Medium |
-| <span id="777">777</span> | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-adjacent-in-lr-string) | Medium |
-| <span id="778">778</span> | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water) | [Go](https://github.com/openset/leetcode/tree/master/problems/swim-in-rising-water) | Hard |
-| <span id="779">779</span> | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-symbol-in-grammar) | Medium |
-| <span id="780">780</span> | [Reaching Points](https://leetcode.com/problems/reaching-points) | [Go](https://github.com/openset/leetcode/tree/master/problems/reaching-points) | Hard |
-| <span id="781">781</span> | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest) | [Go](https://github.com/openset/leetcode/tree/master/problems/rabbits-in-forest) | Medium |
-| <span id="782">782</span> | [Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/transform-to-chessboard) | Hard |
-| <span id="783">783</span> | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes) | Easy |
-| <span id="784">784</span> | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation) | [Go](https://github.com/openset/leetcode/tree/master/problems/letter-case-permutation) | Easy |
-| <span id="785">785</span> | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite) | [Go](https://github.com/openset/leetcode/tree/master/problems/is-graph-bipartite) | Medium |
-| <span id="786">786</span> | [K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-prime-fraction) | Hard |
-| <span id="787">787</span> | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops) | [Go](https://github.com/openset/leetcode/tree/master/problems/cheapest-flights-within-k-stops) | Medium |
-| <span id="788">788</span> | [Rotated Digits](https://leetcode.com/problems/rotated-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotated-digits) | Easy |
-| <span id="789">789</span> | [Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts) | [Go](https://github.com/openset/leetcode/tree/master/problems/escape-the-ghosts) | Medium |
-| <span id="790">790</span> | [Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling) | [Go](https://github.com/openset/leetcode/tree/master/problems/domino-and-tromino-tiling) | Medium |
-| <span id="791">791</span> | [Custom Sort String](https://leetcode.com/problems/custom-sort-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/custom-sort-string) | Medium |
-| <span id="792">792</span> | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-matching-subsequences) | Medium |
-| <span id="793">793</span> | [Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function) | [Go](https://github.com/openset/leetcode/tree/master/problems/preimage-size-of-factorial-zeroes-function) | Hard |
-| <span id="794">794</span> | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-tic-tac-toe-state) | Medium |
-| <span id="795">795</span> | [Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-subarrays-with-bounded-maximum) | Medium |
-| <span id="796">796</span> | [Rotate String](https://leetcode.com/problems/rotate-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-string) | Easy |
-| <span id="797">797</span> | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-paths-from-source-to-target) | Medium |
-| <span id="798">798</span> | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-rotation-with-highest-score) | Hard |
-| <span id="799">799</span> | [Champagne Tower](https://leetcode.com/problems/champagne-tower) | [Go](https://github.com/openset/leetcode/tree/master/problems/champagne-tower) | Medium |
-| <span id="800">800</span> | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color) | Easy |
-| <span id="801">801</span> | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-make-sequences-increasing) | Medium |
-| <span id="802">802</span> | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-eventual-safe-states) | Medium |
-| <span id="803">803</span> | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit) | [Go](https://github.com/openset/leetcode/tree/master/problems/bricks-falling-when-hit) | Hard |
-| <span id="804">804</span> | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-morse-code-words) | Easy |
-| <span id="805">805</span> | [Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-with-same-average) | Hard |
-| <span id="806">806</span> | [Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-lines-to-write-string) | Easy |
-| <span id="807">807</span> | [Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-increase-to-keep-city-skyline) | Medium |
-| <span id="808">808</span> | [Soup Servings](https://leetcode.com/problems/soup-servings) | [Go](https://github.com/openset/leetcode/tree/master/problems/soup-servings) | Medium |
-| <span id="809">809</span> | [Expressive Words](https://leetcode.com/problems/expressive-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/expressive-words) | Medium |
-| <span id="810">810</span> | [Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/chalkboard-xor-game) | Hard |
-| <span id="811">811</span> | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count) | [Go](https://github.com/openset/leetcode/tree/master/problems/subdomain-visit-count) | Easy |
-| <span id="812">812</span> | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-triangle-area) | Easy |
-| <span id="813">813</span> | [Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-sum-of-averages) | Medium |
-| <span id="814">814</span> | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-pruning) | Medium |
-| <span id="815">815</span> | [Bus Routes](https://leetcode.com/problems/bus-routes) | [Go](https://github.com/openset/leetcode/tree/master/problems/bus-routes) | Hard |
-| <span id="816">816</span> | [Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates) | [Go](https://github.com/openset/leetcode/tree/master/problems/ambiguous-coordinates) | Medium |
-| <span id="817">817</span> | [Linked List Components](https://leetcode.com/problems/linked-list-components) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-components) | Medium |
-| <span id="818">818</span> | [Race Car](https://leetcode.com/problems/race-car) | [Go](https://github.com/openset/leetcode/tree/master/problems/race-car) | Hard |
-| <span id="819">819</span> | [Most Common Word](https://leetcode.com/problems/most-common-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-common-word) | Easy |
-| <span id="820">820</span> | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/short-encoding-of-words) | Medium |
-| <span id="821">821</span> | [Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-to-a-character) | Easy |
-| <span id="822">822</span> | [Card Flipping Game](https://leetcode.com/problems/card-flipping-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/card-flipping-game) | Medium |
-| <span id="823">823</span> | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-trees-with-factors) | Medium |
-| <span id="824">824</span> | [Goat Latin](https://leetcode.com/problems/goat-latin) | [Go](https://github.com/openset/leetcode/tree/master/problems/goat-latin) | Easy |
-| <span id="825">825</span> | [Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages) | [Go](https://github.com/openset/leetcode/tree/master/problems/friends-of-appropriate-ages) | Medium |
-| <span id="826">826</span> | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-profit-assigning-work) | Medium |
-| <span id="827">827</span> | [Making A Large Island](https://leetcode.com/problems/making-a-large-island) | [Go](https://github.com/openset/leetcode/tree/master/problems/making-a-large-island) | Hard |
-| <span id="828">828</span> | [Unique Letter String](https://leetcode.com/problems/unique-letter-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-letter-string) | Hard |
-| <span id="829">829</span> | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers-sum) | Hard |
-| <span id="830">830</span> | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups) | [Go](https://github.com/openset/leetcode/tree/master/problems/positions-of-large-groups) | Easy |
-| <span id="831">831</span> | [Masking Personal Information](https://leetcode.com/problems/masking-personal-information) | [Go](https://github.com/openset/leetcode/tree/master/problems/masking-personal-information) | Medium |
-| <span id="832">832</span> | [Flipping an Image](https://leetcode.com/problems/flipping-an-image) | [Go](https://github.com/openset/leetcode/tree/master/problems/flipping-an-image) | Easy |
-| <span id="833">833</span> | [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-in-string) | Medium |
-| <span id="834">834</span> | [Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-distances-in-tree) | Hard |
-| <span id="835">835</span> | [Image Overlap](https://leetcode.com/problems/image-overlap) | [Go](https://github.com/openset/leetcode/tree/master/problems/image-overlap) | Medium |
-| <span id="836">836</span> | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | [Go](https://github.com/openset/leetcode/tree/master/problems/rectangle-overlap) | Easy |
-| <span id="837">837</span> | [New 21 Game](https://leetcode.com/problems/new-21-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/new-21-game) | Medium |
-| <span id="838">838</span> | [Push Dominoes](https://leetcode.com/problems/push-dominoes) | [Go](https://github.com/openset/leetcode/tree/master/problems/push-dominoes) | Medium |
-| <span id="839">839</span> | [Similar String Groups](https://leetcode.com/problems/similar-string-groups) | [Go](https://github.com/openset/leetcode/tree/master/problems/similar-string-groups) | Hard |
-| <span id="840">840</span> | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid) | [Go](https://github.com/openset/leetcode/tree/master/problems/magic-squares-in-grid) | Easy |
-| <span id="841">841</span> | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms) | [Go](https://github.com/openset/leetcode/tree/master/problems/keys-and-rooms) | Medium |
-| <span id="842">842</span> | [Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-into-fibonacci-sequence) | Medium |
-| <span id="843">843</span> | [Guess the Word](https://leetcode.com/problems/guess-the-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/guess-the-word) | Hard |
-| <span id="844">844</span> | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | [Go](https://github.com/openset/leetcode/tree/master/problems/backspace-string-compare) | Easy |
-| <span id="845">845</span> | [Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-mountain-in-array) | Medium |
-| <span id="846">846</span> | [Hand of Straights](https://leetcode.com/problems/hand-of-straights) | [Go](https://github.com/openset/leetcode/tree/master/problems/hand-of-straights) | Medium |
-| <span id="847">847</span> | [Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-path-visiting-all-nodes) | Hard |
-| <span id="848">848</span> | [Shifting Letters](https://leetcode.com/problems/shifting-letters) | [Go](https://github.com/openset/leetcode/tree/master/problems/shifting-letters) | Medium |
-| <span id="849">849</span> | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximize-distance-to-closest-person) | Easy |
-| <span id="850">850</span> | [Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/rectangle-area-ii) | Hard |
-| <span id="851">851</span> | [Loud and Rich](https://leetcode.com/problems/loud-and-rich) | [Go](https://github.com/openset/leetcode/tree/master/problems/loud-and-rich) | Medium |
-| <span id="852">852</span> | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/peak-index-in-a-mountain-array) | Easy |
-| <span id="853">853</span> | [Car Fleet](https://leetcode.com/problems/car-fleet) | [Go](https://github.com/openset/leetcode/tree/master/problems/car-fleet) | Medium |
-| <span id="854">854</span> | [K-Similar Strings](https://leetcode.com/problems/k-similar-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-similar-strings) | Hard |
-| <span id="855">855</span> | [Exam Room](https://leetcode.com/problems/exam-room) | [Go](https://github.com/openset/leetcode/tree/master/problems/exam-room) | Medium |
-| <span id="856">856</span> | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/score-of-parentheses) | Medium |
-| <span id="857">857</span> | [Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-hire-k-workers) | Hard |
-| <span id="858">858</span> | [Mirror Reflection](https://leetcode.com/problems/mirror-reflection) | [Go](https://github.com/openset/leetcode/tree/master/problems/mirror-reflection) | Medium |
-| <span id="859">859</span> | [Buddy Strings](https://leetcode.com/problems/buddy-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/buddy-strings) | Easy |
-| <span id="860">860</span> | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [Go](https://github.com/openset/leetcode/tree/master/problems/lemonade-change) | Easy |
-| <span id="861">861</span> | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/score-after-flipping-matrix) | Medium |
-| <span id="862">862</span> | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-subarray-with-sum-at-least-k) | Hard |
-| <span id="863">863</span> | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-nodes-distance-k-in-binary-tree) | Medium |
-| <span id="864">864</span> | [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-path-to-get-all-keys) | Hard |
-| <span id="865">865</span> | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-subtree-with-all-the-deepest-nodes) | Medium |
-| <span id="866">866</span> | [Prime Palindrome](https://leetcode.com/problems/prime-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/prime-palindrome) | Medium |
-| <span id="867">867</span> | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/transpose-matrix) | Easy |
-| <span id="868">868</span> | [Binary Gap](https://leetcode.com/problems/binary-gap) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-gap) | Easy |
-| <span id="869">869</span> | [Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2) | [Go](https://github.com/openset/leetcode/tree/master/problems/reordered-power-of-2) | Medium |
-| <span id="870">870</span> | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle) | [Go](https://github.com/openset/leetcode/tree/master/problems/advantage-shuffle) | Medium |
-| <span id="871">871</span> | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-refueling-stops) | Hard |
-| <span id="872">872</span> | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/leaf-similar-trees) | Easy |
-| <span id="873">873</span> | [Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/length-of-longest-fibonacci-subsequence) | Medium |
-| <span id="874">874</span> | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation) | [Go](https://github.com/openset/leetcode/tree/master/problems/walking-robot-simulation) | Easy |
-| <span id="875">875</span> | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas) | [Go](https://github.com/openset/leetcode/tree/master/problems/koko-eating-bananas) | Medium |
-| <span id="876">876</span> | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/middle-of-the-linked-list) | Easy |
-| <span id="877">877</span> | [Stone Game](https://leetcode.com/problems/stone-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/stone-game) | Medium |
-| <span id="878">878</span> | [Nth Magical Number](https://leetcode.com/problems/nth-magical-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/nth-magical-number) | Hard |
-| <span id="879">879</span> | [Profitable Schemes](https://leetcode.com/problems/profitable-schemes) | [Go](https://github.com/openset/leetcode/tree/master/problems/profitable-schemes) | Hard |
-| <span id="880">880</span> | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/decoded-string-at-index) | Medium |
-| <span id="881">881</span> | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people) | [Go](https://github.com/openset/leetcode/tree/master/problems/boats-to-save-people) | Medium |
-| <span id="882">882</span> | [Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph) | [Go](https://github.com/openset/leetcode/tree/master/problems/reachable-nodes-in-subdivided-graph) | Hard |
-| <span id="883">883</span> | [Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/problems/projection-area-of-3d-shapes) | Easy |
-| <span id="884">884</span> | [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences) | [Go](https://github.com/openset/leetcode/tree/master/problems/uncommon-words-from-two-sentences) | Easy |
-| <span id="885">885</span> | [Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-iii) | Medium |
-| <span id="886">886</span> | [Possible Bipartition](https://leetcode.com/problems/possible-bipartition) | [Go](https://github.com/openset/leetcode/tree/master/problems/possible-bipartition) | Medium |
-| <span id="887">887</span> | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-egg-drop) | Hard |
-| <span id="888">888</span> | [Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap) | [Go](https://github.com/openset/leetcode/tree/master/problems/fair-candy-swap) | Easy |
-| <span id="889">889</span> | [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | Medium |
-| <span id="890">890</span> | [Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-pattern) | Medium |
-| <span id="891">891</span> | [Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-subsequence-widths) | Hard |
-| <span id="892">892</span> | [Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/problems/surface-area-of-3d-shapes) | Easy |
-| <span id="893">893</span> | [Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/groups-of-special-equivalent-strings) | Easy |
-| <span id="894">894</span> | [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-possible-full-binary-trees) | Medium |
-| <span id="895">895</span> | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-frequency-stack) | Hard |
-| <span id="896">896</span> | [Monotonic Array](https://leetcode.com/problems/monotonic-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/monotonic-array) | Easy |
-| <span id="897">897</span> | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-order-search-tree) | Easy |
-| <span id="898">898</span> | [Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/bitwise-ors-of-subarrays) | Medium |
-| <span id="899">899</span> | [Orderly Queue](https://leetcode.com/problems/orderly-queue) | [Go](https://github.com/openset/leetcode/tree/master/problems/orderly-queue) | Hard |
-| <span id="900">900</span> | [RLE Iterator](https://leetcode.com/problems/rle-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/rle-iterator) | Medium |
-| <span id="901">901</span> | [Online Stock Span](https://leetcode.com/problems/online-stock-span) | [Go](https://github.com/openset/leetcode/tree/master/problems/online-stock-span) | Medium |
-| <span id="902">902</span> | [Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set) | [Go](https://github.com/openset/leetcode/tree/master/problems/numbers-at-most-n-given-digit-set) | Hard |
-| <span id="903">903</span> | [Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-permutations-for-di-sequence) | Hard |
-| <span id="904">904</span> | [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets) | [Go](https://github.com/openset/leetcode/tree/master/problems/fruit-into-baskets) | Medium |
-| <span id="905">905</span> | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity) | Easy |
-| <span id="906">906</span> | [Super Palindromes](https://leetcode.com/problems/super-palindromes) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-palindromes) | Hard |
-| <span id="907">907</span> | [Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-subarray-minimums) | Medium |
-| <span id="908">908</span> | [Smallest Range I](https://leetcode.com/problems/smallest-range-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range-i) | Easy |
-| <span id="909">909</span> | [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders) | [Go](https://github.com/openset/leetcode/tree/master/problems/snakes-and-ladders) | Medium |
-| <span id="910">910</span> | [Smallest Range II](https://leetcode.com/problems/smallest-range-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range-ii) | Medium |
-| <span id="911">911</span> | [Online Election](https://leetcode.com/problems/online-election) | [Go](https://github.com/openset/leetcode/tree/master/problems/online-election) | Medium |
-| <span id="913">913</span> | [Cat and Mouse](https://leetcode.com/problems/cat-and-mouse) | [Go](https://github.com/openset/leetcode/tree/master/problems/cat-and-mouse) | Hard |
-| <span id="914">914</span> | [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | [Go](https://github.com/openset/leetcode/tree/master/problems/x-of-a-kind-in-a-deck-of-cards) | Easy |
-| <span id="915">915</span> | [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-array-into-disjoint-intervals) | Medium |
-| <span id="916">916</span> | [Word Subsets](https://leetcode.com/problems/word-subsets) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-subsets) | Medium |
-| <span id="917">917</span> | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-only-letters) | Easy |
-| <span id="918">918</span> | [Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-circular-subarray) | Medium |
-| <span id="919">919</span> | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter) | [Go](https://github.com/openset/leetcode/tree/master/problems/complete-binary-tree-inserter) | Medium |
-| <span id="920">920</span> | [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-music-playlists) | Hard |
-| <span id="921">921</span> | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-add-to-make-parentheses-valid) | Medium |
-| <span id="922">922</span> | [Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity-ii) | Easy |
-| <span id="923">923</span> | [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity) | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-with-multiplicity) | Medium |
-| <span id="924">924</span> | [Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread) | Hard |
-| <span id="925">925</span> | [Long Pressed Name](https://leetcode.com/problems/long-pressed-name) | [Go](https://github.com/openset/leetcode/tree/master/problems/long-pressed-name) | Easy |
-| <span id="926">926</span> | [Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing) | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-string-to-monotone-increasing) | Medium |
-| <span id="927">927</span> | [Three Equal Parts](https://leetcode.com/problems/three-equal-parts) | [Go](https://github.com/openset/leetcode/tree/master/problems/three-equal-parts) | Hard |
-| <span id="928">928</span> | [Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread-ii) | Hard |
-| <span id="929">929</span> | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-email-addresses) | Easy |
-| <span id="930">930</span> | [Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-subarrays-with-sum) | Medium |
-| <span id="931">931</span> | [Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-falling-path-sum) | Medium |
-| <span id="932">932</span> | [Beautiful Array](https://leetcode.com/problems/beautiful-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-array) | Medium |
-| <span id="933">933</span> | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-recent-calls) | Easy |
-| <span id="934">934</span> | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-bridge) | Medium |
-| <span id="935">935</span> | [Knight Dialer](https://leetcode.com/problems/knight-dialer) | [Go](https://github.com/openset/leetcode/tree/master/problems/knight-dialer) | Medium |
-| <span id="936">936</span> | [Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/stamping-the-sequence) | Hard |
-| <span id="937">937</span> | [Reorder Log Files](https://leetcode.com/problems/reorder-log-files) | [Go](https://github.com/openset/leetcode/tree/master/problems/reorder-log-files) | Easy |
-| <span id="938">938</span> | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-of-bst) | Medium |
-| <span id="939">939</span> | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle) | Medium |
-| <span id="940">940</span> | [Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences-ii) | Hard |
-| <span id="941">941</span> | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-mountain-array) | Easy |
-| <span id="942">942</span> | [DI String Match](https://leetcode.com/problems/di-string-match) | [Go](https://github.com/openset/leetcode/tree/master/problems/di-string-match) | Easy |
-| <span id="943">943</span> | [Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-shortest-superstring) | Hard |
-| <span id="944">944</span> | [Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted) | Easy |
-| <span id="945">945</span> | [Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-increment-to-make-array-unique) | Medium |
-| <span id="946">946</span> | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-stack-sequences) | Medium |
-| <span id="947">947</span> | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-stones-removed-with-same-row-or-column) | Medium |
-| <span id="948">948</span> | [Bag of Tokens](https://leetcode.com/problems/bag-of-tokens) | [Go](https://github.com/openset/leetcode/tree/master/problems/bag-of-tokens) | Medium |
-| <span id="949">949</span> | [Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-time-for-given-digits) | Easy |
-| <span id="950">950</span> | [Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order) | [Go](https://github.com/openset/leetcode/tree/master/problems/reveal-cards-in-increasing-order) | Medium |
-| <span id="951">951</span> | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-equivalent-binary-trees) | Medium |
-| <span id="952">952</span> | [Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-component-size-by-common-factor) | Hard |
-| <span id="953">953</span> | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/problems/verifying-an-alien-dictionary) | Easy |
-| <span id="954">954</span> | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/array-of-doubled-pairs) | Medium |
-| <span id="955">955</span> | [Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-ii) | Medium |
-| <span id="956">956</span> | [Tallest Billboard](https://leetcode.com/problems/tallest-billboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/tallest-billboard) | Hard |
-| <span id="957">957</span> | [Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days) | [Go](https://github.com/openset/leetcode/tree/master/problems/prison-cells-after-n-days) | Medium |
-| <span id="958">958</span> | [Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/check-completeness-of-a-binary-tree) | Medium |
-| <span id="959">959</span> | [Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes) | [Go](https://github.com/openset/leetcode/tree/master/problems/regions-cut-by-slashes) | Medium |
-| <span id="960">960</span> | [Delete Columns to Make Sorted III](https://leetcode.com/problems/delete-columns-to-make-sorted-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-iii) | Hard |
-| <span id="961">961</span> | [N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-repeated-element-in-size-2n-array) | Easy |
-| <span id="962">962</span> | [Maximum Width Ramp](https://leetcode.com/problems/maximum-width-ramp) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-width-ramp) | Medium |
-| <span id="963">963</span> | [Minimum Area Rectangle II](https://leetcode.com/problems/minimum-area-rectangle-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle-ii) | Medium |
+| <span id="968">968</span> | [Binary Tree Cameras](https://leetcode.com/problems/binary-tree-cameras) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-cameras) | Hard |
+| <span id="967">967</span> | [Numbers With Same Consecutive Differences](https://leetcode.com/problems/numbers-with-same-consecutive-differences) | [Go](https://github.com/openset/leetcode/tree/master/problems/numbers-with-same-consecutive-differences) | Medium |
+| <span id="966">966</span> | [Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker) | [Go](https://github.com/openset/leetcode/tree/master/problems/vowel-spellchecker) | Medium |
+| <span id="965">965</span> | [Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/univalued-binary-tree) | Easy |
 | <span id="964">964</span> | [Least Operators to Express Number](https://leetcode.com/problems/least-operators-to-express-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/least-operators-to-express-number) | Hard |
+| <span id="963">963</span> | [Minimum Area Rectangle II](https://leetcode.com/problems/minimum-area-rectangle-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle-ii) | Medium |
+| <span id="962">962</span> | [Maximum Width Ramp](https://leetcode.com/problems/maximum-width-ramp) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-width-ramp) | Medium |
+| <span id="961">961</span> | [N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-repeated-element-in-size-2n-array) | Easy |
+| <span id="960">960</span> | [Delete Columns to Make Sorted III](https://leetcode.com/problems/delete-columns-to-make-sorted-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-iii) | Hard |
+| <span id="959">959</span> | [Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes) | [Go](https://github.com/openset/leetcode/tree/master/problems/regions-cut-by-slashes) | Medium |
+| <span id="958">958</span> | [Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/check-completeness-of-a-binary-tree) | Medium |
+| <span id="957">957</span> | [Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days) | [Go](https://github.com/openset/leetcode/tree/master/problems/prison-cells-after-n-days) | Medium |
+| <span id="956">956</span> | [Tallest Billboard](https://leetcode.com/problems/tallest-billboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/tallest-billboard) | Hard |
+| <span id="955">955</span> | [Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-ii) | Medium |
+| <span id="954">954</span> | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/array-of-doubled-pairs) | Medium |
+| <span id="953">953</span> | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/problems/verifying-an-alien-dictionary) | Easy |
+| <span id="952">952</span> | [Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-component-size-by-common-factor) | Hard |
+| <span id="951">951</span> | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-equivalent-binary-trees) | Medium |
+| <span id="950">950</span> | [Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order) | [Go](https://github.com/openset/leetcode/tree/master/problems/reveal-cards-in-increasing-order) | Medium |
+| <span id="949">949</span> | [Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-time-for-given-digits) | Easy |
+| <span id="948">948</span> | [Bag of Tokens](https://leetcode.com/problems/bag-of-tokens) | [Go](https://github.com/openset/leetcode/tree/master/problems/bag-of-tokens) | Medium |
+| <span id="947">947</span> | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-stones-removed-with-same-row-or-column) | Medium |
+| <span id="946">946</span> | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-stack-sequences) | Medium |
+| <span id="945">945</span> | [Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-increment-to-make-array-unique) | Medium |
+| <span id="944">944</span> | [Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted) | Easy |
+| <span id="943">943</span> | [Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-shortest-superstring) | Hard |
+| <span id="942">942</span> | [DI String Match](https://leetcode.com/problems/di-string-match) | [Go](https://github.com/openset/leetcode/tree/master/problems/di-string-match) | Easy |
+| <span id="941">941</span> | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-mountain-array) | Easy |
+| <span id="940">940</span> | [Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences-ii) | Hard |
+| <span id="939">939</span> | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle) | Medium |
+| <span id="938">938</span> | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-of-bst) | Medium |
+| <span id="937">937</span> | [Reorder Log Files](https://leetcode.com/problems/reorder-log-files) | [Go](https://github.com/openset/leetcode/tree/master/problems/reorder-log-files) | Easy |
+| <span id="936">936</span> | [Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/stamping-the-sequence) | Hard |
+| <span id="935">935</span> | [Knight Dialer](https://leetcode.com/problems/knight-dialer) | [Go](https://github.com/openset/leetcode/tree/master/problems/knight-dialer) | Medium |
+| <span id="934">934</span> | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-bridge) | Medium |
+| <span id="933">933</span> | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-recent-calls) | Easy |
+| <span id="932">932</span> | [Beautiful Array](https://leetcode.com/problems/beautiful-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-array) | Medium |
+| <span id="931">931</span> | [Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-falling-path-sum) | Medium |
+| <span id="930">930</span> | [Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-subarrays-with-sum) | Medium |
+| <span id="929">929</span> | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-email-addresses) | Easy |
+| <span id="928">928</span> | [Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread-ii) | Hard |
+| <span id="927">927</span> | [Three Equal Parts](https://leetcode.com/problems/three-equal-parts) | [Go](https://github.com/openset/leetcode/tree/master/problems/three-equal-parts) | Hard |
+| <span id="926">926</span> | [Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing) | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-string-to-monotone-increasing) | Medium |
+| <span id="925">925</span> | [Long Pressed Name](https://leetcode.com/problems/long-pressed-name) | [Go](https://github.com/openset/leetcode/tree/master/problems/long-pressed-name) | Easy |
+| <span id="924">924</span> | [Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread) | Hard |
+| <span id="923">923</span> | [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity) | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-with-multiplicity) | Medium |
+| <span id="922">922</span> | [Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity-ii) | Easy |
+| <span id="921">921</span> | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-add-to-make-parentheses-valid) | Medium |
+| <span id="920">920</span> | [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-music-playlists) | Hard |
+| <span id="919">919</span> | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter) | [Go](https://github.com/openset/leetcode/tree/master/problems/complete-binary-tree-inserter) | Medium |
+| <span id="918">918</span> | [Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-circular-subarray) | Medium |
+| <span id="917">917</span> | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-only-letters) | Easy |
+| <span id="916">916</span> | [Word Subsets](https://leetcode.com/problems/word-subsets) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-subsets) | Medium |
+| <span id="915">915</span> | [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-array-into-disjoint-intervals) | Medium |
+| <span id="914">914</span> | [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | [Go](https://github.com/openset/leetcode/tree/master/problems/x-of-a-kind-in-a-deck-of-cards) | Easy |
+| <span id="913">913</span> | [Cat and Mouse](https://leetcode.com/problems/cat-and-mouse) | [Go](https://github.com/openset/leetcode/tree/master/problems/cat-and-mouse) | Hard |
+| <span id="911">911</span> | [Online Election](https://leetcode.com/problems/online-election) | [Go](https://github.com/openset/leetcode/tree/master/problems/online-election) | Medium |
+| <span id="910">910</span> | [Smallest Range II](https://leetcode.com/problems/smallest-range-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range-ii) | Medium |
+| <span id="909">909</span> | [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders) | [Go](https://github.com/openset/leetcode/tree/master/problems/snakes-and-ladders) | Medium |
+| <span id="908">908</span> | [Smallest Range I](https://leetcode.com/problems/smallest-range-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range-i) | Easy |
+| <span id="907">907</span> | [Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-subarray-minimums) | Medium |
+| <span id="906">906</span> | [Super Palindromes](https://leetcode.com/problems/super-palindromes) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-palindromes) | Hard |
+| <span id="905">905</span> | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity) | Easy |
+| <span id="904">904</span> | [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets) | [Go](https://github.com/openset/leetcode/tree/master/problems/fruit-into-baskets) | Medium |
+| <span id="903">903</span> | [Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-permutations-for-di-sequence) | Hard |
+| <span id="902">902</span> | [Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set) | [Go](https://github.com/openset/leetcode/tree/master/problems/numbers-at-most-n-given-digit-set) | Hard |
+| <span id="901">901</span> | [Online Stock Span](https://leetcode.com/problems/online-stock-span) | [Go](https://github.com/openset/leetcode/tree/master/problems/online-stock-span) | Medium |
+| <span id="900">900</span> | [RLE Iterator](https://leetcode.com/problems/rle-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/rle-iterator) | Medium |
+| <span id="899">899</span> | [Orderly Queue](https://leetcode.com/problems/orderly-queue) | [Go](https://github.com/openset/leetcode/tree/master/problems/orderly-queue) | Hard |
+| <span id="898">898</span> | [Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/bitwise-ors-of-subarrays) | Medium |
+| <span id="897">897</span> | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-order-search-tree) | Easy |
+| <span id="896">896</span> | [Monotonic Array](https://leetcode.com/problems/monotonic-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/monotonic-array) | Easy |
+| <span id="895">895</span> | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-frequency-stack) | Hard |
+| <span id="894">894</span> | [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-possible-full-binary-trees) | Medium |
+| <span id="893">893</span> | [Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/groups-of-special-equivalent-strings) | Easy |
+| <span id="892">892</span> | [Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/problems/surface-area-of-3d-shapes) | Easy |
+| <span id="891">891</span> | [Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-subsequence-widths) | Hard |
+| <span id="890">890</span> | [Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-pattern) | Medium |
+| <span id="889">889</span> | [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | Medium |
+| <span id="888">888</span> | [Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap) | [Go](https://github.com/openset/leetcode/tree/master/problems/fair-candy-swap) | Easy |
+| <span id="887">887</span> | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-egg-drop) | Hard |
+| <span id="886">886</span> | [Possible Bipartition](https://leetcode.com/problems/possible-bipartition) | [Go](https://github.com/openset/leetcode/tree/master/problems/possible-bipartition) | Medium |
+| <span id="885">885</span> | [Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-iii) | Medium |
+| <span id="884">884</span> | [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences) | [Go](https://github.com/openset/leetcode/tree/master/problems/uncommon-words-from-two-sentences) | Easy |
+| <span id="883">883</span> | [Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/problems/projection-area-of-3d-shapes) | Easy |
+| <span id="882">882</span> | [Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph) | [Go](https://github.com/openset/leetcode/tree/master/problems/reachable-nodes-in-subdivided-graph) | Hard |
+| <span id="881">881</span> | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people) | [Go](https://github.com/openset/leetcode/tree/master/problems/boats-to-save-people) | Medium |
+| <span id="880">880</span> | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/decoded-string-at-index) | Medium |
+| <span id="879">879</span> | [Profitable Schemes](https://leetcode.com/problems/profitable-schemes) | [Go](https://github.com/openset/leetcode/tree/master/problems/profitable-schemes) | Hard |
+| <span id="878">878</span> | [Nth Magical Number](https://leetcode.com/problems/nth-magical-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/nth-magical-number) | Hard |
+| <span id="877">877</span> | [Stone Game](https://leetcode.com/problems/stone-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/stone-game) | Medium |
+| <span id="876">876</span> | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/middle-of-the-linked-list) | Easy |
+| <span id="875">875</span> | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas) | [Go](https://github.com/openset/leetcode/tree/master/problems/koko-eating-bananas) | Medium |
+| <span id="874">874</span> | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation) | [Go](https://github.com/openset/leetcode/tree/master/problems/walking-robot-simulation) | Easy |
+| <span id="873">873</span> | [Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/length-of-longest-fibonacci-subsequence) | Medium |
+| <span id="872">872</span> | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/leaf-similar-trees) | Easy |
+| <span id="871">871</span> | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-refueling-stops) | Hard |
+| <span id="870">870</span> | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle) | [Go](https://github.com/openset/leetcode/tree/master/problems/advantage-shuffle) | Medium |
+| <span id="869">869</span> | [Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2) | [Go](https://github.com/openset/leetcode/tree/master/problems/reordered-power-of-2) | Medium |
+| <span id="868">868</span> | [Binary Gap](https://leetcode.com/problems/binary-gap) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-gap) | Easy |
+| <span id="867">867</span> | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/transpose-matrix) | Easy |
+| <span id="866">866</span> | [Prime Palindrome](https://leetcode.com/problems/prime-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/prime-palindrome) | Medium |
+| <span id="865">865</span> | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-subtree-with-all-the-deepest-nodes) | Medium |
+| <span id="864">864</span> | [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-path-to-get-all-keys) | Hard |
+| <span id="863">863</span> | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-nodes-distance-k-in-binary-tree) | Medium |
+| <span id="862">862</span> | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-subarray-with-sum-at-least-k) | Hard |
+| <span id="861">861</span> | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/score-after-flipping-matrix) | Medium |
+| <span id="860">860</span> | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [Go](https://github.com/openset/leetcode/tree/master/problems/lemonade-change) | Easy |
+| <span id="859">859</span> | [Buddy Strings](https://leetcode.com/problems/buddy-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/buddy-strings) | Easy |
+| <span id="858">858</span> | [Mirror Reflection](https://leetcode.com/problems/mirror-reflection) | [Go](https://github.com/openset/leetcode/tree/master/problems/mirror-reflection) | Medium |
+| <span id="857">857</span> | [Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-hire-k-workers) | Hard |
+| <span id="856">856</span> | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/score-of-parentheses) | Medium |
+| <span id="855">855</span> | [Exam Room](https://leetcode.com/problems/exam-room) | [Go](https://github.com/openset/leetcode/tree/master/problems/exam-room) | Medium |
+| <span id="854">854</span> | [K-Similar Strings](https://leetcode.com/problems/k-similar-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-similar-strings) | Hard |
+| <span id="853">853</span> | [Car Fleet](https://leetcode.com/problems/car-fleet) | [Go](https://github.com/openset/leetcode/tree/master/problems/car-fleet) | Medium |
+| <span id="852">852</span> | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/peak-index-in-a-mountain-array) | Easy |
+| <span id="851">851</span> | [Loud and Rich](https://leetcode.com/problems/loud-and-rich) | [Go](https://github.com/openset/leetcode/tree/master/problems/loud-and-rich) | Medium |
+| <span id="850">850</span> | [Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/rectangle-area-ii) | Hard |
+| <span id="849">849</span> | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximize-distance-to-closest-person) | Easy |
+| <span id="848">848</span> | [Shifting Letters](https://leetcode.com/problems/shifting-letters) | [Go](https://github.com/openset/leetcode/tree/master/problems/shifting-letters) | Medium |
+| <span id="847">847</span> | [Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-path-visiting-all-nodes) | Hard |
+| <span id="846">846</span> | [Hand of Straights](https://leetcode.com/problems/hand-of-straights) | [Go](https://github.com/openset/leetcode/tree/master/problems/hand-of-straights) | Medium |
+| <span id="845">845</span> | [Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-mountain-in-array) | Medium |
+| <span id="844">844</span> | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | [Go](https://github.com/openset/leetcode/tree/master/problems/backspace-string-compare) | Easy |
+| <span id="843">843</span> | [Guess the Word](https://leetcode.com/problems/guess-the-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/guess-the-word) | Hard |
+| <span id="842">842</span> | [Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-into-fibonacci-sequence) | Medium |
+| <span id="841">841</span> | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms) | [Go](https://github.com/openset/leetcode/tree/master/problems/keys-and-rooms) | Medium |
+| <span id="840">840</span> | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid) | [Go](https://github.com/openset/leetcode/tree/master/problems/magic-squares-in-grid) | Easy |
+| <span id="839">839</span> | [Similar String Groups](https://leetcode.com/problems/similar-string-groups) | [Go](https://github.com/openset/leetcode/tree/master/problems/similar-string-groups) | Hard |
+| <span id="838">838</span> | [Push Dominoes](https://leetcode.com/problems/push-dominoes) | [Go](https://github.com/openset/leetcode/tree/master/problems/push-dominoes) | Medium |
+| <span id="837">837</span> | [New 21 Game](https://leetcode.com/problems/new-21-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/new-21-game) | Medium |
+| <span id="836">836</span> | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | [Go](https://github.com/openset/leetcode/tree/master/problems/rectangle-overlap) | Easy |
+| <span id="835">835</span> | [Image Overlap](https://leetcode.com/problems/image-overlap) | [Go](https://github.com/openset/leetcode/tree/master/problems/image-overlap) | Medium |
+| <span id="834">834</span> | [Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-distances-in-tree) | Hard |
+| <span id="833">833</span> | [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-in-string) | Medium |
+| <span id="832">832</span> | [Flipping an Image](https://leetcode.com/problems/flipping-an-image) | [Go](https://github.com/openset/leetcode/tree/master/problems/flipping-an-image) | Easy |
+| <span id="831">831</span> | [Masking Personal Information](https://leetcode.com/problems/masking-personal-information) | [Go](https://github.com/openset/leetcode/tree/master/problems/masking-personal-information) | Medium |
+| <span id="830">830</span> | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups) | [Go](https://github.com/openset/leetcode/tree/master/problems/positions-of-large-groups) | Easy |
+| <span id="829">829</span> | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers-sum) | Hard |
+| <span id="828">828</span> | [Unique Letter String](https://leetcode.com/problems/unique-letter-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-letter-string) | Hard |
+| <span id="827">827</span> | [Making A Large Island](https://leetcode.com/problems/making-a-large-island) | [Go](https://github.com/openset/leetcode/tree/master/problems/making-a-large-island) | Hard |
+| <span id="826">826</span> | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-profit-assigning-work) | Medium |
+| <span id="825">825</span> | [Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages) | [Go](https://github.com/openset/leetcode/tree/master/problems/friends-of-appropriate-ages) | Medium |
+| <span id="824">824</span> | [Goat Latin](https://leetcode.com/problems/goat-latin) | [Go](https://github.com/openset/leetcode/tree/master/problems/goat-latin) | Easy |
+| <span id="823">823</span> | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-trees-with-factors) | Medium |
+| <span id="822">822</span> | [Card Flipping Game](https://leetcode.com/problems/card-flipping-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/card-flipping-game) | Medium |
+| <span id="821">821</span> | [Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-to-a-character) | Easy |
+| <span id="820">820</span> | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/short-encoding-of-words) | Medium |
+| <span id="819">819</span> | [Most Common Word](https://leetcode.com/problems/most-common-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-common-word) | Easy |
+| <span id="818">818</span> | [Race Car](https://leetcode.com/problems/race-car) | [Go](https://github.com/openset/leetcode/tree/master/problems/race-car) | Hard |
+| <span id="817">817</span> | [Linked List Components](https://leetcode.com/problems/linked-list-components) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-components) | Medium |
+| <span id="816">816</span> | [Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates) | [Go](https://github.com/openset/leetcode/tree/master/problems/ambiguous-coordinates) | Medium |
+| <span id="815">815</span> | [Bus Routes](https://leetcode.com/problems/bus-routes) | [Go](https://github.com/openset/leetcode/tree/master/problems/bus-routes) | Hard |
+| <span id="814">814</span> | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-pruning) | Medium |
+| <span id="813">813</span> | [Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-sum-of-averages) | Medium |
+| <span id="812">812</span> | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-triangle-area) | Easy |
+| <span id="811">811</span> | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count) | [Go](https://github.com/openset/leetcode/tree/master/problems/subdomain-visit-count) | Easy |
+| <span id="810">810</span> | [Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/chalkboard-xor-game) | Hard |
+| <span id="809">809</span> | [Expressive Words](https://leetcode.com/problems/expressive-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/expressive-words) | Medium |
+| <span id="808">808</span> | [Soup Servings](https://leetcode.com/problems/soup-servings) | [Go](https://github.com/openset/leetcode/tree/master/problems/soup-servings) | Medium |
+| <span id="807">807</span> | [Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-increase-to-keep-city-skyline) | Medium |
+| <span id="806">806</span> | [Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-lines-to-write-string) | Easy |
+| <span id="805">805</span> | [Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-with-same-average) | Hard |
+| <span id="804">804</span> | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-morse-code-words) | Easy |
+| <span id="803">803</span> | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit) | [Go](https://github.com/openset/leetcode/tree/master/problems/bricks-falling-when-hit) | Hard |
+| <span id="802">802</span> | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-eventual-safe-states) | Medium |
+| <span id="801">801</span> | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-make-sequences-increasing) | Medium |
+| <span id="800">800</span> | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color) | Easy |
+| <span id="799">799</span> | [Champagne Tower](https://leetcode.com/problems/champagne-tower) | [Go](https://github.com/openset/leetcode/tree/master/problems/champagne-tower) | Medium |
+| <span id="798">798</span> | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-rotation-with-highest-score) | Hard |
+| <span id="797">797</span> | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-paths-from-source-to-target) | Medium |
+| <span id="796">796</span> | [Rotate String](https://leetcode.com/problems/rotate-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-string) | Easy |
+| <span id="795">795</span> | [Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-subarrays-with-bounded-maximum) | Medium |
+| <span id="794">794</span> | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-tic-tac-toe-state) | Medium |
+| <span id="793">793</span> | [Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function) | [Go](https://github.com/openset/leetcode/tree/master/problems/preimage-size-of-factorial-zeroes-function) | Hard |
+| <span id="792">792</span> | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-matching-subsequences) | Medium |
+| <span id="791">791</span> | [Custom Sort String](https://leetcode.com/problems/custom-sort-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/custom-sort-string) | Medium |
+| <span id="790">790</span> | [Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling) | [Go](https://github.com/openset/leetcode/tree/master/problems/domino-and-tromino-tiling) | Medium |
+| <span id="789">789</span> | [Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts) | [Go](https://github.com/openset/leetcode/tree/master/problems/escape-the-ghosts) | Medium |
+| <span id="788">788</span> | [Rotated Digits](https://leetcode.com/problems/rotated-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotated-digits) | Easy |
+| <span id="787">787</span> | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops) | [Go](https://github.com/openset/leetcode/tree/master/problems/cheapest-flights-within-k-stops) | Medium |
+| <span id="786">786</span> | [K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-prime-fraction) | Hard |
+| <span id="785">785</span> | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite) | [Go](https://github.com/openset/leetcode/tree/master/problems/is-graph-bipartite) | Medium |
+| <span id="784">784</span> | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation) | [Go](https://github.com/openset/leetcode/tree/master/problems/letter-case-permutation) | Easy |
+| <span id="783">783</span> | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes) | Easy |
+| <span id="782">782</span> | [Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/transform-to-chessboard) | Hard |
+| <span id="781">781</span> | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest) | [Go](https://github.com/openset/leetcode/tree/master/problems/rabbits-in-forest) | Medium |
+| <span id="780">780</span> | [Reaching Points](https://leetcode.com/problems/reaching-points) | [Go](https://github.com/openset/leetcode/tree/master/problems/reaching-points) | Hard |
+| <span id="779">779</span> | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-symbol-in-grammar) | Medium |
+| <span id="778">778</span> | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water) | [Go](https://github.com/openset/leetcode/tree/master/problems/swim-in-rising-water) | Hard |
+| <span id="777">777</span> | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-adjacent-in-lr-string) | Medium |
+| <span id="776">776</span> | [Split BST](https://leetcode.com/problems/split-bst) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-bst) | Medium |
+| <span id="775">775</span> | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | [Go](https://github.com/openset/leetcode/tree/master/problems/global-and-local-inversions) | Medium |
+| <span id="774">774</span> | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station) | Hard |
+| <span id="773">773</span> | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle) | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-puzzle) | Hard |
+| <span id="772">772</span> | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) | Hard |
+| <span id="771">771</span> | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | [Go](https://github.com/openset/leetcode/tree/master/problems/jewels-and-stones) | Easy |
+| <span id="770">770</span> | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv) | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iv) | Hard |
+| <span id="769">769</span> | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted) | Medium |
+| <span id="768">768</span> | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted-ii) | Hard |
+| <span id="767">767</span> | [Reorganize String](https://leetcode.com/problems/reorganize-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reorganize-string) | Medium |
+| <span id="766">766</span> | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/toeplitz-matrix) | Easy |
+| <span id="765">765</span> | [Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands) | [Go](https://github.com/openset/leetcode/tree/master/problems/couples-holding-hands) | Hard |
+| <span id="764">764</span> | [Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-plus-sign) | Medium |
+| <span id="763">763</span> | [Partition Labels](https://leetcode.com/problems/partition-labels) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-labels) | Medium |
+| <span id="762">762</span> | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [Go](https://github.com/openset/leetcode/tree/master/problems/prime-number-of-set-bits-in-binary-representation) | Easy |
+| <span id="761">761</span> | [Special Binary String](https://leetcode.com/problems/special-binary-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/special-binary-string) | Hard |
+| <span id="760">760</span> | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-anagram-mappings) | Easy |
+| <span id="759">759</span> | [Employee Free Time](https://leetcode.com/problems/employee-free-time) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-free-time) | Hard |
+| <span id="758">758</span> | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/bold-words-in-string) | Easy |
+| <span id="757">757</span> | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two) | [Go](https://github.com/openset/leetcode/tree/master/problems/set-intersection-size-at-least-two) | Hard |
+| <span id="756">756</span> | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/pyramid-transition-matrix) | Medium |
+| <span id="755">755</span> | [Pour Water](https://leetcode.com/problems/pour-water) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/pour-water) | Medium |
+| <span id="754">754</span> | [Reach a Number](https://leetcode.com/problems/reach-a-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/reach-a-number) | Easy |
+| <span id="753">753</span> | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | [Go](https://github.com/openset/leetcode/tree/master/problems/cracking-the-safe) | Hard |
+| <span id="752">752</span> | [Open the Lock](https://leetcode.com/problems/open-the-lock) | [Go](https://github.com/openset/leetcode/tree/master/problems/open-the-lock) | Medium |
+| <span id="751">751</span> | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/ip-to-cidr) | Easy |
+| <span id="750">750</span> | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-corner-rectangles) | Medium |
+| <span id="749">749</span> | [Contain Virus](https://leetcode.com/problems/contain-virus) | [Go](https://github.com/openset/leetcode/tree/master/problems/contain-virus) | Hard |
+| <span id="748">748</span> | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-completing-word) | Easy |
+| <span id="747">747</span> | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-number-at-least-twice-of-others) | Easy |
+| <span id="746">746</span> | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/min-cost-climbing-stairs) | Easy |
+| <span id="745">745</span> | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search) | [Go](https://github.com/openset/leetcode/tree/master/problems/prefix-and-suffix-search) | Hard |
+| <span id="744">744</span> | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-smallest-letter-greater-than-target) | Easy |
+| <span id="743">743</span> | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | [Go](https://github.com/openset/leetcode/tree/master/problems/network-delay-time) | Easy |
+| <span id="742">742</span> | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-leaf-in-a-binary-tree) | Medium |
+| <span id="741">741</span> | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup) | [Go](https://github.com/openset/leetcode/tree/master/problems/cherry-pickup) | Hard |
+| <span id="740">740</span> | [Delete and Earn](https://leetcode.com/problems/delete-and-earn) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-and-earn) | Medium |
+| <span id="739">739</span> | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [Go](https://github.com/openset/leetcode/tree/master/problems/daily-temperatures) | Medium |
+| <span id="738">738</span> | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/monotone-increasing-digits) | Medium |
+| <span id="737">737</span> | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii) | Medium |
+| <span id="736">736</span> | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression) | [Go](https://github.com/openset/leetcode/tree/master/problems/parse-lisp-expression) | Hard |
+| <span id="735">735</span> | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [Go](https://github.com/openset/leetcode/tree/master/problems/asteroid-collision) | Medium |
+| <span id="734">734</span> | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity) | Easy |
+| <span id="733">733</span> | [Flood Fill](https://leetcode.com/problems/flood-fill) | [Go](https://github.com/openset/leetcode/tree/master/problems/flood-fill) | Easy |
+| <span id="732">732</span> | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii) | Hard |
+| <span id="731">731</span> | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii) | Medium |
+| <span id="730">730</span> | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-different-palindromic-subsequences) | Hard |
+| <span id="729">729</span> | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-i) | Medium |
+| <span id="728">728</span> | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/self-dividing-numbers) | Easy |
+| <span id="727">727</span> | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-window-subsequence) | Hard |
+| <span id="726">726</span> | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms) | Hard |
+| <span id="725">725</span> | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-linked-list-in-parts) | Medium |
+| <span id="724">724</span> | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-pivot-index) | Easy |
+| <span id="723">723</span> | [Candy Crush](https://leetcode.com/problems/candy-crush) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/candy-crush) | Medium |
+| <span id="722">722</span> | [Remove Comments](https://leetcode.com/problems/remove-comments) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-comments) | Medium |
+| <span id="721">721</span> | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | [Go](https://github.com/openset/leetcode/tree/master/problems/accounts-merge) | Medium |
+| <span id="720">720</span> | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary) | Easy |
+| <span id="719">719</span> | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance) | Hard |
+| <span id="718">718</span> | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-repeated-subarray) | Medium |
+| <span id="717">717</span> | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | [Go](https://github.com/openset/leetcode/tree/master/problems/1-bit-and-2-bit-characters) | Easy |
+| <span id="716">716</span> | [Max Stack](https://leetcode.com/problems/max-stack) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/max-stack) | Easy |
+| <span id="715">715</span> | [Range Module](https://leetcode.com/problems/range-module) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-module) | Hard |
+| <span id="714">714</span> | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
+| <span id="713">713</span> | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k) | Medium |
+| <span id="712">712</span> | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-ascii-delete-sum-for-two-strings) | Medium |
+| <span id="711">711</span> | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii) | Hard |
+| <span id="710">710</span> | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-blacklist) | Hard |
+| <span id="709">709</span> | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [Go](https://github.com/openset/leetcode/tree/master/problems/to-lower-case) | Easy |
+| <span id="708">708</span> | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-cyclic-sorted-list) | Medium |
+| <span id="707">707</span> | [Design Linked List](https://leetcode.com/problems/design-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-linked-list) | Easy |
+| <span id="706">706</span> | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hashmap) | Easy |
+| <span id="705">705</span> | [Design HashSet](https://leetcode.com/problems/design-hashset) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hashset) | Easy |
+| <span id="704">704</span> | [Binary Search](https://leetcode.com/problems/binary-search) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-search) | Easy |
+| <span id="703">703</span> | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-a-stream) | Easy |
+| <span id="702">702</span> | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-a-sorted-array-of-unknown-size) | Medium |
+| <span id="701">701</span> | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-binary-search-tree) | Medium |
+| <span id="700">700</span> | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-a-binary-search-tree) | Easy |
+| <span id="699">699</span> | [Falling Squares](https://leetcode.com/problems/falling-squares) | [Go](https://github.com/openset/leetcode/tree/master/problems/falling-squares) | Hard |
+| <span id="698">698</span> | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-to-k-equal-sum-subsets) | Medium |
+| <span id="697">697</span> | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/degree-of-an-array) | Easy |
+| <span id="696">696</span> | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-binary-substrings) | Easy |
+| <span id="695">695</span> | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-area-of-island) | Medium |
+| <span id="694">694</span> | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands) | Medium |
+| <span id="693">693</span> | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-number-with-alternating-bits) | Easy |
+| <span id="692">692</span> | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-words) | Medium |
+| <span id="691">691</span> | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/stickers-to-spell-word) | Hard |
+| <span id="690">690</span> | [Employee Importance](https://leetcode.com/problems/employee-importance) | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-importance) | Easy |
+| <span id="689">689</span> | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-3-non-overlapping-subarrays) | Hard |
+| <span id="688">688</span> | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/knight-probability-in-chessboard) | Medium |
+| <span id="687">687</span> | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-univalue-path) | Easy |
+| <span id="686">686</span> | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-string-match) | Easy |
+| <span id="685">685</span> | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii) | Hard |
+| <span id="684">684</span> | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | [Go](https://github.com/openset/leetcode/tree/master/problems/redundant-connection) | Medium |
+| <span id="683">683</span> | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots) | Hard |
+| <span id="682">682</span> | [Baseball Game](https://leetcode.com/problems/baseball-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/baseball-game) | Easy |
+| <span id="681">681</span> | [Next Closest Time](https://leetcode.com/problems/next-closest-time) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/next-closest-time) | Medium |
+| <span id="680">680</span> | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-ii) | Easy |
+| <span id="679">679</span> | [24 Game](https://leetcode.com/problems/24-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/24-game) | Hard |
+| <span id="678">678</span> | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-parenthesis-string) | Medium |
+| <span id="677">677</span> | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/map-sum-pairs) | Medium |
+| <span id="676">676</span> | [Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-magic-dictionary) | Medium |
+| <span id="675">675</span> | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event) | [Go](https://github.com/openset/leetcode/tree/master/problems/cut-off-trees-for-golf-event) | Hard |
+| <span id="674">674</span> | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-continuous-increasing-subsequence) | Easy |
+| <span id="673">673</span> | [Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-longest-increasing-subsequence) | Medium |
+| <span id="672">672</span> | [Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher-ii) | Medium |
+| <span id="671">671</span> | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/second-minimum-node-in-a-binary-tree) | Easy |
+| <span id="670">670</span> | [Maximum Swap](https://leetcode.com/problems/maximum-swap) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-swap) | Medium |
+| <span id="669">669</span> | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/trim-a-binary-search-tree) | Easy |
+| <span id="668">668</span> | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-number-in-multiplication-table) | Hard |
+| <span id="667">667</span> | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement-ii) | Medium |
+| <span id="666">666</span> | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) | Medium |
+| <span id="665">665</span> | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/non-decreasing-array) | Easy |
+| <span id="664">664</span> | [Strange Printer](https://leetcode.com/problems/strange-printer) | [Go](https://github.com/openset/leetcode/tree/master/problems/strange-printer) | Hard |
+| <span id="663">663</span> | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/equal-tree-partition) | Medium |
+| <span id="662">662</span> | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-width-of-binary-tree) | Medium |
+| <span id="661">661</span> | [Image Smoother](https://leetcode.com/problems/image-smoother) | [Go](https://github.com/openset/leetcode/tree/master/problems/image-smoother) | Easy |
+| <span id="660">660</span> | [Remove 9](https://leetcode.com/problems/remove-9) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-9) | Hard |
+| <span id="659">659</span> | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-into-consecutive-subsequences) | Medium |
+| <span id="658">658</span> | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-closest-elements) | Medium |
+| <span id="657">657</span> | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [Go](https://github.com/openset/leetcode/tree/master/problems/robot-return-to-origin) | Easy |
+| <span id="656">656</span> | [Coin Path](https://leetcode.com/problems/coin-path) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-path) | Hard |
+| <span id="655">655</span> | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/print-binary-tree) | Medium |
+| <span id="654">654</span> | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-binary-tree) | Medium |
+| <span id="653">653</span> | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-iv-input-is-a-bst) | Easy |
+| <span id="652">652</span> | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-subtrees) | Medium |
+| <span id="651">651</span> | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard) | Medium |
+| <span id="650">650</span> | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/2-keys-keyboard) | Medium |
+| <span id="649">649</span> | [Dota2 Senate](https://leetcode.com/problems/dota2-senate) | [Go](https://github.com/openset/leetcode/tree/master/problems/dota2-senate) | Medium |
+| <span id="648">648</span> | [Replace Words](https://leetcode.com/problems/replace-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/replace-words) | Medium |
+| <span id="647">647</span> | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindromic-substrings) | Medium |
+| <span id="646">646</span> | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-pair-chain) | Medium |
+| <span id="645">645</span> | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [Go](https://github.com/openset/leetcode/tree/master/problems/set-mismatch) | Easy |
+| <span id="644">644</span> | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-ii) | Hard |
+| <span id="643">643</span> | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-i) | Easy |
+| <span id="642">642</span> | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-search-autocomplete-system) | Hard |
+| <span id="641">641</span> | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-circular-deque) | Medium |
+| <span id="640">640</span> | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | [Go](https://github.com/openset/leetcode/tree/master/problems/solve-the-equation) | Medium |
+| <span id="639">639</span> | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-ways-ii) | Hard |
+| <span id="638">638</span> | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | [Go](https://github.com/openset/leetcode/tree/master/problems/shopping-offers) | Medium |
+| <span id="637">637</span> | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/average-of-levels-in-binary-tree) | Easy |
+| <span id="636">636</span> | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | [Go](https://github.com/openset/leetcode/tree/master/problems/exclusive-time-of-functions) | Medium |
+| <span id="635">635</span> | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-log-storage-system) | Medium |
+| <span id="634">634</span> | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-derangement-of-an-array) | Medium |
+| <span id="633">633</span> | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-square-numbers) | Easy |
+| <span id="632">632</span> | [Smallest Range](https://leetcode.com/problems/smallest-range) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range) | Hard |
+| <span id="631">631</span> | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-excel-sum-formula) | Hard |
+| <span id="630">630</span> | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule-iii) | Hard |
+| <span id="629">629</span> | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-inverse-pairs-array) | Hard |
+| <span id="628">628</span> | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers) | Easy |
+| <span id="627">627</span> | [Swap Salary](https://leetcode.com/problems/swap-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-salary) | Easy |
+| <span id="626">626</span> | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [Go](https://github.com/openset/leetcode/tree/master/problems/exchange-seats) | Medium |
+| <span id="625">625</span> | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization) | Medium |
+| <span id="624">624</span> | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-distance-in-arrays) | Easy |
+| <span id="623">623</span> | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-one-row-to-tree) | Medium |
+| <span id="622">622</span> | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue) | Medium |
+| <span id="621">621</span> | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [Go](https://github.com/openset/leetcode/tree/master/problems/task-scheduler) | Medium |
+| <span id="620">620</span> | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [Go](https://github.com/openset/leetcode/tree/master/problems/not-boring-movies) | Easy |
+| <span id="619">619</span> | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/biggest-single-number) | Easy |
+| <span id="618">618</span> | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/students-report-by-geography) | Hard |
+| <span id="617">617</span> | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-two-binary-trees) | Easy |
+| <span id="616">616</span> | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/add-bold-tag-in-string) | Medium |
+| <span id="615">615</span> | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/average-salary-departments-vs-company) | Hard |
+| <span id="614">614</span> | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/second-degree-follower) | Medium |
+| <span id="613">613</span> | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-line) | Easy |
+| <span id="612">612</span> | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-plane) | Medium |
+| <span id="611">611</span> | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-triangle-number) | Medium |
+| <span id="610">610</span> | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/triangle-judgement) | Easy |
+| <span id="609">609</span> | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-file-in-system) | Medium |
+| <span id="608">608</span> | [Tree Node](https://leetcode.com/problems/tree-node) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/tree-node) | Medium |
+| <span id="607">607</span> | [Sales Person](https://leetcode.com/problems/sales-person) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sales-person) | Easy |
+| <span id="606">606</span> | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-string-from-binary-tree) | Easy |
+| <span id="605">605</span> | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [Go](https://github.com/openset/leetcode/tree/master/problems/can-place-flowers) | Easy |
+| <span id="604">604</span> | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-compressed-string-iterator) | Easy |
+| <span id="603">603</span> | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-available-seats) | Easy |
+| <span id="602">602</span> | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-ii-who-has-the-most-friends) | Medium |
+| <span id="601">601</span> | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [Go](https://github.com/openset/leetcode/tree/master/problems/human-traffic-of-stadium) | Hard |
+| <span id="600">600</span> | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/problems/non-negative-integers-without-consecutive-ones) | Hard |
+| <span id="599">599</span> | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-index-sum-of-two-lists) | Easy |
+| <span id="598">598</span> | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-addition-ii) | Easy |
+| <span id="597">597</span> | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-i-overall-acceptance-rate) | Easy |
+| <span id="596">596</span> | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [Go](https://github.com/openset/leetcode/tree/master/problems/classes-more-than-5-students) | Easy |
+| <span id="595">595</span> | [Big Countries](https://leetcode.com/problems/big-countries) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/big-countries) | Easy |
+| <span id="594">594</span> | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-harmonious-subsequence) | Easy |
+| <span id="593">593</span> | [Valid Square](https://leetcode.com/problems/valid-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-square) | Medium |
+| <span id="592">592</span> | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction) | [Go](https://github.com/openset/leetcode/tree/master/problems/fraction-addition-and-subtraction) | Medium |
+| <span id="591">591</span> | [Tag Validator](https://leetcode.com/problems/tag-validator) | [Go](https://github.com/openset/leetcode/tree/master/problems/tag-validator) | Hard |
+| <span id="590">590</span> | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-postorder-traversal) | Easy |
+| <span id="589">589</span> | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-preorder-traversal) | Easy |
+| <span id="588">588</span> | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system) | Hard |
+| <span id="587">587</span> | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | [Go](https://github.com/openset/leetcode/tree/master/problems/erect-the-fence) | Hard |
+| <span id="586">586</span> | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/customer-placing-the-largest-number-of-orders) | Easy |
+| <span id="585">585</span> | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/investments-in-2016) | Medium |
+| <span id="584">584</span> | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-customer-referee) | Easy |
+| <span id="583">583</span> | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-operation-for-two-strings) | Medium |
+| <span id="582">582</span> | [Kill Process](https://leetcode.com/problems/kill-process) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/kill-process) | Medium |
+| <span id="581">581</span> | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-unsorted-continuous-subarray) | Easy |
+| <span id="580">580</span> | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/count-student-number-in-departments) | Medium |
+| <span id="579">579</span> | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-cumulative-salary-of-an-employee) | Hard |
+| <span id="578">578</span> | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/get-highest-answer-rate-question) | Medium |
+| <span id="577">577</span> | [Employee Bonus](https://leetcode.com/problems/employee-bonus) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-bonus) | Easy |
+| <span id="576">576</span> | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [Go](https://github.com/openset/leetcode/tree/master/problems/out-of-boundary-paths) | Medium |
+| <span id="575">575</span> | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | [Go](https://github.com/openset/leetcode/tree/master/problems/distribute-candies) | Easy |
+| <span id="574">574</span> | [Winning Candidate](https://leetcode.com/problems/winning-candidate) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/winning-candidate) | Medium |
+| <span id="573">573</span> | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/squirrel-simulation) | Medium |
+| <span id="572">572</span> | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/subtree-of-another-tree) | Easy |
+| <span id="571">571</span> | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-median-given-frequency-of-numbers) | Hard |
+| <span id="570">570</span> | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/managers-with-at-least-5-direct-reports) | Medium |
+| <span id="569">569</span> | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/median-employee-salary) | Hard |
+| <span id="568">568</span> | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-vacation-days) | Hard |
+| <span id="567">567</span> | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutation-in-string) | Medium |
+| <span id="566">566</span> | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/reshape-the-matrix) | Easy |
+| <span id="565">565</span> | [Array Nesting](https://leetcode.com/problems/array-nesting) | [Go](https://github.com/openset/leetcode/tree/master/problems/array-nesting) | Medium |
+| <span id="564">564</span> | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-closest-palindrome) | Hard |
+| <span id="563">563</span> | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-tilt) | Easy |
+| <span id="562">562</span> | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-line-of-consecutive-one-in-matrix) | Medium |
+| <span id="561">561</span> | [Array Partition I](https://leetcode.com/problems/array-partition-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/array-partition-i) | Easy |
+| <span id="560">560</span> | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k) | Medium |
+| <span id="559">559</span> | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-n-ary-tree) | Easy |
+| <span id="558">558</span> | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection) | [Go](https://github.com/openset/leetcode/tree/master/problems/quad-tree-intersection) | Easy |
+| <span id="557">557</span> | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-iii) | Easy |
+| <span id="556">556</span> | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-iii) | Medium |
+| <span id="555">555</span> | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-concatenated-strings) | Medium |
+| <span id="554">554</span> | [Brick Wall](https://leetcode.com/problems/brick-wall) | [Go](https://github.com/openset/leetcode/tree/master/problems/brick-wall) | Medium |
+| <span id="553">553</span> | [Optimal Division](https://leetcode.com/problems/optimal-division) | [Go](https://github.com/openset/leetcode/tree/master/problems/optimal-division) | Medium |
+| <span id="552">552</span> | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-ii) | Hard |
+| <span id="551">551</span> | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-i) | Easy |
+| <span id="549">549</span> | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence-ii) | Medium |
+| <span id="548">548</span> | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-with-equal-sum) | Medium |
+| <span id="547">547</span> | [Friend Circles](https://leetcode.com/problems/friend-circles) | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-circles) | Medium |
+| <span id="546">546</span> | [Remove Boxes](https://leetcode.com/problems/remove-boxes) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-boxes) | Hard |
+| <span id="545">545</span> | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/boundary-of-binary-tree) | Medium |
+| <span id="544">544</span> | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/output-contest-matches) | Medium |
+| <span id="543">543</span> | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/diameter-of-binary-tree) | Easy |
+| <span id="542">542</span> | [01 Matrix](https://leetcode.com/problems/01-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/01-matrix) | Medium |
+| <span id="541">541</span> | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-string-ii) | Easy |
+| <span id="540">540</span> | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-element-in-a-sorted-array) | Medium |
+| <span id="539">539</span> | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-time-difference) | Medium |
+| <span id="538">538</span> | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-bst-to-greater-tree) | Easy |
+| <span id="537">537</span> | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | [Go](https://github.com/openset/leetcode/tree/master/problems/complex-number-multiplication) | Medium |
+| <span id="536">536</span> | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-string) | Medium |
+| <span id="535">535</span> | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-tinyurl) | Medium |
+| <span id="533">533</span> | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii) | Medium |
+| <span id="532">532</span> | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-diff-pairs-in-an-array) | Easy |
+| <span id="531">531</span> | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i) | Medium |
+| <span id="530">530</span> | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst) | Easy |
+| <span id="529">529</span> | [Minesweeper](https://leetcode.com/problems/minesweeper) | [Go](https://github.com/openset/leetcode/tree/master/problems/minesweeper) | Medium |
+| <span id="528">528</span> | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-weight) | Medium |
+| <span id="527">527</span> | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation) | Hard |
+| <span id="526">526</span> | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement) | Medium |
+| <span id="525">525</span> | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/contiguous-array) | Medium |
+| <span id="524">524</span> | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary-through-deleting) | Medium |
+| <span id="523">523</span> | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/continuous-subarray-sum) | Medium |
+| <span id="522">522</span> | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-ii) | Medium |
+| <span id="521">521</span> | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-i) | Easy |
+| <span id="520">520</span> | [Detect Capital](https://leetcode.com/problems/detect-capital) | [Go](https://github.com/openset/leetcode/tree/master/problems/detect-capital) | Easy |
+| <span id="519">519</span> | [Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-flip-matrix) | Medium |
+| <span id="518">518</span> | [Coin Change 2](https://leetcode.com/problems/coin-change-2) | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-change-2) | Medium |
+| <span id="517">517</span> | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-washing-machines) | Hard |
+| <span id="516">516</span> | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-subsequence) | Medium |
+| <span id="515">515</span> | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row) | Medium |
+| <span id="514">514</span> | [Freedom Trail](https://leetcode.com/problems/freedom-trail) | [Go](https://github.com/openset/leetcode/tree/master/problems/freedom-trail) | Hard |
+| <span id="513">513</span> | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value) | Medium |
+| <span id="508">508</span> | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-frequent-subtree-sum) | Medium |
+| <span id="507">507</span> | [Perfect Number](https://leetcode.com/problems/perfect-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-number) | Easy |
+| <span id="506">506</span> | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | [Go](https://github.com/openset/leetcode/tree/master/problems/relative-ranks) | Easy |
+| <span id="505">505</span> | [The Maze II](https://leetcode.com/problems/the-maze-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii) | Medium |
+| <span id="504">504</span> | [Base 7](https://leetcode.com/problems/base-7) | [Go](https://github.com/openset/leetcode/tree/master/problems/base-7) | Easy |
+| <span id="503">503</span> | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-ii) | Medium |
+| <span id="502">502</span> | [IPO](https://leetcode.com/problems/ipo) | [Go](https://github.com/openset/leetcode/tree/master/problems/ipo) | Hard |
+| <span id="501">501</span> | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-mode-in-binary-search-tree) | Easy |
+| <span id="500">500</span> | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | [Go](https://github.com/openset/leetcode/tree/master/problems/keyboard-row) | Easy |
+| <span id="499">499</span> | [The Maze III](https://leetcode.com/problems/the-maze-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii) | Hard |
+| <span id="498">498</span> | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | [Go](https://github.com/openset/leetcode/tree/master/problems/diagonal-traverse) | Medium |
+| <span id="497">497</span> | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-point-in-non-overlapping-rectangles) | Medium |
+| <span id="496">496</span> | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-i) | Easy |
+| <span id="495">495</span> | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking) | [Go](https://github.com/openset/leetcode/tree/master/problems/teemo-attacking) | Medium |
+| <span id="494">494</span> | [Target Sum](https://leetcode.com/problems/target-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/target-sum) | Medium |
+| <span id="493">493</span> | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | Hard |
+| <span id="492">492</span> | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-the-rectangle) | Easy |
+| <span id="491">491</span> | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-subsequences) | Medium |
+| <span id="490">490</span> | [The Maze](https://leetcode.com/problems/the-maze) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze) | Medium |
+| <span id="489">489</span> | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/robot-room-cleaner) | Hard |
+| <span id="488">488</span> | [Zuma Game](https://leetcode.com/problems/zuma-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/zuma-game) | Hard |
+| <span id="487">487</span> | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-ii) | Medium |
+| <span id="486">486</span> | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | [Go](https://github.com/openset/leetcode/tree/master/problems/predict-the-winner) | Medium |
+| <span id="485">485</span> | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones) | Easy |
+| <span id="484">484</span> | [Find Permutation](https://leetcode.com/problems/find-permutation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-permutation) | Medium |
+| <span id="483">483</span> | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-good-base) | Hard |
+| <span id="482">482</span> | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [Go](https://github.com/openset/leetcode/tree/master/problems/license-key-formatting) | Easy |
+| <span id="481">481</span> | [Magical String](https://leetcode.com/problems/magical-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/magical-string) | Medium |
+| <span id="480">480</span> | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median) | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-window-median) | Hard |
+| <span id="479">479</span> | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-palindrome-product) | Easy |
+| <span id="478">478</span> | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle) | [Go](https://github.com/openset/leetcode/tree/master/problems/generate-random-point-in-a-circle) | Medium |
+| <span id="477">477</span> | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/total-hamming-distance) | Medium |
+| <span id="476">476</span> | [Number Complement](https://leetcode.com/problems/number-complement) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-complement) | Easy |
+| <span id="475">475</span> | [Heaters](https://leetcode.com/problems/heaters) | [Go](https://github.com/openset/leetcode/tree/master/problems/heaters) | Easy |
+| <span id="474">474</span> | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/ones-and-zeroes) | Medium |
+| <span id="473">473</span> | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/matchsticks-to-square) | Medium |
+| <span id="472">472</span> | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/concatenated-words) | Hard |
+| <span id="471">471</span> | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length) | Hard |
+| <span id="470">470</span> | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-rand10-using-rand7) | Medium |
+| <span id="469">469</span> | [Convex Polygon](https://leetcode.com/problems/convex-polygon) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/convex-polygon) | Medium |
+| <span id="468">468</span> | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-ip-address) | Medium |
+| <span id="467">467</span> | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-substrings-in-wraparound-string) | Medium |
+| <span id="466">466</span> | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-the-repetitions) | Hard |
+| <span id="465">465</span> | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/optimal-account-balancing) | Hard |
+| <span id="464">464</span> | [Can I Win](https://leetcode.com/problems/can-i-win) | [Go](https://github.com/openset/leetcode/tree/master/problems/can-i-win) | Medium |
+| <span id="463">463</span> | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | [Go](https://github.com/openset/leetcode/tree/master/problems/island-perimeter) | Easy |
+| <span id="462">462</span> | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements-ii) | Medium |
+| <span id="461">461</span> | [Hamming Distance](https://leetcode.com/problems/hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/hamming-distance) | Easy |
+| <span id="460">460</span> | [LFU Cache](https://leetcode.com/problems/lfu-cache) | [Go](https://github.com/openset/leetcode/tree/master/problems/lfu-cache) | Hard |
+| <span id="459">459</span> | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-substring-pattern) | Easy |
+| <span id="458">458</span> | [Poor Pigs](https://leetcode.com/problems/poor-pigs) | [Go](https://github.com/openset/leetcode/tree/master/problems/poor-pigs) | Easy |
+| <span id="457">457</span> | [Circular Array Loop](https://leetcode.com/problems/circular-array-loop) | [Go](https://github.com/openset/leetcode/tree/master/problems/circular-array-loop) | Medium |
+| <span id="456">456</span> | [132 Pattern](https://leetcode.com/problems/132-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/132-pattern) | Medium |
+| <span id="455">455</span> | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | [Go](https://github.com/openset/leetcode/tree/master/problems/assign-cookies) | Easy |
+| <span id="454">454</span> | [4Sum II](https://leetcode.com/problems/4sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/4sum-ii) | Medium |
+| <span id="453">453</span> | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements) | Easy |
+| <span id="452">452</span> | [Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-arrows-to-burst-balloons) | Medium |
+| <span id="451">451</span> | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-characters-by-frequency) | Medium |
+| <span id="450">450</span> | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-bst) | Medium |
+| <span id="449">449</span> | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-bst) | Medium |
+| <span id="448">448</span> | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-numbers-disappeared-in-an-array) | Easy |
+| <span id="447">447</span> | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-boomerangs) | Easy |
+| <span id="446">446</span> | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices-ii-subsequence) | Hard |
+| <span id="445">445</span> | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers-ii) | Medium |
+| <span id="444">444</span> | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sequence-reconstruction) | Medium |
+| <span id="443">443</span> | [String Compression](https://leetcode.com/problems/string-compression) | [Go](https://github.com/openset/leetcode/tree/master/problems/string-compression) | Easy |
+| <span id="442">442</span> | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-duplicates-in-an-array) | Medium |
+| <span id="441">441</span> | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | [Go](https://github.com/openset/leetcode/tree/master/problems/arranging-coins) | Easy |
+| <span id="440">440</span> | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-in-lexicographical-order) | Hard |
+| <span id="439">439</span> | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser) | Medium |
+| <span id="438">438</span> | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-anagrams-in-a-string) | Easy |
+| <span id="437">437</span> | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-iii) | Easy |
+| <span id="436">436</span> | [Find Right Interval](https://leetcode.com/problems/find-right-interval) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-right-interval) | Medium |
+| <span id="435">435</span> | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/non-overlapping-intervals) | Medium |
+| <span id="434">434</span> | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-segments-in-a-string) | Easy |
+| <span id="433">433</span> | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-genetic-mutation) | Medium |
+| <span id="432">432</span> | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-oone-data-structure) | Hard |
+| <span id="431">431</span> | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-n-ary-tree-to-binary-tree) | Hard |
+| <span id="430">430</span> | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-a-multilevel-doubly-linked-list) | Medium |
+| <span id="429">429</span> | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-level-order-traversal) | Easy |
+| <span id="428">428</span> | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree) | Hard |
+| <span id="427">427</span> | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-quad-tree) | Easy |
+| <span id="426">426</span> | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
+| <span id="425">425</span> | [Word Squares](https://leetcode.com/problems/word-squares) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-squares) | Hard |
+| <span id="424">424</span> | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-character-replacement) | Medium |
+| <span id="423">423</span> | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english) | [Go](https://github.com/openset/leetcode/tree/master/problems/reconstruct-original-digits-from-english) | Medium |
+| <span id="422">422</span> | [Valid Word Square](https://leetcode.com/problems/valid-word-square) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-word-square) | Easy |
+| <span id="421">421</span> | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-xor-of-two-numbers-in-an-array) | Medium |
+| <span id="420">420</span> | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker) | [Go](https://github.com/openset/leetcode/tree/master/problems/strong-password-checker) | Hard |
+| <span id="419">419</span> | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | [Go](https://github.com/openset/leetcode/tree/master/problems/battleships-in-a-board) | Medium |
+| <span id="418">418</span> | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-screen-fitting) | Medium |
+| <span id="417">417</span> | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [Go](https://github.com/openset/leetcode/tree/master/problems/pacific-atlantic-water-flow) | Medium |
+| <span id="416">416</span> | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-equal-subset-sum) | Medium |
+| <span id="415">415</span> | [Add Strings](https://leetcode.com/problems/add-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-strings) | Easy |
+| <span id="414">414</span> | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/third-maximum-number) | Easy |
+| <span id="413">413</span> | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | [Go](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices) | Medium |
+| <span id="412">412</span> | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [Go](https://github.com/openset/leetcode/tree/master/problems/fizz-buzz) | Easy |
+| <span id="411">411</span> | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-unique-word-abbreviation) | Hard |
+| <span id="410">410</span> | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-largest-sum) | Hard |
+| <span id="409">409</span> | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindrome) | Easy |
+| <span id="408">408</span> | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-word-abbreviation) | Easy |
+| <span id="407">407</span> | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water-ii) | Hard |
+| <span id="406">406</span> | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | [Go](https://github.com/openset/leetcode/tree/master/problems/queue-reconstruction-by-height) | Medium |
+| <span id="405">405</span> | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-a-number-to-hexadecimal) | Easy |
+| <span id="404">404</span> | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-left-leaves) | Easy |
+| <span id="403">403</span> | [Frog Jump](https://leetcode.com/problems/frog-jump) | [Go](https://github.com/openset/leetcode/tree/master/problems/frog-jump) | Hard |
+| <span id="402">402</span> | [Remove K Digits](https://leetcode.com/problems/remove-k-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-k-digits) | Medium |
+| <span id="401">401</span> | [Binary Watch](https://leetcode.com/problems/binary-watch) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-watch) | Easy |
+| <span id="400">400</span> | [Nth Digit](https://leetcode.com/problems/nth-digit) | [Go](https://github.com/openset/leetcode/tree/master/problems/nth-digit) | Easy |
+| <span id="399">399</span> | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | [Go](https://github.com/openset/leetcode/tree/master/problems/evaluate-division) | Medium |
+| <span id="398">398</span> | [Random Pick Index](https://leetcode.com/problems/random-pick-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-index) | Medium |
+| <span id="397">397</span> | [Integer Replacement](https://leetcode.com/problems/integer-replacement) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-replacement) | Medium |
+| <span id="396">396</span> | [Rotate Function](https://leetcode.com/problems/rotate-function) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-function) | Medium |
+| <span id="395">395</span> | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-least-k-repeating-characters) | Medium |
+| <span id="394">394</span> | [Decode String](https://leetcode.com/problems/decode-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-string) | Medium |
+| <span id="393">393</span> | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation) | [Go](https://github.com/openset/leetcode/tree/master/problems/utf-8-validation) | Medium |
+| <span id="392">392</span> | [Is Subsequence](https://leetcode.com/problems/is-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/is-subsequence) | Medium |
+| <span id="391">391</span> | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-rectangle) | Hard |
+| <span id="390">390</span> | [Elimination Game](https://leetcode.com/problems/elimination-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/elimination-game) | Medium |
+| <span id="389">389</span> | [Find the Difference](https://leetcode.com/problems/find-the-difference) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-difference) | Easy |
+| <span id="388">388</span> | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-absolute-file-path) | Medium |
+| <span id="387">387</span> | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/first-unique-character-in-a-string) | Easy |
+| <span id="386">386</span> | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/lexicographical-numbers) | Medium |
+| <span id="385">385</span> | [Mini Parser](https://leetcode.com/problems/mini-parser) | [Go](https://github.com/openset/leetcode/tree/master/problems/mini-parser) | Medium |
+| <span id="384">384</span> | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/shuffle-an-array) | Medium |
+| <span id="383">383</span> | [Ransom Note](https://leetcode.com/problems/ransom-note) | [Go](https://github.com/openset/leetcode/tree/master/problems/ransom-note) | Easy |
+| <span id="382">382</span> | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-random-node) | Medium |
+| <span id="381">381</span> | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1-duplicates-allowed) | Hard |
+| <span id="380">380</span> | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1) | Medium |
+| <span id="379">379</span> | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-phone-directory) | Medium |
+| <span id="378">378</span> | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-sorted-matrix) | Medium |
+| <span id="377">377</span> | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iv) | Medium |
+| <span id="376">376</span> | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-subsequence) | Medium |
+| <span id="375">375</span> | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower-ii) | Medium |
+| <span id="374">374</span> | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | [Go](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower) | Easy |
+| <span id="373">373</span> | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-pairs-with-smallest-sums) | Medium |
+| <span id="372">372</span> | [Super Pow](https://leetcode.com/problems/super-pow) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-pow) | Medium |
+| <span id="371">371</span> | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-two-integers) | Easy |
+| <span id="370">370</span> | [Range Addition](https://leetcode.com/problems/range-addition) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/range-addition) | Medium |
+| <span id="369">369</span> | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/plus-one-linked-list) | Medium |
+| <span id="368">368</span> | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-divisible-subset) | Medium |
+| <span id="367">367</span> | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-perfect-square) | Easy |
+| <span id="366">366</span> | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-leaves-of-binary-tree) | Medium |
+| <span id="365">365</span> | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem) | [Go](https://github.com/openset/leetcode/tree/master/problems/water-and-jug-problem) | Medium |
+| <span id="364">364</span> | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum-ii) | Medium |
+| <span id="363">363</span> | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-sum-of-rectangle-no-larger-than-k) | Hard |
+| <span id="362">362</span> | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hit-counter) | Medium |
+| <span id="361">361</span> | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/bomb-enemy) | Medium |
+| <span id="360">360</span> | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-transformed-array) | Medium |
+| <span id="359">359</span> | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/logger-rate-limiter) | Easy |
+| <span id="358">358</span> | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart) | Hard |
+| <span id="357">357</span> | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-numbers-with-unique-digits) | Medium |
+| <span id="356">356</span> | [Line Reflection](https://leetcode.com/problems/line-reflection) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/line-reflection) | Medium |
+| <span id="355">355</span> | [Design Twitter](https://leetcode.com/problems/design-twitter) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-twitter) | Medium |
+| <span id="354">354</span> | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | [Go](https://github.com/openset/leetcode/tree/master/problems/russian-doll-envelopes) | Hard |
+| <span id="353">353</span> | [Design Snake Game](https://leetcode.com/problems/design-snake-game) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-snake-game) | Medium |
+| <span id="352">352</span> | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals) | Hard |
+| <span id="351">351</span> | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns) | Medium |
+| <span id="350">350</span> | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii) | Easy |
+| <span id="349">349</span> | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays) | Easy |
+| <span id="348">348</span> | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-tic-tac-toe) | Medium |
+| <span id="347">347</span> | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements) | Medium |
+| <span id="346">346</span> | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/moving-average-from-data-stream) | Easy |
+| <span id="345">345</span> | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-vowels-of-a-string) | Easy |
+| <span id="344">344</span> | [Reverse String](https://leetcode.com/problems/reverse-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-string) | Easy |
+| <span id="343">343</span> | [Integer Break](https://leetcode.com/problems/integer-break) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-break) | Medium |
+| <span id="342">342</span> | [Power of Four](https://leetcode.com/problems/power-of-four) | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-four) | Easy |
+| <span id="341">341</span> | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator) | Medium |
+| <span id="340">340</span> | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters) | Hard |
+| <span id="339">339</span> | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum) | Easy |
+| <span id="338">338</span> | [Counting Bits](https://leetcode.com/problems/counting-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/counting-bits) | Medium |
+| <span id="337">337</span> | [House Robber III](https://leetcode.com/problems/house-robber-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber-iii) | Medium |
+| <span id="336">336</span> | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-pairs) | Hard |
+| <span id="335">335</span> | [Self Crossing](https://leetcode.com/problems/self-crossing) | [Go](https://github.com/openset/leetcode/tree/master/problems/self-crossing) | Hard |
+| <span id="334">334</span> | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-triplet-subsequence) | Medium |
+| <span id="333">333</span> | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-bst-subtree) | Medium |
+| <span id="332">332</span> | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | [Go](https://github.com/openset/leetcode/tree/master/problems/reconstruct-itinerary) | Medium |
+| <span id="331">331</span> | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-serialization-of-a-binary-tree) | Medium |
+| <span id="330">330</span> | [Patching Array](https://leetcode.com/problems/patching-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/patching-array) | Hard |
+| <span id="329">329</span> | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-path-in-a-matrix) | Hard |
+| <span id="328">328</span> | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/odd-even-linked-list) | Medium |
+| <span id="327">327</span> | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) | Hard |
+| <span id="326">326</span> | [Power of Three](https://leetcode.com/problems/power-of-three) | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-three) | Easy |
+| <span id="325">325</span> | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-size-subarray-sum-equals-k) | Medium |
+| <span id="324">324</span> | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort-ii) | Medium |
+| <span id="323">323</span> | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) | Medium |
+| <span id="322">322</span> | [Coin Change](https://leetcode.com/problems/coin-change) | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-change) | Medium |
+| <span id="321">321</span> | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/create-maximum-number) | Hard |
+| <span id="320">320</span> | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) | Medium |
+| <span id="319">319</span> | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [Go](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher) | Medium |
+| <span id="318">318</span> | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-word-lengths) | Medium |
+| <span id="317">317</span> | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) | Hard |
+| <span id="316">316</span> | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicate-letters) | Hard |
+| <span id="315">315</span> | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | Hard |
+| <span id="314">314</span> | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal) | Medium |
+| <span id="313">313</span> | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-ugly-number) | Medium |
+| <span id="312">312</span> | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/problems/burst-balloons) | Hard |
+| <span id="311">311</span> | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sparse-matrix-multiplication) | Medium |
+| <span id="310">310</span> | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees) | Medium |
+| <span id="309">309</span> | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
+| <span id="308">308</span> | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) | Hard |
+| <span id="307">307</span> | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable) | Medium |
+| <span id="306">306</span> | [Additive Number](https://leetcode.com/problems/additive-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/additive-number) | Medium |
+| <span id="305">305</span> | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-islands-ii) | Hard |
+| <span id="304">304</span> | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-immutable) | Medium |
+| <span id="303">303</span> | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-immutable) | Easy |
+| <span id="302">302</span> | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-rectangle-enclosing-black-pixels) | Hard |
+| <span id="301">301</span> | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-invalid-parentheses) | Hard |
+| <span id="300">300</span> | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence) | Medium |
+| <span id="299">299</span> | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | [Go](https://github.com/openset/leetcode/tree/master/problems/bulls-and-cows) | Medium |
+| <span id="298">298</span> | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence) | Medium |
+| <span id="297">297</span> | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-binary-tree) | Hard |
+| <span id="296">296</span> | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/best-meeting-point) | Hard |
+| <span id="295">295</span> | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-median-from-data-stream) | Hard |
+| <span id="294">294</span> | [Flip Game II](https://leetcode.com/problems/flip-game-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii) | Medium |
+| <span id="293">293</span> | [Flip Game](https://leetcode.com/problems/flip-game) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-game) | Easy |
+| <span id="292">292</span> | [Nim Game](https://leetcode.com/problems/nim-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/nim-game) | Easy |
+| <span id="291">291</span> | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-pattern-ii) | Hard |
+| <span id="290">290</span> | [Word Pattern](https://leetcode.com/problems/word-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-pattern) | Easy |
+| <span id="289">289</span> | [Game of Life](https://leetcode.com/problems/game-of-life) | [Go](https://github.com/openset/leetcode/tree/master/problems/game-of-life) | Medium |
+| <span id="288">288</span> | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-word-abbreviation) | Medium |
+| <span id="287">287</span> | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number) | Medium |
+| <span id="286">286</span> | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates) | Medium |
+| <span id="285">285</span> | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst) | Medium |
+| <span id="284">284</span> | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/peeking-iterator) | Medium |
+| <span id="283">283</span> | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/move-zeroes) | Easy |
+| <span id="282">282</span> | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | [Go](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators) | Hard |
+| <span id="281">281</span> | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/zigzag-iterator) | Medium |
+| <span id="280">280</span> | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort) | Medium |
+| <span id="279">279</span> | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-squares) | Medium |
+| <span id="278">278</span> | [First Bad Version](https://leetcode.com/problems/first-bad-version) | [Go](https://github.com/openset/leetcode/tree/master/problems/first-bad-version) | Easy |
+| <span id="277">277</span> | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-celebrity) | Medium |
+| <span id="276">276</span> | [Paint Fence](https://leetcode.com/problems/paint-fence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-fence) | Easy |
+| <span id="275">275</span> | [H-Index II](https://leetcode.com/problems/h-index-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/h-index-ii) | Medium |
+| <span id="274">274</span> | [H-Index](https://leetcode.com/problems/h-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/h-index) | Medium |
+| <span id="273">273</span> | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-to-english-words) | Hard |
+| <span id="272">272</span> | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value-ii) | Hard |
+| <span id="271">271</span> | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-strings) | Medium |
+| <span id="270">270</span> | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value) | Easy |
+| <span id="269">269</span> | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/alien-dictionary) | Hard |
+| <span id="268">268</span> | [Missing Number](https://leetcode.com/problems/missing-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/missing-number) | Easy |
+| <span id="267">267</span> | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation-ii) | Medium |
+| <span id="266">266</span> | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation) | Easy |
+| <span id="265">265</span> | [Paint House II](https://leetcode.com/problems/paint-house-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii) | Hard |
+| <span id="264">264</span> | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii) | Medium |
+| <span id="263">263</span> | [Ugly Number](https://leetcode.com/problems/ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/ugly-number) | Easy |
+| <span id="262">262</span> | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [Go](https://github.com/openset/leetcode/tree/master/problems/trips-and-users) | Hard |
+| <span id="261">261</span> | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree) | Medium |
+| <span id="260">260</span> | [Single Number III](https://leetcode.com/problems/single-number-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number-iii) | Medium |
+| <span id="259">259</span> | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) | Medium |
+| <span id="258">258</span> | [Add Digits](https://leetcode.com/problems/add-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-digits) | Easy |
+| <span id="257">257</span> | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-paths) | Easy |
+| <span id="256">256</span> | [Paint House](https://leetcode.com/problems/paint-house) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-house) | Easy |
+| <span id="255">255</span> | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-sequence-in-binary-search-tree) | Medium |
+| <span id="254">254</span> | [Factor Combinations](https://leetcode.com/problems/factor-combinations) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/factor-combinations) | Medium |
+| <span id="253">253</span> | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii) | Medium |
+| <span id="252">252</span> | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms) | Easy |
+| <span id="251">251</span> | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector) | Medium |
+| <span id="250">250</span> | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/count-univalue-subtrees) | Medium |
+| <span id="249">249</span> | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/group-shifted-strings) | Medium |
+| <span id="248">248</span> | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-iii) | Hard |
+| <span id="247">247</span> | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-ii) | Medium |
+| <span id="246">246</span> | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number) | Easy |
+| <span id="245">245</span> | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-iii) | Medium |
+| <span id="244">244</span> | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-ii) | Medium |
+| <span id="243">243</span> | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance) | Easy |
+| <span id="242">242</span> | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-anagram) | Easy |
+| <span id="241">241</span> | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/different-ways-to-add-parentheses) | Medium |
+| <span id="240">240</span> | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix-ii) | Medium |
+| <span id="239">239</span> | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-window-maximum) | Hard |
+| <span id="238">238</span> | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | [Go](https://github.com/openset/leetcode/tree/master/problems/product-of-array-except-self) | Medium |
+| <span id="237">237</span> | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-linked-list) | Easy |
+| <span id="236">236</span> | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-tree) | Medium |
+| <span id="235">235</span> | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-search-tree) | Easy |
+| <span id="234">234</span> | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-linked-list) | Easy |
+| <span id="233">233</span> | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-digit-one) | Hard |
+| <span id="232">232</span> | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-queue-using-stacks) | Easy |
+| <span id="231">231</span> | [Power of Two](https://leetcode.com/problems/power-of-two) | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-two) | Easy |
+| <span id="230">230</span> | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-bst) | Medium |
+| <span id="229">229</span> | [Majority Element II](https://leetcode.com/problems/majority-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/majority-element-ii) | Medium |
+| <span id="228">228</span> | [Summary Ranges](https://leetcode.com/problems/summary-ranges) | [Go](https://github.com/openset/leetcode/tree/master/problems/summary-ranges) | Medium |
+| <span id="227">227</span> | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-ii) | Medium |
+| <span id="226">226</span> | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/invert-binary-tree) | Easy |
+| <span id="225">225</span> | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-stack-using-queues) | Easy |
+| <span id="224">224</span> | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator) | Hard |
+| <span id="223">223</span> | [Rectangle Area](https://leetcode.com/problems/rectangle-area) | [Go](https://github.com/openset/leetcode/tree/master/problems/rectangle-area) | Medium |
+| <span id="222">222</span> | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-complete-tree-nodes) | Medium |
+| <span id="221">221</span> | [Maximal Square](https://leetcode.com/problems/maximal-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximal-square) | Medium |
+| <span id="220">220</span> | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii) | Medium |
+| <span id="219">219</span> | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-ii) | Easy |
+| <span id="218">218</span> | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | [Go](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem) | Hard |
+| <span id="217">217</span> | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [Go](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate) | Easy |
+| <span id="216">216</span> | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iii) | Medium |
+| <span id="215">215</span> | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-an-array) | Medium |
+| <span id="214">214</span> | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-palindrome) | Hard |
+| <span id="213">213</span> | [House Robber II](https://leetcode.com/problems/house-robber-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber-ii) | Medium |
+| <span id="212">212</span> | [Word Search II](https://leetcode.com/problems/word-search-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-search-ii) | Hard |
+| <span id="211">211</span> | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-and-search-word-data-structure-design) | Medium |
+| <span id="210">210</span> | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii) | Medium |
+| <span id="209">209</span> | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-size-subarray-sum) | Medium |
+| <span id="208">208</span> | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree) | Medium |
+| <span id="207">207</span> | [Course Schedule](https://leetcode.com/problems/course-schedule) | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule) | Medium |
+| <span id="206">206</span> | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list) | Easy |
+| <span id="205">205</span> | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/isomorphic-strings) | Easy |
+| <span id="204">204</span> | [Count Primes](https://leetcode.com/problems/count-primes) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-primes) | Easy |
+| <span id="203">203</span> | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-linked-list-elements) | Easy |
+| <span id="202">202</span> | [Happy Number](https://leetcode.com/problems/happy-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/happy-number) | Easy |
+| <span id="201">201</span> | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | [Go](https://github.com/openset/leetcode/tree/master/problems/bitwise-and-of-numbers-range) | Medium |
+| <span id="200">200</span> | [Number of Islands](https://leetcode.com/problems/number-of-islands) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-islands) | Medium |
+| <span id="199">199</span> | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-right-side-view) | Medium |
+| <span id="198">198</span> | [House Robber](https://leetcode.com/problems/house-robber) | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber) | Easy |
+| <span id="197">197</span> | [Rising Temperature](https://leetcode.com/problems/rising-temperature) | [Go](https://github.com/openset/leetcode/tree/master/problems/rising-temperature) | Easy |
+| <span id="196">196</span> | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-duplicate-emails) | Easy |
+| <span id="195">195</span> | [Tenth Line](https://leetcode.com/problems/tenth-line) | [Bash](https://github.com/openset/leetcode/tree/master/problems/tenth-line) | Easy |
+| <span id="194">194</span> | [Transpose File](https://leetcode.com/problems/transpose-file) | [Go](https://github.com/openset/leetcode/tree/master/problems/transpose-file) | Medium |
+| <span id="193">193</span> | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-phone-numbers) | Easy |
+| <span id="192">192</span> | [Word Frequency](https://leetcode.com/problems/word-frequency) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-frequency) | Medium |
+| <span id="191">191</span> | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits) | Easy |
+| <span id="190">190</span> | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-bits) | Easy |
+| <span id="189">189</span> | [Rotate Array](https://leetcode.com/problems/rotate-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-array) | Easy |
+| <span id="188">188</span> | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv) | Hard |
+| <span id="187">187</span> | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-dna-sequences) | Medium |
+| <span id="186">186</span> | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-ii) | Medium |
+| <span id="185">185</span> | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [Go](https://github.com/openset/leetcode/tree/master/problems/department-top-three-salaries) | Hard |
+| <span id="184">184</span> | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/department-highest-salary) | Medium |
+| <span id="183">183</span> | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [Go](https://github.com/openset/leetcode/tree/master/problems/customers-who-never-order) | Easy |
+| <span id="182">182</span> | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/problems/duplicate-emails) | Easy |
+| <span id="181">181</span> | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | [Go](https://github.com/openset/leetcode/tree/master/problems/employees-earning-more-than-their-managers) | Easy |
+| <span id="180">180</span> | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers) | Medium |
+| <span id="179">179</span> | [Largest Number](https://leetcode.com/problems/largest-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-number) | Medium |
+| <span id="178">178</span> | [Rank Scores](https://leetcode.com/problems/rank-scores) | [Go](https://github.com/openset/leetcode/tree/master/problems/rank-scores) | Medium |
+| <span id="177">177</span> | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/nth-highest-salary) | Medium |
+| <span id="176">176</span> | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/second-highest-salary) | Easy |
+| <span id="175">175</span> | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | [Go](https://github.com/openset/leetcode/tree/master/problems/combine-two-tables) | Easy |
+| <span id="174">174</span> | [Dungeon Game](https://leetcode.com/problems/dungeon-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/dungeon-game) | Hard |
+| <span id="173">173</span> | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator) | Medium |
+| <span id="172">172</span> | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/factorial-trailing-zeroes) | Easy |
+| <span id="171">171</span> | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-number) | Easy |
+| <span id="170">170</span> | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-iii-data-structure-design) | Easy |
+| <span id="169">169</span> | [Majority Element](https://leetcode.com/problems/majority-element) | [Go](https://github.com/openset/leetcode/tree/master/problems/majority-element) | Easy |
+| <span id="168">168</span> | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [Go](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-title) | Easy |
+| <span id="167">167</span> | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-ii-input-array-is-sorted) | Easy |
+| <span id="166">166</span> | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [Go](https://github.com/openset/leetcode/tree/master/problems/fraction-to-recurring-decimal) | Medium |
+| <span id="165">165</span> | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/compare-version-numbers) | Medium |
+| <span id="164">164</span> | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-gap) | Hard |
+| <span id="163">163</span> | [Missing Ranges](https://leetcode.com/problems/missing-ranges) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/missing-ranges) | Medium |
+| <span id="162">162</span> | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-peak-element) | Medium |
+| <span id="161">161</span> | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/one-edit-distance) | Medium |
+| <span id="160">160</span> | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-linked-lists) | Easy |
+| <span id="159">159</span> | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters) | Hard |
+| <span id="158">158</span> | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4-ii-call-multiple-times) | Hard |
+| <span id="157">157</span> | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4) | Easy |
+| <span id="156">156</span> | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-upside-down) | Medium |
+| <span id="155">155</span> | [Min Stack](https://leetcode.com/problems/min-stack) | [Go](https://github.com/openset/leetcode/tree/master/problems/min-stack) | Easy |
+| <span id="154">154</span> | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array-ii) | Hard |
+| <span id="153">153</span> | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array) | Medium |
+| <span id="152">152</span> | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-subarray) | Medium |
+| <span id="151">151</span> | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string) | Medium |
+| <span id="150">150</span> | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | [Go](https://github.com/openset/leetcode/tree/master/problems/evaluate-reverse-polish-notation) | Medium |
+| <span id="149">149</span> | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-points-on-a-line) | Hard |
+| <span id="148">148</span> | [Sort List](https://leetcode.com/problems/sort-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-list) | Medium |
+| <span id="147">147</span> | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/insertion-sort-list) | Medium |
+| <span id="146">146</span> | [LRU Cache](https://leetcode.com/problems/lru-cache) | [Go](https://github.com/openset/leetcode/tree/master/problems/lru-cache) | Hard |
+| <span id="145">145</span> | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-postorder-traversal) | Hard |
+| <span id="144">144</span> | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-preorder-traversal) | Medium |
+| <span id="143">143</span> | [Reorder List](https://leetcode.com/problems/reorder-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/reorder-list) | Medium |
+| <span id="142">142</span> | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle-ii) | Medium |
+| <span id="141">141</span> | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle) | Easy |
+| <span id="140">140</span> | [Word Break II](https://leetcode.com/problems/word-break-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-break-ii) | Hard |
+| <span id="139">139</span> | [Word Break](https://leetcode.com/problems/word-break) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-break) | Medium |
+| <span id="138">138</span> | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | [Go](https://github.com/openset/leetcode/tree/master/problems/copy-list-with-random-pointer) | Medium |
+| <span id="137">137</span> | [Single Number II](https://leetcode.com/problems/single-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number-ii) | Medium |
+| <span id="136">136</span> | [Single Number](https://leetcode.com/problems/single-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number) | Easy |
+| <span id="135">135</span> | [Candy](https://leetcode.com/problems/candy) | [Go](https://github.com/openset/leetcode/tree/master/problems/candy) | Hard |
+| <span id="134">134</span> | [Gas Station](https://leetcode.com/problems/gas-station) | [Go](https://github.com/openset/leetcode/tree/master/problems/gas-station) | Medium |
+| <span id="133">133</span> | [Clone Graph](https://leetcode.com/problems/clone-graph) | [Go](https://github.com/openset/leetcode/tree/master/problems/clone-graph) | Medium |
+| <span id="132">132</span> | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning-ii) | Hard |
+| <span id="131">131</span> | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning) | Medium |
+| <span id="130">130</span> | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions) | [Go](https://github.com/openset/leetcode/tree/master/problems/surrounded-regions) | Medium |
+| <span id="129">129</span> | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-root-to-leaf-numbers) | Medium |
+| <span id="128">128</span> | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-consecutive-sequence) | Hard |
+| <span id="127">127</span> | [Word Ladder](https://leetcode.com/problems/word-ladder) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-ladder) | Medium |
+| <span id="126">126</span> | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-ladder-ii) | Hard |
+| <span id="125">125</span> | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome) | Easy |
+| <span id="124">124</span> | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-maximum-path-sum) | Hard |
+| <span id="123">123</span> | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii) | Hard |
+| <span id="122">122</span> | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) | Easy |
+| <span id="121">121</span> | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) | Easy |
+| <span id="120">120</span> | [Triangle](https://leetcode.com/problems/triangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/triangle) | Medium |
+| <span id="119">119</span> | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle-ii) | Easy |
+| <span id="118">118</span> | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle) | Easy |
+| <span id="117">117</span> | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node-ii) | Medium |
+| <span id="116">116</span> | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | [Go](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node) | Medium |
+| <span id="115">115</span> | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences) | Hard |
+| <span id="114">114</span> | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-binary-tree-to-linked-list) | Medium |
+| <span id="113">113</span> | [Path Sum II](https://leetcode.com/problems/path-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-ii) | Medium |
+| <span id="112">112</span> | [Path Sum](https://leetcode.com/problems/path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum) | Easy |
+| <span id="111">111</span> | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-depth-of-binary-tree) | Easy |
+| <span id="110">110</span> | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/balanced-binary-tree) | Easy |
+| <span id="109">109</span> | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-list-to-binary-search-tree) | Medium |
+| <span id="108">108</span> | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-array-to-binary-search-tree) | Easy |
+| <span id="107">107</span> | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal-ii) | Easy |
+| <span id="106">106</span> | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | Medium |
+| <span id="105">105</span> | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium |
+| <span id="104">104</span> | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-binary-tree) | Easy |
+| <span id="103">103</span> | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-zigzag-level-order-traversal) | Medium |
+| <span id="102">102</span> | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal) | Medium |
+| <span id="101">101</span> | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/symmetric-tree) | Easy |
+| <span id="100">100</span> | [Same Tree](https://leetcode.com/problems/same-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/same-tree) | Easy |
+| <span id="99">99</span> | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/recover-binary-search-tree) | Hard |
+| <span id="98">98</span> | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-binary-search-tree) | Medium |
+| <span id="97">97</span> | [Interleaving String](https://leetcode.com/problems/interleaving-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/interleaving-string) | Hard |
+| <span id="96">96</span> | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees) | Medium |
+| <span id="95">95</span> | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees-ii) | Medium |
+| <span id="94">94</span> | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) | Medium |
+| <span id="93">93</span> | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | [Go](https://github.com/openset/leetcode/tree/master/problems/restore-ip-addresses) | Medium |
+| <span id="92">92</span> | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list-ii) | Medium |
+| <span id="91">91</span> | [Decode Ways](https://leetcode.com/problems/decode-ways) | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-ways) | Medium |
+| <span id="90">90</span> | [Subsets II](https://leetcode.com/problems/subsets-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/subsets-ii) | Medium |
+| <span id="89">89</span> | [Gray Code](https://leetcode.com/problems/gray-code) | [Go](https://github.com/openset/leetcode/tree/master/problems/gray-code) | Medium |
+| <span id="88">88</span> | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-sorted-array) | Easy |
+| <span id="87">87</span> | [Scramble String](https://leetcode.com/problems/scramble-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/scramble-string) | Hard |
+| <span id="86">86</span> | [Partition List](https://leetcode.com/problems/partition-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-list) | Medium |
+| <span id="85">85</span> | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximal-rectangle) | Hard |
+| <span id="84">84</span> | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-rectangle-in-histogram) | Hard |
+| <span id="83">83</span> | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list) | Easy |
+| <span id="82">82</span> | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list-ii) | Medium |
+| <span id="81">81</span> | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array-ii) | Medium |
+| <span id="80">80</span> | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array-ii) | Medium |
+| <span id="79">79</span> | [Word Search](https://leetcode.com/problems/word-search) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-search) | Medium |
+| <span id="78">78</span> | [Subsets](https://leetcode.com/problems/subsets) | [Go](https://github.com/openset/leetcode/tree/master/problems/subsets) | Medium |
+| <span id="77">77</span> | [Combinations](https://leetcode.com/problems/combinations) | [Go](https://github.com/openset/leetcode/tree/master/problems/combinations) | Medium |
+| <span id="76">76</span> | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring) | Hard |
+| <span id="75">75</span> | [Sort Colors](https://leetcode.com/problems/sort-colors) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-colors) | Medium |
+| <span id="74">74</span> | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix) | Medium |
+| <span id="73">73</span> | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/set-matrix-zeroes) | Medium |
+| <span id="72">72</span> | [Edit Distance](https://leetcode.com/problems/edit-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/edit-distance) | Hard |
+| <span id="71">71</span> | [Simplify Path](https://leetcode.com/problems/simplify-path) | [Go](https://github.com/openset/leetcode/tree/master/problems/simplify-path) | Medium |
+| <span id="70">70</span> | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/climbing-stairs) | Easy |
+| <span id="69">69</span> | [Sqrt(x)](https://leetcode.com/problems/sqrtx) | [Go](https://github.com/openset/leetcode/tree/master/problems/sqrtx) | Easy |
+| <span id="68">68</span> | [Text Justification](https://leetcode.com/problems/text-justification) | [Go](https://github.com/openset/leetcode/tree/master/problems/text-justification) | Hard |
+| <span id="67">67</span> | [Add Binary](https://leetcode.com/problems/add-binary) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-binary) | Easy |
+| <span id="66">66</span> | [Plus One](https://leetcode.com/problems/plus-one) | [Go](https://github.com/openset/leetcode/tree/master/problems/plus-one) | Easy |
+| <span id="65">65</span> | [Valid Number](https://leetcode.com/problems/valid-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-number) | Hard |
+| <span id="64">64</span> | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-path-sum) | Medium |
+| <span id="63">63</span> | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-paths-ii) | Medium |
+| <span id="62">62</span> | [Unique Paths](https://leetcode.com/problems/unique-paths) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-paths) | Medium |
+| <span id="61">61</span> | [Rotate List](https://leetcode.com/problems/rotate-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-list) | Medium |
+| <span id="60">60</span> | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutation-sequence) | Medium |
+| <span id="59">59</span> | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-ii) | Medium |
+| <span id="58">58</span> | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/length-of-last-word) | Easy |
+| <span id="57">57</span> | [Insert Interval](https://leetcode.com/problems/insert-interval) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-interval) | Hard |
+| <span id="56">56</span> | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) | Medium |
+| <span id="55">55</span> | [Jump Game](https://leetcode.com/problems/jump-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/jump-game) | Medium |
+| <span id="54">54</span> | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix) | Medium |
+| <span id="53">53</span> | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray) | Easy |
+| <span id="52">52</span> | [N-Queens II](https://leetcode.com/problems/n-queens-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-queens-ii) | Hard |
+| <span id="51">51</span> | [N-Queens](https://leetcode.com/problems/n-queens) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-queens) | Hard |
+| <span id="50">50</span> | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [Go](https://github.com/openset/leetcode/tree/master/problems/powx-n) | Medium |
+| <span id="49">49</span> | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | [Go](https://github.com/openset/leetcode/tree/master/problems/group-anagrams) | Medium |
+| <span id="48">48</span> | [Rotate Image](https://leetcode.com/problems/rotate-image) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-image) | Medium |
+| <span id="47">47</span> | [Permutations II](https://leetcode.com/problems/permutations-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutations-ii) | Medium |
+| <span id="46">46</span> | [Permutations](https://leetcode.com/problems/permutations) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutations) | Medium |
+| <span id="45">45</span> | [Jump Game II](https://leetcode.com/problems/jump-game-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/jump-game-ii) | Hard |
+| <span id="44">44</span> | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | [Go](https://github.com/openset/leetcode/tree/master/problems/wildcard-matching) | Hard |
+| <span id="43">43</span> | [Multiply Strings](https://leetcode.com/problems/multiply-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/multiply-strings) | Medium |
+| <span id="42">42</span> | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | [Go](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water) | Hard |
+| <span id="41">41</span> | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | [Go](https://github.com/openset/leetcode/tree/master/problems/first-missing-positive) | Hard |
+| <span id="40">40</span> | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-ii) | Medium |
+| <span id="39">39</span> | [Combination Sum](https://leetcode.com/problems/combination-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum) | Medium |
+| <span id="38">38</span> | [Count and Say](https://leetcode.com/problems/count-and-say) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-and-say) | Easy |
+| <span id="37">37</span> | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | [Go](https://github.com/openset/leetcode/tree/master/problems/sudoku-solver) | Hard |
+| <span id="36">36</span> | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-sudoku) | Medium |
+| <span id="35">35</span> | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-insert-position) | Easy |
+| <span id="34">34</span> | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-first-and-last-position-of-element-in-sorted-array) | Medium |
+| <span id="33">33</span> | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array) | Medium |
+| <span id="32">32</span> | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-valid-parentheses) | Hard |
+| <span id="31">31</span> | [Next Permutation](https://leetcode.com/problems/next-permutation) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-permutation) | Medium |
+| <span id="30">30</span> | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/substring-with-concatenation-of-all-words) | Hard |
+| <span id="29">29</span> | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/problems/divide-two-integers) | Medium |
+| <span id="28">28</span> | [Implement strStr()](https://leetcode.com/problems/implement-strstr) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-strstr) | Easy |
+| <span id="27">27</span> | [Remove Element](https://leetcode.com/problems/remove-element) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-element) | Easy |
+| <span id="26">26</span> | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array) | Easy |
+| <span id="25">25</span> | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-nodes-in-k-group) | Hard |
+| <span id="24">24</span> | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-nodes-in-pairs) | Medium |
+| <span id="23">23</span> | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-k-sorted-lists) | Hard |
+| <span id="22">22</span> | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/generate-parentheses) | Medium |
+| <span id="21">21</span> | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-two-sorted-lists) | Easy |
+| <span id="20">20</span> | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-parentheses) | Easy |
+| <span id="19">19</span> | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-nth-node-from-end-of-list) | Medium |
+| <span id="18">18</span> | [4Sum](https://leetcode.com/problems/4sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/4sum) | Medium |
+| <span id="17">17</span> | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/letter-combinations-of-a-phone-number) | Medium |
+| <span id="16">16</span> | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-closest) | Medium |
+| <span id="15">15</span> | [3Sum](https://leetcode.com/problems/3sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum) | Medium |
+| <span id="14">14</span> | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-common-prefix) | Easy |
+| <span id="13">13</span> | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | [Go](https://github.com/openset/leetcode/tree/master/problems/roman-to-integer) | Easy |
+| <span id="12">12</span> | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-to-roman) | Medium |
+| <span id="11">11</span> | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [Go](https://github.com/openset/leetcode/tree/master/problems/container-with-most-water) | Medium |
+| <span id="10">10</span> | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | [Go](https://github.com/openset/leetcode/tree/master/problems/regular-expression-matching) | Hard |
+| <span id="9">9</span> | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-number) | Easy |
+| <span id="8">8</span> | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | [Go](https://github.com/openset/leetcode/tree/master/problems/string-to-integer-atoi) | Medium |
+| <span id="7">7</span> | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-integer) | Easy |
+| <span id="6">6</span> | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | [Go](https://github.com/openset/leetcode/tree/master/problems/zigzag-conversion) | Medium |
+| <span id="5">5</span> | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-substring) | Medium |
+| <span id="4">4</span> | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/median-of-two-sorted-arrays) | Hard |
+| <span id="3">3</span> | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-without-repeating-characters) | Medium |
+| <span id="2">2</span> | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers) | Medium |
+| <span id="1">1</span> | [Two Sum](https://leetcode.com/problems/two-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum) | Easy |

From 52ea88a0d7f95cd491610269ad0cabe1f1289446 Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Sat, 5 Jan 2019 20:39:02 +0800
Subject: [PATCH 16/22] Update: page

---
 index.md | 90 ++++++++++++++++++++++++++++----------------------------
 1 file changed, 45 insertions(+), 45 deletions(-)

diff --git a/index.md b/index.md
index efe67f1bc..13fb1ea6d 100644
--- a/index.md
+++ b/index.md
@@ -18,36 +18,36 @@ LeetCode Problems' Solutions
 
 <table><thead>
 <tr>
-<th align="center"><a href="#1">[1-50]</a></th>
-<th align="center"><a href="#51">[51-100]</a></th>
-<th align="center"><a href="#101">[101-150]</a></th>
-<th align="center"><a href="#151">[151-200]</a></th>
-<th align="center"><a href="#201">[201-250]</a></th>
-<th align="center"><a href="#251">[251-300]</a></th>
+	<th align="center"><a href="#1">[1-50]</a></th>
+	<th align="center"><a href="#51">[51-100]</a></th>
+	<th align="center"><a href="#101">[101-150]</a></th>
+	<th align="center"><a href="#151">[151-200]</a></th>
+	<th align="center"><a href="#201">[201-250]</a></th>
+	<th align="center"><a href="#251">[251-300]</a></th>
 </tr>
 <tr>
-<th align="center"><a href="#301">[301-350]</a></th>
-<th align="center"><a href="#351">[351-400]</a></th>
-<th align="center"><a href="#401">[401-450]</a></th>
-<th align="center"><a href="#451">[451-500]</a></th>
-<th align="center"><a href="#501">[501-550]</a></th>
-<th align="center"><a href="#551">[551-600]</a></th>
+	<th align="center"><a href="#301">[301-350]</a></th>
+	<th align="center"><a href="#351">[351-400]</a></th>
+	<th align="center"><a href="#401">[401-450]</a></th>
+	<th align="center"><a href="#451">[451-500]</a></th>
+	<th align="center"><a href="#501">[501-550]</a></th>
+	<th align="center"><a href="#551">[551-600]</a></th>
 </tr>
 <tr>
-<th align="center"><a href="#601">[601-650]</a></th>
-<th align="center"><a href="#651">[651-700]</a></th>
-<th align="center"><a href="#701">[701-750]</a></th>
-<th align="center"><a href="#751">[751-800]</a></th>
-<th align="center"><a href="#801">[801-850]</a></th>
-<th align="center"><a href="#851">[851-900]</a></th>
+	<th align="center"><a href="#601">[601-650]</a></th>
+	<th align="center"><a href="#651">[651-700]</a></th>
+	<th align="center"><a href="#701">[701-750]</a></th>
+	<th align="center"><a href="#751">[751-800]</a></th>
+	<th align="center"><a href="#801">[801-850]</a></th>
+	<th align="center"><a href="#851">[851-900]</a></th>
 </tr>
 <tr>
-<th align="center"><a href="#901">[901-950]</a></th>
-<th align="center"><a href="#951">[951-1000]</a></th>
-<th align="center"><a href="#1001">[1001-1050]</a></th>
-<th align="center"><a href="#1051">[1051-1100]</a></th>
-<th align="center"><a href="#1101">[1101-1150]</a></th>
-<th align="center"><a href="#1151">[1151-1200]</a></th>
+	<th align="center"><a href="#901">[901-950]</a></th>
+	<th align="center"><a href="#951">[951-1000]</a></th>
+	<th align="center"><a href="#1001">[1001-1050]</a></th>
+	<th align="center"><a href="#1051">[1051-1100]</a></th>
+	<th align="center"><a href="#1101">[1101-1150]</a></th>
+	<th align="center"><a href="#1151">[1151-1200]</a></th>
 </tr>
 </thead></table>
 
@@ -393,14 +393,14 @@ LeetCode Problems' Solutions
 | <span id="630">630</span> | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule-iii) | Hard |
 | <span id="629">629</span> | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-inverse-pairs-array) | Hard |
 | <span id="628">628</span> | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers) | Easy |
-| <span id="627">627</span> | [Swap Salary](https://leetcode.com/problems/swap-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-salary) | Easy |
-| <span id="626">626</span> | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [Go](https://github.com/openset/leetcode/tree/master/problems/exchange-seats) | Medium |
+| <span id="627">627</span> | [Swap Salary](https://leetcode.com/problems/swap-salary) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/swap-salary) | Easy |
+| <span id="626">626</span> | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/exchange-seats) | Medium |
 | <span id="625">625</span> | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization) | Medium |
 | <span id="624">624</span> | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-distance-in-arrays) | Easy |
 | <span id="623">623</span> | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-one-row-to-tree) | Medium |
 | <span id="622">622</span> | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue) | Medium |
 | <span id="621">621</span> | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [Go](https://github.com/openset/leetcode/tree/master/problems/task-scheduler) | Medium |
-| <span id="620">620</span> | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [Go](https://github.com/openset/leetcode/tree/master/problems/not-boring-movies) | Easy |
+| <span id="620">620</span> | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/not-boring-movies) | Easy |
 | <span id="619">619</span> | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/biggest-single-number) | Easy |
 | <span id="618">618</span> | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/students-report-by-geography) | Hard |
 | <span id="617">617</span> | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-two-binary-trees) | Easy |
@@ -419,12 +419,12 @@ LeetCode Problems' Solutions
 | <span id="604">604</span> | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-compressed-string-iterator) | Easy |
 | <span id="603">603</span> | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-available-seats) | Easy |
 | <span id="602">602</span> | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-ii-who-has-the-most-friends) | Medium |
-| <span id="601">601</span> | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [Go](https://github.com/openset/leetcode/tree/master/problems/human-traffic-of-stadium) | Hard |
+| <span id="601">601</span> | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/human-traffic-of-stadium) | Hard |
 | <span id="600">600</span> | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/problems/non-negative-integers-without-consecutive-ones) | Hard |
 | <span id="599">599</span> | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-index-sum-of-two-lists) | Easy |
 | <span id="598">598</span> | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-addition-ii) | Easy |
 | <span id="597">597</span> | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-i-overall-acceptance-rate) | Easy |
-| <span id="596">596</span> | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [Go](https://github.com/openset/leetcode/tree/master/problems/classes-more-than-5-students) | Easy |
+| <span id="596">596</span> | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/classes-more-than-5-students) | Easy |
 | <span id="595">595</span> | [Big Countries](https://leetcode.com/problems/big-countries) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/big-countries) | Easy |
 | <span id="594">594</span> | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-harmonious-subsequence) | Easy |
 | <span id="593">593</span> | [Valid Square](https://leetcode.com/problems/valid-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-square) | Medium |
@@ -752,7 +752,7 @@ LeetCode Problems' Solutions
 | <span id="265">265</span> | [Paint House II](https://leetcode.com/problems/paint-house-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii) | Hard |
 | <span id="264">264</span> | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii) | Medium |
 | <span id="263">263</span> | [Ugly Number](https://leetcode.com/problems/ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/ugly-number) | Easy |
-| <span id="262">262</span> | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [Go](https://github.com/openset/leetcode/tree/master/problems/trips-and-users) | Hard |
+| <span id="262">262</span> | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/trips-and-users) | Hard |
 | <span id="261">261</span> | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree) | Medium |
 | <span id="260">260</span> | [Single Number III](https://leetcode.com/problems/single-number-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number-iii) | Medium |
 | <span id="259">259</span> | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) | Medium |
@@ -817,29 +817,29 @@ LeetCode Problems' Solutions
 | <span id="200">200</span> | [Number of Islands](https://leetcode.com/problems/number-of-islands) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-islands) | Medium |
 | <span id="199">199</span> | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-right-side-view) | Medium |
 | <span id="198">198</span> | [House Robber](https://leetcode.com/problems/house-robber) | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber) | Easy |
-| <span id="197">197</span> | [Rising Temperature](https://leetcode.com/problems/rising-temperature) | [Go](https://github.com/openset/leetcode/tree/master/problems/rising-temperature) | Easy |
-| <span id="196">196</span> | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-duplicate-emails) | Easy |
+| <span id="197">197</span> | [Rising Temperature](https://leetcode.com/problems/rising-temperature) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/rising-temperature) | Easy |
+| <span id="196">196</span> | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/delete-duplicate-emails) | Easy |
 | <span id="195">195</span> | [Tenth Line](https://leetcode.com/problems/tenth-line) | [Bash](https://github.com/openset/leetcode/tree/master/problems/tenth-line) | Easy |
-| <span id="194">194</span> | [Transpose File](https://leetcode.com/problems/transpose-file) | [Go](https://github.com/openset/leetcode/tree/master/problems/transpose-file) | Medium |
-| <span id="193">193</span> | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-phone-numbers) | Easy |
-| <span id="192">192</span> | [Word Frequency](https://leetcode.com/problems/word-frequency) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-frequency) | Medium |
+| <span id="194">194</span> | [Transpose File](https://leetcode.com/problems/transpose-file) | [Bash](https://github.com/openset/leetcode/tree/master/problems/transpose-file) | Medium |
+| <span id="193">193</span> | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Bash](https://github.com/openset/leetcode/tree/master/problems/valid-phone-numbers) | Easy |
+| <span id="192">192</span> | [Word Frequency](https://leetcode.com/problems/word-frequency) | [Bash](https://github.com/openset/leetcode/tree/master/problems/word-frequency) | Medium |
 | <span id="191">191</span> | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits) | Easy |
 | <span id="190">190</span> | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-bits) | Easy |
 | <span id="189">189</span> | [Rotate Array](https://leetcode.com/problems/rotate-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-array) | Easy |
 | <span id="188">188</span> | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv) | Hard |
 | <span id="187">187</span> | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-dna-sequences) | Medium |
 | <span id="186">186</span> | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-ii) | Medium |
-| <span id="185">185</span> | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [Go](https://github.com/openset/leetcode/tree/master/problems/department-top-three-salaries) | Hard |
-| <span id="184">184</span> | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/department-highest-salary) | Medium |
-| <span id="183">183</span> | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [Go](https://github.com/openset/leetcode/tree/master/problems/customers-who-never-order) | Easy |
-| <span id="182">182</span> | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails) | [Go](https://github.com/openset/leetcode/tree/master/problems/duplicate-emails) | Easy |
-| <span id="181">181</span> | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | [Go](https://github.com/openset/leetcode/tree/master/problems/employees-earning-more-than-their-managers) | Easy |
-| <span id="180">180</span> | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers) | Medium |
+| <span id="185">185</span> | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/department-top-three-salaries) | Hard |
+| <span id="184">184</span> | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/department-highest-salary) | Medium |
+| <span id="183">183</span> | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/customers-who-never-order) | Easy |
+| <span id="182">182</span> | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/duplicate-emails) | Easy |
+| <span id="181">181</span> | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/employees-earning-more-than-their-managers) | Easy |
+| <span id="180">180</span> | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers) | Medium |
 | <span id="179">179</span> | [Largest Number](https://leetcode.com/problems/largest-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-number) | Medium |
-| <span id="178">178</span> | [Rank Scores](https://leetcode.com/problems/rank-scores) | [Go](https://github.com/openset/leetcode/tree/master/problems/rank-scores) | Medium |
-| <span id="177">177</span> | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/nth-highest-salary) | Medium |
-| <span id="176">176</span> | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | [Go](https://github.com/openset/leetcode/tree/master/problems/second-highest-salary) | Easy |
-| <span id="175">175</span> | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | [Go](https://github.com/openset/leetcode/tree/master/problems/combine-two-tables) | Easy |
+| <span id="178">178</span> | [Rank Scores](https://leetcode.com/problems/rank-scores) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/rank-scores) | Medium |
+| <span id="177">177</span> | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/nth-highest-salary) | Medium |
+| <span id="176">176</span> | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/second-highest-salary) | Easy |
+| <span id="175">175</span> | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/combine-two-tables) | Easy |
 | <span id="174">174</span> | [Dungeon Game](https://leetcode.com/problems/dungeon-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/dungeon-game) | Hard |
 | <span id="173">173</span> | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator) | Medium |
 | <span id="172">172</span> | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/factorial-trailing-zeroes) | Easy |

From 7b2f67ee47c31e33c81cb55a105431aa555e5f87 Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Sun, 6 Jan 2019 18:21:27 +0800
Subject: [PATCH 17/22] Add: title

---
 index.md | 1922 +++++++++++++++++++++++++++---------------------------
 1 file changed, 961 insertions(+), 961 deletions(-)

diff --git a/index.md b/index.md
index 13fb1ea6d..36dcabe1c 100644
--- a/index.md
+++ b/index.md
@@ -53,964 +53,964 @@ LeetCode Problems' Solutions
 
 | # | Title | Solution | Difficulty |
 | :-: | - | - | :-: |
-| <span id="968">968</span> | [Binary Tree Cameras](https://leetcode.com/problems/binary-tree-cameras) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-cameras) | Hard |
-| <span id="967">967</span> | [Numbers With Same Consecutive Differences](https://leetcode.com/problems/numbers-with-same-consecutive-differences) | [Go](https://github.com/openset/leetcode/tree/master/problems/numbers-with-same-consecutive-differences) | Medium |
-| <span id="966">966</span> | [Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker) | [Go](https://github.com/openset/leetcode/tree/master/problems/vowel-spellchecker) | Medium |
-| <span id="965">965</span> | [Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/univalued-binary-tree) | Easy |
-| <span id="964">964</span> | [Least Operators to Express Number](https://leetcode.com/problems/least-operators-to-express-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/least-operators-to-express-number) | Hard |
-| <span id="963">963</span> | [Minimum Area Rectangle II](https://leetcode.com/problems/minimum-area-rectangle-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle-ii) | Medium |
-| <span id="962">962</span> | [Maximum Width Ramp](https://leetcode.com/problems/maximum-width-ramp) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-width-ramp) | Medium |
-| <span id="961">961</span> | [N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-repeated-element-in-size-2n-array) | Easy |
-| <span id="960">960</span> | [Delete Columns to Make Sorted III](https://leetcode.com/problems/delete-columns-to-make-sorted-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-iii) | Hard |
-| <span id="959">959</span> | [Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes) | [Go](https://github.com/openset/leetcode/tree/master/problems/regions-cut-by-slashes) | Medium |
-| <span id="958">958</span> | [Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/check-completeness-of-a-binary-tree) | Medium |
-| <span id="957">957</span> | [Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days) | [Go](https://github.com/openset/leetcode/tree/master/problems/prison-cells-after-n-days) | Medium |
-| <span id="956">956</span> | [Tallest Billboard](https://leetcode.com/problems/tallest-billboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/tallest-billboard) | Hard |
-| <span id="955">955</span> | [Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-ii) | Medium |
-| <span id="954">954</span> | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/array-of-doubled-pairs) | Medium |
-| <span id="953">953</span> | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/problems/verifying-an-alien-dictionary) | Easy |
-| <span id="952">952</span> | [Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-component-size-by-common-factor) | Hard |
-| <span id="951">951</span> | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-equivalent-binary-trees) | Medium |
-| <span id="950">950</span> | [Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order) | [Go](https://github.com/openset/leetcode/tree/master/problems/reveal-cards-in-increasing-order) | Medium |
-| <span id="949">949</span> | [Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-time-for-given-digits) | Easy |
-| <span id="948">948</span> | [Bag of Tokens](https://leetcode.com/problems/bag-of-tokens) | [Go](https://github.com/openset/leetcode/tree/master/problems/bag-of-tokens) | Medium |
-| <span id="947">947</span> | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-stones-removed-with-same-row-or-column) | Medium |
-| <span id="946">946</span> | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-stack-sequences) | Medium |
-| <span id="945">945</span> | [Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-increment-to-make-array-unique) | Medium |
-| <span id="944">944</span> | [Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted) | Easy |
-| <span id="943">943</span> | [Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-shortest-superstring) | Hard |
-| <span id="942">942</span> | [DI String Match](https://leetcode.com/problems/di-string-match) | [Go](https://github.com/openset/leetcode/tree/master/problems/di-string-match) | Easy |
-| <span id="941">941</span> | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-mountain-array) | Easy |
-| <span id="940">940</span> | [Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences-ii) | Hard |
-| <span id="939">939</span> | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle) | Medium |
-| <span id="938">938</span> | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-of-bst) | Medium |
-| <span id="937">937</span> | [Reorder Log Files](https://leetcode.com/problems/reorder-log-files) | [Go](https://github.com/openset/leetcode/tree/master/problems/reorder-log-files) | Easy |
-| <span id="936">936</span> | [Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/stamping-the-sequence) | Hard |
-| <span id="935">935</span> | [Knight Dialer](https://leetcode.com/problems/knight-dialer) | [Go](https://github.com/openset/leetcode/tree/master/problems/knight-dialer) | Medium |
-| <span id="934">934</span> | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-bridge) | Medium |
-| <span id="933">933</span> | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-recent-calls) | Easy |
-| <span id="932">932</span> | [Beautiful Array](https://leetcode.com/problems/beautiful-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-array) | Medium |
-| <span id="931">931</span> | [Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-falling-path-sum) | Medium |
-| <span id="930">930</span> | [Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-subarrays-with-sum) | Medium |
-| <span id="929">929</span> | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-email-addresses) | Easy |
-| <span id="928">928</span> | [Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread-ii) | Hard |
-| <span id="927">927</span> | [Three Equal Parts](https://leetcode.com/problems/three-equal-parts) | [Go](https://github.com/openset/leetcode/tree/master/problems/three-equal-parts) | Hard |
-| <span id="926">926</span> | [Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing) | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-string-to-monotone-increasing) | Medium |
-| <span id="925">925</span> | [Long Pressed Name](https://leetcode.com/problems/long-pressed-name) | [Go](https://github.com/openset/leetcode/tree/master/problems/long-pressed-name) | Easy |
-| <span id="924">924</span> | [Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread) | Hard |
-| <span id="923">923</span> | [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity) | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-with-multiplicity) | Medium |
-| <span id="922">922</span> | [Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity-ii) | Easy |
-| <span id="921">921</span> | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-add-to-make-parentheses-valid) | Medium |
-| <span id="920">920</span> | [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-music-playlists) | Hard |
-| <span id="919">919</span> | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter) | [Go](https://github.com/openset/leetcode/tree/master/problems/complete-binary-tree-inserter) | Medium |
-| <span id="918">918</span> | [Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-circular-subarray) | Medium |
-| <span id="917">917</span> | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-only-letters) | Easy |
-| <span id="916">916</span> | [Word Subsets](https://leetcode.com/problems/word-subsets) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-subsets) | Medium |
-| <span id="915">915</span> | [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-array-into-disjoint-intervals) | Medium |
-| <span id="914">914</span> | [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | [Go](https://github.com/openset/leetcode/tree/master/problems/x-of-a-kind-in-a-deck-of-cards) | Easy |
-| <span id="913">913</span> | [Cat and Mouse](https://leetcode.com/problems/cat-and-mouse) | [Go](https://github.com/openset/leetcode/tree/master/problems/cat-and-mouse) | Hard |
-| <span id="911">911</span> | [Online Election](https://leetcode.com/problems/online-election) | [Go](https://github.com/openset/leetcode/tree/master/problems/online-election) | Medium |
-| <span id="910">910</span> | [Smallest Range II](https://leetcode.com/problems/smallest-range-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range-ii) | Medium |
-| <span id="909">909</span> | [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders) | [Go](https://github.com/openset/leetcode/tree/master/problems/snakes-and-ladders) | Medium |
-| <span id="908">908</span> | [Smallest Range I](https://leetcode.com/problems/smallest-range-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range-i) | Easy |
-| <span id="907">907</span> | [Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-subarray-minimums) | Medium |
-| <span id="906">906</span> | [Super Palindromes](https://leetcode.com/problems/super-palindromes) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-palindromes) | Hard |
-| <span id="905">905</span> | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity) | Easy |
-| <span id="904">904</span> | [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets) | [Go](https://github.com/openset/leetcode/tree/master/problems/fruit-into-baskets) | Medium |
-| <span id="903">903</span> | [Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-permutations-for-di-sequence) | Hard |
-| <span id="902">902</span> | [Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set) | [Go](https://github.com/openset/leetcode/tree/master/problems/numbers-at-most-n-given-digit-set) | Hard |
-| <span id="901">901</span> | [Online Stock Span](https://leetcode.com/problems/online-stock-span) | [Go](https://github.com/openset/leetcode/tree/master/problems/online-stock-span) | Medium |
-| <span id="900">900</span> | [RLE Iterator](https://leetcode.com/problems/rle-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/rle-iterator) | Medium |
-| <span id="899">899</span> | [Orderly Queue](https://leetcode.com/problems/orderly-queue) | [Go](https://github.com/openset/leetcode/tree/master/problems/orderly-queue) | Hard |
-| <span id="898">898</span> | [Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/bitwise-ors-of-subarrays) | Medium |
-| <span id="897">897</span> | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-order-search-tree) | Easy |
-| <span id="896">896</span> | [Monotonic Array](https://leetcode.com/problems/monotonic-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/monotonic-array) | Easy |
-| <span id="895">895</span> | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-frequency-stack) | Hard |
-| <span id="894">894</span> | [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-possible-full-binary-trees) | Medium |
-| <span id="893">893</span> | [Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/groups-of-special-equivalent-strings) | Easy |
-| <span id="892">892</span> | [Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/problems/surface-area-of-3d-shapes) | Easy |
-| <span id="891">891</span> | [Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-subsequence-widths) | Hard |
-| <span id="890">890</span> | [Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-pattern) | Medium |
-| <span id="889">889</span> | [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | Medium |
-| <span id="888">888</span> | [Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap) | [Go](https://github.com/openset/leetcode/tree/master/problems/fair-candy-swap) | Easy |
-| <span id="887">887</span> | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-egg-drop) | Hard |
-| <span id="886">886</span> | [Possible Bipartition](https://leetcode.com/problems/possible-bipartition) | [Go](https://github.com/openset/leetcode/tree/master/problems/possible-bipartition) | Medium |
-| <span id="885">885</span> | [Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-iii) | Medium |
-| <span id="884">884</span> | [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences) | [Go](https://github.com/openset/leetcode/tree/master/problems/uncommon-words-from-two-sentences) | Easy |
-| <span id="883">883</span> | [Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes) | [Go](https://github.com/openset/leetcode/tree/master/problems/projection-area-of-3d-shapes) | Easy |
-| <span id="882">882</span> | [Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph) | [Go](https://github.com/openset/leetcode/tree/master/problems/reachable-nodes-in-subdivided-graph) | Hard |
-| <span id="881">881</span> | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people) | [Go](https://github.com/openset/leetcode/tree/master/problems/boats-to-save-people) | Medium |
-| <span id="880">880</span> | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/decoded-string-at-index) | Medium |
-| <span id="879">879</span> | [Profitable Schemes](https://leetcode.com/problems/profitable-schemes) | [Go](https://github.com/openset/leetcode/tree/master/problems/profitable-schemes) | Hard |
-| <span id="878">878</span> | [Nth Magical Number](https://leetcode.com/problems/nth-magical-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/nth-magical-number) | Hard |
-| <span id="877">877</span> | [Stone Game](https://leetcode.com/problems/stone-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/stone-game) | Medium |
-| <span id="876">876</span> | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/middle-of-the-linked-list) | Easy |
-| <span id="875">875</span> | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas) | [Go](https://github.com/openset/leetcode/tree/master/problems/koko-eating-bananas) | Medium |
-| <span id="874">874</span> | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation) | [Go](https://github.com/openset/leetcode/tree/master/problems/walking-robot-simulation) | Easy |
-| <span id="873">873</span> | [Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/length-of-longest-fibonacci-subsequence) | Medium |
-| <span id="872">872</span> | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/leaf-similar-trees) | Easy |
-| <span id="871">871</span> | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-refueling-stops) | Hard |
-| <span id="870">870</span> | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle) | [Go](https://github.com/openset/leetcode/tree/master/problems/advantage-shuffle) | Medium |
-| <span id="869">869</span> | [Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2) | [Go](https://github.com/openset/leetcode/tree/master/problems/reordered-power-of-2) | Medium |
-| <span id="868">868</span> | [Binary Gap](https://leetcode.com/problems/binary-gap) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-gap) | Easy |
-| <span id="867">867</span> | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/transpose-matrix) | Easy |
-| <span id="866">866</span> | [Prime Palindrome](https://leetcode.com/problems/prime-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/prime-palindrome) | Medium |
-| <span id="865">865</span> | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-subtree-with-all-the-deepest-nodes) | Medium |
-| <span id="864">864</span> | [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-path-to-get-all-keys) | Hard |
-| <span id="863">863</span> | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-nodes-distance-k-in-binary-tree) | Medium |
-| <span id="862">862</span> | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-subarray-with-sum-at-least-k) | Hard |
-| <span id="861">861</span> | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/score-after-flipping-matrix) | Medium |
-| <span id="860">860</span> | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [Go](https://github.com/openset/leetcode/tree/master/problems/lemonade-change) | Easy |
-| <span id="859">859</span> | [Buddy Strings](https://leetcode.com/problems/buddy-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/buddy-strings) | Easy |
-| <span id="858">858</span> | [Mirror Reflection](https://leetcode.com/problems/mirror-reflection) | [Go](https://github.com/openset/leetcode/tree/master/problems/mirror-reflection) | Medium |
-| <span id="857">857</span> | [Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-hire-k-workers) | Hard |
-| <span id="856">856</span> | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/score-of-parentheses) | Medium |
-| <span id="855">855</span> | [Exam Room](https://leetcode.com/problems/exam-room) | [Go](https://github.com/openset/leetcode/tree/master/problems/exam-room) | Medium |
-| <span id="854">854</span> | [K-Similar Strings](https://leetcode.com/problems/k-similar-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-similar-strings) | Hard |
-| <span id="853">853</span> | [Car Fleet](https://leetcode.com/problems/car-fleet) | [Go](https://github.com/openset/leetcode/tree/master/problems/car-fleet) | Medium |
-| <span id="852">852</span> | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/peak-index-in-a-mountain-array) | Easy |
-| <span id="851">851</span> | [Loud and Rich](https://leetcode.com/problems/loud-and-rich) | [Go](https://github.com/openset/leetcode/tree/master/problems/loud-and-rich) | Medium |
-| <span id="850">850</span> | [Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/rectangle-area-ii) | Hard |
-| <span id="849">849</span> | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximize-distance-to-closest-person) | Easy |
-| <span id="848">848</span> | [Shifting Letters](https://leetcode.com/problems/shifting-letters) | [Go](https://github.com/openset/leetcode/tree/master/problems/shifting-letters) | Medium |
-| <span id="847">847</span> | [Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-path-visiting-all-nodes) | Hard |
-| <span id="846">846</span> | [Hand of Straights](https://leetcode.com/problems/hand-of-straights) | [Go](https://github.com/openset/leetcode/tree/master/problems/hand-of-straights) | Medium |
-| <span id="845">845</span> | [Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-mountain-in-array) | Medium |
-| <span id="844">844</span> | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | [Go](https://github.com/openset/leetcode/tree/master/problems/backspace-string-compare) | Easy |
-| <span id="843">843</span> | [Guess the Word](https://leetcode.com/problems/guess-the-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/guess-the-word) | Hard |
-| <span id="842">842</span> | [Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-into-fibonacci-sequence) | Medium |
-| <span id="841">841</span> | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms) | [Go](https://github.com/openset/leetcode/tree/master/problems/keys-and-rooms) | Medium |
-| <span id="840">840</span> | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid) | [Go](https://github.com/openset/leetcode/tree/master/problems/magic-squares-in-grid) | Easy |
-| <span id="839">839</span> | [Similar String Groups](https://leetcode.com/problems/similar-string-groups) | [Go](https://github.com/openset/leetcode/tree/master/problems/similar-string-groups) | Hard |
-| <span id="838">838</span> | [Push Dominoes](https://leetcode.com/problems/push-dominoes) | [Go](https://github.com/openset/leetcode/tree/master/problems/push-dominoes) | Medium |
-| <span id="837">837</span> | [New 21 Game](https://leetcode.com/problems/new-21-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/new-21-game) | Medium |
-| <span id="836">836</span> | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | [Go](https://github.com/openset/leetcode/tree/master/problems/rectangle-overlap) | Easy |
-| <span id="835">835</span> | [Image Overlap](https://leetcode.com/problems/image-overlap) | [Go](https://github.com/openset/leetcode/tree/master/problems/image-overlap) | Medium |
-| <span id="834">834</span> | [Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-distances-in-tree) | Hard |
-| <span id="833">833</span> | [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-in-string) | Medium |
-| <span id="832">832</span> | [Flipping an Image](https://leetcode.com/problems/flipping-an-image) | [Go](https://github.com/openset/leetcode/tree/master/problems/flipping-an-image) | Easy |
-| <span id="831">831</span> | [Masking Personal Information](https://leetcode.com/problems/masking-personal-information) | [Go](https://github.com/openset/leetcode/tree/master/problems/masking-personal-information) | Medium |
-| <span id="830">830</span> | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups) | [Go](https://github.com/openset/leetcode/tree/master/problems/positions-of-large-groups) | Easy |
-| <span id="829">829</span> | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers-sum) | Hard |
-| <span id="828">828</span> | [Unique Letter String](https://leetcode.com/problems/unique-letter-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-letter-string) | Hard |
-| <span id="827">827</span> | [Making A Large Island](https://leetcode.com/problems/making-a-large-island) | [Go](https://github.com/openset/leetcode/tree/master/problems/making-a-large-island) | Hard |
-| <span id="826">826</span> | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-profit-assigning-work) | Medium |
-| <span id="825">825</span> | [Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages) | [Go](https://github.com/openset/leetcode/tree/master/problems/friends-of-appropriate-ages) | Medium |
-| <span id="824">824</span> | [Goat Latin](https://leetcode.com/problems/goat-latin) | [Go](https://github.com/openset/leetcode/tree/master/problems/goat-latin) | Easy |
-| <span id="823">823</span> | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-trees-with-factors) | Medium |
-| <span id="822">822</span> | [Card Flipping Game](https://leetcode.com/problems/card-flipping-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/card-flipping-game) | Medium |
-| <span id="821">821</span> | [Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-to-a-character) | Easy |
-| <span id="820">820</span> | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/short-encoding-of-words) | Medium |
-| <span id="819">819</span> | [Most Common Word](https://leetcode.com/problems/most-common-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-common-word) | Easy |
-| <span id="818">818</span> | [Race Car](https://leetcode.com/problems/race-car) | [Go](https://github.com/openset/leetcode/tree/master/problems/race-car) | Hard |
-| <span id="817">817</span> | [Linked List Components](https://leetcode.com/problems/linked-list-components) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-components) | Medium |
-| <span id="816">816</span> | [Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates) | [Go](https://github.com/openset/leetcode/tree/master/problems/ambiguous-coordinates) | Medium |
-| <span id="815">815</span> | [Bus Routes](https://leetcode.com/problems/bus-routes) | [Go](https://github.com/openset/leetcode/tree/master/problems/bus-routes) | Hard |
-| <span id="814">814</span> | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-pruning) | Medium |
-| <span id="813">813</span> | [Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-sum-of-averages) | Medium |
-| <span id="812">812</span> | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-triangle-area) | Easy |
-| <span id="811">811</span> | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count) | [Go](https://github.com/openset/leetcode/tree/master/problems/subdomain-visit-count) | Easy |
-| <span id="810">810</span> | [Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/chalkboard-xor-game) | Hard |
-| <span id="809">809</span> | [Expressive Words](https://leetcode.com/problems/expressive-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/expressive-words) | Medium |
-| <span id="808">808</span> | [Soup Servings](https://leetcode.com/problems/soup-servings) | [Go](https://github.com/openset/leetcode/tree/master/problems/soup-servings) | Medium |
-| <span id="807">807</span> | [Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-increase-to-keep-city-skyline) | Medium |
-| <span id="806">806</span> | [Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-lines-to-write-string) | Easy |
-| <span id="805">805</span> | [Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-with-same-average) | Hard |
-| <span id="804">804</span> | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-morse-code-words) | Easy |
-| <span id="803">803</span> | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit) | [Go](https://github.com/openset/leetcode/tree/master/problems/bricks-falling-when-hit) | Hard |
-| <span id="802">802</span> | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-eventual-safe-states) | Medium |
-| <span id="801">801</span> | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-make-sequences-increasing) | Medium |
-| <span id="800">800</span> | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color) | Easy |
-| <span id="799">799</span> | [Champagne Tower](https://leetcode.com/problems/champagne-tower) | [Go](https://github.com/openset/leetcode/tree/master/problems/champagne-tower) | Medium |
-| <span id="798">798</span> | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-rotation-with-highest-score) | Hard |
-| <span id="797">797</span> | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-paths-from-source-to-target) | Medium |
-| <span id="796">796</span> | [Rotate String](https://leetcode.com/problems/rotate-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-string) | Easy |
-| <span id="795">795</span> | [Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-subarrays-with-bounded-maximum) | Medium |
-| <span id="794">794</span> | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-tic-tac-toe-state) | Medium |
-| <span id="793">793</span> | [Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function) | [Go](https://github.com/openset/leetcode/tree/master/problems/preimage-size-of-factorial-zeroes-function) | Hard |
-| <span id="792">792</span> | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-matching-subsequences) | Medium |
-| <span id="791">791</span> | [Custom Sort String](https://leetcode.com/problems/custom-sort-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/custom-sort-string) | Medium |
-| <span id="790">790</span> | [Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling) | [Go](https://github.com/openset/leetcode/tree/master/problems/domino-and-tromino-tiling) | Medium |
-| <span id="789">789</span> | [Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts) | [Go](https://github.com/openset/leetcode/tree/master/problems/escape-the-ghosts) | Medium |
-| <span id="788">788</span> | [Rotated Digits](https://leetcode.com/problems/rotated-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotated-digits) | Easy |
-| <span id="787">787</span> | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops) | [Go](https://github.com/openset/leetcode/tree/master/problems/cheapest-flights-within-k-stops) | Medium |
-| <span id="786">786</span> | [K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-prime-fraction) | Hard |
-| <span id="785">785</span> | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite) | [Go](https://github.com/openset/leetcode/tree/master/problems/is-graph-bipartite) | Medium |
-| <span id="784">784</span> | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation) | [Go](https://github.com/openset/leetcode/tree/master/problems/letter-case-permutation) | Easy |
-| <span id="783">783</span> | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes) | Easy |
-| <span id="782">782</span> | [Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/transform-to-chessboard) | Hard |
-| <span id="781">781</span> | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest) | [Go](https://github.com/openset/leetcode/tree/master/problems/rabbits-in-forest) | Medium |
-| <span id="780">780</span> | [Reaching Points](https://leetcode.com/problems/reaching-points) | [Go](https://github.com/openset/leetcode/tree/master/problems/reaching-points) | Hard |
-| <span id="779">779</span> | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-symbol-in-grammar) | Medium |
-| <span id="778">778</span> | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water) | [Go](https://github.com/openset/leetcode/tree/master/problems/swim-in-rising-water) | Hard |
-| <span id="777">777</span> | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-adjacent-in-lr-string) | Medium |
-| <span id="776">776</span> | [Split BST](https://leetcode.com/problems/split-bst) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-bst) | Medium |
-| <span id="775">775</span> | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | [Go](https://github.com/openset/leetcode/tree/master/problems/global-and-local-inversions) | Medium |
-| <span id="774">774</span> | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station) | Hard |
-| <span id="773">773</span> | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle) | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-puzzle) | Hard |
-| <span id="772">772</span> | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) | Hard |
-| <span id="771">771</span> | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | [Go](https://github.com/openset/leetcode/tree/master/problems/jewels-and-stones) | Easy |
-| <span id="770">770</span> | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv) | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iv) | Hard |
-| <span id="769">769</span> | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted) | Medium |
-| <span id="768">768</span> | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted-ii) | Hard |
-| <span id="767">767</span> | [Reorganize String](https://leetcode.com/problems/reorganize-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reorganize-string) | Medium |
-| <span id="766">766</span> | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/toeplitz-matrix) | Easy |
-| <span id="765">765</span> | [Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands) | [Go](https://github.com/openset/leetcode/tree/master/problems/couples-holding-hands) | Hard |
-| <span id="764">764</span> | [Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-plus-sign) | Medium |
-| <span id="763">763</span> | [Partition Labels](https://leetcode.com/problems/partition-labels) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-labels) | Medium |
-| <span id="762">762</span> | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [Go](https://github.com/openset/leetcode/tree/master/problems/prime-number-of-set-bits-in-binary-representation) | Easy |
-| <span id="761">761</span> | [Special Binary String](https://leetcode.com/problems/special-binary-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/special-binary-string) | Hard |
-| <span id="760">760</span> | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-anagram-mappings) | Easy |
-| <span id="759">759</span> | [Employee Free Time](https://leetcode.com/problems/employee-free-time) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-free-time) | Hard |
-| <span id="758">758</span> | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/bold-words-in-string) | Easy |
-| <span id="757">757</span> | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two) | [Go](https://github.com/openset/leetcode/tree/master/problems/set-intersection-size-at-least-two) | Hard |
-| <span id="756">756</span> | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/pyramid-transition-matrix) | Medium |
-| <span id="755">755</span> | [Pour Water](https://leetcode.com/problems/pour-water) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/pour-water) | Medium |
-| <span id="754">754</span> | [Reach a Number](https://leetcode.com/problems/reach-a-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/reach-a-number) | Easy |
-| <span id="753">753</span> | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | [Go](https://github.com/openset/leetcode/tree/master/problems/cracking-the-safe) | Hard |
-| <span id="752">752</span> | [Open the Lock](https://leetcode.com/problems/open-the-lock) | [Go](https://github.com/openset/leetcode/tree/master/problems/open-the-lock) | Medium |
-| <span id="751">751</span> | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/ip-to-cidr) | Easy |
-| <span id="750">750</span> | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-corner-rectangles) | Medium |
-| <span id="749">749</span> | [Contain Virus](https://leetcode.com/problems/contain-virus) | [Go](https://github.com/openset/leetcode/tree/master/problems/contain-virus) | Hard |
-| <span id="748">748</span> | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-completing-word) | Easy |
-| <span id="747">747</span> | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-number-at-least-twice-of-others) | Easy |
-| <span id="746">746</span> | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/min-cost-climbing-stairs) | Easy |
-| <span id="745">745</span> | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search) | [Go](https://github.com/openset/leetcode/tree/master/problems/prefix-and-suffix-search) | Hard |
-| <span id="744">744</span> | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-smallest-letter-greater-than-target) | Easy |
-| <span id="743">743</span> | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | [Go](https://github.com/openset/leetcode/tree/master/problems/network-delay-time) | Easy |
-| <span id="742">742</span> | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-leaf-in-a-binary-tree) | Medium |
-| <span id="741">741</span> | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup) | [Go](https://github.com/openset/leetcode/tree/master/problems/cherry-pickup) | Hard |
-| <span id="740">740</span> | [Delete and Earn](https://leetcode.com/problems/delete-and-earn) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-and-earn) | Medium |
-| <span id="739">739</span> | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [Go](https://github.com/openset/leetcode/tree/master/problems/daily-temperatures) | Medium |
-| <span id="738">738</span> | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/monotone-increasing-digits) | Medium |
-| <span id="737">737</span> | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii) | Medium |
-| <span id="736">736</span> | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression) | [Go](https://github.com/openset/leetcode/tree/master/problems/parse-lisp-expression) | Hard |
-| <span id="735">735</span> | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [Go](https://github.com/openset/leetcode/tree/master/problems/asteroid-collision) | Medium |
-| <span id="734">734</span> | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity) | Easy |
-| <span id="733">733</span> | [Flood Fill](https://leetcode.com/problems/flood-fill) | [Go](https://github.com/openset/leetcode/tree/master/problems/flood-fill) | Easy |
-| <span id="732">732</span> | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii) | Hard |
-| <span id="731">731</span> | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii) | Medium |
-| <span id="730">730</span> | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-different-palindromic-subsequences) | Hard |
-| <span id="729">729</span> | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-i) | Medium |
-| <span id="728">728</span> | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/self-dividing-numbers) | Easy |
-| <span id="727">727</span> | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-window-subsequence) | Hard |
-| <span id="726">726</span> | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms) | Hard |
-| <span id="725">725</span> | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-linked-list-in-parts) | Medium |
-| <span id="724">724</span> | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-pivot-index) | Easy |
-| <span id="723">723</span> | [Candy Crush](https://leetcode.com/problems/candy-crush) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/candy-crush) | Medium |
-| <span id="722">722</span> | [Remove Comments](https://leetcode.com/problems/remove-comments) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-comments) | Medium |
-| <span id="721">721</span> | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | [Go](https://github.com/openset/leetcode/tree/master/problems/accounts-merge) | Medium |
-| <span id="720">720</span> | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary) | Easy |
-| <span id="719">719</span> | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance) | Hard |
-| <span id="718">718</span> | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-repeated-subarray) | Medium |
-| <span id="717">717</span> | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | [Go](https://github.com/openset/leetcode/tree/master/problems/1-bit-and-2-bit-characters) | Easy |
-| <span id="716">716</span> | [Max Stack](https://leetcode.com/problems/max-stack) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/max-stack) | Easy |
-| <span id="715">715</span> | [Range Module](https://leetcode.com/problems/range-module) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-module) | Hard |
-| <span id="714">714</span> | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
-| <span id="713">713</span> | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k) | Medium |
-| <span id="712">712</span> | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-ascii-delete-sum-for-two-strings) | Medium |
-| <span id="711">711</span> | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii) | Hard |
-| <span id="710">710</span> | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-blacklist) | Hard |
-| <span id="709">709</span> | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [Go](https://github.com/openset/leetcode/tree/master/problems/to-lower-case) | Easy |
-| <span id="708">708</span> | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-cyclic-sorted-list) | Medium |
-| <span id="707">707</span> | [Design Linked List](https://leetcode.com/problems/design-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-linked-list) | Easy |
-| <span id="706">706</span> | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hashmap) | Easy |
-| <span id="705">705</span> | [Design HashSet](https://leetcode.com/problems/design-hashset) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hashset) | Easy |
-| <span id="704">704</span> | [Binary Search](https://leetcode.com/problems/binary-search) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-search) | Easy |
-| <span id="703">703</span> | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-a-stream) | Easy |
-| <span id="702">702</span> | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-a-sorted-array-of-unknown-size) | Medium |
-| <span id="701">701</span> | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-binary-search-tree) | Medium |
-| <span id="700">700</span> | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-a-binary-search-tree) | Easy |
-| <span id="699">699</span> | [Falling Squares](https://leetcode.com/problems/falling-squares) | [Go](https://github.com/openset/leetcode/tree/master/problems/falling-squares) | Hard |
-| <span id="698">698</span> | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-to-k-equal-sum-subsets) | Medium |
-| <span id="697">697</span> | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/degree-of-an-array) | Easy |
-| <span id="696">696</span> | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-binary-substrings) | Easy |
-| <span id="695">695</span> | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-area-of-island) | Medium |
-| <span id="694">694</span> | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands) | Medium |
-| <span id="693">693</span> | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-number-with-alternating-bits) | Easy |
-| <span id="692">692</span> | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-words) | Medium |
-| <span id="691">691</span> | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/stickers-to-spell-word) | Hard |
-| <span id="690">690</span> | [Employee Importance](https://leetcode.com/problems/employee-importance) | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-importance) | Easy |
-| <span id="689">689</span> | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-3-non-overlapping-subarrays) | Hard |
-| <span id="688">688</span> | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/knight-probability-in-chessboard) | Medium |
-| <span id="687">687</span> | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-univalue-path) | Easy |
-| <span id="686">686</span> | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-string-match) | Easy |
-| <span id="685">685</span> | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii) | Hard |
-| <span id="684">684</span> | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | [Go](https://github.com/openset/leetcode/tree/master/problems/redundant-connection) | Medium |
-| <span id="683">683</span> | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots) | Hard |
-| <span id="682">682</span> | [Baseball Game](https://leetcode.com/problems/baseball-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/baseball-game) | Easy |
-| <span id="681">681</span> | [Next Closest Time](https://leetcode.com/problems/next-closest-time) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/next-closest-time) | Medium |
-| <span id="680">680</span> | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-ii) | Easy |
-| <span id="679">679</span> | [24 Game](https://leetcode.com/problems/24-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/24-game) | Hard |
-| <span id="678">678</span> | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-parenthesis-string) | Medium |
-| <span id="677">677</span> | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/map-sum-pairs) | Medium |
-| <span id="676">676</span> | [Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-magic-dictionary) | Medium |
-| <span id="675">675</span> | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event) | [Go](https://github.com/openset/leetcode/tree/master/problems/cut-off-trees-for-golf-event) | Hard |
-| <span id="674">674</span> | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-continuous-increasing-subsequence) | Easy |
-| <span id="673">673</span> | [Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-longest-increasing-subsequence) | Medium |
-| <span id="672">672</span> | [Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher-ii) | Medium |
-| <span id="671">671</span> | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/second-minimum-node-in-a-binary-tree) | Easy |
-| <span id="670">670</span> | [Maximum Swap](https://leetcode.com/problems/maximum-swap) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-swap) | Medium |
-| <span id="669">669</span> | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/trim-a-binary-search-tree) | Easy |
-| <span id="668">668</span> | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-number-in-multiplication-table) | Hard |
-| <span id="667">667</span> | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement-ii) | Medium |
-| <span id="666">666</span> | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) | Medium |
-| <span id="665">665</span> | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/non-decreasing-array) | Easy |
-| <span id="664">664</span> | [Strange Printer](https://leetcode.com/problems/strange-printer) | [Go](https://github.com/openset/leetcode/tree/master/problems/strange-printer) | Hard |
-| <span id="663">663</span> | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/equal-tree-partition) | Medium |
-| <span id="662">662</span> | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-width-of-binary-tree) | Medium |
-| <span id="661">661</span> | [Image Smoother](https://leetcode.com/problems/image-smoother) | [Go](https://github.com/openset/leetcode/tree/master/problems/image-smoother) | Easy |
-| <span id="660">660</span> | [Remove 9](https://leetcode.com/problems/remove-9) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-9) | Hard |
-| <span id="659">659</span> | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-into-consecutive-subsequences) | Medium |
-| <span id="658">658</span> | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-closest-elements) | Medium |
-| <span id="657">657</span> | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [Go](https://github.com/openset/leetcode/tree/master/problems/robot-return-to-origin) | Easy |
-| <span id="656">656</span> | [Coin Path](https://leetcode.com/problems/coin-path) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-path) | Hard |
-| <span id="655">655</span> | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/print-binary-tree) | Medium |
-| <span id="654">654</span> | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-binary-tree) | Medium |
-| <span id="653">653</span> | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-iv-input-is-a-bst) | Easy |
-| <span id="652">652</span> | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-subtrees) | Medium |
-| <span id="651">651</span> | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard) | Medium |
-| <span id="650">650</span> | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [Go](https://github.com/openset/leetcode/tree/master/problems/2-keys-keyboard) | Medium |
-| <span id="649">649</span> | [Dota2 Senate](https://leetcode.com/problems/dota2-senate) | [Go](https://github.com/openset/leetcode/tree/master/problems/dota2-senate) | Medium |
-| <span id="648">648</span> | [Replace Words](https://leetcode.com/problems/replace-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/replace-words) | Medium |
-| <span id="647">647</span> | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindromic-substrings) | Medium |
-| <span id="646">646</span> | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-pair-chain) | Medium |
-| <span id="645">645</span> | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [Go](https://github.com/openset/leetcode/tree/master/problems/set-mismatch) | Easy |
-| <span id="644">644</span> | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-ii) | Hard |
-| <span id="643">643</span> | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-i) | Easy |
-| <span id="642">642</span> | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-search-autocomplete-system) | Hard |
-| <span id="641">641</span> | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-circular-deque) | Medium |
-| <span id="640">640</span> | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | [Go](https://github.com/openset/leetcode/tree/master/problems/solve-the-equation) | Medium |
-| <span id="639">639</span> | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-ways-ii) | Hard |
-| <span id="638">638</span> | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | [Go](https://github.com/openset/leetcode/tree/master/problems/shopping-offers) | Medium |
-| <span id="637">637</span> | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/average-of-levels-in-binary-tree) | Easy |
-| <span id="636">636</span> | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | [Go](https://github.com/openset/leetcode/tree/master/problems/exclusive-time-of-functions) | Medium |
-| <span id="635">635</span> | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-log-storage-system) | Medium |
-| <span id="634">634</span> | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-derangement-of-an-array) | Medium |
-| <span id="633">633</span> | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-square-numbers) | Easy |
-| <span id="632">632</span> | [Smallest Range](https://leetcode.com/problems/smallest-range) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range) | Hard |
-| <span id="631">631</span> | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-excel-sum-formula) | Hard |
-| <span id="630">630</span> | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule-iii) | Hard |
-| <span id="629">629</span> | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-inverse-pairs-array) | Hard |
-| <span id="628">628</span> | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers) | Easy |
-| <span id="627">627</span> | [Swap Salary](https://leetcode.com/problems/swap-salary) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/swap-salary) | Easy |
-| <span id="626">626</span> | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/exchange-seats) | Medium |
-| <span id="625">625</span> | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization) | Medium |
-| <span id="624">624</span> | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-distance-in-arrays) | Easy |
-| <span id="623">623</span> | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-one-row-to-tree) | Medium |
-| <span id="622">622</span> | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue) | Medium |
-| <span id="621">621</span> | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [Go](https://github.com/openset/leetcode/tree/master/problems/task-scheduler) | Medium |
-| <span id="620">620</span> | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/not-boring-movies) | Easy |
-| <span id="619">619</span> | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/biggest-single-number) | Easy |
-| <span id="618">618</span> | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/students-report-by-geography) | Hard |
-| <span id="617">617</span> | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-two-binary-trees) | Easy |
-| <span id="616">616</span> | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/add-bold-tag-in-string) | Medium |
-| <span id="615">615</span> | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/average-salary-departments-vs-company) | Hard |
-| <span id="614">614</span> | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/second-degree-follower) | Medium |
-| <span id="613">613</span> | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-line) | Easy |
-| <span id="612">612</span> | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-plane) | Medium |
-| <span id="611">611</span> | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-triangle-number) | Medium |
-| <span id="610">610</span> | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/triangle-judgement) | Easy |
-| <span id="609">609</span> | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-file-in-system) | Medium |
-| <span id="608">608</span> | [Tree Node](https://leetcode.com/problems/tree-node) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/tree-node) | Medium |
-| <span id="607">607</span> | [Sales Person](https://leetcode.com/problems/sales-person) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sales-person) | Easy |
-| <span id="606">606</span> | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-string-from-binary-tree) | Easy |
-| <span id="605">605</span> | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [Go](https://github.com/openset/leetcode/tree/master/problems/can-place-flowers) | Easy |
-| <span id="604">604</span> | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-compressed-string-iterator) | Easy |
-| <span id="603">603</span> | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-available-seats) | Easy |
-| <span id="602">602</span> | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-ii-who-has-the-most-friends) | Medium |
-| <span id="601">601</span> | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/human-traffic-of-stadium) | Hard |
-| <span id="600">600</span> | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/problems/non-negative-integers-without-consecutive-ones) | Hard |
-| <span id="599">599</span> | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-index-sum-of-two-lists) | Easy |
-| <span id="598">598</span> | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-addition-ii) | Easy |
-| <span id="597">597</span> | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-i-overall-acceptance-rate) | Easy |
-| <span id="596">596</span> | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/classes-more-than-5-students) | Easy |
-| <span id="595">595</span> | [Big Countries](https://leetcode.com/problems/big-countries) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/big-countries) | Easy |
-| <span id="594">594</span> | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-harmonious-subsequence) | Easy |
-| <span id="593">593</span> | [Valid Square](https://leetcode.com/problems/valid-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-square) | Medium |
-| <span id="592">592</span> | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction) | [Go](https://github.com/openset/leetcode/tree/master/problems/fraction-addition-and-subtraction) | Medium |
-| <span id="591">591</span> | [Tag Validator](https://leetcode.com/problems/tag-validator) | [Go](https://github.com/openset/leetcode/tree/master/problems/tag-validator) | Hard |
-| <span id="590">590</span> | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-postorder-traversal) | Easy |
-| <span id="589">589</span> | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-preorder-traversal) | Easy |
-| <span id="588">588</span> | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system) | Hard |
-| <span id="587">587</span> | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | [Go](https://github.com/openset/leetcode/tree/master/problems/erect-the-fence) | Hard |
-| <span id="586">586</span> | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/customer-placing-the-largest-number-of-orders) | Easy |
-| <span id="585">585</span> | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/investments-in-2016) | Medium |
-| <span id="584">584</span> | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-customer-referee) | Easy |
-| <span id="583">583</span> | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-operation-for-two-strings) | Medium |
-| <span id="582">582</span> | [Kill Process](https://leetcode.com/problems/kill-process) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/kill-process) | Medium |
-| <span id="581">581</span> | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-unsorted-continuous-subarray) | Easy |
-| <span id="580">580</span> | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/count-student-number-in-departments) | Medium |
-| <span id="579">579</span> | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-cumulative-salary-of-an-employee) | Hard |
-| <span id="578">578</span> | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/get-highest-answer-rate-question) | Medium |
-| <span id="577">577</span> | [Employee Bonus](https://leetcode.com/problems/employee-bonus) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-bonus) | Easy |
-| <span id="576">576</span> | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [Go](https://github.com/openset/leetcode/tree/master/problems/out-of-boundary-paths) | Medium |
-| <span id="575">575</span> | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | [Go](https://github.com/openset/leetcode/tree/master/problems/distribute-candies) | Easy |
-| <span id="574">574</span> | [Winning Candidate](https://leetcode.com/problems/winning-candidate) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/winning-candidate) | Medium |
-| <span id="573">573</span> | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/squirrel-simulation) | Medium |
-| <span id="572">572</span> | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/subtree-of-another-tree) | Easy |
-| <span id="571">571</span> | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-median-given-frequency-of-numbers) | Hard |
-| <span id="570">570</span> | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/managers-with-at-least-5-direct-reports) | Medium |
-| <span id="569">569</span> | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/median-employee-salary) | Hard |
-| <span id="568">568</span> | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-vacation-days) | Hard |
-| <span id="567">567</span> | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutation-in-string) | Medium |
-| <span id="566">566</span> | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/reshape-the-matrix) | Easy |
-| <span id="565">565</span> | [Array Nesting](https://leetcode.com/problems/array-nesting) | [Go](https://github.com/openset/leetcode/tree/master/problems/array-nesting) | Medium |
-| <span id="564">564</span> | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-closest-palindrome) | Hard |
-| <span id="563">563</span> | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-tilt) | Easy |
-| <span id="562">562</span> | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-line-of-consecutive-one-in-matrix) | Medium |
-| <span id="561">561</span> | [Array Partition I](https://leetcode.com/problems/array-partition-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/array-partition-i) | Easy |
-| <span id="560">560</span> | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k) | Medium |
-| <span id="559">559</span> | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-n-ary-tree) | Easy |
-| <span id="558">558</span> | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection) | [Go](https://github.com/openset/leetcode/tree/master/problems/quad-tree-intersection) | Easy |
-| <span id="557">557</span> | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-iii) | Easy |
-| <span id="556">556</span> | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-iii) | Medium |
-| <span id="555">555</span> | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-concatenated-strings) | Medium |
-| <span id="554">554</span> | [Brick Wall](https://leetcode.com/problems/brick-wall) | [Go](https://github.com/openset/leetcode/tree/master/problems/brick-wall) | Medium |
-| <span id="553">553</span> | [Optimal Division](https://leetcode.com/problems/optimal-division) | [Go](https://github.com/openset/leetcode/tree/master/problems/optimal-division) | Medium |
-| <span id="552">552</span> | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-ii) | Hard |
-| <span id="551">551</span> | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-i) | Easy |
-| <span id="549">549</span> | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence-ii) | Medium |
-| <span id="548">548</span> | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-with-equal-sum) | Medium |
-| <span id="547">547</span> | [Friend Circles](https://leetcode.com/problems/friend-circles) | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-circles) | Medium |
-| <span id="546">546</span> | [Remove Boxes](https://leetcode.com/problems/remove-boxes) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-boxes) | Hard |
-| <span id="545">545</span> | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/boundary-of-binary-tree) | Medium |
-| <span id="544">544</span> | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/output-contest-matches) | Medium |
-| <span id="543">543</span> | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/diameter-of-binary-tree) | Easy |
-| <span id="542">542</span> | [01 Matrix](https://leetcode.com/problems/01-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/01-matrix) | Medium |
-| <span id="541">541</span> | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-string-ii) | Easy |
-| <span id="540">540</span> | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-element-in-a-sorted-array) | Medium |
-| <span id="539">539</span> | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-time-difference) | Medium |
-| <span id="538">538</span> | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-bst-to-greater-tree) | Easy |
-| <span id="537">537</span> | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | [Go](https://github.com/openset/leetcode/tree/master/problems/complex-number-multiplication) | Medium |
-| <span id="536">536</span> | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-string) | Medium |
-| <span id="535">535</span> | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-tinyurl) | Medium |
-| <span id="533">533</span> | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii) | Medium |
-| <span id="532">532</span> | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-diff-pairs-in-an-array) | Easy |
-| <span id="531">531</span> | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i) | Medium |
-| <span id="530">530</span> | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst) | Easy |
-| <span id="529">529</span> | [Minesweeper](https://leetcode.com/problems/minesweeper) | [Go](https://github.com/openset/leetcode/tree/master/problems/minesweeper) | Medium |
-| <span id="528">528</span> | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-weight) | Medium |
-| <span id="527">527</span> | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation) | Hard |
-| <span id="526">526</span> | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement) | Medium |
-| <span id="525">525</span> | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/contiguous-array) | Medium |
-| <span id="524">524</span> | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary-through-deleting) | Medium |
-| <span id="523">523</span> | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/continuous-subarray-sum) | Medium |
-| <span id="522">522</span> | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-ii) | Medium |
-| <span id="521">521</span> | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-i) | Easy |
-| <span id="520">520</span> | [Detect Capital](https://leetcode.com/problems/detect-capital) | [Go](https://github.com/openset/leetcode/tree/master/problems/detect-capital) | Easy |
-| <span id="519">519</span> | [Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-flip-matrix) | Medium |
-| <span id="518">518</span> | [Coin Change 2](https://leetcode.com/problems/coin-change-2) | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-change-2) | Medium |
-| <span id="517">517</span> | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-washing-machines) | Hard |
-| <span id="516">516</span> | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-subsequence) | Medium |
-| <span id="515">515</span> | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row) | Medium |
-| <span id="514">514</span> | [Freedom Trail](https://leetcode.com/problems/freedom-trail) | [Go](https://github.com/openset/leetcode/tree/master/problems/freedom-trail) | Hard |
-| <span id="513">513</span> | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value) | Medium |
-| <span id="508">508</span> | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/most-frequent-subtree-sum) | Medium |
-| <span id="507">507</span> | [Perfect Number](https://leetcode.com/problems/perfect-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-number) | Easy |
-| <span id="506">506</span> | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | [Go](https://github.com/openset/leetcode/tree/master/problems/relative-ranks) | Easy |
-| <span id="505">505</span> | [The Maze II](https://leetcode.com/problems/the-maze-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii) | Medium |
-| <span id="504">504</span> | [Base 7](https://leetcode.com/problems/base-7) | [Go](https://github.com/openset/leetcode/tree/master/problems/base-7) | Easy |
-| <span id="503">503</span> | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-ii) | Medium |
-| <span id="502">502</span> | [IPO](https://leetcode.com/problems/ipo) | [Go](https://github.com/openset/leetcode/tree/master/problems/ipo) | Hard |
-| <span id="501">501</span> | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-mode-in-binary-search-tree) | Easy |
-| <span id="500">500</span> | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | [Go](https://github.com/openset/leetcode/tree/master/problems/keyboard-row) | Easy |
-| <span id="499">499</span> | [The Maze III](https://leetcode.com/problems/the-maze-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii) | Hard |
-| <span id="498">498</span> | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | [Go](https://github.com/openset/leetcode/tree/master/problems/diagonal-traverse) | Medium |
-| <span id="497">497</span> | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-point-in-non-overlapping-rectangles) | Medium |
-| <span id="496">496</span> | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-i) | Easy |
-| <span id="495">495</span> | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking) | [Go](https://github.com/openset/leetcode/tree/master/problems/teemo-attacking) | Medium |
-| <span id="494">494</span> | [Target Sum](https://leetcode.com/problems/target-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/target-sum) | Medium |
-| <span id="493">493</span> | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | Hard |
-| <span id="492">492</span> | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-the-rectangle) | Easy |
-| <span id="491">491</span> | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-subsequences) | Medium |
-| <span id="490">490</span> | [The Maze](https://leetcode.com/problems/the-maze) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze) | Medium |
-| <span id="489">489</span> | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/robot-room-cleaner) | Hard |
-| <span id="488">488</span> | [Zuma Game](https://leetcode.com/problems/zuma-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/zuma-game) | Hard |
-| <span id="487">487</span> | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-ii) | Medium |
-| <span id="486">486</span> | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | [Go](https://github.com/openset/leetcode/tree/master/problems/predict-the-winner) | Medium |
-| <span id="485">485</span> | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones) | Easy |
-| <span id="484">484</span> | [Find Permutation](https://leetcode.com/problems/find-permutation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-permutation) | Medium |
-| <span id="483">483</span> | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-good-base) | Hard |
-| <span id="482">482</span> | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [Go](https://github.com/openset/leetcode/tree/master/problems/license-key-formatting) | Easy |
-| <span id="481">481</span> | [Magical String](https://leetcode.com/problems/magical-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/magical-string) | Medium |
-| <span id="480">480</span> | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median) | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-window-median) | Hard |
-| <span id="479">479</span> | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-palindrome-product) | Easy |
-| <span id="478">478</span> | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle) | [Go](https://github.com/openset/leetcode/tree/master/problems/generate-random-point-in-a-circle) | Medium |
-| <span id="477">477</span> | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/total-hamming-distance) | Medium |
-| <span id="476">476</span> | [Number Complement](https://leetcode.com/problems/number-complement) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-complement) | Easy |
-| <span id="475">475</span> | [Heaters](https://leetcode.com/problems/heaters) | [Go](https://github.com/openset/leetcode/tree/master/problems/heaters) | Easy |
-| <span id="474">474</span> | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/ones-and-zeroes) | Medium |
-| <span id="473">473</span> | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/matchsticks-to-square) | Medium |
-| <span id="472">472</span> | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/concatenated-words) | Hard |
-| <span id="471">471</span> | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length) | Hard |
-| <span id="470">470</span> | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-rand10-using-rand7) | Medium |
-| <span id="469">469</span> | [Convex Polygon](https://leetcode.com/problems/convex-polygon) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/convex-polygon) | Medium |
-| <span id="468">468</span> | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-ip-address) | Medium |
-| <span id="467">467</span> | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-substrings-in-wraparound-string) | Medium |
-| <span id="466">466</span> | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-the-repetitions) | Hard |
-| <span id="465">465</span> | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/optimal-account-balancing) | Hard |
-| <span id="464">464</span> | [Can I Win](https://leetcode.com/problems/can-i-win) | [Go](https://github.com/openset/leetcode/tree/master/problems/can-i-win) | Medium |
-| <span id="463">463</span> | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | [Go](https://github.com/openset/leetcode/tree/master/problems/island-perimeter) | Easy |
-| <span id="462">462</span> | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements-ii) | Medium |
-| <span id="461">461</span> | [Hamming Distance](https://leetcode.com/problems/hamming-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/hamming-distance) | Easy |
-| <span id="460">460</span> | [LFU Cache](https://leetcode.com/problems/lfu-cache) | [Go](https://github.com/openset/leetcode/tree/master/problems/lfu-cache) | Hard |
-| <span id="459">459</span> | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-substring-pattern) | Easy |
-| <span id="458">458</span> | [Poor Pigs](https://leetcode.com/problems/poor-pigs) | [Go](https://github.com/openset/leetcode/tree/master/problems/poor-pigs) | Easy |
-| <span id="457">457</span> | [Circular Array Loop](https://leetcode.com/problems/circular-array-loop) | [Go](https://github.com/openset/leetcode/tree/master/problems/circular-array-loop) | Medium |
-| <span id="456">456</span> | [132 Pattern](https://leetcode.com/problems/132-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/132-pattern) | Medium |
-| <span id="455">455</span> | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | [Go](https://github.com/openset/leetcode/tree/master/problems/assign-cookies) | Easy |
-| <span id="454">454</span> | [4Sum II](https://leetcode.com/problems/4sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/4sum-ii) | Medium |
-| <span id="453">453</span> | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements) | Easy |
-| <span id="452">452</span> | [Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-arrows-to-burst-balloons) | Medium |
-| <span id="451">451</span> | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-characters-by-frequency) | Medium |
-| <span id="450">450</span> | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-bst) | Medium |
-| <span id="449">449</span> | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-bst) | Medium |
-| <span id="448">448</span> | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-numbers-disappeared-in-an-array) | Easy |
-| <span id="447">447</span> | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-boomerangs) | Easy |
-| <span id="446">446</span> | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices-ii-subsequence) | Hard |
-| <span id="445">445</span> | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers-ii) | Medium |
-| <span id="444">444</span> | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sequence-reconstruction) | Medium |
-| <span id="443">443</span> | [String Compression](https://leetcode.com/problems/string-compression) | [Go](https://github.com/openset/leetcode/tree/master/problems/string-compression) | Easy |
-| <span id="442">442</span> | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-duplicates-in-an-array) | Medium |
-| <span id="441">441</span> | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | [Go](https://github.com/openset/leetcode/tree/master/problems/arranging-coins) | Easy |
-| <span id="440">440</span> | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order) | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-in-lexicographical-order) | Hard |
-| <span id="439">439</span> | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser) | Medium |
-| <span id="438">438</span> | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-anagrams-in-a-string) | Easy |
-| <span id="437">437</span> | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-iii) | Easy |
-| <span id="436">436</span> | [Find Right Interval](https://leetcode.com/problems/find-right-interval) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-right-interval) | Medium |
-| <span id="435">435</span> | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/non-overlapping-intervals) | Medium |
-| <span id="434">434</span> | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-segments-in-a-string) | Easy |
-| <span id="433">433</span> | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-genetic-mutation) | Medium |
-| <span id="432">432</span> | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure) | [Go](https://github.com/openset/leetcode/tree/master/problems/all-oone-data-structure) | Hard |
-| <span id="431">431</span> | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-n-ary-tree-to-binary-tree) | Hard |
-| <span id="430">430</span> | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-a-multilevel-doubly-linked-list) | Medium |
-| <span id="429">429</span> | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-level-order-traversal) | Easy |
-| <span id="428">428</span> | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree) | Hard |
-| <span id="427">427</span> | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-quad-tree) | Easy |
-| <span id="426">426</span> | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
-| <span id="425">425</span> | [Word Squares](https://leetcode.com/problems/word-squares) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-squares) | Hard |
-| <span id="424">424</span> | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-character-replacement) | Medium |
-| <span id="423">423</span> | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english) | [Go](https://github.com/openset/leetcode/tree/master/problems/reconstruct-original-digits-from-english) | Medium |
-| <span id="422">422</span> | [Valid Word Square](https://leetcode.com/problems/valid-word-square) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-word-square) | Easy |
-| <span id="421">421</span> | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-xor-of-two-numbers-in-an-array) | Medium |
-| <span id="420">420</span> | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker) | [Go](https://github.com/openset/leetcode/tree/master/problems/strong-password-checker) | Hard |
-| <span id="419">419</span> | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | [Go](https://github.com/openset/leetcode/tree/master/problems/battleships-in-a-board) | Medium |
-| <span id="418">418</span> | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-screen-fitting) | Medium |
-| <span id="417">417</span> | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [Go](https://github.com/openset/leetcode/tree/master/problems/pacific-atlantic-water-flow) | Medium |
-| <span id="416">416</span> | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-equal-subset-sum) | Medium |
-| <span id="415">415</span> | [Add Strings](https://leetcode.com/problems/add-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-strings) | Easy |
-| <span id="414">414</span> | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/third-maximum-number) | Easy |
-| <span id="413">413</span> | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | [Go](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices) | Medium |
-| <span id="412">412</span> | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [Go](https://github.com/openset/leetcode/tree/master/problems/fizz-buzz) | Easy |
-| <span id="411">411</span> | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-unique-word-abbreviation) | Hard |
-| <span id="410">410</span> | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-largest-sum) | Hard |
-| <span id="409">409</span> | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindrome) | Easy |
-| <span id="408">408</span> | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-word-abbreviation) | Easy |
-| <span id="407">407</span> | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water-ii) | Hard |
-| <span id="406">406</span> | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | [Go](https://github.com/openset/leetcode/tree/master/problems/queue-reconstruction-by-height) | Medium |
-| <span id="405">405</span> | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-a-number-to-hexadecimal) | Easy |
-| <span id="404">404</span> | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-left-leaves) | Easy |
-| <span id="403">403</span> | [Frog Jump](https://leetcode.com/problems/frog-jump) | [Go](https://github.com/openset/leetcode/tree/master/problems/frog-jump) | Hard |
-| <span id="402">402</span> | [Remove K Digits](https://leetcode.com/problems/remove-k-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-k-digits) | Medium |
-| <span id="401">401</span> | [Binary Watch](https://leetcode.com/problems/binary-watch) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-watch) | Easy |
-| <span id="400">400</span> | [Nth Digit](https://leetcode.com/problems/nth-digit) | [Go](https://github.com/openset/leetcode/tree/master/problems/nth-digit) | Easy |
-| <span id="399">399</span> | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | [Go](https://github.com/openset/leetcode/tree/master/problems/evaluate-division) | Medium |
-| <span id="398">398</span> | [Random Pick Index](https://leetcode.com/problems/random-pick-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-index) | Medium |
-| <span id="397">397</span> | [Integer Replacement](https://leetcode.com/problems/integer-replacement) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-replacement) | Medium |
-| <span id="396">396</span> | [Rotate Function](https://leetcode.com/problems/rotate-function) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-function) | Medium |
-| <span id="395">395</span> | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-least-k-repeating-characters) | Medium |
-| <span id="394">394</span> | [Decode String](https://leetcode.com/problems/decode-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-string) | Medium |
-| <span id="393">393</span> | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation) | [Go](https://github.com/openset/leetcode/tree/master/problems/utf-8-validation) | Medium |
-| <span id="392">392</span> | [Is Subsequence](https://leetcode.com/problems/is-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/is-subsequence) | Medium |
-| <span id="391">391</span> | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-rectangle) | Hard |
-| <span id="390">390</span> | [Elimination Game](https://leetcode.com/problems/elimination-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/elimination-game) | Medium |
-| <span id="389">389</span> | [Find the Difference](https://leetcode.com/problems/find-the-difference) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-difference) | Easy |
-| <span id="388">388</span> | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-absolute-file-path) | Medium |
-| <span id="387">387</span> | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/first-unique-character-in-a-string) | Easy |
-| <span id="386">386</span> | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/lexicographical-numbers) | Medium |
-| <span id="385">385</span> | [Mini Parser](https://leetcode.com/problems/mini-parser) | [Go](https://github.com/openset/leetcode/tree/master/problems/mini-parser) | Medium |
-| <span id="384">384</span> | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/shuffle-an-array) | Medium |
-| <span id="383">383</span> | [Ransom Note](https://leetcode.com/problems/ransom-note) | [Go](https://github.com/openset/leetcode/tree/master/problems/ransom-note) | Easy |
-| <span id="382">382</span> | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-random-node) | Medium |
-| <span id="381">381</span> | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1-duplicates-allowed) | Hard |
-| <span id="380">380</span> | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1) | Medium |
-| <span id="379">379</span> | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-phone-directory) | Medium |
-| <span id="378">378</span> | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-sorted-matrix) | Medium |
-| <span id="377">377</span> | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iv) | Medium |
-| <span id="376">376</span> | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-subsequence) | Medium |
-| <span id="375">375</span> | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower-ii) | Medium |
-| <span id="374">374</span> | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | [Go](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower) | Easy |
-| <span id="373">373</span> | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-pairs-with-smallest-sums) | Medium |
-| <span id="372">372</span> | [Super Pow](https://leetcode.com/problems/super-pow) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-pow) | Medium |
-| <span id="371">371</span> | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-two-integers) | Easy |
-| <span id="370">370</span> | [Range Addition](https://leetcode.com/problems/range-addition) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/range-addition) | Medium |
-| <span id="369">369</span> | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/plus-one-linked-list) | Medium |
-| <span id="368">368</span> | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-divisible-subset) | Medium |
-| <span id="367">367</span> | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-perfect-square) | Easy |
-| <span id="366">366</span> | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-leaves-of-binary-tree) | Medium |
-| <span id="365">365</span> | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem) | [Go](https://github.com/openset/leetcode/tree/master/problems/water-and-jug-problem) | Medium |
-| <span id="364">364</span> | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum-ii) | Medium |
-| <span id="363">363</span> | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-sum-of-rectangle-no-larger-than-k) | Hard |
-| <span id="362">362</span> | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hit-counter) | Medium |
-| <span id="361">361</span> | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/bomb-enemy) | Medium |
-| <span id="360">360</span> | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-transformed-array) | Medium |
-| <span id="359">359</span> | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/logger-rate-limiter) | Easy |
-| <span id="358">358</span> | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart) | Hard |
-| <span id="357">357</span> | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-numbers-with-unique-digits) | Medium |
-| <span id="356">356</span> | [Line Reflection](https://leetcode.com/problems/line-reflection) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/line-reflection) | Medium |
-| <span id="355">355</span> | [Design Twitter](https://leetcode.com/problems/design-twitter) | [Go](https://github.com/openset/leetcode/tree/master/problems/design-twitter) | Medium |
-| <span id="354">354</span> | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | [Go](https://github.com/openset/leetcode/tree/master/problems/russian-doll-envelopes) | Hard |
-| <span id="353">353</span> | [Design Snake Game](https://leetcode.com/problems/design-snake-game) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-snake-game) | Medium |
-| <span id="352">352</span> | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals) | Hard |
-| <span id="351">351</span> | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns) | Medium |
-| <span id="350">350</span> | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii) | Easy |
-| <span id="349">349</span> | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays) | Easy |
-| <span id="348">348</span> | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-tic-tac-toe) | Medium |
-| <span id="347">347</span> | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements) | Medium |
-| <span id="346">346</span> | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/moving-average-from-data-stream) | Easy |
-| <span id="345">345</span> | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-vowels-of-a-string) | Easy |
-| <span id="344">344</span> | [Reverse String](https://leetcode.com/problems/reverse-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-string) | Easy |
-| <span id="343">343</span> | [Integer Break](https://leetcode.com/problems/integer-break) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-break) | Medium |
-| <span id="342">342</span> | [Power of Four](https://leetcode.com/problems/power-of-four) | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-four) | Easy |
-| <span id="341">341</span> | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator) | Medium |
-| <span id="340">340</span> | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters) | Hard |
-| <span id="339">339</span> | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum) | Easy |
-| <span id="338">338</span> | [Counting Bits](https://leetcode.com/problems/counting-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/counting-bits) | Medium |
-| <span id="337">337</span> | [House Robber III](https://leetcode.com/problems/house-robber-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber-iii) | Medium |
-| <span id="336">336</span> | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-pairs) | Hard |
-| <span id="335">335</span> | [Self Crossing](https://leetcode.com/problems/self-crossing) | [Go](https://github.com/openset/leetcode/tree/master/problems/self-crossing) | Hard |
-| <span id="334">334</span> | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-triplet-subsequence) | Medium |
-| <span id="333">333</span> | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-bst-subtree) | Medium |
-| <span id="332">332</span> | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | [Go](https://github.com/openset/leetcode/tree/master/problems/reconstruct-itinerary) | Medium |
-| <span id="331">331</span> | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-serialization-of-a-binary-tree) | Medium |
-| <span id="330">330</span> | [Patching Array](https://leetcode.com/problems/patching-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/patching-array) | Hard |
-| <span id="329">329</span> | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-path-in-a-matrix) | Hard |
-| <span id="328">328</span> | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/odd-even-linked-list) | Medium |
-| <span id="327">327</span> | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) | Hard |
-| <span id="326">326</span> | [Power of Three](https://leetcode.com/problems/power-of-three) | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-three) | Easy |
-| <span id="325">325</span> | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-size-subarray-sum-equals-k) | Medium |
-| <span id="324">324</span> | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort-ii) | Medium |
-| <span id="323">323</span> | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) | Medium |
-| <span id="322">322</span> | [Coin Change](https://leetcode.com/problems/coin-change) | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-change) | Medium |
-| <span id="321">321</span> | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/create-maximum-number) | Hard |
-| <span id="320">320</span> | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) | Medium |
-| <span id="319">319</span> | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [Go](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher) | Medium |
-| <span id="318">318</span> | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-word-lengths) | Medium |
-| <span id="317">317</span> | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) | Hard |
-| <span id="316">316</span> | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicate-letters) | Hard |
-| <span id="315">315</span> | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | Hard |
-| <span id="314">314</span> | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal) | Medium |
-| <span id="313">313</span> | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/super-ugly-number) | Medium |
-| <span id="312">312</span> | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | [Go](https://github.com/openset/leetcode/tree/master/problems/burst-balloons) | Hard |
-| <span id="311">311</span> | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sparse-matrix-multiplication) | Medium |
-| <span id="310">310</span> | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees) | Medium |
-| <span id="309">309</span> | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
-| <span id="308">308</span> | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) | Hard |
-| <span id="307">307</span> | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable) | Medium |
-| <span id="306">306</span> | [Additive Number](https://leetcode.com/problems/additive-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/additive-number) | Medium |
-| <span id="305">305</span> | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-islands-ii) | Hard |
-| <span id="304">304</span> | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-immutable) | Medium |
-| <span id="303">303</span> | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable) | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-immutable) | Easy |
-| <span id="302">302</span> | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-rectangle-enclosing-black-pixels) | Hard |
-| <span id="301">301</span> | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-invalid-parentheses) | Hard |
-| <span id="300">300</span> | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence) | Medium |
-| <span id="299">299</span> | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | [Go](https://github.com/openset/leetcode/tree/master/problems/bulls-and-cows) | Medium |
-| <span id="298">298</span> | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence) | Medium |
-| <span id="297">297</span> | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-binary-tree) | Hard |
-| <span id="296">296</span> | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/best-meeting-point) | Hard |
-| <span id="295">295</span> | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-median-from-data-stream) | Hard |
-| <span id="294">294</span> | [Flip Game II](https://leetcode.com/problems/flip-game-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii) | Medium |
-| <span id="293">293</span> | [Flip Game](https://leetcode.com/problems/flip-game) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-game) | Easy |
-| <span id="292">292</span> | [Nim Game](https://leetcode.com/problems/nim-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/nim-game) | Easy |
-| <span id="291">291</span> | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-pattern-ii) | Hard |
-| <span id="290">290</span> | [Word Pattern](https://leetcode.com/problems/word-pattern) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-pattern) | Easy |
-| <span id="289">289</span> | [Game of Life](https://leetcode.com/problems/game-of-life) | [Go](https://github.com/openset/leetcode/tree/master/problems/game-of-life) | Medium |
-| <span id="288">288</span> | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-word-abbreviation) | Medium |
-| <span id="287">287</span> | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number) | Medium |
-| <span id="286">286</span> | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates) | Medium |
-| <span id="285">285</span> | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst) | Medium |
-| <span id="284">284</span> | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/peeking-iterator) | Medium |
-| <span id="283">283</span> | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/move-zeroes) | Easy |
-| <span id="282">282</span> | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | [Go](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators) | Hard |
-| <span id="281">281</span> | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/zigzag-iterator) | Medium |
-| <span id="280">280</span> | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort) | Medium |
-| <span id="279">279</span> | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-squares) | Medium |
-| <span id="278">278</span> | [First Bad Version](https://leetcode.com/problems/first-bad-version) | [Go](https://github.com/openset/leetcode/tree/master/problems/first-bad-version) | Easy |
-| <span id="277">277</span> | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-celebrity) | Medium |
-| <span id="276">276</span> | [Paint Fence](https://leetcode.com/problems/paint-fence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-fence) | Easy |
-| <span id="275">275</span> | [H-Index II](https://leetcode.com/problems/h-index-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/h-index-ii) | Medium |
-| <span id="274">274</span> | [H-Index](https://leetcode.com/problems/h-index) | [Go](https://github.com/openset/leetcode/tree/master/problems/h-index) | Medium |
-| <span id="273">273</span> | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-to-english-words) | Hard |
-| <span id="272">272</span> | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value-ii) | Hard |
-| <span id="271">271</span> | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-strings) | Medium |
-| <span id="270">270</span> | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value) | Easy |
-| <span id="269">269</span> | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/alien-dictionary) | Hard |
-| <span id="268">268</span> | [Missing Number](https://leetcode.com/problems/missing-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/missing-number) | Easy |
-| <span id="267">267</span> | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation-ii) | Medium |
-| <span id="266">266</span> | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation) | Easy |
-| <span id="265">265</span> | [Paint House II](https://leetcode.com/problems/paint-house-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii) | Hard |
-| <span id="264">264</span> | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii) | Medium |
-| <span id="263">263</span> | [Ugly Number](https://leetcode.com/problems/ugly-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/ugly-number) | Easy |
-| <span id="262">262</span> | [Trips and Users](https://leetcode.com/problems/trips-and-users) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/trips-and-users) | Hard |
-| <span id="261">261</span> | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree) | Medium |
-| <span id="260">260</span> | [Single Number III](https://leetcode.com/problems/single-number-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number-iii) | Medium |
-| <span id="259">259</span> | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) | Medium |
-| <span id="258">258</span> | [Add Digits](https://leetcode.com/problems/add-digits) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-digits) | Easy |
-| <span id="257">257</span> | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-paths) | Easy |
-| <span id="256">256</span> | [Paint House](https://leetcode.com/problems/paint-house) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-house) | Easy |
-| <span id="255">255</span> | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-sequence-in-binary-search-tree) | Medium |
-| <span id="254">254</span> | [Factor Combinations](https://leetcode.com/problems/factor-combinations) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/factor-combinations) | Medium |
-| <span id="253">253</span> | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii) | Medium |
-| <span id="252">252</span> | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms) | Easy |
-| <span id="251">251</span> | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector) | Medium |
-| <span id="250">250</span> | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/count-univalue-subtrees) | Medium |
-| <span id="249">249</span> | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/group-shifted-strings) | Medium |
-| <span id="248">248</span> | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-iii) | Hard |
-| <span id="247">247</span> | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-ii) | Medium |
-| <span id="246">246</span> | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number) | Easy |
-| <span id="245">245</span> | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-iii) | Medium |
-| <span id="244">244</span> | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-ii) | Medium |
-| <span id="243">243</span> | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance) | Easy |
-| <span id="242">242</span> | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-anagram) | Easy |
-| <span id="241">241</span> | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/different-ways-to-add-parentheses) | Medium |
-| <span id="240">240</span> | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix-ii) | Medium |
-| <span id="239">239</span> | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-window-maximum) | Hard |
-| <span id="238">238</span> | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | [Go](https://github.com/openset/leetcode/tree/master/problems/product-of-array-except-self) | Medium |
-| <span id="237">237</span> | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-linked-list) | Easy |
-| <span id="236">236</span> | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-tree) | Medium |
-| <span id="235">235</span> | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-search-tree) | Easy |
-| <span id="234">234</span> | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-linked-list) | Easy |
-| <span id="233">233</span> | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-digit-one) | Hard |
-| <span id="232">232</span> | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-queue-using-stacks) | Easy |
-| <span id="231">231</span> | [Power of Two](https://leetcode.com/problems/power-of-two) | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-two) | Easy |
-| <span id="230">230</span> | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-bst) | Medium |
-| <span id="229">229</span> | [Majority Element II](https://leetcode.com/problems/majority-element-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/majority-element-ii) | Medium |
-| <span id="228">228</span> | [Summary Ranges](https://leetcode.com/problems/summary-ranges) | [Go](https://github.com/openset/leetcode/tree/master/problems/summary-ranges) | Medium |
-| <span id="227">227</span> | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-ii) | Medium |
-| <span id="226">226</span> | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/invert-binary-tree) | Easy |
-| <span id="225">225</span> | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-stack-using-queues) | Easy |
-| <span id="224">224</span> | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator) | Hard |
-| <span id="223">223</span> | [Rectangle Area](https://leetcode.com/problems/rectangle-area) | [Go](https://github.com/openset/leetcode/tree/master/problems/rectangle-area) | Medium |
-| <span id="222">222</span> | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-complete-tree-nodes) | Medium |
-| <span id="221">221</span> | [Maximal Square](https://leetcode.com/problems/maximal-square) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximal-square) | Medium |
-| <span id="220">220</span> | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii) | Medium |
-| <span id="219">219</span> | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-ii) | Easy |
-| <span id="218">218</span> | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | [Go](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem) | Hard |
-| <span id="217">217</span> | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [Go](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate) | Easy |
-| <span id="216">216</span> | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iii) | Medium |
-| <span id="215">215</span> | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-an-array) | Medium |
-| <span id="214">214</span> | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-palindrome) | Hard |
-| <span id="213">213</span> | [House Robber II](https://leetcode.com/problems/house-robber-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber-ii) | Medium |
-| <span id="212">212</span> | [Word Search II](https://leetcode.com/problems/word-search-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-search-ii) | Hard |
-| <span id="211">211</span> | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-and-search-word-data-structure-design) | Medium |
-| <span id="210">210</span> | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii) | Medium |
-| <span id="209">209</span> | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-size-subarray-sum) | Medium |
-| <span id="208">208</span> | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree) | Medium |
-| <span id="207">207</span> | [Course Schedule](https://leetcode.com/problems/course-schedule) | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule) | Medium |
-| <span id="206">206</span> | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list) | Easy |
-| <span id="205">205</span> | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/isomorphic-strings) | Easy |
-| <span id="204">204</span> | [Count Primes](https://leetcode.com/problems/count-primes) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-primes) | Easy |
-| <span id="203">203</span> | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-linked-list-elements) | Easy |
-| <span id="202">202</span> | [Happy Number](https://leetcode.com/problems/happy-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/happy-number) | Easy |
-| <span id="201">201</span> | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | [Go](https://github.com/openset/leetcode/tree/master/problems/bitwise-and-of-numbers-range) | Medium |
-| <span id="200">200</span> | [Number of Islands](https://leetcode.com/problems/number-of-islands) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-islands) | Medium |
-| <span id="199">199</span> | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-right-side-view) | Medium |
-| <span id="198">198</span> | [House Robber](https://leetcode.com/problems/house-robber) | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber) | Easy |
-| <span id="197">197</span> | [Rising Temperature](https://leetcode.com/problems/rising-temperature) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/rising-temperature) | Easy |
-| <span id="196">196</span> | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/delete-duplicate-emails) | Easy |
-| <span id="195">195</span> | [Tenth Line](https://leetcode.com/problems/tenth-line) | [Bash](https://github.com/openset/leetcode/tree/master/problems/tenth-line) | Easy |
-| <span id="194">194</span> | [Transpose File](https://leetcode.com/problems/transpose-file) | [Bash](https://github.com/openset/leetcode/tree/master/problems/transpose-file) | Medium |
-| <span id="193">193</span> | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Bash](https://github.com/openset/leetcode/tree/master/problems/valid-phone-numbers) | Easy |
-| <span id="192">192</span> | [Word Frequency](https://leetcode.com/problems/word-frequency) | [Bash](https://github.com/openset/leetcode/tree/master/problems/word-frequency) | Medium |
-| <span id="191">191</span> | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits) | Easy |
-| <span id="190">190</span> | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-bits) | Easy |
-| <span id="189">189</span> | [Rotate Array](https://leetcode.com/problems/rotate-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-array) | Easy |
-| <span id="188">188</span> | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv) | Hard |
-| <span id="187">187</span> | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-dna-sequences) | Medium |
-| <span id="186">186</span> | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-ii) | Medium |
-| <span id="185">185</span> | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/department-top-three-salaries) | Hard |
-| <span id="184">184</span> | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/department-highest-salary) | Medium |
-| <span id="183">183</span> | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/customers-who-never-order) | Easy |
-| <span id="182">182</span> | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/duplicate-emails) | Easy |
-| <span id="181">181</span> | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/employees-earning-more-than-their-managers) | Easy |
-| <span id="180">180</span> | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers) | Medium |
-| <span id="179">179</span> | [Largest Number](https://leetcode.com/problems/largest-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-number) | Medium |
-| <span id="178">178</span> | [Rank Scores](https://leetcode.com/problems/rank-scores) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/rank-scores) | Medium |
-| <span id="177">177</span> | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/nth-highest-salary) | Medium |
-| <span id="176">176</span> | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/second-highest-salary) | Easy |
-| <span id="175">175</span> | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/combine-two-tables) | Easy |
-| <span id="174">174</span> | [Dungeon Game](https://leetcode.com/problems/dungeon-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/dungeon-game) | Hard |
-| <span id="173">173</span> | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator) | Medium |
-| <span id="172">172</span> | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/factorial-trailing-zeroes) | Easy |
-| <span id="171">171</span> | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-number) | Easy |
-| <span id="170">170</span> | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-iii-data-structure-design) | Easy |
-| <span id="169">169</span> | [Majority Element](https://leetcode.com/problems/majority-element) | [Go](https://github.com/openset/leetcode/tree/master/problems/majority-element) | Easy |
-| <span id="168">168</span> | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [Go](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-title) | Easy |
-| <span id="167">167</span> | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-ii-input-array-is-sorted) | Easy |
-| <span id="166">166</span> | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [Go](https://github.com/openset/leetcode/tree/master/problems/fraction-to-recurring-decimal) | Medium |
-| <span id="165">165</span> | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/compare-version-numbers) | Medium |
-| <span id="164">164</span> | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-gap) | Hard |
-| <span id="163">163</span> | [Missing Ranges](https://leetcode.com/problems/missing-ranges) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/missing-ranges) | Medium |
-| <span id="162">162</span> | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-peak-element) | Medium |
-| <span id="161">161</span> | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/one-edit-distance) | Medium |
-| <span id="160">160</span> | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-linked-lists) | Easy |
-| <span id="159">159</span> | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters) | Hard |
-| <span id="158">158</span> | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4-ii-call-multiple-times) | Hard |
-| <span id="157">157</span> | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4) | Easy |
-| <span id="156">156</span> | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-upside-down) | Medium |
-| <span id="155">155</span> | [Min Stack](https://leetcode.com/problems/min-stack) | [Go](https://github.com/openset/leetcode/tree/master/problems/min-stack) | Easy |
-| <span id="154">154</span> | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array-ii) | Hard |
-| <span id="153">153</span> | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array) | Medium |
-| <span id="152">152</span> | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-subarray) | Medium |
-| <span id="151">151</span> | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string) | Medium |
-| <span id="150">150</span> | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | [Go](https://github.com/openset/leetcode/tree/master/problems/evaluate-reverse-polish-notation) | Medium |
-| <span id="149">149</span> | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | [Go](https://github.com/openset/leetcode/tree/master/problems/max-points-on-a-line) | Hard |
-| <span id="148">148</span> | [Sort List](https://leetcode.com/problems/sort-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-list) | Medium |
-| <span id="147">147</span> | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/insertion-sort-list) | Medium |
-| <span id="146">146</span> | [LRU Cache](https://leetcode.com/problems/lru-cache) | [Go](https://github.com/openset/leetcode/tree/master/problems/lru-cache) | Hard |
-| <span id="145">145</span> | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-postorder-traversal) | Hard |
-| <span id="144">144</span> | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-preorder-traversal) | Medium |
-| <span id="143">143</span> | [Reorder List](https://leetcode.com/problems/reorder-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/reorder-list) | Medium |
-| <span id="142">142</span> | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle-ii) | Medium |
-| <span id="141">141</span> | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle) | Easy |
-| <span id="140">140</span> | [Word Break II](https://leetcode.com/problems/word-break-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-break-ii) | Hard |
-| <span id="139">139</span> | [Word Break](https://leetcode.com/problems/word-break) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-break) | Medium |
-| <span id="138">138</span> | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | [Go](https://github.com/openset/leetcode/tree/master/problems/copy-list-with-random-pointer) | Medium |
-| <span id="137">137</span> | [Single Number II](https://leetcode.com/problems/single-number-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number-ii) | Medium |
-| <span id="136">136</span> | [Single Number](https://leetcode.com/problems/single-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number) | Easy |
-| <span id="135">135</span> | [Candy](https://leetcode.com/problems/candy) | [Go](https://github.com/openset/leetcode/tree/master/problems/candy) | Hard |
-| <span id="134">134</span> | [Gas Station](https://leetcode.com/problems/gas-station) | [Go](https://github.com/openset/leetcode/tree/master/problems/gas-station) | Medium |
-| <span id="133">133</span> | [Clone Graph](https://leetcode.com/problems/clone-graph) | [Go](https://github.com/openset/leetcode/tree/master/problems/clone-graph) | Medium |
-| <span id="132">132</span> | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning-ii) | Hard |
-| <span id="131">131</span> | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning) | Medium |
-| <span id="130">130</span> | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions) | [Go](https://github.com/openset/leetcode/tree/master/problems/surrounded-regions) | Medium |
-| <span id="129">129</span> | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-root-to-leaf-numbers) | Medium |
-| <span id="128">128</span> | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-consecutive-sequence) | Hard |
-| <span id="127">127</span> | [Word Ladder](https://leetcode.com/problems/word-ladder) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-ladder) | Medium |
-| <span id="126">126</span> | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-ladder-ii) | Hard |
-| <span id="125">125</span> | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome) | Easy |
-| <span id="124">124</span> | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-maximum-path-sum) | Hard |
-| <span id="123">123</span> | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii) | Hard |
-| <span id="122">122</span> | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) | Easy |
-| <span id="121">121</span> | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) | Easy |
-| <span id="120">120</span> | [Triangle](https://leetcode.com/problems/triangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/triangle) | Medium |
-| <span id="119">119</span> | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle-ii) | Easy |
-| <span id="118">118</span> | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle) | Easy |
-| <span id="117">117</span> | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node-ii) | Medium |
-| <span id="116">116</span> | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | [Go](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node) | Medium |
-| <span id="115">115</span> | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences) | [Go](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences) | Hard |
-| <span id="114">114</span> | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-binary-tree-to-linked-list) | Medium |
-| <span id="113">113</span> | [Path Sum II](https://leetcode.com/problems/path-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-ii) | Medium |
-| <span id="112">112</span> | [Path Sum](https://leetcode.com/problems/path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum) | Easy |
-| <span id="111">111</span> | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-depth-of-binary-tree) | Easy |
-| <span id="110">110</span> | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/balanced-binary-tree) | Easy |
-| <span id="109">109</span> | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-list-to-binary-search-tree) | Medium |
-| <span id="108">108</span> | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-array-to-binary-search-tree) | Easy |
-| <span id="107">107</span> | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal-ii) | Easy |
-| <span id="106">106</span> | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | Medium |
-| <span id="105">105</span> | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium |
-| <span id="104">104</span> | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-binary-tree) | Easy |
-| <span id="103">103</span> | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-zigzag-level-order-traversal) | Medium |
-| <span id="102">102</span> | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal) | Medium |
-| <span id="101">101</span> | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/symmetric-tree) | Easy |
-| <span id="100">100</span> | [Same Tree](https://leetcode.com/problems/same-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/same-tree) | Easy |
-| <span id="99">99</span> | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/recover-binary-search-tree) | Hard |
-| <span id="98">98</span> | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-binary-search-tree) | Medium |
-| <span id="97">97</span> | [Interleaving String](https://leetcode.com/problems/interleaving-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/interleaving-string) | Hard |
-| <span id="96">96</span> | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees) | Medium |
-| <span id="95">95</span> | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees-ii) | Medium |
-| <span id="94">94</span> | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) | Medium |
-| <span id="93">93</span> | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | [Go](https://github.com/openset/leetcode/tree/master/problems/restore-ip-addresses) | Medium |
-| <span id="92">92</span> | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list-ii) | Medium |
-| <span id="91">91</span> | [Decode Ways](https://leetcode.com/problems/decode-ways) | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-ways) | Medium |
-| <span id="90">90</span> | [Subsets II](https://leetcode.com/problems/subsets-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/subsets-ii) | Medium |
-| <span id="89">89</span> | [Gray Code](https://leetcode.com/problems/gray-code) | [Go](https://github.com/openset/leetcode/tree/master/problems/gray-code) | Medium |
-| <span id="88">88</span> | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-sorted-array) | Easy |
-| <span id="87">87</span> | [Scramble String](https://leetcode.com/problems/scramble-string) | [Go](https://github.com/openset/leetcode/tree/master/problems/scramble-string) | Hard |
-| <span id="86">86</span> | [Partition List](https://leetcode.com/problems/partition-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-list) | Medium |
-| <span id="85">85</span> | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximal-rectangle) | Hard |
-| <span id="84">84</span> | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-rectangle-in-histogram) | Hard |
-| <span id="83">83</span> | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list) | Easy |
-| <span id="82">82</span> | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list-ii) | Medium |
-| <span id="81">81</span> | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array-ii) | Medium |
-| <span id="80">80</span> | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array-ii) | Medium |
-| <span id="79">79</span> | [Word Search](https://leetcode.com/problems/word-search) | [Go](https://github.com/openset/leetcode/tree/master/problems/word-search) | Medium |
-| <span id="78">78</span> | [Subsets](https://leetcode.com/problems/subsets) | [Go](https://github.com/openset/leetcode/tree/master/problems/subsets) | Medium |
-| <span id="77">77</span> | [Combinations](https://leetcode.com/problems/combinations) | [Go](https://github.com/openset/leetcode/tree/master/problems/combinations) | Medium |
-| <span id="76">76</span> | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring) | Hard |
-| <span id="75">75</span> | [Sort Colors](https://leetcode.com/problems/sort-colors) | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-colors) | Medium |
-| <span id="74">74</span> | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix) | Medium |
-| <span id="73">73</span> | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | [Go](https://github.com/openset/leetcode/tree/master/problems/set-matrix-zeroes) | Medium |
-| <span id="72">72</span> | [Edit Distance](https://leetcode.com/problems/edit-distance) | [Go](https://github.com/openset/leetcode/tree/master/problems/edit-distance) | Hard |
-| <span id="71">71</span> | [Simplify Path](https://leetcode.com/problems/simplify-path) | [Go](https://github.com/openset/leetcode/tree/master/problems/simplify-path) | Medium |
-| <span id="70">70</span> | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/climbing-stairs) | Easy |
-| <span id="69">69</span> | [Sqrt(x)](https://leetcode.com/problems/sqrtx) | [Go](https://github.com/openset/leetcode/tree/master/problems/sqrtx) | Easy |
-| <span id="68">68</span> | [Text Justification](https://leetcode.com/problems/text-justification) | [Go](https://github.com/openset/leetcode/tree/master/problems/text-justification) | Hard |
-| <span id="67">67</span> | [Add Binary](https://leetcode.com/problems/add-binary) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-binary) | Easy |
-| <span id="66">66</span> | [Plus One](https://leetcode.com/problems/plus-one) | [Go](https://github.com/openset/leetcode/tree/master/problems/plus-one) | Easy |
-| <span id="65">65</span> | [Valid Number](https://leetcode.com/problems/valid-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-number) | Hard |
-| <span id="64">64</span> | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-path-sum) | Medium |
-| <span id="63">63</span> | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-paths-ii) | Medium |
-| <span id="62">62</span> | [Unique Paths](https://leetcode.com/problems/unique-paths) | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-paths) | Medium |
-| <span id="61">61</span> | [Rotate List](https://leetcode.com/problems/rotate-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-list) | Medium |
-| <span id="60">60</span> | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutation-sequence) | Medium |
-| <span id="59">59</span> | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-ii) | Medium |
-| <span id="58">58</span> | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [Go](https://github.com/openset/leetcode/tree/master/problems/length-of-last-word) | Easy |
-| <span id="57">57</span> | [Insert Interval](https://leetcode.com/problems/insert-interval) | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-interval) | Hard |
-| <span id="56">56</span> | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) | Medium |
-| <span id="55">55</span> | [Jump Game](https://leetcode.com/problems/jump-game) | [Go](https://github.com/openset/leetcode/tree/master/problems/jump-game) | Medium |
-| <span id="54">54</span> | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | [Go](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix) | Medium |
-| <span id="53">53</span> | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray) | Easy |
-| <span id="52">52</span> | [N-Queens II](https://leetcode.com/problems/n-queens-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-queens-ii) | Hard |
-| <span id="51">51</span> | [N-Queens](https://leetcode.com/problems/n-queens) | [Go](https://github.com/openset/leetcode/tree/master/problems/n-queens) | Hard |
-| <span id="50">50</span> | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [Go](https://github.com/openset/leetcode/tree/master/problems/powx-n) | Medium |
-| <span id="49">49</span> | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | [Go](https://github.com/openset/leetcode/tree/master/problems/group-anagrams) | Medium |
-| <span id="48">48</span> | [Rotate Image](https://leetcode.com/problems/rotate-image) | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-image) | Medium |
-| <span id="47">47</span> | [Permutations II](https://leetcode.com/problems/permutations-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutations-ii) | Medium |
-| <span id="46">46</span> | [Permutations](https://leetcode.com/problems/permutations) | [Go](https://github.com/openset/leetcode/tree/master/problems/permutations) | Medium |
-| <span id="45">45</span> | [Jump Game II](https://leetcode.com/problems/jump-game-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/jump-game-ii) | Hard |
-| <span id="44">44</span> | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | [Go](https://github.com/openset/leetcode/tree/master/problems/wildcard-matching) | Hard |
-| <span id="43">43</span> | [Multiply Strings](https://leetcode.com/problems/multiply-strings) | [Go](https://github.com/openset/leetcode/tree/master/problems/multiply-strings) | Medium |
-| <span id="42">42</span> | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | [Go](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water) | Hard |
-| <span id="41">41</span> | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | [Go](https://github.com/openset/leetcode/tree/master/problems/first-missing-positive) | Hard |
-| <span id="40">40</span> | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-ii) | Medium |
-| <span id="39">39</span> | [Combination Sum](https://leetcode.com/problems/combination-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum) | Medium |
-| <span id="38">38</span> | [Count and Say](https://leetcode.com/problems/count-and-say) | [Go](https://github.com/openset/leetcode/tree/master/problems/count-and-say) | Easy |
-| <span id="37">37</span> | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | [Go](https://github.com/openset/leetcode/tree/master/problems/sudoku-solver) | Hard |
-| <span id="36">36</span> | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-sudoku) | Medium |
-| <span id="35">35</span> | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-insert-position) | Easy |
-| <span id="34">34</span> | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/find-first-and-last-position-of-element-in-sorted-array) | Medium |
-| <span id="33">33</span> | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array) | Medium |
-| <span id="32">32</span> | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-valid-parentheses) | Hard |
-| <span id="31">31</span> | [Next Permutation](https://leetcode.com/problems/next-permutation) | [Go](https://github.com/openset/leetcode/tree/master/problems/next-permutation) | Medium |
-| <span id="30">30</span> | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | [Go](https://github.com/openset/leetcode/tree/master/problems/substring-with-concatenation-of-all-words) | Hard |
-| <span id="29">29</span> | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | [Go](https://github.com/openset/leetcode/tree/master/problems/divide-two-integers) | Medium |
-| <span id="28">28</span> | [Implement strStr()](https://leetcode.com/problems/implement-strstr) | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-strstr) | Easy |
-| <span id="27">27</span> | [Remove Element](https://leetcode.com/problems/remove-element) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-element) | Easy |
-| <span id="26">26</span> | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array) | Easy |
-| <span id="25">25</span> | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-nodes-in-k-group) | Hard |
-| <span id="24">24</span> | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-nodes-in-pairs) | Medium |
-| <span id="23">23</span> | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-k-sorted-lists) | Hard |
-| <span id="22">22</span> | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/generate-parentheses) | Medium |
-| <span id="21">21</span> | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-two-sorted-lists) | Easy |
-| <span id="20">20</span> | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-parentheses) | Easy |
-| <span id="19">19</span> | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-nth-node-from-end-of-list) | Medium |
-| <span id="18">18</span> | [4Sum](https://leetcode.com/problems/4sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/4sum) | Medium |
-| <span id="17">17</span> | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/letter-combinations-of-a-phone-number) | Medium |
-| <span id="16">16</span> | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-closest) | Medium |
-| <span id="15">15</span> | [3Sum](https://leetcode.com/problems/3sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum) | Medium |
-| <span id="14">14</span> | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-common-prefix) | Easy |
-| <span id="13">13</span> | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | [Go](https://github.com/openset/leetcode/tree/master/problems/roman-to-integer) | Easy |
-| <span id="12">12</span> | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-to-roman) | Medium |
-| <span id="11">11</span> | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [Go](https://github.com/openset/leetcode/tree/master/problems/container-with-most-water) | Medium |
-| <span id="10">10</span> | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | [Go](https://github.com/openset/leetcode/tree/master/problems/regular-expression-matching) | Hard |
-| <span id="9">9</span> | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-number) | Easy |
-| <span id="8">8</span> | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | [Go](https://github.com/openset/leetcode/tree/master/problems/string-to-integer-atoi) | Medium |
-| <span id="7">7</span> | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-integer) | Easy |
-| <span id="6">6</span> | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | [Go](https://github.com/openset/leetcode/tree/master/problems/zigzag-conversion) | Medium |
-| <span id="5">5</span> | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-substring) | Medium |
-| <span id="4">4</span> | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [Go](https://github.com/openset/leetcode/tree/master/problems/median-of-two-sorted-arrays) | Hard |
-| <span id="3">3</span> | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-without-repeating-characters) | Medium |
-| <span id="2">2</span> | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | [Go](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers) | Medium |
-| <span id="1">1</span> | [Two Sum](https://leetcode.com/problems/two-sum) | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum) | Easy |
+| <span id="968">968</span> | [Binary Tree Cameras](https://leetcode.com/problems/binary-tree-cameras "监控二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-cameras) | Hard |
+| <span id="967">967</span> | [Numbers With Same Consecutive Differences](https://leetcode.com/problems/numbers-with-same-consecutive-differences "连续差相同的数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/numbers-with-same-consecutive-differences) | Medium |
+| <span id="966">966</span> | [Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker "元音拼写检查器") | [Go](https://github.com/openset/leetcode/tree/master/problems/vowel-spellchecker) | Medium |
+| <span id="965">965</span> | [Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree "单值二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/univalued-binary-tree) | Easy |
+| <span id="964">964</span> | [Least Operators to Express Number](https://leetcode.com/problems/least-operators-to-express-number "表示数字的最少运算符") | [Go](https://github.com/openset/leetcode/tree/master/problems/least-operators-to-express-number) | Hard |
+| <span id="963">963</span> | [Minimum Area Rectangle II](https://leetcode.com/problems/minimum-area-rectangle-ii "最小面积矩形 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle-ii) | Medium |
+| <span id="962">962</span> | [Maximum Width Ramp](https://leetcode.com/problems/maximum-width-ramp "最大宽度坡") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-width-ramp) | Medium |
+| <span id="961">961</span> | [N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array "重复 N 次的元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/n-repeated-element-in-size-2n-array) | Easy |
+| <span id="960">960</span> | [Delete Columns to Make Sorted III](https://leetcode.com/problems/delete-columns-to-make-sorted-iii "删列造序 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-iii) | Hard |
+| <span id="959">959</span> | [Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes "由斜杠划分区域") | [Go](https://github.com/openset/leetcode/tree/master/problems/regions-cut-by-slashes) | Medium |
+| <span id="958">958</span> | [Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree "二叉树的完全性检验") | [Go](https://github.com/openset/leetcode/tree/master/problems/check-completeness-of-a-binary-tree) | Medium |
+| <span id="957">957</span> | [Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days "N 天后的牢房") | [Go](https://github.com/openset/leetcode/tree/master/problems/prison-cells-after-n-days) | Medium |
+| <span id="956">956</span> | [Tallest Billboard](https://leetcode.com/problems/tallest-billboard "最高的广告牌") | [Go](https://github.com/openset/leetcode/tree/master/problems/tallest-billboard) | Hard |
+| <span id="955">955</span> | [Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii "删列造序 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-ii) | Medium |
+| <span id="954">954</span> | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs "二倍数对数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/array-of-doubled-pairs) | Medium |
+| <span id="953">953</span> | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary "验证外星语词典") | [Go](https://github.com/openset/leetcode/tree/master/problems/verifying-an-alien-dictionary) | Easy |
+| <span id="952">952</span> | [Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor "按公因数计算最大组件大小") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-component-size-by-common-factor) | Hard |
+| <span id="951">951</span> | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees "翻转等价二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-equivalent-binary-trees) | Medium |
+| <span id="950">950</span> | [Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order "按递增顺序显示卡牌") | [Go](https://github.com/openset/leetcode/tree/master/problems/reveal-cards-in-increasing-order) | Medium |
+| <span id="949">949</span> | [Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits "给定数字能组成的最大时间") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-time-for-given-digits) | Easy |
+| <span id="948">948</span> | [Bag of Tokens](https://leetcode.com/problems/bag-of-tokens "令牌放置") | [Go](https://github.com/openset/leetcode/tree/master/problems/bag-of-tokens) | Medium |
+| <span id="947">947</span> | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column "移除最多的同行或同列石头") | [Go](https://github.com/openset/leetcode/tree/master/problems/most-stones-removed-with-same-row-or-column) | Medium |
+| <span id="946">946</span> | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences "验证栈序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-stack-sequences) | Medium |
+| <span id="945">945</span> | [Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique "使数组唯一的最小增量") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-increment-to-make-array-unique) | Medium |
+| <span id="944">944</span> | [Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted "删列造序") | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted) | Easy |
+| <span id="943">943</span> | [Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring "最短超级串") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-shortest-superstring) | Hard |
+| <span id="942">942</span> | [DI String Match](https://leetcode.com/problems/di-string-match "增减字符串匹配") | [Go](https://github.com/openset/leetcode/tree/master/problems/di-string-match) | Easy |
+| <span id="941">941</span> | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array "有效的山脉数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-mountain-array) | Easy |
+| <span id="940">940</span> | [Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii "不同的子序列 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences-ii) | Hard |
+| <span id="939">939</span> | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle "最小面积矩形") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle) | Medium |
+| <span id="938">938</span> | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst "二叉搜索树的范围和") | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-of-bst) | Medium |
+| <span id="937">937</span> | [Reorder Log Files](https://leetcode.com/problems/reorder-log-files "重新排列日志文件") | [Go](https://github.com/openset/leetcode/tree/master/problems/reorder-log-files) | Easy |
+| <span id="936">936</span> | [Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence "戳印序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/stamping-the-sequence) | Hard |
+| <span id="935">935</span> | [Knight Dialer](https://leetcode.com/problems/knight-dialer "骑士拨号器") | [Go](https://github.com/openset/leetcode/tree/master/problems/knight-dialer) | Medium |
+| <span id="934">934</span> | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge "最短的桥") | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-bridge) | Medium |
+| <span id="933">933</span> | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls "最近的请求次数") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-recent-calls) | Easy |
+| <span id="932">932</span> | [Beautiful Array](https://leetcode.com/problems/beautiful-array "漂亮数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-array) | Medium |
+| <span id="931">931</span> | [Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum "下降路径最小和") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-falling-path-sum) | Medium |
+| <span id="930">930</span> | [Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum "和相同的二元子数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-subarrays-with-sum) | Medium |
+| <span id="929">929</span> | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses "独特的电子邮件地址") | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-email-addresses) | Easy |
+| <span id="928">928</span> | [Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii "尽量减少恶意软件的传播 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread-ii) | Hard |
+| <span id="927">927</span> | [Three Equal Parts](https://leetcode.com/problems/three-equal-parts "三等分") | [Go](https://github.com/openset/leetcode/tree/master/problems/three-equal-parts) | Hard |
+| <span id="926">926</span> | [Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing "将字符串翻转到单调递增") | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-string-to-monotone-increasing) | Medium |
+| <span id="925">925</span> | [Long Pressed Name](https://leetcode.com/problems/long-pressed-name "长按键入") | [Go](https://github.com/openset/leetcode/tree/master/problems/long-pressed-name) | Easy |
+| <span id="924">924</span> | [Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread "尽量减少恶意软件的传播") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread) | Hard |
+| <span id="923">923</span> | [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity "三数之和的多种可能") | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-with-multiplicity) | Medium |
+| <span id="922">922</span> | [Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii "按奇偶排序数组 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity-ii) | Easy |
+| <span id="921">921</span> | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid "使括号有效的最少添加") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-add-to-make-parentheses-valid) | Medium |
+| <span id="920">920</span> | [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists "播放列表的数量") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-music-playlists) | Hard |
+| <span id="919">919</span> | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter "完全二叉树插入器") | [Go](https://github.com/openset/leetcode/tree/master/problems/complete-binary-tree-inserter) | Medium |
+| <span id="918">918</span> | [Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray "环形子数组的最大和") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-circular-subarray) | Medium |
+| <span id="917">917</span> | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters "仅仅反转字母") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-only-letters) | Easy |
+| <span id="916">916</span> | [Word Subsets](https://leetcode.com/problems/word-subsets "单词子集") | [Go](https://github.com/openset/leetcode/tree/master/problems/word-subsets) | Medium |
+| <span id="915">915</span> | [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals "分割数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-array-into-disjoint-intervals) | Medium |
+| <span id="914">914</span> | [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards "卡牌分组") | [Go](https://github.com/openset/leetcode/tree/master/problems/x-of-a-kind-in-a-deck-of-cards) | Easy |
+| <span id="913">913</span> | [Cat and Mouse](https://leetcode.com/problems/cat-and-mouse "猫和老鼠") | [Go](https://github.com/openset/leetcode/tree/master/problems/cat-and-mouse) | Hard |
+| <span id="911">911</span> | [Online Election](https://leetcode.com/problems/online-election "在线选举") | [Go](https://github.com/openset/leetcode/tree/master/problems/online-election) | Medium |
+| <span id="910">910</span> | [Smallest Range II](https://leetcode.com/problems/smallest-range-ii "最小差值 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range-ii) | Medium |
+| <span id="909">909</span> | [Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders "爬坡和梯子") | [Go](https://github.com/openset/leetcode/tree/master/problems/snakes-and-ladders) | Medium |
+| <span id="908">908</span> | [Smallest Range I](https://leetcode.com/problems/smallest-range-i "最小差值 I") | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range-i) | Easy |
+| <span id="907">907</span> | [Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums "子数组的最小值之和") | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-subarray-minimums) | Medium |
+| <span id="906">906</span> | [Super Palindromes](https://leetcode.com/problems/super-palindromes "超级回文数") | [Go](https://github.com/openset/leetcode/tree/master/problems/super-palindromes) | Hard |
+| <span id="905">905</span> | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity "按奇偶排序数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity) | Easy |
+| <span id="904">904</span> | [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets "水果成篮") | [Go](https://github.com/openset/leetcode/tree/master/problems/fruit-into-baskets) | Medium |
+| <span id="903">903</span> | [Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence "DI 序列的有效排列") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-permutations-for-di-sequence) | Hard |
+| <span id="902">902</span> | [Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set "最大为 N 的数字组合") | [Go](https://github.com/openset/leetcode/tree/master/problems/numbers-at-most-n-given-digit-set) | Hard |
+| <span id="901">901</span> | [Online Stock Span](https://leetcode.com/problems/online-stock-span "股票价格跨度") | [Go](https://github.com/openset/leetcode/tree/master/problems/online-stock-span) | Medium |
+| <span id="900">900</span> | [RLE Iterator](https://leetcode.com/problems/rle-iterator "RLE 迭代器") | [Go](https://github.com/openset/leetcode/tree/master/problems/rle-iterator) | Medium |
+| <span id="899">899</span> | [Orderly Queue](https://leetcode.com/problems/orderly-queue "有序队列") | [Go](https://github.com/openset/leetcode/tree/master/problems/orderly-queue) | Hard |
+| <span id="898">898</span> | [Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays "子数组按位或操作") | [Go](https://github.com/openset/leetcode/tree/master/problems/bitwise-ors-of-subarrays) | Medium |
+| <span id="897">897</span> | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree "递增顺序查找树") | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-order-search-tree) | Easy |
+| <span id="896">896</span> | [Monotonic Array](https://leetcode.com/problems/monotonic-array "单调数列") | [Go](https://github.com/openset/leetcode/tree/master/problems/monotonic-array) | Easy |
+| <span id="895">895</span> | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack "最大频率栈") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-frequency-stack) | Hard |
+| <span id="894">894</span> | [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees "所有可能的满二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/all-possible-full-binary-trees) | Medium |
+| <span id="893">893</span> | [Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings "特殊等价字符串组") | [Go](https://github.com/openset/leetcode/tree/master/problems/groups-of-special-equivalent-strings) | Easy |
+| <span id="892">892</span> | [Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes "三维形体的表面积") | [Go](https://github.com/openset/leetcode/tree/master/problems/surface-area-of-3d-shapes) | Easy |
+| <span id="891">891</span> | [Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths "子序列宽度之和") | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-subsequence-widths) | Hard |
+| <span id="890">890</span> | [Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern "查找和替换模式") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-pattern) | Medium |
+| <span id="889">889</span> | [Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal "根据前序和后序遍历构造二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | Medium |
+| <span id="888">888</span> | [Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap "公平的糖果交换") | [Go](https://github.com/openset/leetcode/tree/master/problems/fair-candy-swap) | Easy |
+| <span id="887">887</span> | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop "鸡蛋掉落") | [Go](https://github.com/openset/leetcode/tree/master/problems/super-egg-drop) | Hard |
+| <span id="886">886</span> | [Possible Bipartition](https://leetcode.com/problems/possible-bipartition "可能的二分法") | [Go](https://github.com/openset/leetcode/tree/master/problems/possible-bipartition) | Medium |
+| <span id="885">885</span> | [Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii "螺旋矩阵 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-iii) | Medium |
+| <span id="884">884</span> | [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences "两句话中的不常见单词") | [Go](https://github.com/openset/leetcode/tree/master/problems/uncommon-words-from-two-sentences) | Easy |
+| <span id="883">883</span> | [Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes "三维形体投影面积") | [Go](https://github.com/openset/leetcode/tree/master/problems/projection-area-of-3d-shapes) | Easy |
+| <span id="882">882</span> | [Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph "细分图中的可到达结点") | [Go](https://github.com/openset/leetcode/tree/master/problems/reachable-nodes-in-subdivided-graph) | Hard |
+| <span id="881">881</span> | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people "救生艇") | [Go](https://github.com/openset/leetcode/tree/master/problems/boats-to-save-people) | Medium |
+| <span id="880">880</span> | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index "索引处的解码字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/decoded-string-at-index) | Medium |
+| <span id="879">879</span> | [Profitable Schemes](https://leetcode.com/problems/profitable-schemes "盈利计划") | [Go](https://github.com/openset/leetcode/tree/master/problems/profitable-schemes) | Hard |
+| <span id="878">878</span> | [Nth Magical Number](https://leetcode.com/problems/nth-magical-number "第 N 个神奇数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/nth-magical-number) | Hard |
+| <span id="877">877</span> | [Stone Game](https://leetcode.com/problems/stone-game "石子游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/stone-game) | Medium |
+| <span id="876">876</span> | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list "链表的中间结点") | [Go](https://github.com/openset/leetcode/tree/master/problems/middle-of-the-linked-list) | Easy |
+| <span id="875">875</span> | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas "爱吃香蕉的珂珂") | [Go](https://github.com/openset/leetcode/tree/master/problems/koko-eating-bananas) | Medium |
+| <span id="874">874</span> | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation "模拟行走机器人") | [Go](https://github.com/openset/leetcode/tree/master/problems/walking-robot-simulation) | Easy |
+| <span id="873">873</span> | [Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence "最长的斐波那契子序列的长度") | [Go](https://github.com/openset/leetcode/tree/master/problems/length-of-longest-fibonacci-subsequence) | Medium |
+| <span id="872">872</span> | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees "叶子相似的树") | [Go](https://github.com/openset/leetcode/tree/master/problems/leaf-similar-trees) | Easy |
+| <span id="871">871</span> | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops "最低加油次数") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-refueling-stops) | Hard |
+| <span id="870">870</span> | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle "优势洗牌") | [Go](https://github.com/openset/leetcode/tree/master/problems/advantage-shuffle) | Medium |
+| <span id="869">869</span> | [Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2 "重新排序得到 2 的幂") | [Go](https://github.com/openset/leetcode/tree/master/problems/reordered-power-of-2) | Medium |
+| <span id="868">868</span> | [Binary Gap](https://leetcode.com/problems/binary-gap "二进制间距") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-gap) | Easy |
+| <span id="867">867</span> | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix "转置矩阵") | [Go](https://github.com/openset/leetcode/tree/master/problems/transpose-matrix) | Easy |
+| <span id="866">866</span> | [Prime Palindrome](https://leetcode.com/problems/prime-palindrome "回文素数") | [Go](https://github.com/openset/leetcode/tree/master/problems/prime-palindrome) | Medium |
+| <span id="865">865</span> | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes "具有所有最深结点的最小子树") | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-subtree-with-all-the-deepest-nodes) | Medium |
+| <span id="864">864</span> | [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys "获取所有钥匙的最短路径") | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-path-to-get-all-keys) | Hard |
+| <span id="863">863</span> | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree "二叉树中所有距离为 K 的结点") | [Go](https://github.com/openset/leetcode/tree/master/problems/all-nodes-distance-k-in-binary-tree) | Medium |
+| <span id="862">862</span> | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k "和至少为 K 的最短子数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-subarray-with-sum-at-least-k) | Hard |
+| <span id="861">861</span> | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix "翻转矩阵后的得分") | [Go](https://github.com/openset/leetcode/tree/master/problems/score-after-flipping-matrix) | Medium |
+| <span id="860">860</span> | [Lemonade Change](https://leetcode.com/problems/lemonade-change "柠檬水找零") | [Go](https://github.com/openset/leetcode/tree/master/problems/lemonade-change) | Easy |
+| <span id="859">859</span> | [Buddy Strings](https://leetcode.com/problems/buddy-strings "亲密字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/buddy-strings) | Easy |
+| <span id="858">858</span> | [Mirror Reflection](https://leetcode.com/problems/mirror-reflection "镜面反射") | [Go](https://github.com/openset/leetcode/tree/master/problems/mirror-reflection) | Medium |
+| <span id="857">857</span> | [Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers "雇佣 K 名工人的最低成本") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-hire-k-workers) | Hard |
+| <span id="856">856</span> | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses "括号的分数") | [Go](https://github.com/openset/leetcode/tree/master/problems/score-of-parentheses) | Medium |
+| <span id="855">855</span> | [Exam Room](https://leetcode.com/problems/exam-room "考场就座") | [Go](https://github.com/openset/leetcode/tree/master/problems/exam-room) | Medium |
+| <span id="854">854</span> | [K-Similar Strings](https://leetcode.com/problems/k-similar-strings "相似度为 K 的字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/k-similar-strings) | Hard |
+| <span id="853">853</span> | [Car Fleet](https://leetcode.com/problems/car-fleet "车队") | [Go](https://github.com/openset/leetcode/tree/master/problems/car-fleet) | Medium |
+| <span id="852">852</span> | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array "山脉数组的峰顶索引") | [Go](https://github.com/openset/leetcode/tree/master/problems/peak-index-in-a-mountain-array) | Easy |
+| <span id="851">851</span> | [Loud and Rich](https://leetcode.com/problems/loud-and-rich "喧闹和富有") | [Go](https://github.com/openset/leetcode/tree/master/problems/loud-and-rich) | Medium |
+| <span id="850">850</span> | [Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii "矩形面积 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/rectangle-area-ii) | Hard |
+| <span id="849">849</span> | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person "到最近的人的最大距离") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximize-distance-to-closest-person) | Easy |
+| <span id="848">848</span> | [Shifting Letters](https://leetcode.com/problems/shifting-letters "字母移位") | [Go](https://github.com/openset/leetcode/tree/master/problems/shifting-letters) | Medium |
+| <span id="847">847</span> | [Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes "访问所有节点的最短路径") | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-path-visiting-all-nodes) | Hard |
+| <span id="846">846</span> | [Hand of Straights](https://leetcode.com/problems/hand-of-straights "一手顺子") | [Go](https://github.com/openset/leetcode/tree/master/problems/hand-of-straights) | Medium |
+| <span id="845">845</span> | [Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array "数组中的最长山脉") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-mountain-in-array) | Medium |
+| <span id="844">844</span> | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare "比较含退格的字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/backspace-string-compare) | Easy |
+| <span id="843">843</span> | [Guess the Word](https://leetcode.com/problems/guess-the-word "猜猜这个单词") | [Go](https://github.com/openset/leetcode/tree/master/problems/guess-the-word) | Hard |
+| <span id="842">842</span> | [Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence "将数组拆分成斐波那契序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-into-fibonacci-sequence) | Medium |
+| <span id="841">841</span> | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms "钥匙和房间") | [Go](https://github.com/openset/leetcode/tree/master/problems/keys-and-rooms) | Medium |
+| <span id="840">840</span> | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid "矩阵中的幻方") | [Go](https://github.com/openset/leetcode/tree/master/problems/magic-squares-in-grid) | Easy |
+| <span id="839">839</span> | [Similar String Groups](https://leetcode.com/problems/similar-string-groups "相似字符串组") | [Go](https://github.com/openset/leetcode/tree/master/problems/similar-string-groups) | Hard |
+| <span id="838">838</span> | [Push Dominoes](https://leetcode.com/problems/push-dominoes "推多米诺") | [Go](https://github.com/openset/leetcode/tree/master/problems/push-dominoes) | Medium |
+| <span id="837">837</span> | [New 21 Game](https://leetcode.com/problems/new-21-game "新21点") | [Go](https://github.com/openset/leetcode/tree/master/problems/new-21-game) | Medium |
+| <span id="836">836</span> | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap "矩形重叠") | [Go](https://github.com/openset/leetcode/tree/master/problems/rectangle-overlap) | Easy |
+| <span id="835">835</span> | [Image Overlap](https://leetcode.com/problems/image-overlap "图像重叠") | [Go](https://github.com/openset/leetcode/tree/master/problems/image-overlap) | Medium |
+| <span id="834">834</span> | [Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree "树中距离之和") | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-distances-in-tree) | Hard |
+| <span id="833">833</span> | [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string "字符串中的查找与替换") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-in-string) | Medium |
+| <span id="832">832</span> | [Flipping an Image](https://leetcode.com/problems/flipping-an-image "翻转图像") | [Go](https://github.com/openset/leetcode/tree/master/problems/flipping-an-image) | Easy |
+| <span id="831">831</span> | [Masking Personal Information](https://leetcode.com/problems/masking-personal-information "隐藏个人信息") | [Go](https://github.com/openset/leetcode/tree/master/problems/masking-personal-information) | Medium |
+| <span id="830">830</span> | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups "较大分组的位置") | [Go](https://github.com/openset/leetcode/tree/master/problems/positions-of-large-groups) | Easy |
+| <span id="829">829</span> | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum "连续整数求和") | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers-sum) | Hard |
+| <span id="828">828</span> | [Unique Letter String](https://leetcode.com/problems/unique-letter-string "独特字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-letter-string) | Hard |
+| <span id="827">827</span> | [Making A Large Island](https://leetcode.com/problems/making-a-large-island "最大人工岛") | [Go](https://github.com/openset/leetcode/tree/master/problems/making-a-large-island) | Hard |
+| <span id="826">826</span> | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work "安排工作以达到最大收益") | [Go](https://github.com/openset/leetcode/tree/master/problems/most-profit-assigning-work) | Medium |
+| <span id="825">825</span> | [Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages "适龄的朋友") | [Go](https://github.com/openset/leetcode/tree/master/problems/friends-of-appropriate-ages) | Medium |
+| <span id="824">824</span> | [Goat Latin](https://leetcode.com/problems/goat-latin "山羊拉丁文") | [Go](https://github.com/openset/leetcode/tree/master/problems/goat-latin) | Easy |
+| <span id="823">823</span> | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors "带因子的二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-trees-with-factors) | Medium |
+| <span id="822">822</span> | [Card Flipping Game](https://leetcode.com/problems/card-flipping-game "翻转卡片游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/card-flipping-game) | Medium |
+| <span id="821">821</span> | [Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character "字符的最短距离") | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-to-a-character) | Easy |
+| <span id="820">820</span> | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words "单词的压缩编码") | [Go](https://github.com/openset/leetcode/tree/master/problems/short-encoding-of-words) | Medium |
+| <span id="819">819</span> | [Most Common Word](https://leetcode.com/problems/most-common-word "最常见的单词") | [Go](https://github.com/openset/leetcode/tree/master/problems/most-common-word) | Easy |
+| <span id="818">818</span> | [Race Car](https://leetcode.com/problems/race-car "赛车") | [Go](https://github.com/openset/leetcode/tree/master/problems/race-car) | Hard |
+| <span id="817">817</span> | [Linked List Components](https://leetcode.com/problems/linked-list-components "链表组件") | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-components) | Medium |
+| <span id="816">816</span> | [Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates "模糊坐标") | [Go](https://github.com/openset/leetcode/tree/master/problems/ambiguous-coordinates) | Medium |
+| <span id="815">815</span> | [Bus Routes](https://leetcode.com/problems/bus-routes "公交路线") | [Go](https://github.com/openset/leetcode/tree/master/problems/bus-routes) | Hard |
+| <span id="814">814</span> | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning "二叉树剪枝") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-pruning) | Medium |
+| <span id="813">813</span> | [Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages "最大平均值和的分组") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-sum-of-averages) | Medium |
+| <span id="812">812</span> | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area "最大三角形面积") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-triangle-area) | Easy |
+| <span id="811">811</span> | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count "子域名访问计数") | [Go](https://github.com/openset/leetcode/tree/master/problems/subdomain-visit-count) | Easy |
+| <span id="810">810</span> | [Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game "黑板异或游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/chalkboard-xor-game) | Hard |
+| <span id="809">809</span> | [Expressive Words](https://leetcode.com/problems/expressive-words "情感丰富的文字") | [Go](https://github.com/openset/leetcode/tree/master/problems/expressive-words) | Medium |
+| <span id="808">808</span> | [Soup Servings](https://leetcode.com/problems/soup-servings "分汤") | [Go](https://github.com/openset/leetcode/tree/master/problems/soup-servings) | Medium |
+| <span id="807">807</span> | [Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline "保持城市天际线") | [Go](https://github.com/openset/leetcode/tree/master/problems/max-increase-to-keep-city-skyline) | Medium |
+| <span id="806">806</span> | [Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string "写字符串需要的行数") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-lines-to-write-string) | Easy |
+| <span id="805">805</span> | [Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average "数组的均值分割") | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-with-same-average) | Hard |
+| <span id="804">804</span> | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words "唯一摩尔斯密码词") | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-morse-code-words) | Easy |
+| <span id="803">803</span> | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit "打砖块") | [Go](https://github.com/openset/leetcode/tree/master/problems/bricks-falling-when-hit) | Hard |
+| <span id="802">802</span> | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states "找到最终的安全状态") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-eventual-safe-states) | Medium |
+| <span id="801">801</span> | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing "使序列递增的最小交换次数") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-make-sequences-increasing) | Medium |
+| <span id="800">800</span> | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color) | Easy |
+| <span id="799">799</span> | [Champagne Tower](https://leetcode.com/problems/champagne-tower "香槟塔") | [Go](https://github.com/openset/leetcode/tree/master/problems/champagne-tower) | Medium |
+| <span id="798">798</span> | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score "得分最高的最小轮调") | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-rotation-with-highest-score) | Hard |
+| <span id="797">797</span> | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target "所有可能的路径") | [Go](https://github.com/openset/leetcode/tree/master/problems/all-paths-from-source-to-target) | Medium |
+| <span id="796">796</span> | [Rotate String](https://leetcode.com/problems/rotate-string "旋转字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-string) | Easy |
+| <span id="795">795</span> | [Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum "区间子数组个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-subarrays-with-bounded-maximum) | Medium |
+| <span id="794">794</span> | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state "有效的井字游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-tic-tac-toe-state) | Medium |
+| <span id="793">793</span> | [Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function "阶乘函数后K个零") | [Go](https://github.com/openset/leetcode/tree/master/problems/preimage-size-of-factorial-zeroes-function) | Hard |
+| <span id="792">792</span> | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences "匹配子序列的单词数") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-matching-subsequences) | Medium |
+| <span id="791">791</span> | [Custom Sort String](https://leetcode.com/problems/custom-sort-string "自定义字符串排序") | [Go](https://github.com/openset/leetcode/tree/master/problems/custom-sort-string) | Medium |
+| <span id="790">790</span> | [Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling "多米诺和托米诺平铺") | [Go](https://github.com/openset/leetcode/tree/master/problems/domino-and-tromino-tiling) | Medium |
+| <span id="789">789</span> | [Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts "逃脱阻碍者") | [Go](https://github.com/openset/leetcode/tree/master/problems/escape-the-ghosts) | Medium |
+| <span id="788">788</span> | [Rotated Digits](https://leetcode.com/problems/rotated-digits "旋转数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/rotated-digits) | Easy |
+| <span id="787">787</span> | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops "K 站中转内最便宜的航班") | [Go](https://github.com/openset/leetcode/tree/master/problems/cheapest-flights-within-k-stops) | Medium |
+| <span id="786">786</span> | [K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction "第 K 个最小的素数分数") | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-prime-fraction) | Hard |
+| <span id="785">785</span> | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite "判断二分图") | [Go](https://github.com/openset/leetcode/tree/master/problems/is-graph-bipartite) | Medium |
+| <span id="784">784</span> | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation "字母大小写全排列") | [Go](https://github.com/openset/leetcode/tree/master/problems/letter-case-permutation) | Easy |
+| <span id="783">783</span> | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes "二叉搜索树结点最小距离") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes) | Easy |
+| <span id="782">782</span> | [Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard "变为棋盘") | [Go](https://github.com/openset/leetcode/tree/master/problems/transform-to-chessboard) | Hard |
+| <span id="781">781</span> | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest "森林中的兔子") | [Go](https://github.com/openset/leetcode/tree/master/problems/rabbits-in-forest) | Medium |
+| <span id="780">780</span> | [Reaching Points](https://leetcode.com/problems/reaching-points "到达终点") | [Go](https://github.com/openset/leetcode/tree/master/problems/reaching-points) | Hard |
+| <span id="779">779</span> | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar "第K个语法符号") | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-symbol-in-grammar) | Medium |
+| <span id="778">778</span> | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water "水位上升的泳池中游泳") | [Go](https://github.com/openset/leetcode/tree/master/problems/swim-in-rising-water) | Hard |
+| <span id="777">777</span> | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string "在LR字符串中交换相邻字符") | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-adjacent-in-lr-string) | Medium |
+| <span id="776">776</span> | [Split BST](https://leetcode.com/problems/split-bst "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-bst) | Medium |
+| <span id="775">775</span> | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions "全局倒置与局部倒置") | [Go](https://github.com/openset/leetcode/tree/master/problems/global-and-local-inversions) | Medium |
+| <span id="774">774</span> | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station) | Hard |
+| <span id="773">773</span> | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle "滑动谜题") | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-puzzle) | Hard |
+| <span id="772">772</span> | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) | Hard |
+| <span id="771">771</span> | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones "宝石与石头") | [Go](https://github.com/openset/leetcode/tree/master/problems/jewels-and-stones) | Easy |
+| <span id="770">770</span> | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv "基本计算器 IV") | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iv) | Hard |
+| <span id="769">769</span> | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted "最多能完成排序的块") | [Go](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted) | Medium |
+| <span id="768">768</span> | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii "最多能完成排序的块 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted-ii) | Hard |
+| <span id="767">767</span> | [Reorganize String](https://leetcode.com/problems/reorganize-string "重构字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/reorganize-string) | Medium |
+| <span id="766">766</span> | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix "托普利茨矩阵") | [Go](https://github.com/openset/leetcode/tree/master/problems/toeplitz-matrix) | Easy |
+| <span id="765">765</span> | [Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands "情侣牵手") | [Go](https://github.com/openset/leetcode/tree/master/problems/couples-holding-hands) | Hard |
+| <span id="764">764</span> | [Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign "最大加号标志") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-plus-sign) | Medium |
+| <span id="763">763</span> | [Partition Labels](https://leetcode.com/problems/partition-labels "划分字母区间") | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-labels) | Medium |
+| <span id="762">762</span> | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation "二进制表示中质数个计算置位") | [Go](https://github.com/openset/leetcode/tree/master/problems/prime-number-of-set-bits-in-binary-representation) | Easy |
+| <span id="761">761</span> | [Special Binary String](https://leetcode.com/problems/special-binary-string "特殊的二进制序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/special-binary-string) | Hard |
+| <span id="760">760</span> | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-anagram-mappings) | Easy |
+| <span id="759">759</span> | [Employee Free Time](https://leetcode.com/problems/employee-free-time "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-free-time) | Hard |
+| <span id="758">758</span> | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/bold-words-in-string) | Easy |
+| <span id="757">757</span> | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two " 设置交集大小至少为2") | [Go](https://github.com/openset/leetcode/tree/master/problems/set-intersection-size-at-least-two) | Hard |
+| <span id="756">756</span> | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix "金字塔转换矩阵") | [Go](https://github.com/openset/leetcode/tree/master/problems/pyramid-transition-matrix) | Medium |
+| <span id="755">755</span> | [Pour Water](https://leetcode.com/problems/pour-water "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/pour-water) | Medium |
+| <span id="754">754</span> | [Reach a Number](https://leetcode.com/problems/reach-a-number "到达终点数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/reach-a-number) | Easy |
+| <span id="753">753</span> | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe "破解保险箱") | [Go](https://github.com/openset/leetcode/tree/master/problems/cracking-the-safe) | Hard |
+| <span id="752">752</span> | [Open the Lock](https://leetcode.com/problems/open-the-lock "打开转盘锁") | [Go](https://github.com/openset/leetcode/tree/master/problems/open-the-lock) | Medium |
+| <span id="751">751</span> | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/ip-to-cidr) | Easy |
+| <span id="750">750</span> | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-corner-rectangles) | Medium |
+| <span id="749">749</span> | [Contain Virus](https://leetcode.com/problems/contain-virus "隔离病毒") | [Go](https://github.com/openset/leetcode/tree/master/problems/contain-virus) | Hard |
+| <span id="748">748</span> | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word "最短完整词") | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-completing-word) | Easy |
+| <span id="747">747</span> | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others "至少是其他数字两倍的最大数") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-number-at-least-twice-of-others) | Easy |
+| <span id="746">746</span> | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs "使用最小花费爬楼梯") | [Go](https://github.com/openset/leetcode/tree/master/problems/min-cost-climbing-stairs) | Easy |
+| <span id="745">745</span> | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search "前缀和后缀搜索") | [Go](https://github.com/openset/leetcode/tree/master/problems/prefix-and-suffix-search) | Hard |
+| <span id="744">744</span> | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target "寻找比目标字母大的最小字母") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-smallest-letter-greater-than-target) | Easy |
+| <span id="743">743</span> | [Network Delay Time](https://leetcode.com/problems/network-delay-time "网络延迟时间") | [Go](https://github.com/openset/leetcode/tree/master/problems/network-delay-time) | Easy |
+| <span id="742">742</span> | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-leaf-in-a-binary-tree) | Medium |
+| <span id="741">741</span> | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup "摘樱桃") | [Go](https://github.com/openset/leetcode/tree/master/problems/cherry-pickup) | Hard |
+| <span id="740">740</span> | [Delete and Earn](https://leetcode.com/problems/delete-and-earn "删除与获得点数") | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-and-earn) | Medium |
+| <span id="739">739</span> | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures "每日温度") | [Go](https://github.com/openset/leetcode/tree/master/problems/daily-temperatures) | Medium |
+| <span id="738">738</span> | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits "单调递增的数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/monotone-increasing-digits) | Medium |
+| <span id="737">737</span> | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii) | Medium |
+| <span id="736">736</span> | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression "Lisp 语法解析") | [Go](https://github.com/openset/leetcode/tree/master/problems/parse-lisp-expression) | Hard |
+| <span id="735">735</span> | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision "行星碰撞") | [Go](https://github.com/openset/leetcode/tree/master/problems/asteroid-collision) | Medium |
+| <span id="734">734</span> | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity) | Easy |
+| <span id="733">733</span> | [Flood Fill](https://leetcode.com/problems/flood-fill "图像渲染") | [Go](https://github.com/openset/leetcode/tree/master/problems/flood-fill) | Easy |
+| <span id="732">732</span> | [My Calendar III](https://leetcode.com/problems/my-calendar-iii "我的日程安排表 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii) | Hard |
+| <span id="731">731</span> | [My Calendar II](https://leetcode.com/problems/my-calendar-ii "我的日程安排表 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii) | Medium |
+| <span id="730">730</span> | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences "统计不同回文子字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-different-palindromic-subsequences) | Hard |
+| <span id="729">729</span> | [My Calendar I](https://leetcode.com/problems/my-calendar-i "我的日程安排表 I") | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-i) | Medium |
+| <span id="728">728</span> | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers "自除数") | [Go](https://github.com/openset/leetcode/tree/master/problems/self-dividing-numbers) | Easy |
+| <span id="727">727</span> | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-window-subsequence) | Hard |
+| <span id="726">726</span> | [Number of Atoms](https://leetcode.com/problems/number-of-atoms "原子的数量") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms) | Hard |
+| <span id="725">725</span> | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts "分隔链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/split-linked-list-in-parts) | Medium |
+| <span id="724">724</span> | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index "寻找数组的中心索引") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-pivot-index) | Easy |
+| <span id="723">723</span> | [Candy Crush](https://leetcode.com/problems/candy-crush "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/candy-crush) | Medium |
+| <span id="722">722</span> | [Remove Comments](https://leetcode.com/problems/remove-comments "删除注释") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-comments) | Medium |
+| <span id="721">721</span> | [Accounts Merge](https://leetcode.com/problems/accounts-merge "账户合并") | [Go](https://github.com/openset/leetcode/tree/master/problems/accounts-merge) | Medium |
+| <span id="720">720</span> | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary "词典中最长的单词") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary) | Easy |
+| <span id="719">719</span> | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance "找出第 k 小的距离对") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance) | Hard |
+| <span id="718">718</span> | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray "最长重复子数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-repeated-subarray) | Medium |
+| <span id="717">717</span> | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters "1比特与2比特字符") | [Go](https://github.com/openset/leetcode/tree/master/problems/1-bit-and-2-bit-characters) | Easy |
+| <span id="716">716</span> | [Max Stack](https://leetcode.com/problems/max-stack "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/max-stack) | Easy |
+| <span id="715">715</span> | [Range Module](https://leetcode.com/problems/range-module "Range 模块") | [Go](https://github.com/openset/leetcode/tree/master/problems/range-module) | Hard |
+| <span id="714">714</span> | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee "买卖股票的最佳时机含手续费") | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
+| <span id="713">713</span> | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k "乘积小于K的子数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k) | Medium |
+| <span id="712">712</span> | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings "两个字符串的最小ASCII删除和") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-ascii-delete-sum-for-two-strings) | Medium |
+| <span id="711">711</span> | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii) | Hard |
+| <span id="710">710</span> | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist "黑名单中的随机数") | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-blacklist) | Hard |
+| <span id="709">709</span> | [To Lower Case](https://leetcode.com/problems/to-lower-case "转换成小写字母") | [Go](https://github.com/openset/leetcode/tree/master/problems/to-lower-case) | Easy |
+| <span id="708">708</span> | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-cyclic-sorted-list) | Medium |
+| <span id="707">707</span> | [Design Linked List](https://leetcode.com/problems/design-linked-list "设计链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/design-linked-list) | Easy |
+| <span id="706">706</span> | [Design HashMap](https://leetcode.com/problems/design-hashmap "设计哈希映射") | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hashmap) | Easy |
+| <span id="705">705</span> | [Design HashSet](https://leetcode.com/problems/design-hashset "设计哈希集合") | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hashset) | Easy |
+| <span id="704">704</span> | [Binary Search](https://leetcode.com/problems/binary-search "二分查找") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-search) | Easy |
+| <span id="703">703</span> | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream "数据流中的第K大元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-a-stream) | Easy |
+| <span id="702">702</span> | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-a-sorted-array-of-unknown-size) | Medium |
+| <span id="701">701</span> | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree "二叉搜索树中的插入操作") | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-binary-search-tree) | Medium |
+| <span id="700">700</span> | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree "二叉搜索树中的搜索") | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-a-binary-search-tree) | Easy |
+| <span id="699">699</span> | [Falling Squares](https://leetcode.com/problems/falling-squares "掉落的方块") | [Go](https://github.com/openset/leetcode/tree/master/problems/falling-squares) | Hard |
+| <span id="698">698</span> | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets "划分为k个相等的子集") | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-to-k-equal-sum-subsets) | Medium |
+| <span id="697">697</span> | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array "数组的度") | [Go](https://github.com/openset/leetcode/tree/master/problems/degree-of-an-array) | Easy |
+| <span id="696">696</span> | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings "计数二进制子串") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-binary-substrings) | Easy |
+| <span id="695">695</span> | [Max Area of Island](https://leetcode.com/problems/max-area-of-island "岛屿的最大面积") | [Go](https://github.com/openset/leetcode/tree/master/problems/max-area-of-island) | Medium |
+| <span id="694">694</span> | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands) | Medium |
+| <span id="693">693</span> | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits "交替位二进制数") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-number-with-alternating-bits) | Easy |
+| <span id="692">692</span> | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words "前K个高频单词") | [Go](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-words) | Medium |
+| <span id="691">691</span> | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word "贴纸拼词") | [Go](https://github.com/openset/leetcode/tree/master/problems/stickers-to-spell-word) | Hard |
+| <span id="690">690</span> | [Employee Importance](https://leetcode.com/problems/employee-importance "员工的重要性") | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-importance) | Easy |
+| <span id="689">689</span> | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays "三个无重叠子数组的最大和") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-3-non-overlapping-subarrays) | Hard |
+| <span id="688">688</span> | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard "“马”在棋盘上的概率") | [Go](https://github.com/openset/leetcode/tree/master/problems/knight-probability-in-chessboard) | Medium |
+| <span id="687">687</span> | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path "最长同值路径") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-univalue-path) | Easy |
+| <span id="686">686</span> | [Repeated String Match](https://leetcode.com/problems/repeated-string-match "重复叠加字符串匹配") | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-string-match) | Easy |
+| <span id="685">685</span> | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii "冗余连接 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii) | Hard |
+| <span id="684">684</span> | [Redundant Connection](https://leetcode.com/problems/redundant-connection "冗余连接") | [Go](https://github.com/openset/leetcode/tree/master/problems/redundant-connection) | Medium |
+| <span id="683">683</span> | [K Empty Slots](https://leetcode.com/problems/k-empty-slots "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots) | Hard |
+| <span id="682">682</span> | [Baseball Game](https://leetcode.com/problems/baseball-game "棒球比赛") | [Go](https://github.com/openset/leetcode/tree/master/problems/baseball-game) | Easy |
+| <span id="681">681</span> | [Next Closest Time](https://leetcode.com/problems/next-closest-time "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/next-closest-time) | Medium |
+| <span id="680">680</span> | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii "验证回文字符串 Ⅱ") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-ii) | Easy |
+| <span id="679">679</span> | [24 Game](https://leetcode.com/problems/24-game "24点游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/24-game) | Hard |
+| <span id="678">678</span> | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string "有效的括号字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-parenthesis-string) | Medium |
+| <span id="677">677</span> | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs "键值映射") | [Go](https://github.com/openset/leetcode/tree/master/problems/map-sum-pairs) | Medium |
+| <span id="676">676</span> | [Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary "实现一个魔法字典") | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-magic-dictionary) | Medium |
+| <span id="675">675</span> | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event "为高尔夫比赛砍树") | [Go](https://github.com/openset/leetcode/tree/master/problems/cut-off-trees-for-golf-event) | Hard |
+| <span id="674">674</span> | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence "最长连续递增序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-continuous-increasing-subsequence) | Easy |
+| <span id="673">673</span> | [Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence "最长递增子序列的个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-longest-increasing-subsequence) | Medium |
+| <span id="672">672</span> | [Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii "灯泡开关 Ⅱ") | [Go](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher-ii) | Medium |
+| <span id="671">671</span> | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree "二叉树中第二小的节点") | [Go](https://github.com/openset/leetcode/tree/master/problems/second-minimum-node-in-a-binary-tree) | Easy |
+| <span id="670">670</span> | [Maximum Swap](https://leetcode.com/problems/maximum-swap "最大交换") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-swap) | Medium |
+| <span id="669">669</span> | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree "修剪二叉搜索树") | [Go](https://github.com/openset/leetcode/tree/master/problems/trim-a-binary-search-tree) | Easy |
+| <span id="668">668</span> | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table "乘法表中第k小的数") | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-number-in-multiplication-table) | Hard |
+| <span id="667">667</span> | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii "优美的排列 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement-ii) | Medium |
+| <span id="666">666</span> | [Path Sum IV](https://leetcode.com/problems/path-sum-iv "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) | Medium |
+| <span id="665">665</span> | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array "非递减数列") | [Go](https://github.com/openset/leetcode/tree/master/problems/non-decreasing-array) | Easy |
+| <span id="664">664</span> | [Strange Printer](https://leetcode.com/problems/strange-printer "奇怪的打印机") | [Go](https://github.com/openset/leetcode/tree/master/problems/strange-printer) | Hard |
+| <span id="663">663</span> | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/equal-tree-partition) | Medium |
+| <span id="662">662</span> | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree "二叉树最大宽度") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-width-of-binary-tree) | Medium |
+| <span id="661">661</span> | [Image Smoother](https://leetcode.com/problems/image-smoother "图片平滑器") | [Go](https://github.com/openset/leetcode/tree/master/problems/image-smoother) | Easy |
+| <span id="660">660</span> | [Remove 9](https://leetcode.com/problems/remove-9 "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-9) | Hard |
+| <span id="659">659</span> | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences "分割数组为连续子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-into-consecutive-subsequences) | Medium |
+| <span id="658">658</span> | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements "找到 K 个最接近的元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-closest-elements) | Medium |
+| <span id="657">657</span> | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin "机器人能否返回原点") | [Go](https://github.com/openset/leetcode/tree/master/problems/robot-return-to-origin) | Easy |
+| <span id="656">656</span> | [Coin Path](https://leetcode.com/problems/coin-path "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-path) | Hard |
+| <span id="655">655</span> | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree "输出二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/print-binary-tree) | Medium |
+| <span id="654">654</span> | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree "最大二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-binary-tree) | Medium |
+| <span id="653">653</span> | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst "两数之和 IV - 输入 BST") | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-iv-input-is-a-bst) | Easy |
+| <span id="652">652</span> | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees "寻找重复的子树") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-subtrees) | Medium |
+| <span id="651">651</span> | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard) | Medium |
+| <span id="650">650</span> | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard "只有两个键的键盘") | [Go](https://github.com/openset/leetcode/tree/master/problems/2-keys-keyboard) | Medium |
+| <span id="649">649</span> | [Dota2 Senate](https://leetcode.com/problems/dota2-senate "Dota2 参议院") | [Go](https://github.com/openset/leetcode/tree/master/problems/dota2-senate) | Medium |
+| <span id="648">648</span> | [Replace Words](https://leetcode.com/problems/replace-words "单词替换") | [Go](https://github.com/openset/leetcode/tree/master/problems/replace-words) | Medium |
+| <span id="647">647</span> | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings "回文子串") | [Go](https://github.com/openset/leetcode/tree/master/problems/palindromic-substrings) | Medium |
+| <span id="646">646</span> | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain "最长数对链") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-pair-chain) | Medium |
+| <span id="645">645</span> | [Set Mismatch](https://leetcode.com/problems/set-mismatch "错误的集合") | [Go](https://github.com/openset/leetcode/tree/master/problems/set-mismatch) | Easy |
+| <span id="644">644</span> | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-ii) | Hard |
+| <span id="643">643</span> | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i "子数组最大平均数 I") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-i) | Easy |
+| <span id="642">642</span> | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-search-autocomplete-system) | Hard |
+| <span id="641">641</span> | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque "设计循环双端队列") | [Go](https://github.com/openset/leetcode/tree/master/problems/design-circular-deque) | Medium |
+| <span id="640">640</span> | [Solve the Equation](https://leetcode.com/problems/solve-the-equation "求解方程") | [Go](https://github.com/openset/leetcode/tree/master/problems/solve-the-equation) | Medium |
+| <span id="639">639</span> | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii "解码方法 2") | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-ways-ii) | Hard |
+| <span id="638">638</span> | [Shopping Offers](https://leetcode.com/problems/shopping-offers "大礼包") | [Go](https://github.com/openset/leetcode/tree/master/problems/shopping-offers) | Medium |
+| <span id="637">637</span> | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree "二叉树的层平均值") | [Go](https://github.com/openset/leetcode/tree/master/problems/average-of-levels-in-binary-tree) | Easy |
+| <span id="636">636</span> | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions "函数的独占时间") | [Go](https://github.com/openset/leetcode/tree/master/problems/exclusive-time-of-functions) | Medium |
+| <span id="635">635</span> | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-log-storage-system) | Medium |
+| <span id="634">634</span> | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-derangement-of-an-array) | Medium |
+| <span id="633">633</span> | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers "平方数之和") | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-square-numbers) | Easy |
+| <span id="632">632</span> | [Smallest Range](https://leetcode.com/problems/smallest-range "最小区间") | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range) | Hard |
+| <span id="631">631</span> | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-excel-sum-formula) | Hard |
+| <span id="630">630</span> | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii "课程表 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule-iii) | Hard |
+| <span id="629">629</span> | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array "K个逆序对数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/k-inverse-pairs-array) | Hard |
+| <span id="628">628</span> | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers "三个数的最大乘积") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers) | Easy |
+| <span id="627">627</span> | [Swap Salary](https://leetcode.com/problems/swap-salary "交换工资") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/swap-salary) | Easy |
+| <span id="626">626</span> | [Exchange Seats](https://leetcode.com/problems/exchange-seats "换座位") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/exchange-seats) | Medium |
+| <span id="625">625</span> | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization) | Medium |
+| <span id="624">624</span> | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-distance-in-arrays) | Easy |
+| <span id="623">623</span> | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree "在二叉树中增加一行") | [Go](https://github.com/openset/leetcode/tree/master/problems/add-one-row-to-tree) | Medium |
+| <span id="622">622</span> | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue "设计循环队列") | [Go](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue) | Medium |
+| <span id="621">621</span> | [Task Scheduler](https://leetcode.com/problems/task-scheduler "任务调度器") | [Go](https://github.com/openset/leetcode/tree/master/problems/task-scheduler) | Medium |
+| <span id="620">620</span> | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies "有趣的电影") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/not-boring-movies) | Easy |
+| <span id="619">619</span> | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/biggest-single-number) | Easy |
+| <span id="618">618</span> | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/students-report-by-geography) | Hard |
+| <span id="617">617</span> | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees "合并二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-two-binary-trees) | Easy |
+| <span id="616">616</span> | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/add-bold-tag-in-string) | Medium |
+| <span id="615">615</span> | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/average-salary-departments-vs-company) | Hard |
+| <span id="614">614</span> | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/second-degree-follower) | Medium |
+| <span id="613">613</span> | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-line) | Easy |
+| <span id="612">612</span> | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-plane) | Medium |
+| <span id="611">611</span> | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number "有效三角形的个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-triangle-number) | Medium |
+| <span id="610">610</span> | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/triangle-judgement) | Easy |
+| <span id="609">609</span> | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system "在系统中查找重复文件") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-file-in-system) | Medium |
+| <span id="608">608</span> | [Tree Node](https://leetcode.com/problems/tree-node "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/tree-node) | Medium |
+| <span id="607">607</span> | [Sales Person](https://leetcode.com/problems/sales-person "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sales-person) | Easy |
+| <span id="606">606</span> | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree "根据二叉树创建字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-string-from-binary-tree) | Easy |
+| <span id="605">605</span> | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers "种花问题") | [Go](https://github.com/openset/leetcode/tree/master/problems/can-place-flowers) | Easy |
+| <span id="604">604</span> | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-compressed-string-iterator) | Easy |
+| <span id="603">603</span> | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-available-seats) | Easy |
+| <span id="602">602</span> | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-ii-who-has-the-most-friends) | Medium |
+| <span id="601">601</span> | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium "体育馆的人流量") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/human-traffic-of-stadium) | Hard |
+| <span id="600">600</span> | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones "不含连续1的非负整数") | [Go](https://github.com/openset/leetcode/tree/master/problems/non-negative-integers-without-consecutive-ones) | Hard |
+| <span id="599">599</span> | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists "两个列表的最小索引总和") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-index-sum-of-two-lists) | Easy |
+| <span id="598">598</span> | [Range Addition II](https://leetcode.com/problems/range-addition-ii "范围求和 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/range-addition-ii) | Easy |
+| <span id="597">597</span> | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-i-overall-acceptance-rate) | Easy |
+| <span id="596">596</span> | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students "超过5名学生的课") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/classes-more-than-5-students) | Easy |
+| <span id="595">595</span> | [Big Countries](https://leetcode.com/problems/big-countries "大的国家") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/big-countries) | Easy |
+| <span id="594">594</span> | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence "最长和谐子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-harmonious-subsequence) | Easy |
+| <span id="593">593</span> | [Valid Square](https://leetcode.com/problems/valid-square "有效的正方形") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-square) | Medium |
+| <span id="592">592</span> | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction "分数加减运算") | [Go](https://github.com/openset/leetcode/tree/master/problems/fraction-addition-and-subtraction) | Medium |
+| <span id="591">591</span> | [Tag Validator](https://leetcode.com/problems/tag-validator "标签验证器") | [Go](https://github.com/openset/leetcode/tree/master/problems/tag-validator) | Hard |
+| <span id="590">590</span> | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal "N叉树的后序遍历") | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-postorder-traversal) | Easy |
+| <span id="589">589</span> | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal "N叉树的前序遍历") | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-preorder-traversal) | Easy |
+| <span id="588">588</span> | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system) | Hard |
+| <span id="587">587</span> | [Erect the Fence](https://leetcode.com/problems/erect-the-fence "安装栅栏") | [Go](https://github.com/openset/leetcode/tree/master/problems/erect-the-fence) | Hard |
+| <span id="586">586</span> | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/customer-placing-the-largest-number-of-orders) | Easy |
+| <span id="585">585</span> | [Investments in 2016](https://leetcode.com/problems/investments-in-2016 "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/investments-in-2016) | Medium |
+| <span id="584">584</span> | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-customer-referee) | Easy |
+| <span id="583">583</span> | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings "两个字符串的删除操作") | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-operation-for-two-strings) | Medium |
+| <span id="582">582</span> | [Kill Process](https://leetcode.com/problems/kill-process "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/kill-process) | Medium |
+| <span id="581">581</span> | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray "最短无序连续子数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-unsorted-continuous-subarray) | Easy |
+| <span id="580">580</span> | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/count-student-number-in-departments) | Medium |
+| <span id="579">579</span> | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-cumulative-salary-of-an-employee) | Hard |
+| <span id="578">578</span> | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/get-highest-answer-rate-question) | Medium |
+| <span id="577">577</span> | [Employee Bonus](https://leetcode.com/problems/employee-bonus "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-bonus) | Easy |
+| <span id="576">576</span> | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths "出界的路径数") | [Go](https://github.com/openset/leetcode/tree/master/problems/out-of-boundary-paths) | Medium |
+| <span id="575">575</span> | [Distribute Candies](https://leetcode.com/problems/distribute-candies "分糖果") | [Go](https://github.com/openset/leetcode/tree/master/problems/distribute-candies) | Easy |
+| <span id="574">574</span> | [Winning Candidate](https://leetcode.com/problems/winning-candidate "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/winning-candidate) | Medium |
+| <span id="573">573</span> | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/squirrel-simulation) | Medium |
+| <span id="572">572</span> | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree "另一个树的子树") | [Go](https://github.com/openset/leetcode/tree/master/problems/subtree-of-another-tree) | Easy |
+| <span id="571">571</span> | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-median-given-frequency-of-numbers) | Hard |
+| <span id="570">570</span> | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/managers-with-at-least-5-direct-reports) | Medium |
+| <span id="569">569</span> | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/median-employee-salary) | Hard |
+| <span id="568">568</span> | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-vacation-days) | Hard |
+| <span id="567">567</span> | [Permutation in String](https://leetcode.com/problems/permutation-in-string "字符串的排列") | [Go](https://github.com/openset/leetcode/tree/master/problems/permutation-in-string) | Medium |
+| <span id="566">566</span> | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix "重塑矩阵") | [Go](https://github.com/openset/leetcode/tree/master/problems/reshape-the-matrix) | Easy |
+| <span id="565">565</span> | [Array Nesting](https://leetcode.com/problems/array-nesting "数组嵌套") | [Go](https://github.com/openset/leetcode/tree/master/problems/array-nesting) | Medium |
+| <span id="564">564</span> | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome "寻找最近的回文数") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-closest-palindrome) | Hard |
+| <span id="563">563</span> | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt "二叉树的坡度") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-tilt) | Easy |
+| <span id="562">562</span> | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-line-of-consecutive-one-in-matrix) | Medium |
+| <span id="561">561</span> | [Array Partition I](https://leetcode.com/problems/array-partition-i "数组拆分 I") | [Go](https://github.com/openset/leetcode/tree/master/problems/array-partition-i) | Easy |
+| <span id="560">560</span> | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k "和为K的子数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k) | Medium |
+| <span id="559">559</span> | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree "N叉树的最大深度") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-n-ary-tree) | Easy |
+| <span id="558">558</span> | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection "四叉树交集") | [Go](https://github.com/openset/leetcode/tree/master/problems/quad-tree-intersection) | Easy |
+| <span id="557">557</span> | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii "反转字符串中的单词 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-iii) | Easy |
+| <span id="556">556</span> | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii "下一个更大元素 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-iii) | Medium |
+| <span id="555">555</span> | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-concatenated-strings) | Medium |
+| <span id="554">554</span> | [Brick Wall](https://leetcode.com/problems/brick-wall "砖墙") | [Go](https://github.com/openset/leetcode/tree/master/problems/brick-wall) | Medium |
+| <span id="553">553</span> | [Optimal Division](https://leetcode.com/problems/optimal-division "最优除法") | [Go](https://github.com/openset/leetcode/tree/master/problems/optimal-division) | Medium |
+| <span id="552">552</span> | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii "学生出勤记录 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-ii) | Hard |
+| <span id="551">551</span> | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i "学生出勤记录 I") | [Go](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-i) | Easy |
+| <span id="549">549</span> | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence-ii) | Medium |
+| <span id="548">548</span> | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-with-equal-sum) | Medium |
+| <span id="547">547</span> | [Friend Circles](https://leetcode.com/problems/friend-circles "朋友圈") | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-circles) | Medium |
+| <span id="546">546</span> | [Remove Boxes](https://leetcode.com/problems/remove-boxes "移除盒子") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-boxes) | Hard |
+| <span id="545">545</span> | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/boundary-of-binary-tree) | Medium |
+| <span id="544">544</span> | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/output-contest-matches) | Medium |
+| <span id="543">543</span> | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree "二叉树的直径") | [Go](https://github.com/openset/leetcode/tree/master/problems/diameter-of-binary-tree) | Easy |
+| <span id="542">542</span> | [01 Matrix](https://leetcode.com/problems/01-matrix "01 矩阵") | [Go](https://github.com/openset/leetcode/tree/master/problems/01-matrix) | Medium |
+| <span id="541">541</span> | [Reverse String II](https://leetcode.com/problems/reverse-string-ii "反转字符串 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-string-ii) | Easy |
+| <span id="540">540</span> | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array "有序数组中的单一元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/single-element-in-a-sorted-array) | Medium |
+| <span id="539">539</span> | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference "最小时间差") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-time-difference) | Medium |
+| <span id="538">538</span> | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree "把二叉搜索树转换为累加树") | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-bst-to-greater-tree) | Easy |
+| <span id="537">537</span> | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication "复数乘法") | [Go](https://github.com/openset/leetcode/tree/master/problems/complex-number-multiplication) | Medium |
+| <span id="536">536</span> | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-string) | Medium |
+| <span id="535">535</span> | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl "TinyURL 的加密与解密") | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-tinyurl) | Medium |
+| <span id="533">533</span> | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii) | Medium |
+| <span id="532">532</span> | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array "数组中的K-diff数对") | [Go](https://github.com/openset/leetcode/tree/master/problems/k-diff-pairs-in-an-array) | Easy |
+| <span id="531">531</span> | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i) | Medium |
+| <span id="530">530</span> | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst "二叉搜索树的最小绝对差") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst) | Easy |
+| <span id="529">529</span> | [Minesweeper](https://leetcode.com/problems/minesweeper "扫雷游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/minesweeper) | Medium |
+| <span id="528">528</span> | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight "按权重随机选择") | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-weight) | Medium |
+| <span id="527">527</span> | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation) | Hard |
+| <span id="526">526</span> | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement "优美的排列") | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement) | Medium |
+| <span id="525">525</span> | [Contiguous Array](https://leetcode.com/problems/contiguous-array "连续数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/contiguous-array) | Medium |
+| <span id="524">524</span> | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting "通过删除字母匹配到字典里最长单词") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary-through-deleting) | Medium |
+| <span id="523">523</span> | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum "连续的子数组和") | [Go](https://github.com/openset/leetcode/tree/master/problems/continuous-subarray-sum) | Medium |
+| <span id="522">522</span> | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii "最长特殊序列 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-ii) | Medium |
+| <span id="521">521</span> | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i "最长特殊序列 Ⅰ") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-i) | Easy |
+| <span id="520">520</span> | [Detect Capital](https://leetcode.com/problems/detect-capital "检测大写字母") | [Go](https://github.com/openset/leetcode/tree/master/problems/detect-capital) | Easy |
+| <span id="519">519</span> | [Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix "随机翻转矩阵") | [Go](https://github.com/openset/leetcode/tree/master/problems/random-flip-matrix) | Medium |
+| <span id="518">518</span> | [Coin Change 2](https://leetcode.com/problems/coin-change-2 "零钱兑换 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-change-2) | Medium |
+| <span id="517">517</span> | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines "超级洗衣机") | [Go](https://github.com/openset/leetcode/tree/master/problems/super-washing-machines) | Hard |
+| <span id="516">516</span> | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence "最长回文子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-subsequence) | Medium |
+| <span id="515">515</span> | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row "在每个树行中找最大值") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row) | Medium |
+| <span id="514">514</span> | [Freedom Trail](https://leetcode.com/problems/freedom-trail "自由之路") | [Go](https://github.com/openset/leetcode/tree/master/problems/freedom-trail) | Hard |
+| <span id="513">513</span> | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value "找树左下角的值") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value) | Medium |
+| <span id="508">508</span> | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum "出现次数最多的子树元素和") | [Go](https://github.com/openset/leetcode/tree/master/problems/most-frequent-subtree-sum) | Medium |
+| <span id="507">507</span> | [Perfect Number](https://leetcode.com/problems/perfect-number "完美数") | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-number) | Easy |
+| <span id="506">506</span> | [Relative Ranks](https://leetcode.com/problems/relative-ranks "相对名次") | [Go](https://github.com/openset/leetcode/tree/master/problems/relative-ranks) | Easy |
+| <span id="505">505</span> | [The Maze II](https://leetcode.com/problems/the-maze-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii) | Medium |
+| <span id="504">504</span> | [Base 7](https://leetcode.com/problems/base-7 "七进制数") | [Go](https://github.com/openset/leetcode/tree/master/problems/base-7) | Easy |
+| <span id="503">503</span> | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii "下一个更大元素 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-ii) | Medium |
+| <span id="502">502</span> | [IPO](https://leetcode.com/problems/ipo "IPO") | [Go](https://github.com/openset/leetcode/tree/master/problems/ipo) | Hard |
+| <span id="501">501</span> | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree "二叉搜索树中的众数") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-mode-in-binary-search-tree) | Easy |
+| <span id="500">500</span> | [Keyboard Row](https://leetcode.com/problems/keyboard-row "键盘行") | [Go](https://github.com/openset/leetcode/tree/master/problems/keyboard-row) | Easy |
+| <span id="499">499</span> | [The Maze III](https://leetcode.com/problems/the-maze-iii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii) | Hard |
+| <span id="498">498</span> | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse "对角线遍历") | [Go](https://github.com/openset/leetcode/tree/master/problems/diagonal-traverse) | Medium |
+| <span id="497">497</span> | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles "非重叠矩形中的随机点") | [Go](https://github.com/openset/leetcode/tree/master/problems/random-point-in-non-overlapping-rectangles) | Medium |
+| <span id="496">496</span> | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i "下一个更大元素 I") | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-i) | Easy |
+| <span id="495">495</span> | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking "提莫攻击") | [Go](https://github.com/openset/leetcode/tree/master/problems/teemo-attacking) | Medium |
+| <span id="494">494</span> | [Target Sum](https://leetcode.com/problems/target-sum "目标和") | [Go](https://github.com/openset/leetcode/tree/master/problems/target-sum) | Medium |
+| <span id="493">493</span> | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs "翻转对") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | Hard |
+| <span id="492">492</span> | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle "构造矩形") | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-the-rectangle) | Easy |
+| <span id="491">491</span> | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences "递增子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-subsequences) | Medium |
+| <span id="490">490</span> | [The Maze](https://leetcode.com/problems/the-maze "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze) | Medium |
+| <span id="489">489</span> | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/robot-room-cleaner) | Hard |
+| <span id="488">488</span> | [Zuma Game](https://leetcode.com/problems/zuma-game "祖玛游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/zuma-game) | Hard |
+| <span id="487">487</span> | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-ii) | Medium |
+| <span id="486">486</span> | [Predict the Winner](https://leetcode.com/problems/predict-the-winner "预测赢家") | [Go](https://github.com/openset/leetcode/tree/master/problems/predict-the-winner) | Medium |
+| <span id="485">485</span> | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones "最大连续1的个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones) | Easy |
+| <span id="484">484</span> | [Find Permutation](https://leetcode.com/problems/find-permutation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-permutation) | Medium |
+| <span id="483">483</span> | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base "最小好进制") | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-good-base) | Hard |
+| <span id="482">482</span> | [License Key Formatting](https://leetcode.com/problems/license-key-formatting "密钥格式化") | [Go](https://github.com/openset/leetcode/tree/master/problems/license-key-formatting) | Easy |
+| <span id="481">481</span> | [Magical String](https://leetcode.com/problems/magical-string "神奇字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/magical-string) | Medium |
+| <span id="480">480</span> | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median "滑动窗口中位数") | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-window-median) | Hard |
+| <span id="479">479</span> | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product "最大回文数乘积") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-palindrome-product) | Easy |
+| <span id="478">478</span> | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle "在圆内随机生成点") | [Go](https://github.com/openset/leetcode/tree/master/problems/generate-random-point-in-a-circle) | Medium |
+| <span id="477">477</span> | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance "汉明距离总和") | [Go](https://github.com/openset/leetcode/tree/master/problems/total-hamming-distance) | Medium |
+| <span id="476">476</span> | [Number Complement](https://leetcode.com/problems/number-complement "数字的补数") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-complement) | Easy |
+| <span id="475">475</span> | [Heaters](https://leetcode.com/problems/heaters "供暖器") | [Go](https://github.com/openset/leetcode/tree/master/problems/heaters) | Easy |
+| <span id="474">474</span> | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes "一和零") | [Go](https://github.com/openset/leetcode/tree/master/problems/ones-and-zeroes) | Medium |
+| <span id="473">473</span> | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square "火柴拼正方形") | [Go](https://github.com/openset/leetcode/tree/master/problems/matchsticks-to-square) | Medium |
+| <span id="472">472</span> | [Concatenated Words](https://leetcode.com/problems/concatenated-words "连接词") | [Go](https://github.com/openset/leetcode/tree/master/problems/concatenated-words) | Hard |
+| <span id="471">471</span> | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length) | Hard |
+| <span id="470">470</span> | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7 "用 Rand7() 实现 Rand10()") | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-rand10-using-rand7) | Medium |
+| <span id="469">469</span> | [Convex Polygon](https://leetcode.com/problems/convex-polygon "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/convex-polygon) | Medium |
+| <span id="468">468</span> | [Validate IP Address](https://leetcode.com/problems/validate-ip-address "验证IP地址") | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-ip-address) | Medium |
+| <span id="467">467</span> | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string "环绕字符串中唯一的子字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-substrings-in-wraparound-string) | Medium |
+| <span id="466">466</span> | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions "统计重复个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-the-repetitions) | Hard |
+| <span id="465">465</span> | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/optimal-account-balancing) | Hard |
+| <span id="464">464</span> | [Can I Win](https://leetcode.com/problems/can-i-win "我能赢吗") | [Go](https://github.com/openset/leetcode/tree/master/problems/can-i-win) | Medium |
+| <span id="463">463</span> | [Island Perimeter](https://leetcode.com/problems/island-perimeter "岛屿的周长") | [Go](https://github.com/openset/leetcode/tree/master/problems/island-perimeter) | Easy |
+| <span id="462">462</span> | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii "最少移动次数使数组元素相等 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements-ii) | Medium |
+| <span id="461">461</span> | [Hamming Distance](https://leetcode.com/problems/hamming-distance "汉明距离") | [Go](https://github.com/openset/leetcode/tree/master/problems/hamming-distance) | Easy |
+| <span id="460">460</span> | [LFU Cache](https://leetcode.com/problems/lfu-cache "LFU缓存") | [Go](https://github.com/openset/leetcode/tree/master/problems/lfu-cache) | Hard |
+| <span id="459">459</span> | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern "重复的子字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-substring-pattern) | Easy |
+| <span id="458">458</span> | [Poor Pigs](https://leetcode.com/problems/poor-pigs "可怜的小猪") | [Go](https://github.com/openset/leetcode/tree/master/problems/poor-pigs) | Easy |
+| <span id="457">457</span> | [Circular Array Loop](https://leetcode.com/problems/circular-array-loop "环形数组循环") | [Go](https://github.com/openset/leetcode/tree/master/problems/circular-array-loop) | Medium |
+| <span id="456">456</span> | [132 Pattern](https://leetcode.com/problems/132-pattern "132模式") | [Go](https://github.com/openset/leetcode/tree/master/problems/132-pattern) | Medium |
+| <span id="455">455</span> | [Assign Cookies](https://leetcode.com/problems/assign-cookies "分发饼干") | [Go](https://github.com/openset/leetcode/tree/master/problems/assign-cookies) | Easy |
+| <span id="454">454</span> | [4Sum II](https://leetcode.com/problems/4sum-ii "四数相加 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/4sum-ii) | Medium |
+| <span id="453">453</span> | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements "最小移动次数使数组元素相等") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements) | Easy |
+| <span id="452">452</span> | [Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons "用最少数量的箭引爆气球") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-arrows-to-burst-balloons) | Medium |
+| <span id="451">451</span> | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency "根据字符出现频率排序") | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-characters-by-frequency) | Medium |
+| <span id="450">450</span> | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst "删除二叉搜索树中的节点") | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-bst) | Medium |
+| <span id="449">449</span> | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst "序列化和反序列化二叉搜索树") | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-bst) | Medium |
+| <span id="448">448</span> | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array "找到所有数组中消失的数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-numbers-disappeared-in-an-array) | Easy |
+| <span id="447">447</span> | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs "回旋镖的数量") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-boomerangs) | Easy |
+| <span id="446">446</span> | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence "等差数列划分 II - 子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices-ii-subsequence) | Hard |
+| <span id="445">445</span> | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii "两数相加 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers-ii) | Medium |
+| <span id="444">444</span> | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sequence-reconstruction) | Medium |
+| <span id="443">443</span> | [String Compression](https://leetcode.com/problems/string-compression "压缩字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/string-compression) | Easy |
+| <span id="442">442</span> | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array "数组中重复的数据") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-duplicates-in-an-array) | Medium |
+| <span id="441">441</span> | [Arranging Coins](https://leetcode.com/problems/arranging-coins "排列硬币") | [Go](https://github.com/openset/leetcode/tree/master/problems/arranging-coins) | Easy |
+| <span id="440">440</span> | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order "字典序的第K小数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-in-lexicographical-order) | Hard |
+| <span id="439">439</span> | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser) | Medium |
+| <span id="438">438</span> | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string "找到字符串中所有字母异位词") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-anagrams-in-a-string) | Easy |
+| <span id="437">437</span> | [Path Sum III](https://leetcode.com/problems/path-sum-iii "路径总和 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-iii) | Easy |
+| <span id="436">436</span> | [Find Right Interval](https://leetcode.com/problems/find-right-interval "寻找右区间") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-right-interval) | Medium |
+| <span id="435">435</span> | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals "无重叠区间") | [Go](https://github.com/openset/leetcode/tree/master/problems/non-overlapping-intervals) | Medium |
+| <span id="434">434</span> | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string "字符串中的单词数") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-segments-in-a-string) | Easy |
+| <span id="433">433</span> | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation "最小基因变化") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-genetic-mutation) | Medium |
+| <span id="432">432</span> | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure "全 O(1) 的数据结构") | [Go](https://github.com/openset/leetcode/tree/master/problems/all-oone-data-structure) | Hard |
+| <span id="431">431</span> | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-n-ary-tree-to-binary-tree) | Hard |
+| <span id="430">430</span> | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list "扁平化多级双向链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-a-multilevel-doubly-linked-list) | Medium |
+| <span id="429">429</span> | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal "N叉树的层序遍历") | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-level-order-traversal) | Easy |
+| <span id="428">428</span> | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree) | Hard |
+| <span id="427">427</span> | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree "建立四叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-quad-tree) | Easy |
+| <span id="426">426</span> | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
+| <span id="425">425</span> | [Word Squares](https://leetcode.com/problems/word-squares "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-squares) | Hard |
+| <span id="424">424</span> | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement "替换后的最长重复字符") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-character-replacement) | Medium |
+| <span id="423">423</span> | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english "从英文中重建数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/reconstruct-original-digits-from-english) | Medium |
+| <span id="422">422</span> | [Valid Word Square](https://leetcode.com/problems/valid-word-square "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-word-square) | Easy |
+| <span id="421">421</span> | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array "数组中两个数的最大异或值") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-xor-of-two-numbers-in-an-array) | Medium |
+| <span id="420">420</span> | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker "强密码检验器") | [Go](https://github.com/openset/leetcode/tree/master/problems/strong-password-checker) | Hard |
+| <span id="419">419</span> | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board "甲板上的战舰") | [Go](https://github.com/openset/leetcode/tree/master/problems/battleships-in-a-board) | Medium |
+| <span id="418">418</span> | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-screen-fitting) | Medium |
+| <span id="417">417</span> | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow "太平洋大西洋水流问题") | [Go](https://github.com/openset/leetcode/tree/master/problems/pacific-atlantic-water-flow) | Medium |
+| <span id="416">416</span> | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum "分割等和子集") | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-equal-subset-sum) | Medium |
+| <span id="415">415</span> | [Add Strings](https://leetcode.com/problems/add-strings "字符串相加") | [Go](https://github.com/openset/leetcode/tree/master/problems/add-strings) | Easy |
+| <span id="414">414</span> | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number "第三大的数") | [Go](https://github.com/openset/leetcode/tree/master/problems/third-maximum-number) | Easy |
+| <span id="413">413</span> | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices "等差数列划分") | [Go](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices) | Medium |
+| <span id="412">412</span> | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz "Fizz Buzz") | [Go](https://github.com/openset/leetcode/tree/master/problems/fizz-buzz) | Easy |
+| <span id="411">411</span> | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-unique-word-abbreviation) | Hard |
+| <span id="410">410</span> | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum "分割数组的最大值") | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-largest-sum) | Hard |
+| <span id="409">409</span> | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome "最长回文串") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindrome) | Easy |
+| <span id="408">408</span> | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-word-abbreviation) | Easy |
+| <span id="407">407</span> | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii "接雨水 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water-ii) | Hard |
+| <span id="406">406</span> | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height "根据身高重建队列") | [Go](https://github.com/openset/leetcode/tree/master/problems/queue-reconstruction-by-height) | Medium |
+| <span id="405">405</span> | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal "数字转换为十六进制数") | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-a-number-to-hexadecimal) | Easy |
+| <span id="404">404</span> | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves "左叶子之和") | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-left-leaves) | Easy |
+| <span id="403">403</span> | [Frog Jump](https://leetcode.com/problems/frog-jump "青蛙过河") | [Go](https://github.com/openset/leetcode/tree/master/problems/frog-jump) | Hard |
+| <span id="402">402</span> | [Remove K Digits](https://leetcode.com/problems/remove-k-digits "移掉K位数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-k-digits) | Medium |
+| <span id="401">401</span> | [Binary Watch](https://leetcode.com/problems/binary-watch "二进制手表") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-watch) | Easy |
+| <span id="400">400</span> | [Nth Digit](https://leetcode.com/problems/nth-digit "第N个数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/nth-digit) | Easy |
+| <span id="399">399</span> | [Evaluate Division](https://leetcode.com/problems/evaluate-division "除法求值") | [Go](https://github.com/openset/leetcode/tree/master/problems/evaluate-division) | Medium |
+| <span id="398">398</span> | [Random Pick Index](https://leetcode.com/problems/random-pick-index "随机数索引") | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-index) | Medium |
+| <span id="397">397</span> | [Integer Replacement](https://leetcode.com/problems/integer-replacement "整数替换") | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-replacement) | Medium |
+| <span id="396">396</span> | [Rotate Function](https://leetcode.com/problems/rotate-function "旋转函数") | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-function) | Medium |
+| <span id="395">395</span> | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters "至少有K个重复字符的最长子串") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-least-k-repeating-characters) | Medium |
+| <span id="394">394</span> | [Decode String](https://leetcode.com/problems/decode-string "字符串解码") | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-string) | Medium |
+| <span id="393">393</span> | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation "UTF-8 编码验证") | [Go](https://github.com/openset/leetcode/tree/master/problems/utf-8-validation) | Medium |
+| <span id="392">392</span> | [Is Subsequence](https://leetcode.com/problems/is-subsequence "判断子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/is-subsequence) | Medium |
+| <span id="391">391</span> | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle "完美矩形") | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-rectangle) | Hard |
+| <span id="390">390</span> | [Elimination Game](https://leetcode.com/problems/elimination-game "消除游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/elimination-game) | Medium |
+| <span id="389">389</span> | [Find the Difference](https://leetcode.com/problems/find-the-difference "找不同") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-difference) | Easy |
+| <span id="388">388</span> | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path "文件的最长绝对路径") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-absolute-file-path) | Medium |
+| <span id="387">387</span> | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string "字符串中的第一个唯一字符") | [Go](https://github.com/openset/leetcode/tree/master/problems/first-unique-character-in-a-string) | Easy |
+| <span id="386">386</span> | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers "字典序排数") | [Go](https://github.com/openset/leetcode/tree/master/problems/lexicographical-numbers) | Medium |
+| <span id="385">385</span> | [Mini Parser](https://leetcode.com/problems/mini-parser "迷你语法分析器") | [Go](https://github.com/openset/leetcode/tree/master/problems/mini-parser) | Medium |
+| <span id="384">384</span> | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array "打乱数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/shuffle-an-array) | Medium |
+| <span id="383">383</span> | [Ransom Note](https://leetcode.com/problems/ransom-note "赎金信") | [Go](https://github.com/openset/leetcode/tree/master/problems/ransom-note) | Easy |
+| <span id="382">382</span> | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node "链表随机节点") | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-random-node) | Medium |
+| <span id="381">381</span> | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed "O(1) 时间插入、删除和获取随机元素 - 允许重复") | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1-duplicates-allowed) | Hard |
+| <span id="380">380</span> | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1 "常数时间插入、删除和获取随机元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1) | Medium |
+| <span id="379">379</span> | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-phone-directory) | Medium |
+| <span id="378">378</span> | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix "有序矩阵中第K小的元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-sorted-matrix) | Medium |
+| <span id="377">377</span> | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv "组合总和 Ⅳ") | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iv) | Medium |
+| <span id="376">376</span> | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence "摆动序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-subsequence) | Medium |
+| <span id="375">375</span> | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii "猜数字大小 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower-ii) | Medium |
+| <span id="374">374</span> | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower "猜数字大小") | [Go](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower) | Easy |
+| <span id="373">373</span> | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums "查找和最小的K对数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-pairs-with-smallest-sums) | Medium |
+| <span id="372">372</span> | [Super Pow](https://leetcode.com/problems/super-pow "超级次方") | [Go](https://github.com/openset/leetcode/tree/master/problems/super-pow) | Medium |
+| <span id="371">371</span> | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers "两整数之和") | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-two-integers) | Easy |
+| <span id="370">370</span> | [Range Addition](https://leetcode.com/problems/range-addition "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/range-addition) | Medium |
+| <span id="369">369</span> | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/plus-one-linked-list) | Medium |
+| <span id="368">368</span> | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset "最大整除子集") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-divisible-subset) | Medium |
+| <span id="367">367</span> | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square "有效的完全平方数") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-perfect-square) | Easy |
+| <span id="366">366</span> | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-leaves-of-binary-tree) | Medium |
+| <span id="365">365</span> | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem "水壶问题") | [Go](https://github.com/openset/leetcode/tree/master/problems/water-and-jug-problem) | Medium |
+| <span id="364">364</span> | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum-ii) | Medium |
+| <span id="363">363</span> | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k "矩形区域不超过 K 的最大数值和") | [Go](https://github.com/openset/leetcode/tree/master/problems/max-sum-of-rectangle-no-larger-than-k) | Hard |
+| <span id="362">362</span> | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hit-counter) | Medium |
+| <span id="361">361</span> | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/bomb-enemy) | Medium |
+| <span id="360">360</span> | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-transformed-array) | Medium |
+| <span id="359">359</span> | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/logger-rate-limiter) | Easy |
+| <span id="358">358</span> | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart) | Hard |
+| <span id="357">357</span> | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits "计算各个位数不同的数字个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-numbers-with-unique-digits) | Medium |
+| <span id="356">356</span> | [Line Reflection](https://leetcode.com/problems/line-reflection "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/line-reflection) | Medium |
+| <span id="355">355</span> | [Design Twitter](https://leetcode.com/problems/design-twitter "设计推特") | [Go](https://github.com/openset/leetcode/tree/master/problems/design-twitter) | Medium |
+| <span id="354">354</span> | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes "俄罗斯套娃信封问题") | [Go](https://github.com/openset/leetcode/tree/master/problems/russian-doll-envelopes) | Hard |
+| <span id="353">353</span> | [Design Snake Game](https://leetcode.com/problems/design-snake-game "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-snake-game) | Medium |
+| <span id="352">352</span> | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals "将数据流变为多个不相交间隔") | [Go](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals) | Hard |
+| <span id="351">351</span> | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns) | Medium |
+| <span id="350">350</span> | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii "两个数组的交集 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii) | Easy |
+| <span id="349">349</span> | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays "两个数组的交集") | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays) | Easy |
+| <span id="348">348</span> | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-tic-tac-toe) | Medium |
+| <span id="347">347</span> | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements "前K个高频元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements) | Medium |
+| <span id="346">346</span> | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/moving-average-from-data-stream) | Easy |
+| <span id="345">345</span> | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string "反转字符串中的元音字母") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-vowels-of-a-string) | Easy |
+| <span id="344">344</span> | [Reverse String](https://leetcode.com/problems/reverse-string "反转字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-string) | Easy |
+| <span id="343">343</span> | [Integer Break](https://leetcode.com/problems/integer-break "整数拆分") | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-break) | Medium |
+| <span id="342">342</span> | [Power of Four](https://leetcode.com/problems/power-of-four "4的幂") | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-four) | Easy |
+| <span id="341">341</span> | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator "扁平化嵌套列表迭代器") | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator) | Medium |
+| <span id="340">340</span> | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters) | Hard |
+| <span id="339">339</span> | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum) | Easy |
+| <span id="338">338</span> | [Counting Bits](https://leetcode.com/problems/counting-bits "比特位计数") | [Go](https://github.com/openset/leetcode/tree/master/problems/counting-bits) | Medium |
+| <span id="337">337</span> | [House Robber III](https://leetcode.com/problems/house-robber-iii "打家劫舍 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber-iii) | Medium |
+| <span id="336">336</span> | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs "回文对") | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-pairs) | Hard |
+| <span id="335">335</span> | [Self Crossing](https://leetcode.com/problems/self-crossing "路径交叉") | [Go](https://github.com/openset/leetcode/tree/master/problems/self-crossing) | Hard |
+| <span id="334">334</span> | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence "递增的三元子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-triplet-subsequence) | Medium |
+| <span id="333">333</span> | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-bst-subtree) | Medium |
+| <span id="332">332</span> | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary "重新安排行程") | [Go](https://github.com/openset/leetcode/tree/master/problems/reconstruct-itinerary) | Medium |
+| <span id="331">331</span> | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree "验证二叉树的前序序列化") | [Go](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-serialization-of-a-binary-tree) | Medium |
+| <span id="330">330</span> | [Patching Array](https://leetcode.com/problems/patching-array "按要求补齐数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/patching-array) | Hard |
+| <span id="329">329</span> | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix "矩阵中的最长递增路径") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-path-in-a-matrix) | Hard |
+| <span id="328">328</span> | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list "奇偶链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/odd-even-linked-list) | Medium |
+| <span id="327">327</span> | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum "区间和的个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) | Hard |
+| <span id="326">326</span> | [Power of Three](https://leetcode.com/problems/power-of-three "3的幂") | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-three) | Easy |
+| <span id="325">325</span> | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-size-subarray-sum-equals-k) | Medium |
+| <span id="324">324</span> | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii "摆动排序 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort-ii) | Medium |
+| <span id="323">323</span> | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) | Medium |
+| <span id="322">322</span> | [Coin Change](https://leetcode.com/problems/coin-change "零钱兑换") | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-change) | Medium |
+| <span id="321">321</span> | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number "拼接最大数") | [Go](https://github.com/openset/leetcode/tree/master/problems/create-maximum-number) | Hard |
+| <span id="320">320</span> | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) | Medium |
+| <span id="319">319</span> | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher "灯泡开关") | [Go](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher) | Medium |
+| <span id="318">318</span> | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths "最大单词长度乘积") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-word-lengths) | Medium |
+| <span id="317">317</span> | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) | Hard |
+| <span id="316">316</span> | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters "去除重复字母") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicate-letters) | Hard |
+| <span id="315">315</span> | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self "计算右侧小于当前元素的个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | Hard |
+| <span id="314">314</span> | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal) | Medium |
+| <span id="313">313</span> | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number "超级丑数") | [Go](https://github.com/openset/leetcode/tree/master/problems/super-ugly-number) | Medium |
+| <span id="312">312</span> | [Burst Balloons](https://leetcode.com/problems/burst-balloons "戳气球") | [Go](https://github.com/openset/leetcode/tree/master/problems/burst-balloons) | Hard |
+| <span id="311">311</span> | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sparse-matrix-multiplication) | Medium |
+| <span id="310">310</span> | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees "最小高度树") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees) | Medium |
+| <span id="309">309</span> | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown "最佳买卖股票时机含冷冻期") | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
+| <span id="308">308</span> | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) | Hard |
+| <span id="307">307</span> | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable "区域和检索 - 数组可修改") | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable) | Medium |
+| <span id="306">306</span> | [Additive Number](https://leetcode.com/problems/additive-number "累加数") | [Go](https://github.com/openset/leetcode/tree/master/problems/additive-number) | Medium |
+| <span id="305">305</span> | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-islands-ii) | Hard |
+| <span id="304">304</span> | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable "二维区域和检索 - 矩阵不可变") | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-immutable) | Medium |
+| <span id="303">303</span> | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable "区域和检索 - 数组不可变") | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-immutable) | Easy |
+| <span id="302">302</span> | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-rectangle-enclosing-black-pixels) | Hard |
+| <span id="301">301</span> | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses "删除无效的括号") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-invalid-parentheses) | Hard |
+| <span id="300">300</span> | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence "最长上升子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence) | Medium |
+| <span id="299">299</span> | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows "猜数字游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/bulls-and-cows) | Medium |
+| <span id="298">298</span> | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence) | Medium |
+| <span id="297">297</span> | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree "二叉树的序列化与反序列化") | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-binary-tree) | Hard |
+| <span id="296">296</span> | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/best-meeting-point) | Hard |
+| <span id="295">295</span> | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream "数据流的中位数") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-median-from-data-stream) | Hard |
+| <span id="294">294</span> | [Flip Game II](https://leetcode.com/problems/flip-game-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii) | Medium |
+| <span id="293">293</span> | [Flip Game](https://leetcode.com/problems/flip-game "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-game) | Easy |
+| <span id="292">292</span> | [Nim Game](https://leetcode.com/problems/nim-game "Nim游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/nim-game) | Easy |
+| <span id="291">291</span> | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-pattern-ii) | Hard |
+| <span id="290">290</span> | [Word Pattern](https://leetcode.com/problems/word-pattern "单词模式") | [Go](https://github.com/openset/leetcode/tree/master/problems/word-pattern) | Easy |
+| <span id="289">289</span> | [Game of Life](https://leetcode.com/problems/game-of-life "生命游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/game-of-life) | Medium |
+| <span id="288">288</span> | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-word-abbreviation) | Medium |
+| <span id="287">287</span> | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number "寻找重复数") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number) | Medium |
+| <span id="286">286</span> | [Walls and Gates](https://leetcode.com/problems/walls-and-gates "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates) | Medium |
+| <span id="285">285</span> | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst) | Medium |
+| <span id="284">284</span> | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator "顶端迭代器") | [Go](https://github.com/openset/leetcode/tree/master/problems/peeking-iterator) | Medium |
+| <span id="283">283</span> | [Move Zeroes](https://leetcode.com/problems/move-zeroes "移动零") | [Go](https://github.com/openset/leetcode/tree/master/problems/move-zeroes) | Easy |
+| <span id="282">282</span> | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators "给表达式添加运算符") | [Go](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators) | Hard |
+| <span id="281">281</span> | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/zigzag-iterator) | Medium |
+| <span id="280">280</span> | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort) | Medium |
+| <span id="279">279</span> | [Perfect Squares](https://leetcode.com/problems/perfect-squares "完全平方数") | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-squares) | Medium |
+| <span id="278">278</span> | [First Bad Version](https://leetcode.com/problems/first-bad-version "第一个错误的版本") | [Go](https://github.com/openset/leetcode/tree/master/problems/first-bad-version) | Easy |
+| <span id="277">277</span> | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-celebrity) | Medium |
+| <span id="276">276</span> | [Paint Fence](https://leetcode.com/problems/paint-fence "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-fence) | Easy |
+| <span id="275">275</span> | [H-Index II](https://leetcode.com/problems/h-index-ii "H指数 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/h-index-ii) | Medium |
+| <span id="274">274</span> | [H-Index](https://leetcode.com/problems/h-index "H指数") | [Go](https://github.com/openset/leetcode/tree/master/problems/h-index) | Medium |
+| <span id="273">273</span> | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words "整数转换英文表示") | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-to-english-words) | Hard |
+| <span id="272">272</span> | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value-ii) | Hard |
+| <span id="271">271</span> | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-strings) | Medium |
+| <span id="270">270</span> | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value) | Easy |
+| <span id="269">269</span> | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/alien-dictionary) | Hard |
+| <span id="268">268</span> | [Missing Number](https://leetcode.com/problems/missing-number "缺失数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/missing-number) | Easy |
+| <span id="267">267</span> | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation-ii) | Medium |
+| <span id="266">266</span> | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation) | Easy |
+| <span id="265">265</span> | [Paint House II](https://leetcode.com/problems/paint-house-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii) | Hard |
+| <span id="264">264</span> | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii "丑数 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii) | Medium |
+| <span id="263">263</span> | [Ugly Number](https://leetcode.com/problems/ugly-number "丑数") | [Go](https://github.com/openset/leetcode/tree/master/problems/ugly-number) | Easy |
+| <span id="262">262</span> | [Trips and Users](https://leetcode.com/problems/trips-and-users "行程和用户") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/trips-and-users) | Hard |
+| <span id="261">261</span> | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree) | Medium |
+| <span id="260">260</span> | [Single Number III](https://leetcode.com/problems/single-number-iii "只出现一次的数字 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number-iii) | Medium |
+| <span id="259">259</span> | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) | Medium |
+| <span id="258">258</span> | [Add Digits](https://leetcode.com/problems/add-digits "各位相加") | [Go](https://github.com/openset/leetcode/tree/master/problems/add-digits) | Easy |
+| <span id="257">257</span> | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths "二叉树的所有路径") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-paths) | Easy |
+| <span id="256">256</span> | [Paint House](https://leetcode.com/problems/paint-house "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-house) | Easy |
+| <span id="255">255</span> | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-sequence-in-binary-search-tree) | Medium |
+| <span id="254">254</span> | [Factor Combinations](https://leetcode.com/problems/factor-combinations "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/factor-combinations) | Medium |
+| <span id="253">253</span> | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii) | Medium |
+| <span id="252">252</span> | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms) | Easy |
+| <span id="251">251</span> | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector) | Medium |
+| <span id="250">250</span> | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/count-univalue-subtrees) | Medium |
+| <span id="249">249</span> | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/group-shifted-strings) | Medium |
+| <span id="248">248</span> | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-iii) | Hard |
+| <span id="247">247</span> | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-ii) | Medium |
+| <span id="246">246</span> | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number) | Easy |
+| <span id="245">245</span> | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-iii) | Medium |
+| <span id="244">244</span> | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-ii) | Medium |
+| <span id="243">243</span> | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance) | Easy |
+| <span id="242">242</span> | [Valid Anagram](https://leetcode.com/problems/valid-anagram "有效的字母异位词") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-anagram) | Easy |
+| <span id="241">241</span> | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses "为运算表达式设计优先级") | [Go](https://github.com/openset/leetcode/tree/master/problems/different-ways-to-add-parentheses) | Medium |
+| <span id="240">240</span> | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii "搜索二维矩阵 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix-ii) | Medium |
+| <span id="239">239</span> | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum "滑动窗口最大值") | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-window-maximum) | Hard |
+| <span id="238">238</span> | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self "除自身以外数组的乘积") | [Go](https://github.com/openset/leetcode/tree/master/problems/product-of-array-except-self) | Medium |
+| <span id="237">237</span> | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list "删除链表中的节点") | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-linked-list) | Easy |
+| <span id="236">236</span> | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree "二叉树的最近公共祖先") | [Go](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-tree) | Medium |
+| <span id="235">235</span> | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree "二叉搜索树的最近公共祖先") | [Go](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-search-tree) | Easy |
+| <span id="234">234</span> | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list "回文链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-linked-list) | Easy |
+| <span id="233">233</span> | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one "数字1的个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-digit-one) | Hard |
+| <span id="232">232</span> | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks "用栈实现队列") | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-queue-using-stacks) | Easy |
+| <span id="231">231</span> | [Power of Two](https://leetcode.com/problems/power-of-two "2的幂") | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-two) | Easy |
+| <span id="230">230</span> | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst "二叉搜索树中第K小的元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-bst) | Medium |
+| <span id="229">229</span> | [Majority Element II](https://leetcode.com/problems/majority-element-ii "求众数 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/majority-element-ii) | Medium |
+| <span id="228">228</span> | [Summary Ranges](https://leetcode.com/problems/summary-ranges "汇总区间") | [Go](https://github.com/openset/leetcode/tree/master/problems/summary-ranges) | Medium |
+| <span id="227">227</span> | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii "基本计算器 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-ii) | Medium |
+| <span id="226">226</span> | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree "翻转二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/invert-binary-tree) | Easy |
+| <span id="225">225</span> | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues "用队列实现栈") | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-stack-using-queues) | Easy |
+| <span id="224">224</span> | [Basic Calculator](https://leetcode.com/problems/basic-calculator "基本计算器") | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator) | Hard |
+| <span id="223">223</span> | [Rectangle Area](https://leetcode.com/problems/rectangle-area "矩形面积") | [Go](https://github.com/openset/leetcode/tree/master/problems/rectangle-area) | Medium |
+| <span id="222">222</span> | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes "完全二叉树的节点个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-complete-tree-nodes) | Medium |
+| <span id="221">221</span> | [Maximal Square](https://leetcode.com/problems/maximal-square "最大正方形") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximal-square) | Medium |
+| <span id="220">220</span> | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii "存在重复元素 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii) | Medium |
+| <span id="219">219</span> | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii "存在重复元素 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-ii) | Easy |
+| <span id="218">218</span> | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem "天际线问题") | [Go](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem) | Hard |
+| <span id="217">217</span> | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate "存在重复元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate) | Easy |
+| <span id="216">216</span> | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii "组合总和 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iii) | Medium |
+| <span id="215">215</span> | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array "数组中的第K个最大元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-an-array) | Medium |
+| <span id="214">214</span> | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome "最短回文串") | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-palindrome) | Hard |
+| <span id="213">213</span> | [House Robber II](https://leetcode.com/problems/house-robber-ii "打家劫舍 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber-ii) | Medium |
+| <span id="212">212</span> | [Word Search II](https://leetcode.com/problems/word-search-ii "单词搜索 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/word-search-ii) | Hard |
+| <span id="211">211</span> | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design "添加与搜索单词 - 数据结构设计") | [Go](https://github.com/openset/leetcode/tree/master/problems/add-and-search-word-data-structure-design) | Medium |
+| <span id="210">210</span> | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii "课程表 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii) | Medium |
+| <span id="209">209</span> | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum "长度最小的子数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-size-subarray-sum) | Medium |
+| <span id="208">208</span> | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree "实现 Trie (前缀树)") | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree) | Medium |
+| <span id="207">207</span> | [Course Schedule](https://leetcode.com/problems/course-schedule "课程表") | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule) | Medium |
+| <span id="206">206</span> | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list "反转链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list) | Easy |
+| <span id="205">205</span> | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings "同构字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/isomorphic-strings) | Easy |
+| <span id="204">204</span> | [Count Primes](https://leetcode.com/problems/count-primes "计数质数") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-primes) | Easy |
+| <span id="203">203</span> | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements "移除链表元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-linked-list-elements) | Easy |
+| <span id="202">202</span> | [Happy Number](https://leetcode.com/problems/happy-number "快乐数") | [Go](https://github.com/openset/leetcode/tree/master/problems/happy-number) | Easy |
+| <span id="201">201</span> | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range "数字范围按位与") | [Go](https://github.com/openset/leetcode/tree/master/problems/bitwise-and-of-numbers-range) | Medium |
+| <span id="200">200</span> | [Number of Islands](https://leetcode.com/problems/number-of-islands "岛屿的个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-islands) | Medium |
+| <span id="199">199</span> | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view "二叉树的右视图") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-right-side-view) | Medium |
+| <span id="198">198</span> | [House Robber](https://leetcode.com/problems/house-robber "打家劫舍") | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber) | Easy |
+| <span id="197">197</span> | [Rising Temperature](https://leetcode.com/problems/rising-temperature "上升的温度") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/rising-temperature) | Easy |
+| <span id="196">196</span> | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails "删除重复的电子邮箱") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/delete-duplicate-emails) | Easy |
+| <span id="195">195</span> | [Tenth Line](https://leetcode.com/problems/tenth-line "第十行") | [Bash](https://github.com/openset/leetcode/tree/master/problems/tenth-line) | Easy |
+| <span id="194">194</span> | [Transpose File](https://leetcode.com/problems/transpose-file "转置文件") | [Bash](https://github.com/openset/leetcode/tree/master/problems/transpose-file) | Medium |
+| <span id="193">193</span> | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers "有效电话号码") | [Bash](https://github.com/openset/leetcode/tree/master/problems/valid-phone-numbers) | Easy |
+| <span id="192">192</span> | [Word Frequency](https://leetcode.com/problems/word-frequency "统计词频") | [Bash](https://github.com/openset/leetcode/tree/master/problems/word-frequency) | Medium |
+| <span id="191">191</span> | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits "位1的个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits) | Easy |
+| <span id="190">190</span> | [Reverse Bits](https://leetcode.com/problems/reverse-bits "颠倒二进制位") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-bits) | Easy |
+| <span id="189">189</span> | [Rotate Array](https://leetcode.com/problems/rotate-array "旋转数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-array) | Easy |
+| <span id="188">188</span> | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv "买卖股票的最佳时机 IV") | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv) | Hard |
+| <span id="187">187</span> | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences "重复的DNA序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-dna-sequences) | Medium |
+| <span id="186">186</span> | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-ii) | Medium |
+| <span id="185">185</span> | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries "部门工资前三高的员工") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/department-top-three-salaries) | Hard |
+| <span id="184">184</span> | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary "部门工资最高的员工") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/department-highest-salary) | Medium |
+| <span id="183">183</span> | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order "从不订购的客户") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/customers-who-never-order) | Easy |
+| <span id="182">182</span> | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails "查找重复的电子邮箱") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/duplicate-emails) | Easy |
+| <span id="181">181</span> | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers "超过经理收入的员工") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/employees-earning-more-than-their-managers) | Easy |
+| <span id="180">180</span> | [Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers "连续出现的数字") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers) | Medium |
+| <span id="179">179</span> | [Largest Number](https://leetcode.com/problems/largest-number "最大数") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-number) | Medium |
+| <span id="178">178</span> | [Rank Scores](https://leetcode.com/problems/rank-scores "分数排名") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/rank-scores) | Medium |
+| <span id="177">177</span> | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary "第N高的薪水") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/nth-highest-salary) | Medium |
+| <span id="176">176</span> | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary "第二高的薪水") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/second-highest-salary) | Easy |
+| <span id="175">175</span> | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables "组合两个表") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/combine-two-tables) | Easy |
+| <span id="174">174</span> | [Dungeon Game](https://leetcode.com/problems/dungeon-game "地下城游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/dungeon-game) | Hard |
+| <span id="173">173</span> | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator "二叉搜索树迭代器") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator) | Medium |
+| <span id="172">172</span> | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes "阶乘后的零") | [Go](https://github.com/openset/leetcode/tree/master/problems/factorial-trailing-zeroes) | Easy |
+| <span id="171">171</span> | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number "Excel表列序号") | [Go](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-number) | Easy |
+| <span id="170">170</span> | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-iii-data-structure-design) | Easy |
+| <span id="169">169</span> | [Majority Element](https://leetcode.com/problems/majority-element "求众数") | [Go](https://github.com/openset/leetcode/tree/master/problems/majority-element) | Easy |
+| <span id="168">168</span> | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title "Excel表列名称") | [Go](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-title) | Easy |
+| <span id="167">167</span> | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted "两数之和 II - 输入有序数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-ii-input-array-is-sorted) | Easy |
+| <span id="166">166</span> | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal "分数到小数") | [Go](https://github.com/openset/leetcode/tree/master/problems/fraction-to-recurring-decimal) | Medium |
+| <span id="165">165</span> | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers "比较版本号") | [Go](https://github.com/openset/leetcode/tree/master/problems/compare-version-numbers) | Medium |
+| <span id="164">164</span> | [Maximum Gap](https://leetcode.com/problems/maximum-gap "最大间距") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-gap) | Hard |
+| <span id="163">163</span> | [Missing Ranges](https://leetcode.com/problems/missing-ranges "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/missing-ranges) | Medium |
+| <span id="162">162</span> | [Find Peak Element](https://leetcode.com/problems/find-peak-element "寻找峰值") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-peak-element) | Medium |
+| <span id="161">161</span> | [One Edit Distance](https://leetcode.com/problems/one-edit-distance "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/one-edit-distance) | Medium |
+| <span id="160">160</span> | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists "相交链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-linked-lists) | Easy |
+| <span id="159">159</span> | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters) | Hard |
+| <span id="158">158</span> | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4-ii-call-multiple-times) | Hard |
+| <span id="157">157</span> | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4 "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4) | Easy |
+| <span id="156">156</span> | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-upside-down) | Medium |
+| <span id="155">155</span> | [Min Stack](https://leetcode.com/problems/min-stack "最小栈") | [Go](https://github.com/openset/leetcode/tree/master/problems/min-stack) | Easy |
+| <span id="154">154</span> | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii "寻找旋转排序数组中的最小值 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array-ii) | Hard |
+| <span id="153">153</span> | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array "寻找旋转排序数组中的最小值") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array) | Medium |
+| <span id="152">152</span> | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray "乘积最大子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-subarray) | Medium |
+| <span id="151">151</span> | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string "翻转字符串里的单词") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string) | Medium |
+| <span id="150">150</span> | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation "逆波兰表达式求值") | [Go](https://github.com/openset/leetcode/tree/master/problems/evaluate-reverse-polish-notation) | Medium |
+| <span id="149">149</span> | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line "直线上最多的点数") | [Go](https://github.com/openset/leetcode/tree/master/problems/max-points-on-a-line) | Hard |
+| <span id="148">148</span> | [Sort List](https://leetcode.com/problems/sort-list "排序链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-list) | Medium |
+| <span id="147">147</span> | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list "对链表进行插入排序") | [Go](https://github.com/openset/leetcode/tree/master/problems/insertion-sort-list) | Medium |
+| <span id="146">146</span> | [LRU Cache](https://leetcode.com/problems/lru-cache "LRU缓存机制") | [Go](https://github.com/openset/leetcode/tree/master/problems/lru-cache) | Hard |
+| <span id="145">145</span> | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal "二叉树的后序遍历") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-postorder-traversal) | Hard |
+| <span id="144">144</span> | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal "二叉树的前序遍历") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-preorder-traversal) | Medium |
+| <span id="143">143</span> | [Reorder List](https://leetcode.com/problems/reorder-list "重排链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/reorder-list) | Medium |
+| <span id="142">142</span> | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii "环形链表 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle-ii) | Medium |
+| <span id="141">141</span> | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle "环形链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle) | Easy |
+| <span id="140">140</span> | [Word Break II](https://leetcode.com/problems/word-break-ii "单词拆分 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/word-break-ii) | Hard |
+| <span id="139">139</span> | [Word Break](https://leetcode.com/problems/word-break "单词拆分") | [Go](https://github.com/openset/leetcode/tree/master/problems/word-break) | Medium |
+| <span id="138">138</span> | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer "复制带随机指针的链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/copy-list-with-random-pointer) | Medium |
+| <span id="137">137</span> | [Single Number II](https://leetcode.com/problems/single-number-ii "只出现一次的数字 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number-ii) | Medium |
+| <span id="136">136</span> | [Single Number](https://leetcode.com/problems/single-number "只出现一次的数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number) | Easy |
+| <span id="135">135</span> | [Candy](https://leetcode.com/problems/candy "分发糖果") | [Go](https://github.com/openset/leetcode/tree/master/problems/candy) | Hard |
+| <span id="134">134</span> | [Gas Station](https://leetcode.com/problems/gas-station "加油站") | [Go](https://github.com/openset/leetcode/tree/master/problems/gas-station) | Medium |
+| <span id="133">133</span> | [Clone Graph](https://leetcode.com/problems/clone-graph "克隆图") | [Go](https://github.com/openset/leetcode/tree/master/problems/clone-graph) | Medium |
+| <span id="132">132</span> | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii "分割回文串 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning-ii) | Hard |
+| <span id="131">131</span> | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning "分割回文串") | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning) | Medium |
+| <span id="130">130</span> | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions "被围绕的区域") | [Go](https://github.com/openset/leetcode/tree/master/problems/surrounded-regions) | Medium |
+| <span id="129">129</span> | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers "求根到叶子节点数字之和") | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-root-to-leaf-numbers) | Medium |
+| <span id="128">128</span> | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence "最长连续序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-consecutive-sequence) | Hard |
+| <span id="127">127</span> | [Word Ladder](https://leetcode.com/problems/word-ladder "单词接龙") | [Go](https://github.com/openset/leetcode/tree/master/problems/word-ladder) | Medium |
+| <span id="126">126</span> | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii "单词接龙 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/word-ladder-ii) | Hard |
+| <span id="125">125</span> | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome "验证回文串") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome) | Easy |
+| <span id="124">124</span> | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum "二叉树中的最大路径和") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-maximum-path-sum) | Hard |
+| <span id="123">123</span> | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii "买卖股票的最佳时机 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii) | Hard |
+| <span id="122">122</span> | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii "买卖股票的最佳时机 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) | Easy |
+| <span id="121">121</span> | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock "买卖股票的最佳时机") | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) | Easy |
+| <span id="120">120</span> | [Triangle](https://leetcode.com/problems/triangle "三角形最小路径和") | [Go](https://github.com/openset/leetcode/tree/master/problems/triangle) | Medium |
+| <span id="119">119</span> | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii "杨辉三角 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle-ii) | Easy |
+| <span id="118">118</span> | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle "杨辉三角") | [Go](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle) | Easy |
+| <span id="117">117</span> | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii "填充同一层的兄弟节点 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node-ii) | Medium |
+| <span id="116">116</span> | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node "填充同一层的兄弟节点") | [Go](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node) | Medium |
+| <span id="115">115</span> | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences "不同的子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences) | Hard |
+| <span id="114">114</span> | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list "二叉树展开为链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-binary-tree-to-linked-list) | Medium |
+| <span id="113">113</span> | [Path Sum II](https://leetcode.com/problems/path-sum-ii "路径总和 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-ii) | Medium |
+| <span id="112">112</span> | [Path Sum](https://leetcode.com/problems/path-sum "路径总和") | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum) | Easy |
+| <span id="111">111</span> | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree "二叉树的最小深度") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-depth-of-binary-tree) | Easy |
+| <span id="110">110</span> | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree "平衡二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/balanced-binary-tree) | Easy |
+| <span id="109">109</span> | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree "有序链表转换二叉搜索树") | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-list-to-binary-search-tree) | Medium |
+| <span id="108">108</span> | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree "将有序数组转换为二叉搜索树") | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-array-to-binary-search-tree) | Easy |
+| <span id="107">107</span> | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii "二叉树的层次遍历 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal-ii) | Easy |
+| <span id="106">106</span> | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal "从中序与后序遍历序列构造二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | Medium |
+| <span id="105">105</span> | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal "从前序与中序遍历序列构造二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium |
+| <span id="104">104</span> | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree "二叉树的最大深度") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-binary-tree) | Easy |
+| <span id="103">103</span> | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal "二叉树的锯齿形层次遍历") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-zigzag-level-order-traversal) | Medium |
+| <span id="102">102</span> | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal "二叉树的层次遍历") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal) | Medium |
+| <span id="101">101</span> | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree "对称二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/symmetric-tree) | Easy |
+| <span id="100">100</span> | [Same Tree](https://leetcode.com/problems/same-tree "相同的树") | [Go](https://github.com/openset/leetcode/tree/master/problems/same-tree) | Easy |
+| <span id="99">99</span> | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree "恢复二叉搜索树") | [Go](https://github.com/openset/leetcode/tree/master/problems/recover-binary-search-tree) | Hard |
+| <span id="98">98</span> | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree "验证二叉搜索树") | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-binary-search-tree) | Medium |
+| <span id="97">97</span> | [Interleaving String](https://leetcode.com/problems/interleaving-string "交错字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/interleaving-string) | Hard |
+| <span id="96">96</span> | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees "不同的二叉搜索树") | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees) | Medium |
+| <span id="95">95</span> | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii "不同的二叉搜索树 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees-ii) | Medium |
+| <span id="94">94</span> | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal "二叉树的中序遍历") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) | Medium |
+| <span id="93">93</span> | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses "复原IP地址") | [Go](https://github.com/openset/leetcode/tree/master/problems/restore-ip-addresses) | Medium |
+| <span id="92">92</span> | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii "反转链表 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list-ii) | Medium |
+| <span id="91">91</span> | [Decode Ways](https://leetcode.com/problems/decode-ways "解码方法") | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-ways) | Medium |
+| <span id="90">90</span> | [Subsets II](https://leetcode.com/problems/subsets-ii "子集 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/subsets-ii) | Medium |
+| <span id="89">89</span> | [Gray Code](https://leetcode.com/problems/gray-code "格雷编码") | [Go](https://github.com/openset/leetcode/tree/master/problems/gray-code) | Medium |
+| <span id="88">88</span> | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array "合并两个有序数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-sorted-array) | Easy |
+| <span id="87">87</span> | [Scramble String](https://leetcode.com/problems/scramble-string "扰乱字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/scramble-string) | Hard |
+| <span id="86">86</span> | [Partition List](https://leetcode.com/problems/partition-list "分隔链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-list) | Medium |
+| <span id="85">85</span> | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle "最大矩形") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximal-rectangle) | Hard |
+| <span id="84">84</span> | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram "柱状图中最大的矩形") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-rectangle-in-histogram) | Hard |
+| <span id="83">83</span> | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list "删除排序链表中的重复元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list) | Easy |
+| <span id="82">82</span> | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii "删除排序链表中的重复元素 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list-ii) | Medium |
+| <span id="81">81</span> | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii "搜索旋转排序数组 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array-ii) | Medium |
+| <span id="80">80</span> | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii "删除排序数组中的重复项 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array-ii) | Medium |
+| <span id="79">79</span> | [Word Search](https://leetcode.com/problems/word-search "单词搜索") | [Go](https://github.com/openset/leetcode/tree/master/problems/word-search) | Medium |
+| <span id="78">78</span> | [Subsets](https://leetcode.com/problems/subsets "子集") | [Go](https://github.com/openset/leetcode/tree/master/problems/subsets) | Medium |
+| <span id="77">77</span> | [Combinations](https://leetcode.com/problems/combinations "组合") | [Go](https://github.com/openset/leetcode/tree/master/problems/combinations) | Medium |
+| <span id="76">76</span> | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring "最小覆盖子串") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring) | Hard |
+| <span id="75">75</span> | [Sort Colors](https://leetcode.com/problems/sort-colors "颜色分类") | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-colors) | Medium |
+| <span id="74">74</span> | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix "搜索二维矩阵") | [Go](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix) | Medium |
+| <span id="73">73</span> | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes "矩阵置零") | [Go](https://github.com/openset/leetcode/tree/master/problems/set-matrix-zeroes) | Medium |
+| <span id="72">72</span> | [Edit Distance](https://leetcode.com/problems/edit-distance "编辑距离") | [Go](https://github.com/openset/leetcode/tree/master/problems/edit-distance) | Hard |
+| <span id="71">71</span> | [Simplify Path](https://leetcode.com/problems/simplify-path "简化路径") | [Go](https://github.com/openset/leetcode/tree/master/problems/simplify-path) | Medium |
+| <span id="70">70</span> | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs "爬楼梯") | [Go](https://github.com/openset/leetcode/tree/master/problems/climbing-stairs) | Easy |
+| <span id="69">69</span> | [Sqrt(x)](https://leetcode.com/problems/sqrtx "x 的平方根") | [Go](https://github.com/openset/leetcode/tree/master/problems/sqrtx) | Easy |
+| <span id="68">68</span> | [Text Justification](https://leetcode.com/problems/text-justification "文本左右对齐") | [Go](https://github.com/openset/leetcode/tree/master/problems/text-justification) | Hard |
+| <span id="67">67</span> | [Add Binary](https://leetcode.com/problems/add-binary "二进制求和") | [Go](https://github.com/openset/leetcode/tree/master/problems/add-binary) | Easy |
+| <span id="66">66</span> | [Plus One](https://leetcode.com/problems/plus-one "加一") | [Go](https://github.com/openset/leetcode/tree/master/problems/plus-one) | Easy |
+| <span id="65">65</span> | [Valid Number](https://leetcode.com/problems/valid-number "有效数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-number) | Hard |
+| <span id="64">64</span> | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum "最小路径和") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-path-sum) | Medium |
+| <span id="63">63</span> | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii "不同路径 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-paths-ii) | Medium |
+| <span id="62">62</span> | [Unique Paths](https://leetcode.com/problems/unique-paths "不同路径") | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-paths) | Medium |
+| <span id="61">61</span> | [Rotate List](https://leetcode.com/problems/rotate-list "旋转链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-list) | Medium |
+| <span id="60">60</span> | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence "第k个排列") | [Go](https://github.com/openset/leetcode/tree/master/problems/permutation-sequence) | Medium |
+| <span id="59">59</span> | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii "螺旋矩阵 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-ii) | Medium |
+| <span id="58">58</span> | [Length of Last Word](https://leetcode.com/problems/length-of-last-word "最后一个单词的长度") | [Go](https://github.com/openset/leetcode/tree/master/problems/length-of-last-word) | Easy |
+| <span id="57">57</span> | [Insert Interval](https://leetcode.com/problems/insert-interval "插入区间") | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-interval) | Hard |
+| <span id="56">56</span> | [Merge Intervals](https://leetcode.com/problems/merge-intervals "合并区间") | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) | Medium |
+| <span id="55">55</span> | [Jump Game](https://leetcode.com/problems/jump-game "跳跃游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/jump-game) | Medium |
+| <span id="54">54</span> | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix "螺旋矩阵") | [Go](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix) | Medium |
+| <span id="53">53</span> | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray "最大子序和") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray) | Easy |
+| <span id="52">52</span> | [N-Queens II](https://leetcode.com/problems/n-queens-ii "N皇后 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/n-queens-ii) | Hard |
+| <span id="51">51</span> | [N-Queens](https://leetcode.com/problems/n-queens "N皇后") | [Go](https://github.com/openset/leetcode/tree/master/problems/n-queens) | Hard |
+| <span id="50">50</span> | [Pow(x, n)](https://leetcode.com/problems/powx-n "Pow(x, n)") | [Go](https://github.com/openset/leetcode/tree/master/problems/powx-n) | Medium |
+| <span id="49">49</span> | [Group Anagrams](https://leetcode.com/problems/group-anagrams "字母异位词分组") | [Go](https://github.com/openset/leetcode/tree/master/problems/group-anagrams) | Medium |
+| <span id="48">48</span> | [Rotate Image](https://leetcode.com/problems/rotate-image "旋转图像") | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-image) | Medium |
+| <span id="47">47</span> | [Permutations II](https://leetcode.com/problems/permutations-ii "全排列 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/permutations-ii) | Medium |
+| <span id="46">46</span> | [Permutations](https://leetcode.com/problems/permutations "全排列") | [Go](https://github.com/openset/leetcode/tree/master/problems/permutations) | Medium |
+| <span id="45">45</span> | [Jump Game II](https://leetcode.com/problems/jump-game-ii "跳跃游戏 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/jump-game-ii) | Hard |
+| <span id="44">44</span> | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching "通配符匹配") | [Go](https://github.com/openset/leetcode/tree/master/problems/wildcard-matching) | Hard |
+| <span id="43">43</span> | [Multiply Strings](https://leetcode.com/problems/multiply-strings "字符串相乘") | [Go](https://github.com/openset/leetcode/tree/master/problems/multiply-strings) | Medium |
+| <span id="42">42</span> | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water "接雨水") | [Go](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water) | Hard |
+| <span id="41">41</span> | [First Missing Positive](https://leetcode.com/problems/first-missing-positive "缺失的第一个正数") | [Go](https://github.com/openset/leetcode/tree/master/problems/first-missing-positive) | Hard |
+| <span id="40">40</span> | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii "组合总和 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-ii) | Medium |
+| <span id="39">39</span> | [Combination Sum](https://leetcode.com/problems/combination-sum "组合总和") | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum) | Medium |
+| <span id="38">38</span> | [Count and Say](https://leetcode.com/problems/count-and-say "报数") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-and-say) | Easy |
+| <span id="37">37</span> | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver "解数独") | [Go](https://github.com/openset/leetcode/tree/master/problems/sudoku-solver) | Hard |
+| <span id="36">36</span> | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku "有效的数独") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-sudoku) | Medium |
+| <span id="35">35</span> | [Search Insert Position](https://leetcode.com/problems/search-insert-position "搜索插入位置") | [Go](https://github.com/openset/leetcode/tree/master/problems/search-insert-position) | Easy |
+| <span id="34">34</span> | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array "在排序数组中查找元素的第一个和最后一个位置") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-first-and-last-position-of-element-in-sorted-array) | Medium |
+| <span id="33">33</span> | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array "搜索旋转排序数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array) | Medium |
+| <span id="32">32</span> | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses "最长有效括号") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-valid-parentheses) | Hard |
+| <span id="31">31</span> | [Next Permutation](https://leetcode.com/problems/next-permutation "下一个排列") | [Go](https://github.com/openset/leetcode/tree/master/problems/next-permutation) | Medium |
+| <span id="30">30</span> | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words "与所有单词相关联的字串") | [Go](https://github.com/openset/leetcode/tree/master/problems/substring-with-concatenation-of-all-words) | Hard |
+| <span id="29">29</span> | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers "两数相除") | [Go](https://github.com/openset/leetcode/tree/master/problems/divide-two-integers) | Medium |
+| <span id="28">28</span> | [Implement strStr()](https://leetcode.com/problems/implement-strstr "实现strStr()") | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-strstr) | Easy |
+| <span id="27">27</span> | [Remove Element](https://leetcode.com/problems/remove-element "移除元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-element) | Easy |
+| <span id="26">26</span> | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array "删除排序数组中的重复项") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array) | Easy |
+| <span id="25">25</span> | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group "k个一组翻转链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-nodes-in-k-group) | Hard |
+| <span id="24">24</span> | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs "两两交换链表中的节点") | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-nodes-in-pairs) | Medium |
+| <span id="23">23</span> | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists "合并K个排序链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-k-sorted-lists) | Hard |
+| <span id="22">22</span> | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses "括号生成") | [Go](https://github.com/openset/leetcode/tree/master/problems/generate-parentheses) | Medium |
+| <span id="21">21</span> | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists "合并两个有序链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-two-sorted-lists) | Easy |
+| <span id="20">20</span> | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses "有效的括号") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-parentheses) | Easy |
+| <span id="19">19</span> | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list "删除链表的倒数第N个节点") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-nth-node-from-end-of-list) | Medium |
+| <span id="18">18</span> | [4Sum](https://leetcode.com/problems/4sum "四数之和") | [Go](https://github.com/openset/leetcode/tree/master/problems/4sum) | Medium |
+| <span id="17">17</span> | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number "电话号码的字母组合") | [Go](https://github.com/openset/leetcode/tree/master/problems/letter-combinations-of-a-phone-number) | Medium |
+| <span id="16">16</span> | [3Sum Closest](https://leetcode.com/problems/3sum-closest "最接近的三数之和") | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-closest) | Medium |
+| <span id="15">15</span> | [3Sum](https://leetcode.com/problems/3sum "三数之和") | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum) | Medium |
+| <span id="14">14</span> | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix "最长公共前缀") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-common-prefix) | Easy |
+| <span id="13">13</span> | [Roman to Integer](https://leetcode.com/problems/roman-to-integer "罗马数字转整数") | [Go](https://github.com/openset/leetcode/tree/master/problems/roman-to-integer) | Easy |
+| <span id="12">12</span> | [Integer to Roman](https://leetcode.com/problems/integer-to-roman "整数转罗马数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-to-roman) | Medium |
+| <span id="11">11</span> | [Container With Most Water](https://leetcode.com/problems/container-with-most-water "盛最多水的容器") | [Go](https://github.com/openset/leetcode/tree/master/problems/container-with-most-water) | Medium |
+| <span id="10">10</span> | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching "正则表达式匹配") | [Go](https://github.com/openset/leetcode/tree/master/problems/regular-expression-matching) | Hard |
+| <span id="9">9</span> | [Palindrome Number](https://leetcode.com/problems/palindrome-number "回文数") | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-number) | Easy |
+| <span id="8">8</span> | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi "字符串转换整数 (atoi)") | [Go](https://github.com/openset/leetcode/tree/master/problems/string-to-integer-atoi) | Medium |
+| <span id="7">7</span> | [Reverse Integer](https://leetcode.com/problems/reverse-integer "整数反转") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-integer) | Easy |
+| <span id="6">6</span> | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion "Z 字形变换") | [Go](https://github.com/openset/leetcode/tree/master/problems/zigzag-conversion) | Medium |
+| <span id="5">5</span> | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring "最长回文子串") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-substring) | Medium |
+| <span id="4">4</span> | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays "寻找两个有序数组的中位数") | [Go](https://github.com/openset/leetcode/tree/master/problems/median-of-two-sorted-arrays) | Hard |
+| <span id="3">3</span> | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters "无重复字符的最长子串") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-without-repeating-characters) | Medium |
+| <span id="2">2</span> | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers "两数相加") | [Go](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers) | Medium |
+| <span id="1">1</span> | [Two Sum](https://leetcode.com/problems/two-sum "两数之和") | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum) | Easy |

From 5d18adb2d6681f7b174d67e8cc5224cf15f66dee Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Mon, 7 Jan 2019 11:15:51 +0800
Subject: [PATCH 18/22] Add: new

---
 index.md | 328 ++++++++++++++++++++++++++++---------------------------
 1 file changed, 166 insertions(+), 162 deletions(-)

diff --git a/index.md b/index.md
index 36dcabe1c..ef5db89a4 100644
--- a/index.md
+++ b/index.md
@@ -53,6 +53,10 @@ LeetCode Problems' Solutions
 
 | # | Title | Solution | Difficulty |
 | :-: | - | - | :-: |
+| <span id="972">972</span> | [Equal Rational Numbers](https://leetcode.com/problems/equal-rational-numbers "相等的有理数") | [Go](https://github.com/openset/leetcode/tree/master/problems/equal-rational-numbers) | Hard |
+| <span id="971">971</span> | [Flip Binary Tree To Match Preorder Traversal](https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal "翻转二叉树以匹配先序遍历") | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-binary-tree-to-match-preorder-traversal) | Medium |
+| <span id="970">970</span> | [Powerful Integers](https://leetcode.com/problems/powerful-integers "强整数") | [Go](https://github.com/openset/leetcode/tree/master/problems/powerful-integers) | Easy |
+| <span id="969">969</span> | [Pancake Sorting](https://leetcode.com/problems/pancake-sorting "煎饼排序") | [Go](https://github.com/openset/leetcode/tree/master/problems/pancake-sorting) | Medium |
 | <span id="968">968</span> | [Binary Tree Cameras](https://leetcode.com/problems/binary-tree-cameras "监控二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-cameras) | Hard |
 | <span id="967">967</span> | [Numbers With Same Consecutive Differences](https://leetcode.com/problems/numbers-with-same-consecutive-differences "连续差相同的数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/numbers-with-same-consecutive-differences) | Medium |
 | <span id="966">966</span> | [Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker "元音拼写检查器") | [Go](https://github.com/openset/leetcode/tree/master/problems/vowel-spellchecker) | Medium |
@@ -220,7 +224,7 @@ LeetCode Problems' Solutions
 | <span id="803">803</span> | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit "打砖块") | [Go](https://github.com/openset/leetcode/tree/master/problems/bricks-falling-when-hit) | Hard |
 | <span id="802">802</span> | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states "找到最终的安全状态") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-eventual-safe-states) | Medium |
 | <span id="801">801</span> | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing "使序列递增的最小交换次数") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-make-sequences-increasing) | Medium |
-| <span id="800">800</span> | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color) | Easy |
+| <span id="800">800</span> | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color) | Easy |
 | <span id="799">799</span> | [Champagne Tower](https://leetcode.com/problems/champagne-tower "香槟塔") | [Go](https://github.com/openset/leetcode/tree/master/problems/champagne-tower) | Medium |
 | <span id="798">798</span> | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score "得分最高的最小轮调") | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-rotation-with-highest-score) | Hard |
 | <span id="797">797</span> | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target "所有可能的路径") | [Go](https://github.com/openset/leetcode/tree/master/problems/all-paths-from-source-to-target) | Medium |
@@ -244,11 +248,11 @@ LeetCode Problems' Solutions
 | <span id="779">779</span> | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar "第K个语法符号") | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-symbol-in-grammar) | Medium |
 | <span id="778">778</span> | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water "水位上升的泳池中游泳") | [Go](https://github.com/openset/leetcode/tree/master/problems/swim-in-rising-water) | Hard |
 | <span id="777">777</span> | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string "在LR字符串中交换相邻字符") | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-adjacent-in-lr-string) | Medium |
-| <span id="776">776</span> | [Split BST](https://leetcode.com/problems/split-bst "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-bst) | Medium |
+| <span id="776">776</span> | [Split BST](https://leetcode.com/problems/split-bst) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-bst) | Medium |
 | <span id="775">775</span> | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions "全局倒置与局部倒置") | [Go](https://github.com/openset/leetcode/tree/master/problems/global-and-local-inversions) | Medium |
-| <span id="774">774</span> | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station) | Hard |
+| <span id="774">774</span> | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station) | Hard |
 | <span id="773">773</span> | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle "滑动谜题") | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-puzzle) | Hard |
-| <span id="772">772</span> | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) | Hard |
+| <span id="772">772</span> | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) | Hard |
 | <span id="771">771</span> | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones "宝石与石头") | [Go](https://github.com/openset/leetcode/tree/master/problems/jewels-and-stones) | Easy |
 | <span id="770">770</span> | [Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv "基本计算器 IV") | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iv) | Hard |
 | <span id="769">769</span> | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted "最多能完成排序的块") | [Go](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted) | Medium |
@@ -260,17 +264,17 @@ LeetCode Problems' Solutions
 | <span id="763">763</span> | [Partition Labels](https://leetcode.com/problems/partition-labels "划分字母区间") | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-labels) | Medium |
 | <span id="762">762</span> | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation "二进制表示中质数个计算置位") | [Go](https://github.com/openset/leetcode/tree/master/problems/prime-number-of-set-bits-in-binary-representation) | Easy |
 | <span id="761">761</span> | [Special Binary String](https://leetcode.com/problems/special-binary-string "特殊的二进制序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/special-binary-string) | Hard |
-| <span id="760">760</span> | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-anagram-mappings) | Easy |
-| <span id="759">759</span> | [Employee Free Time](https://leetcode.com/problems/employee-free-time "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-free-time) | Hard |
-| <span id="758">758</span> | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/bold-words-in-string) | Easy |
+| <span id="760">760</span> | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-anagram-mappings) | Easy |
+| <span id="759">759</span> | [Employee Free Time](https://leetcode.com/problems/employee-free-time) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-free-time) | Hard |
+| <span id="758">758</span> | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/bold-words-in-string) | Easy |
 | <span id="757">757</span> | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two " 设置交集大小至少为2") | [Go](https://github.com/openset/leetcode/tree/master/problems/set-intersection-size-at-least-two) | Hard |
 | <span id="756">756</span> | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix "金字塔转换矩阵") | [Go](https://github.com/openset/leetcode/tree/master/problems/pyramid-transition-matrix) | Medium |
-| <span id="755">755</span> | [Pour Water](https://leetcode.com/problems/pour-water "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/pour-water) | Medium |
+| <span id="755">755</span> | [Pour Water](https://leetcode.com/problems/pour-water) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/pour-water) | Medium |
 | <span id="754">754</span> | [Reach a Number](https://leetcode.com/problems/reach-a-number "到达终点数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/reach-a-number) | Easy |
 | <span id="753">753</span> | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe "破解保险箱") | [Go](https://github.com/openset/leetcode/tree/master/problems/cracking-the-safe) | Hard |
 | <span id="752">752</span> | [Open the Lock](https://leetcode.com/problems/open-the-lock "打开转盘锁") | [Go](https://github.com/openset/leetcode/tree/master/problems/open-the-lock) | Medium |
-| <span id="751">751</span> | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/ip-to-cidr) | Easy |
-| <span id="750">750</span> | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-corner-rectangles) | Medium |
+| <span id="751">751</span> | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/ip-to-cidr) | Easy |
+| <span id="750">750</span> | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-corner-rectangles) | Medium |
 | <span id="749">749</span> | [Contain Virus](https://leetcode.com/problems/contain-virus "隔离病毒") | [Go](https://github.com/openset/leetcode/tree/master/problems/contain-virus) | Hard |
 | <span id="748">748</span> | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word "最短完整词") | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-completing-word) | Easy |
 | <span id="747">747</span> | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others "至少是其他数字两倍的最大数") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-number-at-least-twice-of-others) | Easy |
@@ -278,47 +282,47 @@ LeetCode Problems' Solutions
 | <span id="745">745</span> | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search "前缀和后缀搜索") | [Go](https://github.com/openset/leetcode/tree/master/problems/prefix-and-suffix-search) | Hard |
 | <span id="744">744</span> | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target "寻找比目标字母大的最小字母") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-smallest-letter-greater-than-target) | Easy |
 | <span id="743">743</span> | [Network Delay Time](https://leetcode.com/problems/network-delay-time "网络延迟时间") | [Go](https://github.com/openset/leetcode/tree/master/problems/network-delay-time) | Easy |
-| <span id="742">742</span> | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-leaf-in-a-binary-tree) | Medium |
+| <span id="742">742</span> | [Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-leaf-in-a-binary-tree) | Medium |
 | <span id="741">741</span> | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup "摘樱桃") | [Go](https://github.com/openset/leetcode/tree/master/problems/cherry-pickup) | Hard |
 | <span id="740">740</span> | [Delete and Earn](https://leetcode.com/problems/delete-and-earn "删除与获得点数") | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-and-earn) | Medium |
 | <span id="739">739</span> | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures "每日温度") | [Go](https://github.com/openset/leetcode/tree/master/problems/daily-temperatures) | Medium |
 | <span id="738">738</span> | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits "单调递增的数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/monotone-increasing-digits) | Medium |
-| <span id="737">737</span> | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii) | Medium |
+| <span id="737">737</span> | [Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii) | Medium |
 | <span id="736">736</span> | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression "Lisp 语法解析") | [Go](https://github.com/openset/leetcode/tree/master/problems/parse-lisp-expression) | Hard |
 | <span id="735">735</span> | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision "行星碰撞") | [Go](https://github.com/openset/leetcode/tree/master/problems/asteroid-collision) | Medium |
-| <span id="734">734</span> | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity) | Easy |
+| <span id="734">734</span> | [Sentence Similarity](https://leetcode.com/problems/sentence-similarity) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity) | Easy |
 | <span id="733">733</span> | [Flood Fill](https://leetcode.com/problems/flood-fill "图像渲染") | [Go](https://github.com/openset/leetcode/tree/master/problems/flood-fill) | Easy |
 | <span id="732">732</span> | [My Calendar III](https://leetcode.com/problems/my-calendar-iii "我的日程安排表 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii) | Hard |
 | <span id="731">731</span> | [My Calendar II](https://leetcode.com/problems/my-calendar-ii "我的日程安排表 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii) | Medium |
 | <span id="730">730</span> | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences "统计不同回文子字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-different-palindromic-subsequences) | Hard |
 | <span id="729">729</span> | [My Calendar I](https://leetcode.com/problems/my-calendar-i "我的日程安排表 I") | [Go](https://github.com/openset/leetcode/tree/master/problems/my-calendar-i) | Medium |
 | <span id="728">728</span> | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers "自除数") | [Go](https://github.com/openset/leetcode/tree/master/problems/self-dividing-numbers) | Easy |
-| <span id="727">727</span> | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-window-subsequence) | Hard |
+| <span id="727">727</span> | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-window-subsequence) | Hard |
 | <span id="726">726</span> | [Number of Atoms](https://leetcode.com/problems/number-of-atoms "原子的数量") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms) | Hard |
 | <span id="725">725</span> | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts "分隔链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/split-linked-list-in-parts) | Medium |
 | <span id="724">724</span> | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index "寻找数组的中心索引") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-pivot-index) | Easy |
-| <span id="723">723</span> | [Candy Crush](https://leetcode.com/problems/candy-crush "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/candy-crush) | Medium |
+| <span id="723">723</span> | [Candy Crush](https://leetcode.com/problems/candy-crush) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/candy-crush) | Medium |
 | <span id="722">722</span> | [Remove Comments](https://leetcode.com/problems/remove-comments "删除注释") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-comments) | Medium |
 | <span id="721">721</span> | [Accounts Merge](https://leetcode.com/problems/accounts-merge "账户合并") | [Go](https://github.com/openset/leetcode/tree/master/problems/accounts-merge) | Medium |
 | <span id="720">720</span> | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary "词典中最长的单词") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary) | Easy |
 | <span id="719">719</span> | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance "找出第 k 小的距离对") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance) | Hard |
 | <span id="718">718</span> | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray "最长重复子数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-repeated-subarray) | Medium |
 | <span id="717">717</span> | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters "1比特与2比特字符") | [Go](https://github.com/openset/leetcode/tree/master/problems/1-bit-and-2-bit-characters) | Easy |
-| <span id="716">716</span> | [Max Stack](https://leetcode.com/problems/max-stack "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/max-stack) | Easy |
+| <span id="716">716</span> | [Max Stack](https://leetcode.com/problems/max-stack) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/max-stack) | Easy |
 | <span id="715">715</span> | [Range Module](https://leetcode.com/problems/range-module "Range 模块") | [Go](https://github.com/openset/leetcode/tree/master/problems/range-module) | Hard |
 | <span id="714">714</span> | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee "买卖股票的最佳时机含手续费") | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | Medium |
 | <span id="713">713</span> | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k "乘积小于K的子数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k) | Medium |
 | <span id="712">712</span> | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings "两个字符串的最小ASCII删除和") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-ascii-delete-sum-for-two-strings) | Medium |
-| <span id="711">711</span> | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii) | Hard |
+| <span id="711">711</span> | [Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii) | Hard |
 | <span id="710">710</span> | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist "黑名单中的随机数") | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-blacklist) | Hard |
 | <span id="709">709</span> | [To Lower Case](https://leetcode.com/problems/to-lower-case "转换成小写字母") | [Go](https://github.com/openset/leetcode/tree/master/problems/to-lower-case) | Easy |
-| <span id="708">708</span> | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-cyclic-sorted-list) | Medium |
+| <span id="708">708</span> | [Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-cyclic-sorted-list) | Medium |
 | <span id="707">707</span> | [Design Linked List](https://leetcode.com/problems/design-linked-list "设计链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/design-linked-list) | Easy |
 | <span id="706">706</span> | [Design HashMap](https://leetcode.com/problems/design-hashmap "设计哈希映射") | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hashmap) | Easy |
 | <span id="705">705</span> | [Design HashSet](https://leetcode.com/problems/design-hashset "设计哈希集合") | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hashset) | Easy |
 | <span id="704">704</span> | [Binary Search](https://leetcode.com/problems/binary-search "二分查找") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-search) | Easy |
 | <span id="703">703</span> | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream "数据流中的第K大元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-a-stream) | Easy |
-| <span id="702">702</span> | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-a-sorted-array-of-unknown-size) | Medium |
+| <span id="702">702</span> | [Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-a-sorted-array-of-unknown-size) | Medium |
 | <span id="701">701</span> | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree "二叉搜索树中的插入操作") | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-binary-search-tree) | Medium |
 | <span id="700">700</span> | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree "二叉搜索树中的搜索") | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-a-binary-search-tree) | Easy |
 | <span id="699">699</span> | [Falling Squares](https://leetcode.com/problems/falling-squares "掉落的方块") | [Go](https://github.com/openset/leetcode/tree/master/problems/falling-squares) | Hard |
@@ -326,7 +330,7 @@ LeetCode Problems' Solutions
 | <span id="697">697</span> | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array "数组的度") | [Go](https://github.com/openset/leetcode/tree/master/problems/degree-of-an-array) | Easy |
 | <span id="696">696</span> | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings "计数二进制子串") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-binary-substrings) | Easy |
 | <span id="695">695</span> | [Max Area of Island](https://leetcode.com/problems/max-area-of-island "岛屿的最大面积") | [Go](https://github.com/openset/leetcode/tree/master/problems/max-area-of-island) | Medium |
-| <span id="694">694</span> | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands) | Medium |
+| <span id="694">694</span> | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands) | Medium |
 | <span id="693">693</span> | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits "交替位二进制数") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-number-with-alternating-bits) | Easy |
 | <span id="692">692</span> | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words "前K个高频单词") | [Go](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-words) | Medium |
 | <span id="691">691</span> | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word "贴纸拼词") | [Go](https://github.com/openset/leetcode/tree/master/problems/stickers-to-spell-word) | Hard |
@@ -337,9 +341,9 @@ LeetCode Problems' Solutions
 | <span id="686">686</span> | [Repeated String Match](https://leetcode.com/problems/repeated-string-match "重复叠加字符串匹配") | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-string-match) | Easy |
 | <span id="685">685</span> | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii "冗余连接 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii) | Hard |
 | <span id="684">684</span> | [Redundant Connection](https://leetcode.com/problems/redundant-connection "冗余连接") | [Go](https://github.com/openset/leetcode/tree/master/problems/redundant-connection) | Medium |
-| <span id="683">683</span> | [K Empty Slots](https://leetcode.com/problems/k-empty-slots "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots) | Hard |
+| <span id="683">683</span> | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots) | Hard |
 | <span id="682">682</span> | [Baseball Game](https://leetcode.com/problems/baseball-game "棒球比赛") | [Go](https://github.com/openset/leetcode/tree/master/problems/baseball-game) | Easy |
-| <span id="681">681</span> | [Next Closest Time](https://leetcode.com/problems/next-closest-time "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/next-closest-time) | Medium |
+| <span id="681">681</span> | [Next Closest Time](https://leetcode.com/problems/next-closest-time) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/next-closest-time) | Medium |
 | <span id="680">680</span> | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii "验证回文字符串 Ⅱ") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-ii) | Easy |
 | <span id="679">679</span> | [24 Game](https://leetcode.com/problems/24-game "24点游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/24-game) | Hard |
 | <span id="678">678</span> | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string "有效的括号字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-parenthesis-string) | Medium |
@@ -354,76 +358,76 @@ LeetCode Problems' Solutions
 | <span id="669">669</span> | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree "修剪二叉搜索树") | [Go](https://github.com/openset/leetcode/tree/master/problems/trim-a-binary-search-tree) | Easy |
 | <span id="668">668</span> | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table "乘法表中第k小的数") | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-number-in-multiplication-table) | Hard |
 | <span id="667">667</span> | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii "优美的排列 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement-ii) | Medium |
-| <span id="666">666</span> | [Path Sum IV](https://leetcode.com/problems/path-sum-iv "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) | Medium |
+| <span id="666">666</span> | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) | Medium |
 | <span id="665">665</span> | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array "非递减数列") | [Go](https://github.com/openset/leetcode/tree/master/problems/non-decreasing-array) | Easy |
 | <span id="664">664</span> | [Strange Printer](https://leetcode.com/problems/strange-printer "奇怪的打印机") | [Go](https://github.com/openset/leetcode/tree/master/problems/strange-printer) | Hard |
-| <span id="663">663</span> | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/equal-tree-partition) | Medium |
+| <span id="663">663</span> | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/equal-tree-partition) | Medium |
 | <span id="662">662</span> | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree "二叉树最大宽度") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-width-of-binary-tree) | Medium |
 | <span id="661">661</span> | [Image Smoother](https://leetcode.com/problems/image-smoother "图片平滑器") | [Go](https://github.com/openset/leetcode/tree/master/problems/image-smoother) | Easy |
-| <span id="660">660</span> | [Remove 9](https://leetcode.com/problems/remove-9 "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-9) | Hard |
+| <span id="660">660</span> | [Remove 9](https://leetcode.com/problems/remove-9) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-9) | Hard |
 | <span id="659">659</span> | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences "分割数组为连续子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-into-consecutive-subsequences) | Medium |
 | <span id="658">658</span> | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements "找到 K 个最接近的元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-closest-elements) | Medium |
 | <span id="657">657</span> | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin "机器人能否返回原点") | [Go](https://github.com/openset/leetcode/tree/master/problems/robot-return-to-origin) | Easy |
-| <span id="656">656</span> | [Coin Path](https://leetcode.com/problems/coin-path "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-path) | Hard |
+| <span id="656">656</span> | [Coin Path](https://leetcode.com/problems/coin-path) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-path) | Hard |
 | <span id="655">655</span> | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree "输出二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/print-binary-tree) | Medium |
 | <span id="654">654</span> | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree "最大二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-binary-tree) | Medium |
 | <span id="653">653</span> | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst "两数之和 IV - 输入 BST") | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-iv-input-is-a-bst) | Easy |
 | <span id="652">652</span> | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees "寻找重复的子树") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-subtrees) | Medium |
-| <span id="651">651</span> | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard) | Medium |
+| <span id="651">651</span> | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard) | Medium |
 | <span id="650">650</span> | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard "只有两个键的键盘") | [Go](https://github.com/openset/leetcode/tree/master/problems/2-keys-keyboard) | Medium |
 | <span id="649">649</span> | [Dota2 Senate](https://leetcode.com/problems/dota2-senate "Dota2 参议院") | [Go](https://github.com/openset/leetcode/tree/master/problems/dota2-senate) | Medium |
 | <span id="648">648</span> | [Replace Words](https://leetcode.com/problems/replace-words "单词替换") | [Go](https://github.com/openset/leetcode/tree/master/problems/replace-words) | Medium |
 | <span id="647">647</span> | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings "回文子串") | [Go](https://github.com/openset/leetcode/tree/master/problems/palindromic-substrings) | Medium |
 | <span id="646">646</span> | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain "最长数对链") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-pair-chain) | Medium |
 | <span id="645">645</span> | [Set Mismatch](https://leetcode.com/problems/set-mismatch "错误的集合") | [Go](https://github.com/openset/leetcode/tree/master/problems/set-mismatch) | Easy |
-| <span id="644">644</span> | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-ii) | Hard |
+| <span id="644">644</span> | [Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-ii) | Hard |
 | <span id="643">643</span> | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i "子数组最大平均数 I") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-i) | Easy |
-| <span id="642">642</span> | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-search-autocomplete-system) | Hard |
+| <span id="642">642</span> | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-search-autocomplete-system) | Hard |
 | <span id="641">641</span> | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque "设计循环双端队列") | [Go](https://github.com/openset/leetcode/tree/master/problems/design-circular-deque) | Medium |
 | <span id="640">640</span> | [Solve the Equation](https://leetcode.com/problems/solve-the-equation "求解方程") | [Go](https://github.com/openset/leetcode/tree/master/problems/solve-the-equation) | Medium |
 | <span id="639">639</span> | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii "解码方法 2") | [Go](https://github.com/openset/leetcode/tree/master/problems/decode-ways-ii) | Hard |
 | <span id="638">638</span> | [Shopping Offers](https://leetcode.com/problems/shopping-offers "大礼包") | [Go](https://github.com/openset/leetcode/tree/master/problems/shopping-offers) | Medium |
 | <span id="637">637</span> | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree "二叉树的层平均值") | [Go](https://github.com/openset/leetcode/tree/master/problems/average-of-levels-in-binary-tree) | Easy |
 | <span id="636">636</span> | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions "函数的独占时间") | [Go](https://github.com/openset/leetcode/tree/master/problems/exclusive-time-of-functions) | Medium |
-| <span id="635">635</span> | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-log-storage-system) | Medium |
-| <span id="634">634</span> | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-derangement-of-an-array) | Medium |
+| <span id="635">635</span> | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-log-storage-system) | Medium |
+| <span id="634">634</span> | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-derangement-of-an-array) | Medium |
 | <span id="633">633</span> | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers "平方数之和") | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-square-numbers) | Easy |
 | <span id="632">632</span> | [Smallest Range](https://leetcode.com/problems/smallest-range "最小区间") | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-range) | Hard |
-| <span id="631">631</span> | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-excel-sum-formula) | Hard |
+| <span id="631">631</span> | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-excel-sum-formula) | Hard |
 | <span id="630">630</span> | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii "课程表 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/course-schedule-iii) | Hard |
 | <span id="629">629</span> | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array "K个逆序对数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/k-inverse-pairs-array) | Hard |
 | <span id="628">628</span> | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers "三个数的最大乘积") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers) | Easy |
 | <span id="627">627</span> | [Swap Salary](https://leetcode.com/problems/swap-salary "交换工资") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/swap-salary) | Easy |
 | <span id="626">626</span> | [Exchange Seats](https://leetcode.com/problems/exchange-seats "换座位") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/exchange-seats) | Medium |
-| <span id="625">625</span> | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization) | Medium |
-| <span id="624">624</span> | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-distance-in-arrays) | Easy |
+| <span id="625">625</span> | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization) | Medium |
+| <span id="624">624</span> | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-distance-in-arrays) | Easy |
 | <span id="623">623</span> | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree "在二叉树中增加一行") | [Go](https://github.com/openset/leetcode/tree/master/problems/add-one-row-to-tree) | Medium |
 | <span id="622">622</span> | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue "设计循环队列") | [Go](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue) | Medium |
 | <span id="621">621</span> | [Task Scheduler](https://leetcode.com/problems/task-scheduler "任务调度器") | [Go](https://github.com/openset/leetcode/tree/master/problems/task-scheduler) | Medium |
 | <span id="620">620</span> | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies "有趣的电影") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/not-boring-movies) | Easy |
-| <span id="619">619</span> | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/biggest-single-number) | Easy |
-| <span id="618">618</span> | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/students-report-by-geography) | Hard |
+| <span id="619">619</span> | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/biggest-single-number) | Easy |
+| <span id="618">618</span> | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/students-report-by-geography) | Hard |
 | <span id="617">617</span> | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees "合并二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-two-binary-trees) | Easy |
-| <span id="616">616</span> | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/add-bold-tag-in-string) | Medium |
-| <span id="615">615</span> | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/average-salary-departments-vs-company) | Hard |
-| <span id="614">614</span> | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/second-degree-follower) | Medium |
-| <span id="613">613</span> | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-line) | Easy |
-| <span id="612">612</span> | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-plane) | Medium |
+| <span id="616">616</span> | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/add-bold-tag-in-string) | Medium |
+| <span id="615">615</span> | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/average-salary-departments-vs-company) | Hard |
+| <span id="614">614</span> | [Second Degree Follower](https://leetcode.com/problems/second-degree-follower) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/second-degree-follower) | Medium |
+| <span id="613">613</span> | [Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-line) | Easy |
+| <span id="612">612</span> | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-plane) | Medium |
 | <span id="611">611</span> | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number "有效三角形的个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-triangle-number) | Medium |
-| <span id="610">610</span> | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/triangle-judgement) | Easy |
+| <span id="610">610</span> | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/triangle-judgement) | Easy |
 | <span id="609">609</span> | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system "在系统中查找重复文件") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-file-in-system) | Medium |
-| <span id="608">608</span> | [Tree Node](https://leetcode.com/problems/tree-node "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/tree-node) | Medium |
-| <span id="607">607</span> | [Sales Person](https://leetcode.com/problems/sales-person "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sales-person) | Easy |
+| <span id="608">608</span> | [Tree Node](https://leetcode.com/problems/tree-node) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/tree-node) | Medium |
+| <span id="607">607</span> | [Sales Person](https://leetcode.com/problems/sales-person) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sales-person) | Easy |
 | <span id="606">606</span> | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree "根据二叉树创建字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-string-from-binary-tree) | Easy |
 | <span id="605">605</span> | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers "种花问题") | [Go](https://github.com/openset/leetcode/tree/master/problems/can-place-flowers) | Easy |
-| <span id="604">604</span> | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-compressed-string-iterator) | Easy |
-| <span id="603">603</span> | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-available-seats) | Easy |
-| <span id="602">602</span> | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-ii-who-has-the-most-friends) | Medium |
+| <span id="604">604</span> | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-compressed-string-iterator) | Easy |
+| <span id="603">603</span> | [Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/consecutive-available-seats) | Easy |
+| <span id="602">602</span> | [Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-ii-who-has-the-most-friends) | Medium |
 | <span id="601">601</span> | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium "体育馆的人流量") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/human-traffic-of-stadium) | Hard |
 | <span id="600">600</span> | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones "不含连续1的非负整数") | [Go](https://github.com/openset/leetcode/tree/master/problems/non-negative-integers-without-consecutive-ones) | Hard |
 | <span id="599">599</span> | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists "两个列表的最小索引总和") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-index-sum-of-two-lists) | Easy |
 | <span id="598">598</span> | [Range Addition II](https://leetcode.com/problems/range-addition-ii "范围求和 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/range-addition-ii) | Easy |
-| <span id="597">597</span> | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-i-overall-acceptance-rate) | Easy |
+| <span id="597">597</span> | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-requests-i-overall-acceptance-rate) | Easy |
 | <span id="596">596</span> | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students "超过5名学生的课") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/classes-more-than-5-students) | Easy |
 | <span id="595">595</span> | [Big Countries](https://leetcode.com/problems/big-countries "大的国家") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/big-countries) | Easy |
 | <span id="594">594</span> | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence "最长和谐子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-harmonious-subsequence) | Easy |
@@ -432,50 +436,50 @@ LeetCode Problems' Solutions
 | <span id="591">591</span> | [Tag Validator](https://leetcode.com/problems/tag-validator "标签验证器") | [Go](https://github.com/openset/leetcode/tree/master/problems/tag-validator) | Hard |
 | <span id="590">590</span> | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal "N叉树的后序遍历") | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-postorder-traversal) | Easy |
 | <span id="589">589</span> | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal "N叉树的前序遍历") | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-preorder-traversal) | Easy |
-| <span id="588">588</span> | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system) | Hard |
+| <span id="588">588</span> | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system) | Hard |
 | <span id="587">587</span> | [Erect the Fence](https://leetcode.com/problems/erect-the-fence "安装栅栏") | [Go](https://github.com/openset/leetcode/tree/master/problems/erect-the-fence) | Hard |
-| <span id="586">586</span> | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/customer-placing-the-largest-number-of-orders) | Easy |
-| <span id="585">585</span> | [Investments in 2016](https://leetcode.com/problems/investments-in-2016 "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/investments-in-2016) | Medium |
-| <span id="584">584</span> | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-customer-referee) | Easy |
+| <span id="586">586</span> | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/customer-placing-the-largest-number-of-orders) | Easy |
+| <span id="585">585</span> | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/investments-in-2016) | Medium |
+| <span id="584">584</span> | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-customer-referee) | Easy |
 | <span id="583">583</span> | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings "两个字符串的删除操作") | [Go](https://github.com/openset/leetcode/tree/master/problems/delete-operation-for-two-strings) | Medium |
-| <span id="582">582</span> | [Kill Process](https://leetcode.com/problems/kill-process "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/kill-process) | Medium |
+| <span id="582">582</span> | [Kill Process](https://leetcode.com/problems/kill-process) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/kill-process) | Medium |
 | <span id="581">581</span> | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray "最短无序连续子数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-unsorted-continuous-subarray) | Easy |
-| <span id="580">580</span> | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/count-student-number-in-departments) | Medium |
-| <span id="579">579</span> | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-cumulative-salary-of-an-employee) | Hard |
-| <span id="578">578</span> | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/get-highest-answer-rate-question) | Medium |
-| <span id="577">577</span> | [Employee Bonus](https://leetcode.com/problems/employee-bonus "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-bonus) | Easy |
+| <span id="580">580</span> | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/count-student-number-in-departments) | Medium |
+| <span id="579">579</span> | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-cumulative-salary-of-an-employee) | Hard |
+| <span id="578">578</span> | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/get-highest-answer-rate-question) | Medium |
+| <span id="577">577</span> | [Employee Bonus](https://leetcode.com/problems/employee-bonus) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/employee-bonus) | Easy |
 | <span id="576">576</span> | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths "出界的路径数") | [Go](https://github.com/openset/leetcode/tree/master/problems/out-of-boundary-paths) | Medium |
 | <span id="575">575</span> | [Distribute Candies](https://leetcode.com/problems/distribute-candies "分糖果") | [Go](https://github.com/openset/leetcode/tree/master/problems/distribute-candies) | Easy |
-| <span id="574">574</span> | [Winning Candidate](https://leetcode.com/problems/winning-candidate "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/winning-candidate) | Medium |
-| <span id="573">573</span> | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/squirrel-simulation) | Medium |
+| <span id="574">574</span> | [Winning Candidate](https://leetcode.com/problems/winning-candidate) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/winning-candidate) | Medium |
+| <span id="573">573</span> | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/squirrel-simulation) | Medium |
 | <span id="572">572</span> | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree "另一个树的子树") | [Go](https://github.com/openset/leetcode/tree/master/problems/subtree-of-another-tree) | Easy |
-| <span id="571">571</span> | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-median-given-frequency-of-numbers) | Hard |
-| <span id="570">570</span> | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/managers-with-at-least-5-direct-reports) | Medium |
-| <span id="569">569</span> | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/median-employee-salary) | Hard |
-| <span id="568">568</span> | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-vacation-days) | Hard |
+| <span id="571">571</span> | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-median-given-frequency-of-numbers) | Hard |
+| <span id="570">570</span> | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/managers-with-at-least-5-direct-reports) | Medium |
+| <span id="569">569</span> | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/median-employee-salary) | Hard |
+| <span id="568">568</span> | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-vacation-days) | Hard |
 | <span id="567">567</span> | [Permutation in String](https://leetcode.com/problems/permutation-in-string "字符串的排列") | [Go](https://github.com/openset/leetcode/tree/master/problems/permutation-in-string) | Medium |
 | <span id="566">566</span> | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix "重塑矩阵") | [Go](https://github.com/openset/leetcode/tree/master/problems/reshape-the-matrix) | Easy |
 | <span id="565">565</span> | [Array Nesting](https://leetcode.com/problems/array-nesting "数组嵌套") | [Go](https://github.com/openset/leetcode/tree/master/problems/array-nesting) | Medium |
 | <span id="564">564</span> | [Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome "寻找最近的回文数") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-closest-palindrome) | Hard |
 | <span id="563">563</span> | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt "二叉树的坡度") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-tilt) | Easy |
-| <span id="562">562</span> | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-line-of-consecutive-one-in-matrix) | Medium |
+| <span id="562">562</span> | [Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-line-of-consecutive-one-in-matrix) | Medium |
 | <span id="561">561</span> | [Array Partition I](https://leetcode.com/problems/array-partition-i "数组拆分 I") | [Go](https://github.com/openset/leetcode/tree/master/problems/array-partition-i) | Easy |
 | <span id="560">560</span> | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k "和为K的子数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k) | Medium |
 | <span id="559">559</span> | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree "N叉树的最大深度") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-n-ary-tree) | Easy |
 | <span id="558">558</span> | [Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection "四叉树交集") | [Go](https://github.com/openset/leetcode/tree/master/problems/quad-tree-intersection) | Easy |
 | <span id="557">557</span> | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii "反转字符串中的单词 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-iii) | Easy |
 | <span id="556">556</span> | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii "下一个更大元素 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-iii) | Medium |
-| <span id="555">555</span> | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-concatenated-strings) | Medium |
+| <span id="555">555</span> | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-concatenated-strings) | Medium |
 | <span id="554">554</span> | [Brick Wall](https://leetcode.com/problems/brick-wall "砖墙") | [Go](https://github.com/openset/leetcode/tree/master/problems/brick-wall) | Medium |
 | <span id="553">553</span> | [Optimal Division](https://leetcode.com/problems/optimal-division "最优除法") | [Go](https://github.com/openset/leetcode/tree/master/problems/optimal-division) | Medium |
 | <span id="552">552</span> | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii "学生出勤记录 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-ii) | Hard |
 | <span id="551">551</span> | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i "学生出勤记录 I") | [Go](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-i) | Easy |
-| <span id="549">549</span> | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence-ii) | Medium |
-| <span id="548">548</span> | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-with-equal-sum) | Medium |
+| <span id="549">549</span> | [Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence-ii) | Medium |
+| <span id="548">548</span> | [Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-with-equal-sum) | Medium |
 | <span id="547">547</span> | [Friend Circles](https://leetcode.com/problems/friend-circles "朋友圈") | [Go](https://github.com/openset/leetcode/tree/master/problems/friend-circles) | Medium |
 | <span id="546">546</span> | [Remove Boxes](https://leetcode.com/problems/remove-boxes "移除盒子") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-boxes) | Hard |
-| <span id="545">545</span> | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/boundary-of-binary-tree) | Medium |
-| <span id="544">544</span> | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/output-contest-matches) | Medium |
+| <span id="545">545</span> | [Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/boundary-of-binary-tree) | Medium |
+| <span id="544">544</span> | [Output Contest Matches](https://leetcode.com/problems/output-contest-matches) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/output-contest-matches) | Medium |
 | <span id="543">543</span> | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree "二叉树的直径") | [Go](https://github.com/openset/leetcode/tree/master/problems/diameter-of-binary-tree) | Easy |
 | <span id="542">542</span> | [01 Matrix](https://leetcode.com/problems/01-matrix "01 矩阵") | [Go](https://github.com/openset/leetcode/tree/master/problems/01-matrix) | Medium |
 | <span id="541">541</span> | [Reverse String II](https://leetcode.com/problems/reverse-string-ii "反转字符串 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-string-ii) | Easy |
@@ -483,15 +487,15 @@ LeetCode Problems' Solutions
 | <span id="539">539</span> | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference "最小时间差") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-time-difference) | Medium |
 | <span id="538">538</span> | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree "把二叉搜索树转换为累加树") | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-bst-to-greater-tree) | Easy |
 | <span id="537">537</span> | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication "复数乘法") | [Go](https://github.com/openset/leetcode/tree/master/problems/complex-number-multiplication) | Medium |
-| <span id="536">536</span> | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-string) | Medium |
+| <span id="536">536</span> | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-string) | Medium |
 | <span id="535">535</span> | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl "TinyURL 的加密与解密") | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-tinyurl) | Medium |
-| <span id="533">533</span> | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii) | Medium |
+| <span id="533">533</span> | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii) | Medium |
 | <span id="532">532</span> | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array "数组中的K-diff数对") | [Go](https://github.com/openset/leetcode/tree/master/problems/k-diff-pairs-in-an-array) | Easy |
-| <span id="531">531</span> | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i) | Medium |
+| <span id="531">531</span> | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i) | Medium |
 | <span id="530">530</span> | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst "二叉搜索树的最小绝对差") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst) | Easy |
 | <span id="529">529</span> | [Minesweeper](https://leetcode.com/problems/minesweeper "扫雷游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/minesweeper) | Medium |
 | <span id="528">528</span> | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight "按权重随机选择") | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-weight) | Medium |
-| <span id="527">527</span> | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation) | Hard |
+| <span id="527">527</span> | [Word Abbreviation](https://leetcode.com/problems/word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation) | Hard |
 | <span id="526">526</span> | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement "优美的排列") | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement) | Medium |
 | <span id="525">525</span> | [Contiguous Array](https://leetcode.com/problems/contiguous-array "连续数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/contiguous-array) | Medium |
 | <span id="524">524</span> | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting "通过删除字母匹配到字典里最长单词") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary-through-deleting) | Medium |
@@ -509,13 +513,13 @@ LeetCode Problems' Solutions
 | <span id="508">508</span> | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum "出现次数最多的子树元素和") | [Go](https://github.com/openset/leetcode/tree/master/problems/most-frequent-subtree-sum) | Medium |
 | <span id="507">507</span> | [Perfect Number](https://leetcode.com/problems/perfect-number "完美数") | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-number) | Easy |
 | <span id="506">506</span> | [Relative Ranks](https://leetcode.com/problems/relative-ranks "相对名次") | [Go](https://github.com/openset/leetcode/tree/master/problems/relative-ranks) | Easy |
-| <span id="505">505</span> | [The Maze II](https://leetcode.com/problems/the-maze-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii) | Medium |
+| <span id="505">505</span> | [The Maze II](https://leetcode.com/problems/the-maze-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii) | Medium |
 | <span id="504">504</span> | [Base 7](https://leetcode.com/problems/base-7 "七进制数") | [Go](https://github.com/openset/leetcode/tree/master/problems/base-7) | Easy |
 | <span id="503">503</span> | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii "下一个更大元素 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-ii) | Medium |
 | <span id="502">502</span> | [IPO](https://leetcode.com/problems/ipo "IPO") | [Go](https://github.com/openset/leetcode/tree/master/problems/ipo) | Hard |
 | <span id="501">501</span> | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree "二叉搜索树中的众数") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-mode-in-binary-search-tree) | Easy |
 | <span id="500">500</span> | [Keyboard Row](https://leetcode.com/problems/keyboard-row "键盘行") | [Go](https://github.com/openset/leetcode/tree/master/problems/keyboard-row) | Easy |
-| <span id="499">499</span> | [The Maze III](https://leetcode.com/problems/the-maze-iii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii) | Hard |
+| <span id="499">499</span> | [The Maze III](https://leetcode.com/problems/the-maze-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii) | Hard |
 | <span id="498">498</span> | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse "对角线遍历") | [Go](https://github.com/openset/leetcode/tree/master/problems/diagonal-traverse) | Medium |
 | <span id="497">497</span> | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles "非重叠矩形中的随机点") | [Go](https://github.com/openset/leetcode/tree/master/problems/random-point-in-non-overlapping-rectangles) | Medium |
 | <span id="496">496</span> | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i "下一个更大元素 I") | [Go](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-i) | Easy |
@@ -524,13 +528,13 @@ LeetCode Problems' Solutions
 | <span id="493">493</span> | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs "翻转对") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | Hard |
 | <span id="492">492</span> | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle "构造矩形") | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-the-rectangle) | Easy |
 | <span id="491">491</span> | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences "递增子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-subsequences) | Medium |
-| <span id="490">490</span> | [The Maze](https://leetcode.com/problems/the-maze "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze) | Medium |
-| <span id="489">489</span> | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/robot-room-cleaner) | Hard |
+| <span id="490">490</span> | [The Maze](https://leetcode.com/problems/the-maze) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze) | Medium |
+| <span id="489">489</span> | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/robot-room-cleaner) | Hard |
 | <span id="488">488</span> | [Zuma Game](https://leetcode.com/problems/zuma-game "祖玛游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/zuma-game) | Hard |
-| <span id="487">487</span> | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-ii) | Medium |
+| <span id="487">487</span> | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-ii) | Medium |
 | <span id="486">486</span> | [Predict the Winner](https://leetcode.com/problems/predict-the-winner "预测赢家") | [Go](https://github.com/openset/leetcode/tree/master/problems/predict-the-winner) | Medium |
 | <span id="485">485</span> | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones "最大连续1的个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones) | Easy |
-| <span id="484">484</span> | [Find Permutation](https://leetcode.com/problems/find-permutation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-permutation) | Medium |
+| <span id="484">484</span> | [Find Permutation](https://leetcode.com/problems/find-permutation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-permutation) | Medium |
 | <span id="483">483</span> | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base "最小好进制") | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-good-base) | Hard |
 | <span id="482">482</span> | [License Key Formatting](https://leetcode.com/problems/license-key-formatting "密钥格式化") | [Go](https://github.com/openset/leetcode/tree/master/problems/license-key-formatting) | Easy |
 | <span id="481">481</span> | [Magical String](https://leetcode.com/problems/magical-string "神奇字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/magical-string) | Medium |
@@ -543,13 +547,13 @@ LeetCode Problems' Solutions
 | <span id="474">474</span> | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes "一和零") | [Go](https://github.com/openset/leetcode/tree/master/problems/ones-and-zeroes) | Medium |
 | <span id="473">473</span> | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square "火柴拼正方形") | [Go](https://github.com/openset/leetcode/tree/master/problems/matchsticks-to-square) | Medium |
 | <span id="472">472</span> | [Concatenated Words](https://leetcode.com/problems/concatenated-words "连接词") | [Go](https://github.com/openset/leetcode/tree/master/problems/concatenated-words) | Hard |
-| <span id="471">471</span> | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length) | Hard |
+| <span id="471">471</span> | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length) | Hard |
 | <span id="470">470</span> | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7 "用 Rand7() 实现 Rand10()") | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-rand10-using-rand7) | Medium |
-| <span id="469">469</span> | [Convex Polygon](https://leetcode.com/problems/convex-polygon "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/convex-polygon) | Medium |
+| <span id="469">469</span> | [Convex Polygon](https://leetcode.com/problems/convex-polygon) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/convex-polygon) | Medium |
 | <span id="468">468</span> | [Validate IP Address](https://leetcode.com/problems/validate-ip-address "验证IP地址") | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-ip-address) | Medium |
 | <span id="467">467</span> | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string "环绕字符串中唯一的子字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-substrings-in-wraparound-string) | Medium |
 | <span id="466">466</span> | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions "统计重复个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-the-repetitions) | Hard |
-| <span id="465">465</span> | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/optimal-account-balancing) | Hard |
+| <span id="465">465</span> | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/optimal-account-balancing) | Hard |
 | <span id="464">464</span> | [Can I Win](https://leetcode.com/problems/can-i-win "我能赢吗") | [Go](https://github.com/openset/leetcode/tree/master/problems/can-i-win) | Medium |
 | <span id="463">463</span> | [Island Perimeter](https://leetcode.com/problems/island-perimeter "岛屿的周长") | [Go](https://github.com/openset/leetcode/tree/master/problems/island-perimeter) | Easy |
 | <span id="462">462</span> | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii "最少移动次数使数组元素相等 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements-ii) | Medium |
@@ -570,12 +574,12 @@ LeetCode Problems' Solutions
 | <span id="447">447</span> | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs "回旋镖的数量") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-boomerangs) | Easy |
 | <span id="446">446</span> | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence "等差数列划分 II - 子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices-ii-subsequence) | Hard |
 | <span id="445">445</span> | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii "两数相加 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers-ii) | Medium |
-| <span id="444">444</span> | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sequence-reconstruction) | Medium |
+| <span id="444">444</span> | [Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sequence-reconstruction) | Medium |
 | <span id="443">443</span> | [String Compression](https://leetcode.com/problems/string-compression "压缩字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/string-compression) | Easy |
 | <span id="442">442</span> | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array "数组中重复的数据") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-duplicates-in-an-array) | Medium |
 | <span id="441">441</span> | [Arranging Coins](https://leetcode.com/problems/arranging-coins "排列硬币") | [Go](https://github.com/openset/leetcode/tree/master/problems/arranging-coins) | Easy |
 | <span id="440">440</span> | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order "字典序的第K小数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-in-lexicographical-order) | Hard |
-| <span id="439">439</span> | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser) | Medium |
+| <span id="439">439</span> | [Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser) | Medium |
 | <span id="438">438</span> | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string "找到字符串中所有字母异位词") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-all-anagrams-in-a-string) | Easy |
 | <span id="437">437</span> | [Path Sum III](https://leetcode.com/problems/path-sum-iii "路径总和 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-iii) | Easy |
 | <span id="436">436</span> | [Find Right Interval](https://leetcode.com/problems/find-right-interval "寻找右区间") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-right-interval) | Medium |
@@ -583,30 +587,30 @@ LeetCode Problems' Solutions
 | <span id="434">434</span> | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string "字符串中的单词数") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-segments-in-a-string) | Easy |
 | <span id="433">433</span> | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation "最小基因变化") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-genetic-mutation) | Medium |
 | <span id="432">432</span> | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure "全 O(1) 的数据结构") | [Go](https://github.com/openset/leetcode/tree/master/problems/all-oone-data-structure) | Hard |
-| <span id="431">431</span> | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-n-ary-tree-to-binary-tree) | Hard |
+| <span id="431">431</span> | [Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-n-ary-tree-to-binary-tree) | Hard |
 | <span id="430">430</span> | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list "扁平化多级双向链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-a-multilevel-doubly-linked-list) | Medium |
 | <span id="429">429</span> | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal "N叉树的层序遍历") | [Go](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-level-order-traversal) | Easy |
-| <span id="428">428</span> | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree) | Hard |
+| <span id="428">428</span> | [Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree) | Hard |
 | <span id="427">427</span> | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree "建立四叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-quad-tree) | Easy |
-| <span id="426">426</span> | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
-| <span id="425">425</span> | [Word Squares](https://leetcode.com/problems/word-squares "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-squares) | Hard |
+| <span id="426">426</span> | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) | Medium |
+| <span id="425">425</span> | [Word Squares](https://leetcode.com/problems/word-squares) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-squares) | Hard |
 | <span id="424">424</span> | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement "替换后的最长重复字符") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-character-replacement) | Medium |
 | <span id="423">423</span> | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english "从英文中重建数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/reconstruct-original-digits-from-english) | Medium |
-| <span id="422">422</span> | [Valid Word Square](https://leetcode.com/problems/valid-word-square "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-word-square) | Easy |
+| <span id="422">422</span> | [Valid Word Square](https://leetcode.com/problems/valid-word-square) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-word-square) | Easy |
 | <span id="421">421</span> | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array "数组中两个数的最大异或值") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-xor-of-two-numbers-in-an-array) | Medium |
 | <span id="420">420</span> | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker "强密码检验器") | [Go](https://github.com/openset/leetcode/tree/master/problems/strong-password-checker) | Hard |
 | <span id="419">419</span> | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board "甲板上的战舰") | [Go](https://github.com/openset/leetcode/tree/master/problems/battleships-in-a-board) | Medium |
-| <span id="418">418</span> | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-screen-fitting) | Medium |
+| <span id="418">418</span> | [Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sentence-screen-fitting) | Medium |
 | <span id="417">417</span> | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow "太平洋大西洋水流问题") | [Go](https://github.com/openset/leetcode/tree/master/problems/pacific-atlantic-water-flow) | Medium |
 | <span id="416">416</span> | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum "分割等和子集") | [Go](https://github.com/openset/leetcode/tree/master/problems/partition-equal-subset-sum) | Medium |
 | <span id="415">415</span> | [Add Strings](https://leetcode.com/problems/add-strings "字符串相加") | [Go](https://github.com/openset/leetcode/tree/master/problems/add-strings) | Easy |
 | <span id="414">414</span> | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number "第三大的数") | [Go](https://github.com/openset/leetcode/tree/master/problems/third-maximum-number) | Easy |
 | <span id="413">413</span> | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices "等差数列划分") | [Go](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices) | Medium |
 | <span id="412">412</span> | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz "Fizz Buzz") | [Go](https://github.com/openset/leetcode/tree/master/problems/fizz-buzz) | Easy |
-| <span id="411">411</span> | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-unique-word-abbreviation) | Hard |
+| <span id="411">411</span> | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-unique-word-abbreviation) | Hard |
 | <span id="410">410</span> | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum "分割数组的最大值") | [Go](https://github.com/openset/leetcode/tree/master/problems/split-array-largest-sum) | Hard |
 | <span id="409">409</span> | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome "最长回文串") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-palindrome) | Easy |
-| <span id="408">408</span> | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-word-abbreviation) | Easy |
+| <span id="408">408</span> | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-word-abbreviation) | Easy |
 | <span id="407">407</span> | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii "接雨水 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water-ii) | Hard |
 | <span id="406">406</span> | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height "根据身高重建队列") | [Go](https://github.com/openset/leetcode/tree/master/problems/queue-reconstruction-by-height) | Medium |
 | <span id="405">405</span> | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal "数字转换为十六进制数") | [Go](https://github.com/openset/leetcode/tree/master/problems/convert-a-number-to-hexadecimal) | Easy |
@@ -635,7 +639,7 @@ LeetCode Problems' Solutions
 | <span id="382">382</span> | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node "链表随机节点") | [Go](https://github.com/openset/leetcode/tree/master/problems/linked-list-random-node) | Medium |
 | <span id="381">381</span> | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed "O(1) 时间插入、删除和获取随机元素 - 允许重复") | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1-duplicates-allowed) | Hard |
 | <span id="380">380</span> | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1 "常数时间插入、删除和获取随机元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1) | Medium |
-| <span id="379">379</span> | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-phone-directory) | Medium |
+| <span id="379">379</span> | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-phone-directory) | Medium |
 | <span id="378">378</span> | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix "有序矩阵中第K小的元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-sorted-matrix) | Medium |
 | <span id="377">377</span> | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv "组合总和 Ⅳ") | [Go](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iv) | Medium |
 | <span id="376">376</span> | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence "摆动序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-subsequence) | Medium |
@@ -644,44 +648,44 @@ LeetCode Problems' Solutions
 | <span id="373">373</span> | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums "查找和最小的K对数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-pairs-with-smallest-sums) | Medium |
 | <span id="372">372</span> | [Super Pow](https://leetcode.com/problems/super-pow "超级次方") | [Go](https://github.com/openset/leetcode/tree/master/problems/super-pow) | Medium |
 | <span id="371">371</span> | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers "两整数之和") | [Go](https://github.com/openset/leetcode/tree/master/problems/sum-of-two-integers) | Easy |
-| <span id="370">370</span> | [Range Addition](https://leetcode.com/problems/range-addition "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/range-addition) | Medium |
-| <span id="369">369</span> | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/plus-one-linked-list) | Medium |
+| <span id="370">370</span> | [Range Addition](https://leetcode.com/problems/range-addition) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/range-addition) | Medium |
+| <span id="369">369</span> | [Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/plus-one-linked-list) | Medium |
 | <span id="368">368</span> | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset "最大整除子集") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-divisible-subset) | Medium |
 | <span id="367">367</span> | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square "有效的完全平方数") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-perfect-square) | Easy |
-| <span id="366">366</span> | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-leaves-of-binary-tree) | Medium |
+| <span id="366">366</span> | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-leaves-of-binary-tree) | Medium |
 | <span id="365">365</span> | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem "水壶问题") | [Go](https://github.com/openset/leetcode/tree/master/problems/water-and-jug-problem) | Medium |
-| <span id="364">364</span> | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum-ii) | Medium |
+| <span id="364">364</span> | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum-ii) | Medium |
 | <span id="363">363</span> | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k "矩形区域不超过 K 的最大数值和") | [Go](https://github.com/openset/leetcode/tree/master/problems/max-sum-of-rectangle-no-larger-than-k) | Hard |
-| <span id="362">362</span> | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hit-counter) | Medium |
-| <span id="361">361</span> | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/bomb-enemy) | Medium |
-| <span id="360">360</span> | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-transformed-array) | Medium |
-| <span id="359">359</span> | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/logger-rate-limiter) | Easy |
-| <span id="358">358</span> | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart) | Hard |
+| <span id="362">362</span> | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-hit-counter) | Medium |
+| <span id="361">361</span> | [Bomb Enemy](https://leetcode.com/problems/bomb-enemy) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/bomb-enemy) | Medium |
+| <span id="360">360</span> | [Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sort-transformed-array) | Medium |
+| <span id="359">359</span> | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/logger-rate-limiter) | Easy |
+| <span id="358">358</span> | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart) | Hard |
 | <span id="357">357</span> | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits "计算各个位数不同的数字个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-numbers-with-unique-digits) | Medium |
-| <span id="356">356</span> | [Line Reflection](https://leetcode.com/problems/line-reflection "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/line-reflection) | Medium |
+| <span id="356">356</span> | [Line Reflection](https://leetcode.com/problems/line-reflection) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/line-reflection) | Medium |
 | <span id="355">355</span> | [Design Twitter](https://leetcode.com/problems/design-twitter "设计推特") | [Go](https://github.com/openset/leetcode/tree/master/problems/design-twitter) | Medium |
 | <span id="354">354</span> | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes "俄罗斯套娃信封问题") | [Go](https://github.com/openset/leetcode/tree/master/problems/russian-doll-envelopes) | Hard |
-| <span id="353">353</span> | [Design Snake Game](https://leetcode.com/problems/design-snake-game "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-snake-game) | Medium |
+| <span id="353">353</span> | [Design Snake Game](https://leetcode.com/problems/design-snake-game) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-snake-game) | Medium |
 | <span id="352">352</span> | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals "将数据流变为多个不相交间隔") | [Go](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals) | Hard |
-| <span id="351">351</span> | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns) | Medium |
+| <span id="351">351</span> | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns) | Medium |
 | <span id="350">350</span> | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii "两个数组的交集 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii) | Easy |
 | <span id="349">349</span> | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays "两个数组的交集") | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays) | Easy |
-| <span id="348">348</span> | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-tic-tac-toe) | Medium |
+| <span id="348">348</span> | [Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/design-tic-tac-toe) | Medium |
 | <span id="347">347</span> | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements "前K个高频元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements) | Medium |
-| <span id="346">346</span> | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/moving-average-from-data-stream) | Easy |
+| <span id="346">346</span> | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/moving-average-from-data-stream) | Easy |
 | <span id="345">345</span> | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string "反转字符串中的元音字母") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-vowels-of-a-string) | Easy |
 | <span id="344">344</span> | [Reverse String](https://leetcode.com/problems/reverse-string "反转字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-string) | Easy |
 | <span id="343">343</span> | [Integer Break](https://leetcode.com/problems/integer-break "整数拆分") | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-break) | Medium |
 | <span id="342">342</span> | [Power of Four](https://leetcode.com/problems/power-of-four "4的幂") | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-four) | Easy |
 | <span id="341">341</span> | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator "扁平化嵌套列表迭代器") | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator) | Medium |
-| <span id="340">340</span> | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters) | Hard |
-| <span id="339">339</span> | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum) | Easy |
+| <span id="340">340</span> | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters) | Hard |
+| <span id="339">339</span> | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum) | Easy |
 | <span id="338">338</span> | [Counting Bits](https://leetcode.com/problems/counting-bits "比特位计数") | [Go](https://github.com/openset/leetcode/tree/master/problems/counting-bits) | Medium |
 | <span id="337">337</span> | [House Robber III](https://leetcode.com/problems/house-robber-iii "打家劫舍 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/house-robber-iii) | Medium |
 | <span id="336">336</span> | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs "回文对") | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-pairs) | Hard |
 | <span id="335">335</span> | [Self Crossing](https://leetcode.com/problems/self-crossing "路径交叉") | [Go](https://github.com/openset/leetcode/tree/master/problems/self-crossing) | Hard |
 | <span id="334">334</span> | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence "递增的三元子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-triplet-subsequence) | Medium |
-| <span id="333">333</span> | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-bst-subtree) | Medium |
+| <span id="333">333</span> | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-bst-subtree) | Medium |
 | <span id="332">332</span> | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary "重新安排行程") | [Go](https://github.com/openset/leetcode/tree/master/problems/reconstruct-itinerary) | Medium |
 | <span id="331">331</span> | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree "验证二叉树的前序序列化") | [Go](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-serialization-of-a-binary-tree) | Medium |
 | <span id="330">330</span> | [Patching Array](https://leetcode.com/problems/patching-array "按要求补齐数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/patching-array) | Hard |
@@ -689,89 +693,89 @@ LeetCode Problems' Solutions
 | <span id="328">328</span> | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list "奇偶链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/odd-even-linked-list) | Medium |
 | <span id="327">327</span> | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum "区间和的个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) | Hard |
 | <span id="326">326</span> | [Power of Three](https://leetcode.com/problems/power-of-three "3的幂") | [Go](https://github.com/openset/leetcode/tree/master/problems/power-of-three) | Easy |
-| <span id="325">325</span> | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-size-subarray-sum-equals-k) | Medium |
+| <span id="325">325</span> | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-size-subarray-sum-equals-k) | Medium |
 | <span id="324">324</span> | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii "摆动排序 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort-ii) | Medium |
-| <span id="323">323</span> | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) | Medium |
+| <span id="323">323</span> | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) | Medium |
 | <span id="322">322</span> | [Coin Change](https://leetcode.com/problems/coin-change "零钱兑换") | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-change) | Medium |
 | <span id="321">321</span> | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number "拼接最大数") | [Go](https://github.com/openset/leetcode/tree/master/problems/create-maximum-number) | Hard |
-| <span id="320">320</span> | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) | Medium |
+| <span id="320">320</span> | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) | Medium |
 | <span id="319">319</span> | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher "灯泡开关") | [Go](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher) | Medium |
 | <span id="318">318</span> | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths "最大单词长度乘积") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-word-lengths) | Medium |
-| <span id="317">317</span> | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) | Hard |
+| <span id="317">317</span> | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) | Hard |
 | <span id="316">316</span> | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters "去除重复字母") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicate-letters) | Hard |
 | <span id="315">315</span> | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self "计算右侧小于当前元素的个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | Hard |
-| <span id="314">314</span> | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal) | Medium |
+| <span id="314">314</span> | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal) | Medium |
 | <span id="313">313</span> | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number "超级丑数") | [Go](https://github.com/openset/leetcode/tree/master/problems/super-ugly-number) | Medium |
 | <span id="312">312</span> | [Burst Balloons](https://leetcode.com/problems/burst-balloons "戳气球") | [Go](https://github.com/openset/leetcode/tree/master/problems/burst-balloons) | Hard |
-| <span id="311">311</span> | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sparse-matrix-multiplication) | Medium |
+| <span id="311">311</span> | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/sparse-matrix-multiplication) | Medium |
 | <span id="310">310</span> | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees "最小高度树") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees) | Medium |
 | <span id="309">309</span> | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown "最佳买卖股票时机含冷冻期") | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown) | Medium |
-| <span id="308">308</span> | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) | Hard |
+| <span id="308">308</span> | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) | Hard |
 | <span id="307">307</span> | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable "区域和检索 - 数组可修改") | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable) | Medium |
 | <span id="306">306</span> | [Additive Number](https://leetcode.com/problems/additive-number "累加数") | [Go](https://github.com/openset/leetcode/tree/master/problems/additive-number) | Medium |
-| <span id="305">305</span> | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-islands-ii) | Hard |
+| <span id="305">305</span> | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-islands-ii) | Hard |
 | <span id="304">304</span> | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable "二维区域和检索 - 矩阵不可变") | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-immutable) | Medium |
 | <span id="303">303</span> | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable "区域和检索 - 数组不可变") | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-immutable) | Easy |
-| <span id="302">302</span> | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-rectangle-enclosing-black-pixels) | Hard |
+| <span id="302">302</span> | [Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-rectangle-enclosing-black-pixels) | Hard |
 | <span id="301">301</span> | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses "删除无效的括号") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-invalid-parentheses) | Hard |
 | <span id="300">300</span> | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence "最长上升子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence) | Medium |
 | <span id="299">299</span> | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows "猜数字游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/bulls-and-cows) | Medium |
-| <span id="298">298</span> | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence) | Medium |
+| <span id="298">298</span> | [Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence) | Medium |
 | <span id="297">297</span> | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree "二叉树的序列化与反序列化") | [Go](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-binary-tree) | Hard |
-| <span id="296">296</span> | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/best-meeting-point) | Hard |
+| <span id="296">296</span> | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/best-meeting-point) | Hard |
 | <span id="295">295</span> | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream "数据流的中位数") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-median-from-data-stream) | Hard |
-| <span id="294">294</span> | [Flip Game II](https://leetcode.com/problems/flip-game-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii) | Medium |
-| <span id="293">293</span> | [Flip Game](https://leetcode.com/problems/flip-game "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-game) | Easy |
+| <span id="294">294</span> | [Flip Game II](https://leetcode.com/problems/flip-game-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii) | Medium |
+| <span id="293">293</span> | [Flip Game](https://leetcode.com/problems/flip-game) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-game) | Easy |
 | <span id="292">292</span> | [Nim Game](https://leetcode.com/problems/nim-game "Nim游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/nim-game) | Easy |
-| <span id="291">291</span> | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-pattern-ii) | Hard |
+| <span id="291">291</span> | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/word-pattern-ii) | Hard |
 | <span id="290">290</span> | [Word Pattern](https://leetcode.com/problems/word-pattern "单词模式") | [Go](https://github.com/openset/leetcode/tree/master/problems/word-pattern) | Easy |
 | <span id="289">289</span> | [Game of Life](https://leetcode.com/problems/game-of-life "生命游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/game-of-life) | Medium |
-| <span id="288">288</span> | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-word-abbreviation) | Medium |
+| <span id="288">288</span> | [Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-word-abbreviation) | Medium |
 | <span id="287">287</span> | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number "寻找重复数") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number) | Medium |
-| <span id="286">286</span> | [Walls and Gates](https://leetcode.com/problems/walls-and-gates "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates) | Medium |
-| <span id="285">285</span> | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst) | Medium |
+| <span id="286">286</span> | [Walls and Gates](https://leetcode.com/problems/walls-and-gates) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates) | Medium |
+| <span id="285">285</span> | [Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst) | Medium |
 | <span id="284">284</span> | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator "顶端迭代器") | [Go](https://github.com/openset/leetcode/tree/master/problems/peeking-iterator) | Medium |
 | <span id="283">283</span> | [Move Zeroes](https://leetcode.com/problems/move-zeroes "移动零") | [Go](https://github.com/openset/leetcode/tree/master/problems/move-zeroes) | Easy |
 | <span id="282">282</span> | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators "给表达式添加运算符") | [Go](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators) | Hard |
-| <span id="281">281</span> | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/zigzag-iterator) | Medium |
-| <span id="280">280</span> | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort) | Medium |
+| <span id="281">281</span> | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/zigzag-iterator) | Medium |
+| <span id="280">280</span> | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort) | Medium |
 | <span id="279">279</span> | [Perfect Squares](https://leetcode.com/problems/perfect-squares "完全平方数") | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-squares) | Medium |
 | <span id="278">278</span> | [First Bad Version](https://leetcode.com/problems/first-bad-version "第一个错误的版本") | [Go](https://github.com/openset/leetcode/tree/master/problems/first-bad-version) | Easy |
-| <span id="277">277</span> | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-celebrity) | Medium |
-| <span id="276">276</span> | [Paint Fence](https://leetcode.com/problems/paint-fence "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-fence) | Easy |
+| <span id="277">277</span> | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/find-the-celebrity) | Medium |
+| <span id="276">276</span> | [Paint Fence](https://leetcode.com/problems/paint-fence) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-fence) | Easy |
 | <span id="275">275</span> | [H-Index II](https://leetcode.com/problems/h-index-ii "H指数 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/h-index-ii) | Medium |
 | <span id="274">274</span> | [H-Index](https://leetcode.com/problems/h-index "H指数") | [Go](https://github.com/openset/leetcode/tree/master/problems/h-index) | Medium |
 | <span id="273">273</span> | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words "整数转换英文表示") | [Go](https://github.com/openset/leetcode/tree/master/problems/integer-to-english-words) | Hard |
-| <span id="272">272</span> | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value-ii) | Hard |
-| <span id="271">271</span> | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-strings) | Medium |
-| <span id="270">270</span> | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value) | Easy |
-| <span id="269">269</span> | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/alien-dictionary) | Hard |
+| <span id="272">272</span> | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value-ii) | Hard |
+| <span id="271">271</span> | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-strings) | Medium |
+| <span id="270">270</span> | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value) | Easy |
+| <span id="269">269</span> | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/alien-dictionary) | Hard |
 | <span id="268">268</span> | [Missing Number](https://leetcode.com/problems/missing-number "缺失数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/missing-number) | Easy |
-| <span id="267">267</span> | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation-ii) | Medium |
-| <span id="266">266</span> | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation) | Easy |
-| <span id="265">265</span> | [Paint House II](https://leetcode.com/problems/paint-house-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii) | Hard |
+| <span id="267">267</span> | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation-ii) | Medium |
+| <span id="266">266</span> | [Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation) | Easy |
+| <span id="265">265</span> | [Paint House II](https://leetcode.com/problems/paint-house-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii) | Hard |
 | <span id="264">264</span> | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii "丑数 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii) | Medium |
 | <span id="263">263</span> | [Ugly Number](https://leetcode.com/problems/ugly-number "丑数") | [Go](https://github.com/openset/leetcode/tree/master/problems/ugly-number) | Easy |
 | <span id="262">262</span> | [Trips and Users](https://leetcode.com/problems/trips-and-users "行程和用户") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/trips-and-users) | Hard |
-| <span id="261">261</span> | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree) | Medium |
+| <span id="261">261</span> | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree) | Medium |
 | <span id="260">260</span> | [Single Number III](https://leetcode.com/problems/single-number-iii "只出现一次的数字 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/single-number-iii) | Medium |
-| <span id="259">259</span> | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) | Medium |
+| <span id="259">259</span> | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) | Medium |
 | <span id="258">258</span> | [Add Digits](https://leetcode.com/problems/add-digits "各位相加") | [Go](https://github.com/openset/leetcode/tree/master/problems/add-digits) | Easy |
 | <span id="257">257</span> | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths "二叉树的所有路径") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-paths) | Easy |
-| <span id="256">256</span> | [Paint House](https://leetcode.com/problems/paint-house "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-house) | Easy |
-| <span id="255">255</span> | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-sequence-in-binary-search-tree) | Medium |
-| <span id="254">254</span> | [Factor Combinations](https://leetcode.com/problems/factor-combinations "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/factor-combinations) | Medium |
-| <span id="253">253</span> | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii) | Medium |
-| <span id="252">252</span> | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms) | Easy |
-| <span id="251">251</span> | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector) | Medium |
-| <span id="250">250</span> | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/count-univalue-subtrees) | Medium |
-| <span id="249">249</span> | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/group-shifted-strings) | Medium |
-| <span id="248">248</span> | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-iii) | Hard |
-| <span id="247">247</span> | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-ii) | Medium |
-| <span id="246">246</span> | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number) | Easy |
-| <span id="245">245</span> | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-iii) | Medium |
-| <span id="244">244</span> | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-ii) | Medium |
-| <span id="243">243</span> | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance) | Easy |
+| <span id="256">256</span> | [Paint House](https://leetcode.com/problems/paint-house) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/paint-house) | Easy |
+| <span id="255">255</span> | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-sequence-in-binary-search-tree) | Medium |
+| <span id="254">254</span> | [Factor Combinations](https://leetcode.com/problems/factor-combinations) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/factor-combinations) | Medium |
+| <span id="253">253</span> | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii) | Medium |
+| <span id="252">252</span> | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms) | Easy |
+| <span id="251">251</span> | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector) | Medium |
+| <span id="250">250</span> | [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/count-univalue-subtrees) | Medium |
+| <span id="249">249</span> | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/group-shifted-strings) | Medium |
+| <span id="248">248</span> | [Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-iii) | Hard |
+| <span id="247">247</span> | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-ii) | Medium |
+| <span id="246">246</span> | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number) | Easy |
+| <span id="245">245</span> | [Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-iii) | Medium |
+| <span id="244">244</span> | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-ii) | Medium |
+| <span id="243">243</span> | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance) | Easy |
 | <span id="242">242</span> | [Valid Anagram](https://leetcode.com/problems/valid-anagram "有效的字母异位词") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-anagram) | Easy |
 | <span id="241">241</span> | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses "为运算表达式设计优先级") | [Go](https://github.com/openset/leetcode/tree/master/problems/different-ways-to-add-parentheses) | Medium |
 | <span id="240">240</span> | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii "搜索二维矩阵 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix-ii) | Medium |
@@ -828,7 +832,7 @@ LeetCode Problems' Solutions
 | <span id="189">189</span> | [Rotate Array](https://leetcode.com/problems/rotate-array "旋转数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/rotate-array) | Easy |
 | <span id="188">188</span> | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv "买卖股票的最佳时机 IV") | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv) | Hard |
 | <span id="187">187</span> | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences "重复的DNA序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-dna-sequences) | Medium |
-| <span id="186">186</span> | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-ii) | Medium |
+| <span id="186">186</span> | [Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-ii) | Medium |
 | <span id="185">185</span> | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries "部门工资前三高的员工") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/department-top-three-salaries) | Hard |
 | <span id="184">184</span> | [Department Highest Salary](https://leetcode.com/problems/department-highest-salary "部门工资最高的员工") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/department-highest-salary) | Medium |
 | <span id="183">183</span> | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order "从不订购的客户") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/customers-who-never-order) | Easy |
@@ -844,21 +848,21 @@ LeetCode Problems' Solutions
 | <span id="173">173</span> | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator "二叉搜索树迭代器") | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator) | Medium |
 | <span id="172">172</span> | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes "阶乘后的零") | [Go](https://github.com/openset/leetcode/tree/master/problems/factorial-trailing-zeroes) | Easy |
 | <span id="171">171</span> | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number "Excel表列序号") | [Go](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-number) | Easy |
-| <span id="170">170</span> | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-iii-data-structure-design) | Easy |
+| <span id="170">170</span> | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-iii-data-structure-design) | Easy |
 | <span id="169">169</span> | [Majority Element](https://leetcode.com/problems/majority-element "求众数") | [Go](https://github.com/openset/leetcode/tree/master/problems/majority-element) | Easy |
 | <span id="168">168</span> | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title "Excel表列名称") | [Go](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-title) | Easy |
 | <span id="167">167</span> | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted "两数之和 II - 输入有序数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-ii-input-array-is-sorted) | Easy |
 | <span id="166">166</span> | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal "分数到小数") | [Go](https://github.com/openset/leetcode/tree/master/problems/fraction-to-recurring-decimal) | Medium |
 | <span id="165">165</span> | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers "比较版本号") | [Go](https://github.com/openset/leetcode/tree/master/problems/compare-version-numbers) | Medium |
 | <span id="164">164</span> | [Maximum Gap](https://leetcode.com/problems/maximum-gap "最大间距") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-gap) | Hard |
-| <span id="163">163</span> | [Missing Ranges](https://leetcode.com/problems/missing-ranges "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/missing-ranges) | Medium |
+| <span id="163">163</span> | [Missing Ranges](https://leetcode.com/problems/missing-ranges) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/missing-ranges) | Medium |
 | <span id="162">162</span> | [Find Peak Element](https://leetcode.com/problems/find-peak-element "寻找峰值") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-peak-element) | Medium |
-| <span id="161">161</span> | [One Edit Distance](https://leetcode.com/problems/one-edit-distance "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/one-edit-distance) | Medium |
+| <span id="161">161</span> | [One Edit Distance](https://leetcode.com/problems/one-edit-distance) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/one-edit-distance) | Medium |
 | <span id="160">160</span> | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists "相交链表") | [Go](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-linked-lists) | Easy |
-| <span id="159">159</span> | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters) | Hard |
-| <span id="158">158</span> | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4-ii-call-multiple-times) | Hard |
-| <span id="157">157</span> | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4 "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4) | Easy |
-| <span id="156">156</span> | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down "") &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-upside-down) | Medium |
+| <span id="159">159</span> | [Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters) | Hard |
+| <span id="158">158</span> | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4-ii-call-multiple-times) | Hard |
+| <span id="157">157</span> | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4) | Easy |
+| <span id="156">156</span> | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) &hearts; | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-upside-down) | Medium |
 | <span id="155">155</span> | [Min Stack](https://leetcode.com/problems/min-stack "最小栈") | [Go](https://github.com/openset/leetcode/tree/master/problems/min-stack) | Easy |
 | <span id="154">154</span> | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii "寻找旋转排序数组中的最小值 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array-ii) | Hard |
 | <span id="153">153</span> | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array "寻找旋转排序数组中的最小值") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array) | Medium |

From f3cf1ad6d2840be65e8759edd2ef955be0738ba5 Mon Sep 17 00:00:00 2001
From: Openset <openset.wang@gmail.com>
Date: Fri, 11 Jan 2019 21:11:29 +0800
Subject: [PATCH 19/22] Add: Fibonacci Number

---
 index.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/index.md b/index.md
index ef5db89a4..732a223ec 100644
--- a/index.md
+++ b/index.md
@@ -510,6 +510,7 @@ LeetCode Problems' Solutions
 | <span id="515">515</span> | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row "在每个树行中找最大值") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row) | Medium |
 | <span id="514">514</span> | [Freedom Trail](https://leetcode.com/problems/freedom-trail "自由之路") | [Go](https://github.com/openset/leetcode/tree/master/problems/freedom-trail) | Hard |
 | <span id="513">513</span> | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value "找树左下角的值") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value) | Medium |
+| <span id="509">509</span> | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number "斐波那契数") | [Go](https://github.com/openset/leetcode/tree/master/problems/fibonacci-number) | Easy |
 | <span id="508">508</span> | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum "出现次数最多的子树元素和") | [Go](https://github.com/openset/leetcode/tree/master/problems/most-frequent-subtree-sum) | Medium |
 | <span id="507">507</span> | [Perfect Number](https://leetcode.com/problems/perfect-number "完美数") | [Go](https://github.com/openset/leetcode/tree/master/problems/perfect-number) | Easy |
 | <span id="506">506</span> | [Relative Ranks](https://leetcode.com/problems/relative-ranks "相对名次") | [Go](https://github.com/openset/leetcode/tree/master/problems/relative-ranks) | Easy |

From 989b73cdfc4c919df91a0385a6bcc2c4bdb8fc9b Mon Sep 17 00:00:00 2001
From: Openset <openset@users.noreply.github.com>
Date: Mon, 14 Jan 2019 15:44:23 +0800
Subject: [PATCH 20/22] Add: new

---
 index.md | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/index.md b/index.md
index 732a223ec..cb1d3c1c0 100644
--- a/index.md
+++ b/index.md
@@ -53,6 +53,10 @@ LeetCode Problems' Solutions
 
 | # | Title | Solution | Difficulty |
 | :-: | - | - | :-: |
+| <span id="976">976</span> | [Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle "三角形的最大周长") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-perimeter-triangle) | Easy |
+| <span id="975">975</span> | [Odd Even Jump](https://leetcode.com/problems/odd-even-jump "奇偶跳") | [Go](https://github.com/openset/leetcode/tree/master/problems/odd-even-jump) | Hard |
+| <span id="974">974</span> | [Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k "和可被 K 整除的子数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/subarray-sums-divisible-by-k) | Medium |
+| <span id="973">973</span> | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin "最接近原点的 K 个点") | [Go](https://github.com/openset/leetcode/tree/master/problems/k-closest-points-to-origin) | Easy |
 | <span id="972">972</span> | [Equal Rational Numbers](https://leetcode.com/problems/equal-rational-numbers "相等的有理数") | [Go](https://github.com/openset/leetcode/tree/master/problems/equal-rational-numbers) | Hard |
 | <span id="971">971</span> | [Flip Binary Tree To Match Preorder Traversal](https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal "翻转二叉树以匹配先序遍历") | [Go](https://github.com/openset/leetcode/tree/master/problems/flip-binary-tree-to-match-preorder-traversal) | Medium |
 | <span id="970">970</span> | [Powerful Integers](https://leetcode.com/problems/powerful-integers "强整数") | [Go](https://github.com/openset/leetcode/tree/master/problems/powerful-integers) | Easy |
@@ -989,7 +993,7 @@ LeetCode Problems' Solutions
 | <span id="33">33</span> | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array "搜索旋转排序数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array) | Medium |
 | <span id="32">32</span> | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses "最长有效括号") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-valid-parentheses) | Hard |
 | <span id="31">31</span> | [Next Permutation](https://leetcode.com/problems/next-permutation "下一个排列") | [Go](https://github.com/openset/leetcode/tree/master/problems/next-permutation) | Medium |
-| <span id="30">30</span> | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words "与所有单词相关联的字串") | [Go](https://github.com/openset/leetcode/tree/master/problems/substring-with-concatenation-of-all-words) | Hard |
+| <span id="30">30</span> | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words "串联所有单词的子串") | [Go](https://github.com/openset/leetcode/tree/master/problems/substring-with-concatenation-of-all-words) | Hard |
 | <span id="29">29</span> | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers "两数相除") | [Go](https://github.com/openset/leetcode/tree/master/problems/divide-two-integers) | Medium |
 | <span id="28">28</span> | [Implement strStr()](https://leetcode.com/problems/implement-strstr "实现strStr()") | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-strstr) | Easy |
 | <span id="27">27</span> | [Remove Element](https://leetcode.com/problems/remove-element "移除元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-element) | Easy |

From 5fa8fecb6b2834203719affb357ec2af857790c5 Mon Sep 17 00:00:00 2001
From: Openset <openset@users.noreply.github.com>
Date: Mon, 21 Jan 2019 09:40:32 +0800
Subject: [PATCH 21/22] Add: new

---
 index.md | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/index.md b/index.md
index cb1d3c1c0..33bb8501e 100644
--- a/index.md
+++ b/index.md
@@ -53,6 +53,10 @@ LeetCode Problems' Solutions
 
 | # | Title | Solution | Difficulty |
 | :-: | - | - | :-: |
+| <span id="980">980</span> | [Unique Paths III](https://leetcode.com/problems/unique-paths-iii "不同路径 III") | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-paths-iii) | Hard |
+| <span id="979">979</span> | [Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree "在二叉树中分配硬币") | [Go](https://github.com/openset/leetcode/tree/master/problems/distribute-coins-in-binary-tree) | Medium |
+| <span id="978">978</span> | [Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray "最长湍流子数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-turbulent-subarray) | Medium |
+| <span id="977">977</span> | [Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array "有序数组的平方") | [Go](https://github.com/openset/leetcode/tree/master/problems/squares-of-a-sorted-array) | Easy |
 | <span id="976">976</span> | [Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle "三角形的最大周长") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-perimeter-triangle) | Easy |
 | <span id="975">975</span> | [Odd Even Jump](https://leetcode.com/problems/odd-even-jump "奇偶跳") | [Go](https://github.com/openset/leetcode/tree/master/problems/odd-even-jump) | Hard |
 | <span id="974">974</span> | [Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k "和可被 K 整除的子数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/subarray-sums-divisible-by-k) | Medium |
@@ -544,7 +548,7 @@ LeetCode Problems' Solutions
 | <span id="482">482</span> | [License Key Formatting](https://leetcode.com/problems/license-key-formatting "密钥格式化") | [Go](https://github.com/openset/leetcode/tree/master/problems/license-key-formatting) | Easy |
 | <span id="481">481</span> | [Magical String](https://leetcode.com/problems/magical-string "神奇字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/magical-string) | Medium |
 | <span id="480">480</span> | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median "滑动窗口中位数") | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-window-median) | Hard |
-| <span id="479">479</span> | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product "最大回文数乘积") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-palindrome-product) | Easy |
+| <span id="479">479</span> | [Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product "最大回文数乘积") | [Go](https://github.com/openset/leetcode/tree/master/problems/largest-palindrome-product) | Hard |
 | <span id="478">478</span> | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle "在圆内随机生成点") | [Go](https://github.com/openset/leetcode/tree/master/problems/generate-random-point-in-a-circle) | Medium |
 | <span id="477">477</span> | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance "汉明距离总和") | [Go](https://github.com/openset/leetcode/tree/master/problems/total-hamming-distance) | Medium |
 | <span id="476">476</span> | [Number Complement](https://leetcode.com/problems/number-complement "数字的补数") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-complement) | Easy |

From 582789286c752e3a0b28340272133e6258ce6668 Mon Sep 17 00:00:00 2001
From: Shuo <openset.wang@gmail.com>
Date: Sat, 27 Nov 2021 18:11:35 +0800
Subject: [PATCH 22/22] Update CNAME

---
 CNAME | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/CNAME b/CNAME
index c28f2028f..135ff1398 100644
--- a/CNAME
+++ b/CNAME
@@ -1 +1 @@
-leetcode.openset.wang
\ No newline at end of file
+leetcode.awesee.cn
\ No newline at end of file

[1-50]	[51-100]	[101-150]	[151-200]	[201-250]	[251-300]
[301-350]	[351-400]	[401-450]	[451-500]	[501-550]	[551-600]
[601-650]	[651-700]	[701-750]	[751-800]	[801-850]	[851-900]
[901-950]	[951-1000]	[1001-1050]	[1051-1100]	[1101-1150]	[1151-1200]