diff --git a/README.md b/README.md
index 7c54e825..f976e12e 100644
--- a/README.md
+++ b/README.md
@@ -37,8 +37,8 @@
* [Tree](#tree)
* [Dynamic programming](#dynamic-programming)
* [Backtracking ✅](#backtracking)
-* [Depth-first search](#depth-first-search)
-* [Breadth-first Search](#breadth-first-search)
+* [Depth First Search](#depth-first-search)
+* [Breadth First Search](#breadth-first-search)
* [Binary Search](#binary-search)
* [Math](#math)
* [Hash Table](#hash-table)
@@ -70,1216 +70,1544 @@
| # | Title | Solution | Acceptance | Difficulty | Frequency |
|:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:|
-| 0001 | Two Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0001.Two-Sum) | 44.30% | Easy | |
-| 0002 | Add Two Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0002.Add-Two-Numbers) | 31.30% | Medium | |
-| 0003 | Longest Substring Without Repeating Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters) | 28.50% | Medium | |
-| 0004 | Median of Two Sorted Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0004.Median-of-Two-Sorted-Arrays) | 26.60% | Hard | |
-| 0005 | Longest Palindromic Substring | | 27.50% | Medium | |
-| 0006 | ZigZag Conversion | | 32.20% | Medium | |
-| 0007 | Reverse Integer |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0007.Reverse-Integer) | 25.40% | Easy | |
-| 0008 | String to Integer (atoi) | | 14.70% | Medium | |
-| 0009 | Palindrome Number | | 43.70% | Easy | |
-| 0010 | Regular Expression Matching | | 25.40% | Hard | |
-| 0011 | Container With Most Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water) | 45.10% | Medium | |
-| 0012 | Integer to Roman | | 51.30% | Medium | |
-| 0013 | Roman to Integer | | 52.60% | Easy | |
-| 0014 | Longest Common Prefix | | 33.70% | Easy | |
-| 0015 | 3Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0015.3Sum) | 24.20% | Medium | |
-| 0016 | 3Sum Closest | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0016.3Sum-Closest) | 45.80% | Medium | |
-| 0017 | Letter Combinations of a Phone Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0017.Letter-Combinations-of-a-Phone-Number) | 41.90% | Medium | |
-| 0018 | 4Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0018.4Sum) | 30.80% | Medium | |
-| 0019 | Remove Nth Node From End of List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0019.Remove-Nth-Node-From-End-of-List) | 34.30% | Medium | |
-| 0020 | Valid Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0020.Valid-Parentheses) | 36.70% | Easy | |
-| 0021 | Merge Two Sorted Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0021.Merge-Two-Sorted-Lists) | 47.70% | Easy | |
-| 0022 | Generate Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0022.Generate-Parentheses) | 55.50% | Medium | |
-| 0023 | Merge k Sorted Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0023.Merge-k-Sorted-Lists) | 34.90% | Hard | |
-| 0024 | Swap Nodes in Pairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0024.Swap-Nodes-in-Pairs) | 45.10% | Medium | |
-| 0025 | Reverse Nodes in k-Group | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0025.Reverse-Nodes-in-k-Group) | 36.80% | Hard | |
-| 0026 | Remove Duplicates from Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0026.Remove-Duplicates-from-Sorted-Array) | 41.00% | Easy | |
-| 0027 | Remove Element | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0027.Remove-Element) | 44.80% | Easy | |
-| 0028 | Implement strStr() | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0028.Implement-strStr) | 32.20% | Easy | |
-| 0029 | Divide Two Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0029.Divide-Two-Integers) | 16.10% | Medium | |
-| 0030 | Substring with Concatenation of All Words | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0030.Substring-with-Concatenation-of-All-Words)(是否还有更优解) | 23.70% | Hard | |
-| 0031 | Next Permutation | | 30.60% | Medium | |
-| 0032 | Longest Valid Parentheses | | 25.70% | Hard | |
-| 0033 | Search in Rotated Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0033.Search-in-Rotated-Sorted-Array) | 33.00% | Medium | |
-| 0034 | Find First and Last Position of Element in Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array) | 33.70% | Medium | |
-| 0035 | Search Insert Position | | 40.90% | Easy | |
-| 0036 | Valid Sudoku | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0036.Valid-Sudoku) | 43.50% | Medium | |
-| 0037 | Sudoku Solver | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0037.Sudoku-Solver) | 37.40% | Hard | |
-| 0038 | Count and Say | | 40.80% | Easy | |
-| 0039 | Combination Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0039.Combination-Sum) | 49.10% | Medium | |
-| 0040 | Combination Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0040.Combination-Sum-II) | 42.10% | Medium | |
-| 0041 | First Missing Positive | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0041.First-Missing-Positive) | 29.10% | Hard | |
-| 0042 | Trapping Rain Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water) | 43.50% | Hard | |
-| 0043 | Multiply Strings | | 30.90% | Medium | |
-| 0044 | Wildcard Matching | | 23.00% | Hard | |
-| 0045 | Jump Game II | | 28.20% | Hard | |
-| 0046 | Permutations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0046.Permutations) | 55.70% | Medium | |
-| 0047 | Permutations II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0047.Permutations-II) | 40.90% | Medium | |
-| 0048 | Rotate Image | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0048.Rotate-Image) | 49.00% | Medium | |
-| 0049 | Group Anagrams | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0049.Group-Anagrams) | 47.40% | Medium | |
-| 0050 | Pow(x, n) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0050.Powx-n) | 28.10% | Medium |
-| 0051 | N-Queens | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0051.N-Queens) | 39.80% | Hard | |
-| 0052 | N-Queens II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0052.N-Queens-II) | 52.40% | Hard | |
-| 0053 | Maximum Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray) | 43.80% | Easy | |
-| 0054 | Spiral Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix) | 30.70% | Medium | |
-| 0055 | Jump Game | | 32.10% | Medium | |
-| 0056 | Merge Intervals | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0056.Merge-Intervals) | 35.90% | Medium | |
-| 0057 | Insert Interval | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0057.Insert-Interval) | 31.40% | Hard | |
-| 0058 | Length of Last Word | | 32.30% | Easy | |
-| 0059 | Spiral Matrix II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0059.Spiral-Matrix-II) | 47.00% | Medium | |
-| 0060 | Permutation Sequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0060.Permutation-Sequence) | 33.40% | Medium | |
-| 0061 | Rotate List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0061.Rotate-List) | 27.30% | Medium | |
-| 0062 | Unique Paths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0062.Unique-Paths) | 48.00% | Medium | |
-| 0063 | Unique Paths II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0063.Unique-Paths-II) | 33.50% | Medium | |
-| 0064 | Minimum Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0064.Minimum-Path-Sum) | 47.30% | Medium | |
-| 0065 | Valid Number | | 14.10% | Hard | |
-| 0066 | Plus One | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0066.Plus-One) | 41.40% | Easy | |
-| 0067 | Add Binary | | 39.50% | Easy | |
-| 0068 | Text Justification | | 23.50% | Hard | |
-| 0069 | Sqrt(x) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0069.Sqrtx) | 31.50% | Easy | |
-| 0070 | Climbing Stairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0070.Climbing-Stairs) | 44.40% | Easy | |
-| 0071 | Simplify Path | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0071.Simplify-Path) | 29.00% | Medium | |
-| 0072 | Edit Distance | | 38.20% | Hard | |
-| 0073 | Set Matrix Zeroes | | 40.10% | Medium | |
-| 0074 | Search a 2D Matrix | | 35.00% | Medium | |
-| 0075 | Sort Colors | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0075.Sort-Colors) | 42.40% | Medium | |
-| 0076 | Minimum Window Substring | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring) | 31.10% | Hard | |
-| 0077 | Combinations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0077.Combinations) | 48.20% | Medium | |
-| 0078 | Subsets | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets) | 53.40% | Medium | |
-| 0079 | Word Search | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0079.Word-Search) | 31.50% | Medium | |
-| 0080 | Remove Duplicates from Sorted Array II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II) | 40.60% | Medium | |
-| 0081 | Search in Rotated Sorted Array II | | 32.70% | Medium | |
-| 0082 | Remove Duplicates from Sorted List II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0082.Remove-Duplicates-from-Sorted-List-II) | 33.30% | Medium | |
-| 0083 | Remove Duplicates from Sorted List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0083.Remove-Duplicates-from-Sorted-List) | 42.80% | Easy | |
-| 0084 | Largest Rectangle in Histogram | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0084.Largest-Rectangle-in-Histogram) | 31.40% | Hard | |
-| 0085 | Maximal Rectangle | | 33.60% | Hard | |
-| 0086 | Partition List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0086.Partition-List) | 37.60% | Medium | |
-| 0087 | Scramble String | | 31.70% | Hard | |
-| 0088 | Merge Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0088.Merge-Sorted-Array) | 36.00% | Easy | |
-| 0089 | Gray Code | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0089.Gray-Code) | 46.00% | Medium | |
-| 0090 | Subsets II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0090.Subsets-II) | 42.70% | Medium | |
-| 0091 | Decode Ways | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0091.Decode-Ways) | 22.50% | Medium | |
-| 0092 | Reverse Linked List II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II) | 35.20% | Medium | |
-| 0093 | Restore IP Addresses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0093.Restore-IP-Addresses) | 31.70% | Medium | |
-| 0094 | Binary Tree Inorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0094.Binary-Tree-Inorder-Traversal) | 57.10% | Medium | |
-| 0095 | Unique Binary Search Trees II |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0095.Unique-Binary-Search-Trees-II) | 36.00% | Medium | |
-| 0096 | Unique Binary Search Trees | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0096.Unique-Binary-Search-Trees) | 46.60% | Medium | |
-| 0097 | Interleaving String | | 28.20% | Hard | |
-| 0098 | Validate Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0098.Validate-Binary-Search-Tree) | 25.90% | Medium | |
-| 0099 | Recover Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0099.Recover-Binary-Search-Tree) | 34.90% | Hard | |
-| 0100 | Same Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0100.Same-Tree) | 50.20% | Easy | |
-| 0101 | Symmetric Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree) | 43.70% | Easy | |
-| 0102 | Binary Tree Level Order Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0102.Binary-Tree-Level-Order-Traversal) | 48.90% | Medium | |
-| 0103 | Binary Tree Zigzag Level Order Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal) | 42.10% | Medium | |
-| 0104 | Maximum Depth of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0104.Maximum-Depth-of-Binary-Tree) | 60.90% | Easy | |
-| 0105 | Construct Binary Tree from Preorder and Inorder Traversal |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal) | 41.60% | Medium | |
-| 0106 | Construct Binary Tree from Inorder and Postorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal) | 39.70% | Medium | |
-| 0107 | Binary Tree Level Order Traversal II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0107.Binary-Tree-Level-Order-Traversal-II) | 47.20% | Easy | |
-| 0108 | Convert Sorted Array to Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree) | 51.20% | Easy | |
-| 0109 | Convert Sorted List to Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree) | 41.20% | Medium | |
-| 0110 | Balanced Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0110.Balanced-Binary-Tree) | 41.20% | Easy | |
-| 0111 | Minimum Depth of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree) | 35.40% | Easy | |
-| 0112 | Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0112.Path-Sum) | 38.00% | Easy | |
-| 0113 | Path Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0113.Path-Sum-II) | 41.00% | Medium | |
-| 0114 | Flatten Binary Tree to Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0114.Flatten-Binary-Tree-to-Linked-List) | 42.80% | Medium | |
-| 0115 | Distinct Subsequences | | 35.20% | Hard | |
-| 0116 | Populating Next Right Pointers in Each Node | | 38.20% | Medium | |
-| 0117 | Populating Next Right Pointers in Each Node II | | 34.70% | Medium | |
-| 0118 | Pascal's Triangle | | 46.50% | Easy | |
-| 0119 | Pascal's Triangle II | | 44.00% | Easy | |
-| 0120 | Triangle | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0120.Triangle) | 39.70% | Medium | |
-| 0121 | Best Time to Buy and Sell Stock | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock) | 47.50% | Easy | |
-| 0122 | Best Time to Buy and Sell Stock II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II) | 52.20% | Easy | |
-| 0123 | Best Time to Buy and Sell Stock III | | 33.90% | Hard | |
-| 0124 | Binary Tree Maximum Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0124.Binary-Tree-Maximum-Path-Sum) | 30.20% | Hard | |
-| 0125 | Valid Palindrome | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0125.Valid-Palindrome) | 31.40% | Easy | |
-| 0126 | Word Ladder II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II) | 18.00% | Hard | |
-| 0127 | Word Ladder | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0127.Word-Ladder) | 24.40% | Medium | |
-| 0128 | Longest Consecutive Sequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0128.Longest-Consecutive-Sequence) | 41.90% | Hard | |
-| 0129 | Sum Root to Leaf Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0129.Sum-Root-to-Leaf-Numbers) | 42.80% | Medium | |
-| 0130 | Surrounded Regions | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0130.Surrounded-Regions) | 23.10% | Medium | |
-| 0131 | Palindrome Partitioning | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0131.Palindrome-Partitioning) | 41.30% | Medium | |
-| 0132 | Palindrome Partitioning II | | 27.60% | Hard | |
-| 0133 | Clone Graph | | 27.00% | Medium | |
-| 0134 | Gas Station | | 34.10% | Medium | |
-| 0135 | Candy | | 28.60% | Hard | |
-| 0136 | Single Number |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0136.Single-Number) | 60.50% | Easy | |
-| 0137 | Single Number II |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0137.Single-Number-II) | 46.20% | Medium | |
-| 0138 | Copy List with Random Pointer | | 27.50% | Medium | |
-| 0139 | Word Break | | 35.60% | Medium | |
-| 0140 | Word Break II | | 27.50% | Hard | |
-| 0141 | Linked List Cycle | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0141.Linked-List-Cycle) | 37.20% | Easy | |
-| 0142 | Linked List Cycle II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0142.Linked-List-Cycle-II) | 32.40% | Medium | |
-| 0143 | Reorder List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0143.Reorder-List) | 31.20% | Medium | |
-| 0144 | Binary Tree Preorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0144.Binary-Tree-Preorder-Traversal) | 51.70% | Medium | |
-| 0145 | Binary Tree Postorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0145.Binary-Tree-Postorder-Traversal) | 48.90% | Hard | |
-| 0146 | LRU Cache | | 25.90% | Medium | |
-| 0147 | Insertion Sort List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0147.Insertion-Sort-List) | 37.60% | Medium | |
-| 0148 | Sort List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0148.Sort-List) | 35.80% | Medium | |
-| 0149 | Max Points on a Line | | 15.80% | Hard | |
-| 0150 | Evaluate Reverse Polish Notation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0150.Evaluate-Reverse-Polish-Notation) | 32.50% | Medium | |
-| 0151 | Reverse Words in a String | | 17.00% | Medium | |
-| 0152 | Maximum Product Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0152.Maximum-Product-Subarray) | 29.40% | Medium | |
-| 0153 | Find Minimum in Rotated Sorted Array | | 43.10% | Medium | |
-| 0154 | Find Minimum in Rotated Sorted Array II | | 39.40% | Hard | |
-| 0155 | Min Stack | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0155.Min-Stack) | 37.50% | Easy | |
-| 0156 | Binary Tree Upside Down | | 51.10% | Medium | |
-| 0157 | Read N Characters Given Read4 | | 29.70% | Easy | |
-| 0158 | Read N Characters Given Read4 II - Call multiple times | | 26.60% | Hard | |
-| 0159 | Longest Substring with At Most Two Distinct Characters | | 47.20% | Hard | |
-| 0160 | Intersection of Two Linked Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0160.Intersection-of-Two-Linked-Lists) | 34.30% | Easy | |
-| 0161 | One Edit Distance | | 31.70% | Medium | |
-| 0162 | Find Peak Element | | 41.40% | Medium | |
-| 0163 | Missing Ranges | | 23.30% | Medium | |
-| 0164 | Maximum Gap | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0164.Maximum-Gap) | 32.70% | Hard | |
-| 0165 | Compare Version Numbers | | 23.80% | Medium | |
-| 0166 | Fraction to Recurring Decimal | | 19.60% | Medium | |
-| 0167 | Two Sum II - Input array is sorted | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0167.Two-Sum-II---Input-array-is-sorted) | 50.60% | Easy | |
-| 0168 | Excel Sheet Column Title | | 29.10% | Easy | |
-| 0169 | Majority Element |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0169.Majority-Element) | 53.00% | Easy | |
-| 0170 | Two Sum III - Data structure design | | 30.60% | Easy | |
-| 0171 | Excel Sheet Column Number | | 51.70% | Easy | |
-| 0172 | Factorial Trailing Zeroes |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0172.Factorial-Trailing-Zeroes) | 37.40% | Easy | |
-| 0173 | Binary Search Tree Iterator | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0173.Binary-Search-Tree-Iterator) | 49.00% | Medium | |
-| 0174 | Dungeon Game | | 27.30% | Hard | |
-| 0175 | Combine Two Tables | | 52.40% | Easy | |
-| 0176 | Second Highest Salary | | 27.50% | Easy | |
-| 0177 | Nth Highest Salary | | 26.60% | Medium | |
-| 0178 | Rank Scores | | 37.10% | Medium | |
-| 0179 | Largest Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0179.Largest-Number) | 26.00% | Medium | |
-| 0180 | Consecutive Numbers | | 34.00% | Medium | |
-| 0181 | Employees Earning More Than Their Managers | | 48.90% | Easy | |
-| 0182 | Duplicate Emails | | 55.20% | Easy | |
-| 0183 | Customers Who Never Order | | 45.40% | Easy | |
-| 0184 | Department Highest Salary | | 29.40% | Medium | |
-| 0185 | Department Top Three Salaries | | 26.50% | Hard | |
-| 0186 | Reverse Words in a String II | | 38.10% | Medium | |
-| 0187 | Repeated DNA Sequences |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0187.Repeated-DNA-Sequences) | 36.30% | Medium | |
-| 0188 | Best Time to Buy and Sell Stock IV | | 26.40% | Hard | |
-| 0189 | Rotate Array | | 30.50% | Easy | |
-| 0190 | Reverse Bits |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0190.Reverse-Bits) | 31.70% | Easy | |
-| 0191 | Number of 1 Bits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0191.Number-of-1-Bits) | 43.60% | Easy | |
-| 0192 | Word Frequency | | 26.80% | Medium | |
-| 0193 | Valid Phone Numbers | | 25.20% | Easy | |
-| 0194 | Transpose File | | 22.90% | Medium | |
-| 0195 | Tenth Line | | 33.90% | Easy | |
-| 0196 | Delete Duplicate Emails | | 33.40% | Easy | |
-| 0197 | Rising Temperature | | 35.10% | Easy | |
-| 0198 | House Robber | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0198.House-Robber) | 41.10% | Easy | |
-| 0199 | Binary Tree Right Side View | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0199.Binary-Tree-Right-Side-View) | 48.30% | Medium | |
-| 0200 | Number of Islands | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0200.Number-of-Islands) | 41.90% | Medium | |
-| 0201 | Bitwise AND of Numbers Range |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0201.Bitwise-AND-of-Numbers-Range) | 36.10% | Medium | |
-| 0202 | Happy Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0202.Happy-Number) | 45.60% | Easy | |
-| 0203 | Remove Linked List Elements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0203.Remove-Linked-List-Elements) | 35.90% | Easy | |
-| 0204 | Count Primes |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0204.Count-Primes) | 29.20% | Easy | |
-| 0205 | Isomorphic Strings | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0205.Isomorphic-Strings) | 37.60% | Easy | |
-| 0206 | Reverse Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0206.Reverse-Linked-List) | 55.30% | Easy | |
-| 0207 | Course Schedule | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0207.Course-Schedule) | 38.20% | Medium | |
-| 0208 | Implement Trie (Prefix Tree) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0208.Implement-Trie-Prefix-Tree) | 39.00% | Medium | |
-| 0209 | Minimum Size Subarray Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0209.Minimum-Size-Subarray-Sum) | 35.10% | Medium | |
-| 0210 | Course Schedule II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0210.Course-Schedule-II) | 35.20% | Medium | |
-| 0211 | Add and Search Word - Data structure design | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0211.Add-and-Search-Word---Data-structure-design) | 30.70% | Medium | |
-| 0212 | Word Search II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0212.Word-Search-II) | 29.00% | Hard | |
-| 0213 | House Robber II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0213.House-Robber-II) | 35.40% | Medium | |
-| 0214 | Shortest Palindrome | | 27.70% | Hard | |
-| 0215 | Kth Largest Element in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0215.Kth-Largest-Element-in-an-Array) | 48.30% | Medium | |
-| 0216 | Combination Sum III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0216.Combination-Sum-III) | 51.90% | Medium | |
-| 0217 | Contains Duplicate | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0217.Contains-Duplicate) | 52.30% | Easy | |
-| 0218 | The Skyline Problem | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0218.The-Skyline-Problem) | 31.80% | Hard | |
-| 0219 | Contains Duplicate II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0219.Contains-Duplicate-II) | 35.50% | Easy | |
-| 0220 | Contains Duplicate III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0220.Contains-Duplicate-III) | 19.80% | Medium | |
-| 0221 | Maximal Square | | 33.30% | Medium | |
-| 0222 | Count Complete Tree Nodes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0222.Count-Complete-Tree-Nodes) | 34.40% | Medium | |
-| 0223 | Rectangle Area | | 36.00% | Medium | |
-| 0224 | Basic Calculator | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0224.Basic-Calculator) | 33.00% | Hard | |
-| 0225 | Implement Stack using Queues | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0225.Implement-Stack-using-Queues) | 39.60% | Easy | |
-| 0226 | Invert Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0226.Invert-Binary-Tree) | 58.50% | Easy | |
-| 0227 | Basic Calculator II | | 33.70% | Medium | |
-| 0228 | Summary Ranges | | 36.20% | Medium | |
-| 0229 | Majority Element II |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0229.Majority-Element-II) | 32.30% | Medium | |
-| 0230 | Kth Smallest Element in a BST | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0230.Kth-Smallest-Element-in-a-BST) | 51.90% | Medium | |
-| 0231 | Power of Two | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0231.Power-of-Two) | 42.10% | Easy | |
-| 0232 | Implement Queue using Stacks | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0232.Implement-Queue-using-Stacks) | 43.70% | Easy | |
-| 0233 | Number of Digit One | | 30.30% | Hard | |
-| 0234 | Palindrome Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0234.Palindrome-Linked-List) | 36.30% | Easy | |
-| 0235 | Lowest Common Ancestor of a Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree) | 45.10% | Easy | |
-| 0236 | Lowest Common Ancestor of a Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree) | 37.90% | Medium | |
-| 0237 | Delete Node in a Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0237.Delete-Node-in-a-Linked-List) | 54.00% | Easy | |
-| 0238 | Product of Array Except Self | | 55.40% | Medium | |
-| 0239 | Sliding Window Maximum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0239.Sliding-Window-Maximum) | 38.40% | Hard | |
-| 0240 | Search a 2D Matrix II | | 41.00% | Medium | |
-| 0241 | Different Ways to Add Parentheses | | 50.30% | Medium | |
-| 0242 | Valid Anagram | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram) | 52.50% | Easy | |
-| 0243 | Shortest Word Distance | | 57.60% | Easy | |
-| 0244 | Shortest Word Distance II | | 47.60% | Medium | |
-| 0245 | Shortest Word Distance III | | 53.60% | Medium | |
-| 0246 | Strobogrammatic Number | | 42.40% | Easy | |
-| 0247 | Strobogrammatic Number II | | 44.60% | Medium | |
-| 0248 | Strobogrammatic Number III | | 36.70% | Hard | |
-| 0249 | Group Shifted Strings | | 49.10% | Medium | |
-| 0250 | Count Univalue Subtrees | | 49.10% | Medium | |
-| 0251 | Flatten 2D Vector | | 43.90% | Medium | |
-| 0252 | Meeting Rooms | | 52.30% | Easy | |
-| 0253 | Meeting Rooms II | | 43.10% | Medium | |
-| 0254 | Factor Combinations | | 44.50% | Medium | |
-| 0255 | Verify Preorder Sequence in Binary Search Tree | | 43.70% | Medium | |
-| 0256 | Paint House | | 49.10% | Easy | |
-| 0257 | Binary Tree Paths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0257.Binary-Tree-Paths) | 46.30% | Easy | |
-| 0258 | Add Digits | | 54.30% | Easy | |
-| 0259 | 3Sum Smaller | | 45.10% | Medium | |
-| 0260 | Single Number III |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0260.Single-Number-III) | 57.30% | Medium | |
-| 0261 | Graph Valid Tree | | 40.00% | Medium | |
-| 0262 | Trips and Users | | 25.40% | Hard | |
-| 0263 | Ugly Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0263.Ugly-Number) | 40.70% | Easy | |
-| 0264 | Ugly Number II | | 36.60% | Medium | |
-| 0265 | Paint House II | | 41.70% | Hard | |
-| 0266 | Palindrome Permutation | | 60.20% | Easy | |
-| 0267 | Palindrome Permutation II | | 33.90% | Medium | |
-| 0268 | Missing Number |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0268.Missing-Number) | 48.60% | Easy | |
-| 0269 | Alien Dictionary | | 31.30% | Hard | |
-| 0270 | Closest Binary Search Tree Value | | 44.00% | Easy | |
-| 0271 | Encode and Decode Strings | | 27.00% | Medium | |
-| 0272 | Closest Binary Search Tree Value II | | 45.40% | Hard | |
-| 0273 | Integer to English Words | | 24.50% | Hard | |
-| 0274 | H-Index | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0274.H-Index) | 34.70% | Medium | |
-| 0275 | H-Index II | | 35.50% | Medium | |
-| 0276 | Paint Fence | | 36.60% | Easy | |
-| 0277 | Find the Celebrity | | 37.10% | Medium | |
-| 0278 | First Bad Version | | 30.30% | Easy | |
-| 0279 | Perfect Squares | | 42.30% | Medium | |
-| 0280 | Wiggle Sort | | 61.20% | Medium | |
-| 0281 | Zigzag Iterator | | 56.10% | Medium | |
-| 0282 | Expression Add Operators | | 32.90% | Hard | |
-| 0283 | Move Zeroes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0283.Move-Zeroes) | 54.50% | Easy | |
-| 0284 | Peeking Iterator | | 40.90% | Medium | |
-| 0285 | Inorder Successor in BST | | 35.10% | Medium | |
-| 0286 | Walls and Gates | | 49.80% | Medium | |
-| 0287 | Find the Duplicate Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0287.Find-the-Duplicate-Number) | 50.00% | Medium | |
-| 0288 | Unique Word Abbreviation | | 20.10% | Medium | |
-| 0289 | Game of Life | | 45.90% | Medium | |
-| 0290 | Word Pattern | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0290.Word-Pattern) | 35.20% | Easy | |
-| 0291 | Word Pattern II | | 41.10% | Hard | |
-| 0292 | Nim Game | | 55.70% | Easy | |
-| 0293 | Flip Game | | 59.00% | Easy | |
-| 0294 | Flip Game II | | 48.40% | Medium | |
-| 0295 | Find Median from Data Stream | | 37.10% | Hard | |
-| 0296 | Best Meeting Point | | 55.00% | Hard | |
-| 0297 | Serialize and Deserialize Binary Tree | | 41.30% | Hard | |
-| 0298 | Binary Tree Longest Consecutive Sequence | | 44.20% | Medium | |
-| 0299 | Bulls and Cows | | 39.70% | Medium | |
-| 0300 | Longest Increasing Subsequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0300.Longest-Increasing-Subsequence) | 41.00% | Medium | |
-| 0301 | Remove Invalid Parentheses | | 39.50% | Hard | |
-| 0302 | Smallest Rectangle Enclosing Black Pixels | | 49.40% | Hard | |
-| 0303 | Range Sum Query - Immutable | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0303.Range-Sum-Query---Immutable) | 38.40% | Easy | |
-| 0304 | Range Sum Query 2D - Immutable | | 32.70% | Medium | |
-| 0305 | Number of Islands II | | 41.70% | Hard | |
-| 0306 | Additive Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0306.Additive-Number) | 28.40% | Medium | |
-| 0307 | Range Sum Query - Mutable | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0307.Range-Sum-Query---Mutable) | 29.00% | Medium | |
-| 0308 | Range Sum Query 2D - Mutable | | 32.20% | Hard | |
-| 0309 | Best Time to Buy and Sell Stock with Cooldown | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown) | 44.20% | Medium | |
-| 0310 | Minimum Height Trees | | 30.30% | Medium | |
-| 0311 | Sparse Matrix Multiplication | | 56.70% | Medium | |
-| 0312 | Burst Balloons | | 47.50% | Hard | |
-| 0313 | Super Ugly Number | | 41.70% | Medium | |
-| 0314 | Binary Tree Vertical Order Traversal | | 41.20% | Medium | |
-| 0315 | Count of Smaller Numbers After Self | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0315.Count-of-Smaller-Numbers-After-Self) | 38.40% | Hard | |
-| 0316 | Remove Duplicate Letters | | 32.80% | Hard | |
-| 0317 | Shortest Distance from All Buildings | | 38.10% | Hard | |
-| 0318 | Maximum Product of Word Lengths |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0318.Maximum-Product-of-Word-Lengths) | 48.70% | Medium | |
-| 0319 | Bulb Switcher | | 44.00% | Medium | |
-| 0320 | Generalized Abbreviation | | 48.90% | Medium | |
-| 0321 | Create Maximum Number | | 25.50% | Hard | |
-| 0322 | Coin Change | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0322.Coin-Change) | 30.80% | Medium | |
-| 0323 | Number of Connected Components in an Undirected Graph | | 52.30% | Medium | |
-| 0324 | Wiggle Sort II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0324.Wiggle-Sort-II) | 28.10% | Medium | |
-| 0325 | Maximum Size Subarray Sum Equals k | | 44.80% | Medium | |
-| 0326 | Power of Three | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0326.Power-of-Three) | 41.70% | Easy | |
-| 0327 | Count of Range Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0327.Count-of-Range-Sum) | 32.90% | Hard | |
-| 0328 | Odd Even Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0328.Odd-Even-Linked-List) | 49.50% | Medium | |
-| 0329 | Longest Increasing Path in a Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0329.Longest-Increasing-Path-in-a-Matrix) | 40.30% | Hard | |
-| 0330 | Patching Array | | 33.40% | Hard | |
-| 0331 | Verify Preorder Serialization of a Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree) | 38.80% | Medium | |
-| 0332 | Reconstruct Itinerary | | 31.70% | Medium | |
-| 0333 | Largest BST Subtree | | 33.20% | Medium | |
-| 0334 | Increasing Triplet Subsequence | | 39.60% | Medium | |
-| 0335 | Self Crossing | | 27.00% | Hard | |
-| 0336 | Palindrome Pairs | | 31.10% | Hard | |
-| 0337 | House Robber III | | 48.30% | Medium | |
-| 0338 | Counting Bits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0338.Counting-Bits) | 64.90% | Medium | |
-| 0339 | Nested List Weight Sum | | 68.50% | Easy | |
-| 0340 | Longest Substring with At Most K Distinct Characters | | 40.00% | Hard | |
-| 0341 | Flatten Nested List Iterator | | 48.20% | Medium | |
-| 0342 | Power of Four | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0342.Power-of-Four) | 40.40% | Easy | |
-| 0343 | Integer Break | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0343.Integer-Break) | 48.00% | Medium | |
-| 0344 | Reverse String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String) | 63.50% | Easy | |
-| 0345 | Reverse Vowels of a String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0345.Reverse-Vowels-of-a-String) | 41.70% | Easy | |
-| 0346 | Moving Average from Data Stream | | 66.50% | Easy | |
-| 0347 | Top K Frequent Elements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0347.Top-K-Frequent-Elements) | 55.30% | Medium | |
-| 0348 | Design Tic-Tac-Toe | | 50.00% | Medium | |
-| 0349 | Intersection of Two Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays) | 55.10% | Easy | |
-| 0350 | Intersection of Two Arrays II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0350.Intersection-of-Two-Arrays-II) | 48.10% | Easy | |
-| 0351 | Android Unlock Patterns | | 46.00% | Medium | |
-| 0352 | Data Stream as Disjoint Intervals | | 43.70% | Hard | |
-| 0353 | Design Snake Game | | 30.80% | Medium | |
-| 0354 | Russian Doll Envelopes |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0354.Russian-Doll-Envelopes) | 34.10% | Hard | |
-| 0355 | Design Twitter | | 27.50% | Medium | |
-| 0356 | Line Reflection | | 30.90% | Medium | |
-| 0357 | Count Numbers with Unique Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0357.Count-Numbers-with-Unique-Digits) | 47.10% | Medium | |
-| 0358 | Rearrange String k Distance Apart | | 32.90% | Hard | |
-| 0359 | Logger Rate Limiter | | 65.40% | Easy | |
-| 0360 | Sort Transformed Array | | 46.90% | Medium | |
-| 0361 | Bomb Enemy | | 43.60% | Medium | |
-| 0362 | Design Hit Counter | | 59.20% | Medium | |
-| 0363 | Max Sum of Rectangle No Larger Than K | | 35.30% | Hard | |
-| 0364 | Nested List Weight Sum II | | 58.00% | Medium | |
-| 0365 | Water and Jug Problem | | 29.00% | Medium | |
-| 0366 | Find Leaves of Binary Tree | | 66.00% | Medium | |
-| 0367 | Valid Perfect Square | | 40.00% | Easy | |
-| 0368 | Largest Divisible Subset | | 34.90% | Medium | |
-| 0369 | Plus One Linked List | | 56.40% | Medium | |
-| 0370 | Range Addition | | 60.60% | Medium | |
-| 0371 | Sum of Two Integers |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0371.Sum-of-Two-Integers) | 50.90% | Easy | |
-| 0372 | Super Pow | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0372.Super-Pow) | 35.70% | Medium | |
-| 0373 | Find K Pairs with Smallest Sums | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0373.Find-K-Pairs-with-Smallest-Sums) | 34.00% | Medium | |
-| 0374 | Guess Number Higher or Lower | | 39.60% | Easy | |
-| 0375 | Guess Number Higher or Lower II | | 37.80% | Medium | |
-| 0376 | Wiggle Subsequence | | 37.60% | Medium | |
-| 0377 | Combination Sum IV | | 43.70% | Medium | |
-| 0378 | Kth Smallest Element in a Sorted Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix) | 49.70% | Medium | |
-| 0379 | Design Phone Directory | | 41.70% | Medium | |
-| 0380 | Insert Delete GetRandom O(1) | | 43.00% | Medium | |
-| 0381 | Insert Delete GetRandom O(1) - Duplicates allowed | | 32.10% | Hard | |
-| 0382 | Linked List Random Node | | 49.40% | Medium | |
-| 0383 | Ransom Note | | 50.10% | Easy | |
-| 0384 | Shuffle an Array | | 50.30% | Medium | |
-| 0385 | Mini Parser | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0385.Mini-Parser) | 31.90% | Medium | |
-| 0386 | Lexicographical Numbers | | 46.50% | Medium | |
-| 0387 | First Unique Character in a String |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0387.First-Unique-Character-in-a-String) | 50.20% | Easy | |
-| 0388 | Longest Absolute File Path | | 39.30% | Medium | |
-| 0389 | Find the Difference |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0389.Find-the-Difference) | 53.20% | Easy | |
-| 0390 | Elimination Game | | 43.40% | Medium | |
-| 0391 | Perfect Rectangle | | 28.30% | Hard | |
-| 0392 | Is Subsequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0392.Is-Subsequence) | 46.90% | Medium | |
-| 0393 | UTF-8 Validation |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0393.UTF-8-Validation) | 36.00% | Medium | |
-| 0394 | Decode String |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0394.Decode-String) | 45.20% | Medium | |
-| 0395 | Longest Substring with At Least K Repeating Characters | | 38.80% | Medium | |
-| 0396 | Rotate Function | | 35.20% | Medium | |
-| 0397 | Integer Replacement |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0397.Integer-Replacement) | 31.50% | Medium | |
-| 0398 | Random Pick Index | | 50.20% | Medium | |
-| 0399 | Evaluate Division | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0399.Evaluate-Division) | 47.80% | Medium | |
-| 0400 | Nth Digit | | 30.40% | Easy | |
-| 0401 | Binary Watch | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0401.Binary-Watch) | 45.40% | Easy | |
-| 0402 | Remove K Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0402.Remove-K-Digits) | 26.70% | Medium | |
-| 0403 | Frog Jump | | 36.40% | Hard | |
-| 0404 | Sum of Left Leaves | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0404.Sum-of-Left-Leaves) | 49.20% | Easy | |
-| 0405 | Convert a Number to Hexadecimal |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0405.Convert-a-Number-to-Hexadecimal) | 42.00% | Easy | |
-| 0406 | Queue Reconstruction by Height | | 60.10% | Medium | |
-| 0407 | Trapping Rain Water II | | 39.40% | Hard | |
-| 0408 | Valid Word Abbreviation | | 29.60% | Easy | |
-| 0409 | Longest Palindrome |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0409.Longest-Palindrome) | 48.20% | Easy | |
-| 0410 | Split Array Largest Sum |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0410.Split-Array-Largest-Sum) | 42.60% | Hard | |
-| 0411 | Minimum Unique Word Abbreviation | | 35.10% | Hard | |
-| 0412 | Fizz Buzz | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0412.Fizz-Buzz) | 59.70% | Easy | |
-| 0413 | Arithmetic Slices | | 56.00% | Medium | |
-| 0414 | Third Maximum Number |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0414.Third-Maximum-Number)| 29.10% | Easy | |
-| 0415 | Add Strings | | 43.90% | Easy | |
-| 0416 | Partition Equal Subset Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0416.Partition-Equal-Subset-Sum) | 40.90% | Medium | |
-| 0417 | Pacific Atlantic Water Flow | | 37.60% | Medium | |
-| 0418 | Sentence Screen Fitting | | 31.20% | Medium | |
-| 0419 | Battleships in a Board | | 65.90% | Medium | |
-| 0420 | Strong Password Checker | | 17.20% | Hard | |
-| 0421 | Maximum XOR of Two Numbers in an Array |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array) | 51.20% | Medium | |
-| 0422 | Valid Word Square | | 36.60% | Easy | |
-| 0423 | Reconstruct Original Digits from English | | 45.70% | Medium | |
-| 0424 | Longest Repeating Character Replacement | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement) | 44.30% | Medium | |
-| 0425 | Word Squares | | 44.50% | Hard | |
-| 0426 | Convert Binary Search Tree to Sorted Doubly Linked List | | 52.50% | Medium | |
-| 0427 | Construct Quad Tree | | 57.20% | Medium | |
-| 0428 | Serialize and Deserialize N-ary Tree | | 54.20% | Hard | |
-| 0429 | N-ary Tree Level Order Traversal | | 59.80% | Easy | |
-| 0430 | Flatten a Multilevel Doubly Linked List | | 42.60% | Medium | |
-| 0431 | Encode N-ary Tree to Binary Tree | | 64.20% | Hard | |
-| 0432 | All O`one Data Structure | | 29.70% | Hard | |
-| 0433 | Minimum Genetic Mutation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0433.Minimum-Genetic-Mutation) | 38.40% | Medium | |
-| 0434 | Number of Segments in a String | | 37.00% | Easy | |
-| 0435 | Non-overlapping Intervals | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0435.Non-overlapping-Intervals) | 41.60% | Medium | |
-| 0436 | Find Right Interval | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0436.Find-Right-Interval) | 42.90% | Medium | |
-| 0437 | Path Sum III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0437.Path-Sum-III) | 43.00% | Easy | |
-| 0438 | Find All Anagrams in a String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0438.Find-All-Anagrams-in-a-String) | 37.50% | Easy | |
-| 0439 | Ternary Expression Parser | | 53.70% | Medium | |
-| 0440 | K-th Smallest in Lexicographical Order | | 26.60% | Hard | |
-| 0441 | Arranging Coins |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0441.Arranging-Coins) | 38.10% | Easy | |
-| 0442 | Find All Duplicates in an Array | | 61.30% | Medium | |
-| 0443 | String Compression | | 37.90% | Easy | |
-| 0444 | Sequence Reconstruction | | 20.50% | Medium | |
-| 0445 | Add Two Numbers II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0445.Add-Two-Numbers-II) | 50.40% | Medium | |
-| 0446 | Arithmetic Slices II - Subsequence | | 30.30% | Hard | |
-| 0447 | Number of Boomerangs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0447.Number-of-Boomerangs) | 50.00% | Easy | |
-| 0448 | Find All Numbers Disappeared in an Array | | 53.60% | Easy | |
-| 0449 | Serialize and Deserialize BST | | 47.50% | Medium | |
-| 0450 | Delete Node in a BST | | 40.20% | Medium | |
-| 0451 | Sort Characters By Frequency | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0451.Sort-Characters-By-Frequency) | 56.40% | Medium | |
-| 0452 | Minimum Number of Arrows to Burst Balloons | | 46.60% | Medium | |
-| 0453 | Minimum Moves to Equal Array Elements | | 49.30% | Easy | |
-| 0454 | 4Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0454.4Sum-II) | 50.80% | Medium | |
-| 0455 | Assign Cookies | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0455.Assign-Cookies) | 48.50% | Easy | |
-| 0456 | 132 Pattern | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0456.132-Pattern) | 27.40% | Medium | |
-| 0457 | Circular Array Loop |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0457.Circular-Array-Loop) | 27.70% | Medium | |
-| 0458 | Poor Pigs | | 45.50% | Hard | |
-| 0459 | Repeated Substring Pattern | | 40.00% | Easy | |
-| 0460 | LFU Cache | | 29.00% | Hard | |
-| 0461 | Hamming Distance |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0461.Hamming-Distance) | 70.40% | Easy | |
-| 0462 | Minimum Moves to Equal Array Elements II | | 52.50% | Medium | |
-| 0463 | Island Perimeter |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0463.Island-Perimeter) | 61.20% | Easy | |
-| 0464 | Can I Win | | 27.30% | Medium | |
-| 0465 | Optimal Account Balancing | | 42.90% | Hard | |
-| 0466 | Count The Repetitions | | 27.30% | Hard | |
-| 0467 | Unique Substrings in Wraparound String | | 34.10% | Medium | |
-| 0468 | Validate IP Address | | 21.40% | Medium | |
-| 0469 | Convex Polygon | | 35.50% | Medium | |
-| 0470 | Implement Rand10() Using Rand7() | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0470.Implement-Rand10-Using-Rand7) | 45.10% | Medium | |
-| 0471 | Encode String with Shortest Length | | 45.20% | Hard | |
-| 0472 | Concatenated Words | | 35.10% | Hard | |
-| 0473 | Matchsticks to Square | | 36.00% | Medium | |
-| 0474 | Ones and Zeroes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0474.Ones-and-Zeroes) | 39.80% | Medium | |
-| 0475 | Heaters | | 31.90% | Easy | |
-| 0476 | Number Complement |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0476.Number-Complement) | 62.50% | Easy | |
-| 0477 | Total Hamming Distance |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0477.Total-Hamming-Distance) | 49.00% | Medium | |
-| 0478 | Generate Random Point in a Circle | | 36.90% | Medium | |
-| 0479 | Largest Palindrome Product | | 27.50% | Hard | |
-| 0480 | Sliding Window Median | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0480.Sliding-Window-Median) | 32.80% | Hard | |
-| 0481 | Magical String | | 46.30% | Medium | |
-| 0482 | License Key Formatting | | 41.10% | Easy | |
-| 0483 | Smallest Good Base | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0483.Smallest-Good-Base) | 34.20% | Hard | |
-| 0484 | Find Permutation | | 57.80% | Medium | |
-| 0485 | Max Consecutive Ones | | 55.10% | Easy | |
-| 0486 | Predict the Winner | | 46.80% | Medium | |
-| 0487 | Max Consecutive Ones II | | 46.70% | Medium | |
-| 0488 | Zuma Game | | 39.10% | Hard | |
-| 0489 | Robot Room Cleaner | | 64.70% | Hard | |
-| 0490 | The Maze | | 47.60% | Medium | |
-| 0491 | Increasing Subsequences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0491.Increasing-Subsequences) | 42.20% | Medium | |
-| 0492 | Construct the Rectangle | | 48.80% | Easy | |
-| 0493 | Reverse Pairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0493.Reverse-Pairs) | 23.30% | Hard | |
-| 0494 | Target Sum | | 45.40% | Medium | |
-| 0495 | Teemo Attacking | | 52.30% | Medium | |
-| 0496 | Next Greater Element I | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0496.Next-Greater-Element-I) | 59.80% | Easy | |
-| 0497 | Random Point in Non-overlapping Rectangles |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles) | 35.90% | Medium | |
-| 0498 | Diagonal Traverse | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0498.Diagonal-Traverse) | 45.40% | Medium | |
-| 0499 | The Maze III | | 37.40% | Hard | |
-| 0500 | Keyboard Row |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0500.Keyboard-Row) | 62.40% | Easy | |
-| 0501 | Find Mode in Binary Search Tree | | 39.60% | Easy | |
-| 0502 | IPO | | 38.00% | Hard | |
-| 0503 | Next Greater Element II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0503.Next-Greater-Element-II) | 51.30% | Medium | |
-| 0504 | Base 7 | | 45.00% | Easy | |
-| 0505 | The Maze II | | 44.10% | Medium | |
-| 0506 | Relative Ranks | | 48.40% | Easy | |
-| 0507 | Perfect Number | | 34.40% | Easy | |
-| 0508 | Most Frequent Subtree Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0508.Most-Frequent-Subtree-Sum) | 54.80% | Medium | |
-| 0509 | Fibonacci Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0509.Fibonacci-Number) | 66.70% | Easy | |
-| 0510 | Inorder Successor in BST II | | 53.30% | Medium | |
-| 0511 | Game Play Analysis I | | 74.40% | Easy | |
-| 0512 | Game Play Analysis II | | 56.80% | Easy | |
-| 0513 | Find Bottom Left Tree Value | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0513.Find-Bottom-Left-Tree-Value) | 58.60% | Medium | |
-| 0514 | Freedom Trail | | 40.70% | Hard | |
-| 0515 | Find Largest Value in Each Tree Row | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row) | 58.00% | Medium | |
-| 0516 | Longest Palindromic Subsequence | | 47.10% | Medium | |
-| 0517 | Super Washing Machines | | 37.00% | Hard | |
-| 0518 | Coin Change 2 | | 43.10% | Medium | |
-| 0519 | Random Flip Matrix | | 33.00% | Medium | |
-| 0520 | Detect Capital | | 52.60% | Easy | |
-| 0521 | Longest Uncommon Subsequence I | | 56.50% | Easy | |
-| 0522 | Longest Uncommon Subsequence II | | 32.90% | Medium | |
-| 0523 | Continuous Subarray Sum | | 24.20% | Medium | |
-| 0524 | Longest Word in Dictionary through Deleting | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting) | 46.00% | Medium | |
-| 0525 | Contiguous Array | | 42.80% | Medium | |
-| 0526 | Beautiful Arrangement | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0526.Beautiful-Arrangement) | 54.80% | Medium | |
-| 0527 | Word Abbreviation | | 50.20% | Hard | |
-| 0528 | Random Pick with Weight |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0528.Random-Pick-with-Weight) | 42.80% | Medium | |
-| 0529 | Minesweeper | | 53.10% | Medium | |
-| 0530 | Minimum Absolute Difference in BST | | 50.70% | Easy | |
-| 0531 | Lonely Pixel I | | 57.60% | Medium | |
-| 0532 | K-diff Pairs in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0532.K-diff-Pairs-in-an-Array) | 30.00% | Easy | |
-| 0533 | Lonely Pixel II | | 46.20% | Medium | |
-| 0534 | Game Play Analysis III | | 64.60% | Medium | |
-| 0535 | Encode and Decode TinyURL | | 76.90% | Medium | |
-| 0536 | Construct Binary Tree from String | | 45.20% | Medium | |
-| 0537 | Complex Number Multiplication | | 65.70% | Medium | |
-| 0538 | Convert BST to Greater Tree | | 51.30% | Easy | |
-| 0539 | Minimum Time Difference | | 48.10% | Medium | |
-| 0540 | Single Element in a Sorted Array | | 57.40% | Medium | |
-| 0541 | Reverse String II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0541.Reverse-String-II) | 45.70% | Easy | |
-| 0542 | 01 Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0542.01-Matrix) | 36.00% | Medium | |
-| 0543 | Diameter of Binary Tree | | 46.90% | Easy | |
-| 0544 | Output Contest Matches | | 73.50% | Medium | |
-| 0545 | Boundary of Binary Tree | | 35.30% | Medium | |
-| 0546 | Remove Boxes | | 38.50% | Hard | |
-| 0547 | Friend Circles | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0547.Friend-Circles) | 53.90% | Medium | |
-| 0548 | Split Array with Equal Sum | | 43.50% | Medium | |
-| 0549 | Binary Tree Longest Consecutive Sequence II | | 44.50% | Medium | |
-| 0550 | Game Play Analysis IV | | 42.20% | Medium | |
-| 0551 | Student Attendance Record I | | 45.30% | Easy | |
-| 0552 | Student Attendance Record II | | 33.30% | Hard | |
-| 0553 | Optimal Division | | 55.50% | Medium | |
-| 0554 | Brick Wall | | 47.80% | Medium | |
-| 0555 | Split Concatenated Strings | | 40.00% | Medium | |
-| 0556 | Next Greater Element III | | 30.00% | Medium | |
-| 0557 | Reverse Words in a String III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0557.Reverse-Words-in-a-String-III) | 64.40% | Easy | |
-| 0558 | Quad Tree Intersection | | 41.10% | Easy | |
-| 0559 | Maximum Depth of N-ary Tree | | 65.60% | Easy | |
-| 0560 | Subarray Sum Equals K | | 42.30% | Medium | |
-| 0561 | Array Partition I | | 69.30% | Easy | |
-| 0562 | Longest Line of Consecutive One in Matrix | | 43.80% | Medium | |
-| 0563 | Binary Tree Tilt | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0563.Binary-Tree-Tilt) | 47.10% | Easy | |
-| 0564 | Find the Closest Palindrome | | 18.90% | Hard | |
-| 0565 | Array Nesting | | 52.80% | Medium | |
-| 0566 | Reshape the Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0566.Reshape-the-Matrix) | 59.00% | Easy | |
-| 0567 | Permutation in String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0567.Permutation-in-String) | 38.60% | Medium | |
-| 0568 | Maximum Vacation Days | | 38.30% | Hard | |
-| 0569 | Median Employee Salary | | 47.60% | Hard | |
-| 0570 | Managers with at Least 5 Direct Reports | | 62.90% | Medium | |
-| 0571 | Find Median Given Frequency of Numbers | | 46.80% | Hard | |
-| 0572 | Subtree of Another Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0572.Subtree-of-Another-Tree) | 41.80% | Easy | |
-| 0573 | Squirrel Simulation | | 53.80% | Medium | |
-| 0574 | Winning Candidate | | 36.80% | Medium | |
-| 0575 | Distribute Candies |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0575.Distribute-Candies) | 59.80% | Easy | |
-| 0576 | Out of Boundary Paths | | 32.30% | Medium | |
-| 0577 | Employee Bonus | | 59.90% | Easy | |
-| 0578 | Get Highest Answer Rate Question | | 35.70% | Medium | |
-| 0579 | Find Cumulative Salary of an Employee | | 34.30% | Hard | |
-| 0580 | Count Student Number in Departments | | 42.90% | Medium | |
-| 0581 | Shortest Unsorted Continuous Subarray | | 30.20% | Easy | |
-| 0582 | Kill Process | | 56.50% | Medium | |
-| 0583 | Delete Operation for Two Strings | | 45.10% | Medium | |
-| 0584 | Find Customer Referee | | 67.90% | Easy | |
-| 0585 | Investments in 2016 | | 47.70% | Medium | |
-| 0586 | Customer Placing the Largest Number of Orders | | 66.90% | Easy | |
-| 0587 | Erect the Fence | | 34.40% | Hard | |
-| 0588 | Design In-Memory File System | | 40.00% | Hard | |
-| 0589 | N-ary Tree Preorder Traversal | | 67.80% | Easy | |
-| 0590 | N-ary Tree Postorder Traversal | | 67.90% | Easy | |
-| 0591 | Tag Validator | | 32.90% | Hard | |
-| 0592 | Fraction Addition and Subtraction | | 47.20% | Medium | |
-| 0593 | Valid Square | | 40.60% | Medium | |
-| 0594 | Longest Harmonious Subsequence |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0594.Longest-Harmonious-Subsequence) | 44.00% | Easy | |
-| 0595 | Big Countries | | 74.00% | Easy | |
-| 0596 | Classes More Than 5 Students | | 35.80% | Easy | |
-| 0597 | Friend Requests I: Overall Acceptance Rate | | 39.80% | Easy | |
-| 0598 | Range Addition II | | 48.70% | Easy | |
-| 0599 | Minimum Index Sum of Two Lists |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0599.Minimum-Index-Sum-of-Two-Lists) | 48.20% | Easy | |
-| 0600 | Non-negative Integers without Consecutive Ones | | 32.80% | Hard | |
-| 0601 | Human Traffic of Stadium | | 36.80% | Hard | |
-| 0602 | Friend Requests II: Who Has the Most Friends | | 45.40% | Medium | |
-| 0603 | Consecutive Available Seats | | 58.60% | Easy | |
-| 0604 | Design Compressed String Iterator | | 34.90% | Easy | |
-| 0605 | Can Place Flowers | | 31.00% | Easy | |
-| 0606 | Construct String from Binary Tree | | 51.70% | Easy | |
-| 0607 | Sales Person | | 57.30% | Easy | |
-| 0608 | Tree Node | | 59.10% | Medium | |
-| 0609 | Find Duplicate File in System | | 55.50% | Medium | |
-| 0610 | Triangle Judgement | | 61.60% | Easy | |
-| 0611 | Valid Triangle Number | | 45.40% | Medium | |
-| 0612 | Shortest Distance in a Plane | | 54.00% | Medium | |
-| 0613 | Shortest Distance in a Line | | 73.20% | Easy | |
-| 0614 | Second Degree Follower | | 22.60% | Medium | |
-| 0615 | Average Salary: Departments VS Company | | 38.00% | Hard | |
-| 0616 | Add Bold Tag in String | | 39.40% | Medium | |
-| 0617 | Merge Two Binary Trees | | 70.40% | Easy | |
-| 0618 | Students Report By Geography | | 43.10% | Hard | |
-| 0619 | Biggest Single Number | | 39.10% | Easy | |
-| 0620 | Not Boring Movies | | 62.50% | Easy | |
-| 0621 | Task Scheduler | | 45.70% | Medium | |
-| 0622 | Design Circular Queue | | 39.70% | Medium | |
-| 0623 | Add One Row to Tree | | 47.40% | Medium | |
-| 0624 | Maximum Distance in Arrays | | 37.40% | Easy | |
-| 0625 | Minimum Factorization | | 32.00% | Medium | |
-| 0626 | Exchange Seats | | 54.80% | Medium | |
-| 0627 | Swap Salary | | 69.20% | Easy | |
-| 0628 | Maximum Product of Three Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers) | 46.20% | Easy | |
-| 0629 | K Inverse Pairs Array | | 29.30% | Hard | |
-| 0630 | Course Schedule III | | 31.90% | Hard | |
-| 0631 | Design Excel Sum Formula | | 29.30% | Hard | |
-| 0632 | Smallest Range Covering Elements from K Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists) | 47.90% | Hard | |
-| 0633 | Sum of Square Numbers | | 32.70% | Easy | |
-| 0634 | Find the Derangement of An Array | | 37.80% | Medium | |
-| 0635 | Design Log Storage System | | 54.40% | Medium | |
-| 0636 | Exclusive Time of Functions | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0636.Exclusive-Time-of-Functions) | 48.80% | Medium | |
-| 0637 | Average of Levels in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0637.Average-of-Levels-in-Binary-Tree) | 59.00% | Easy | |
-| 0638 | Shopping Offers | | 48.90% | Medium | |
-| 0639 | Decode Ways II | | 25.30% | Hard | |
-| 0640 | Solve the Equation | | 40.40% | Medium | |
-| 0641 | Design Circular Deque | | 49.80% | Medium | |
-| 0642 | Design Search Autocomplete System | | 38.20% | Hard | |
-| 0643 | Maximum Average Subarray I | | 39.70% | Easy | |
-| 0644 | Maximum Average Subarray II | | 28.70% | Hard | |
-| 0645 | Set Mismatch |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0645.Set-Mismatch) | 40.80% | Easy | |
-| 0646 | Maximum Length of Pair Chain | | 49.00% | Medium | |
-| 0647 | Palindromic Substrings | | 57.20% | Medium | |
-| 0648 | Replace Words | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0648.Replace-Words) | 52.20% | Medium | |
-| 0649 | Dota2 Senate | | 37.80% | Medium | |
-| 0650 | 2 Keys Keyboard | | 46.80% | Medium | |
-| 0651 | 4 Keys Keyboard | | 50.80% | Medium | |
-| 0652 | Find Duplicate Subtrees | | 45.90% | Medium | |
-| 0653 | Two Sum IV - Input is a BST | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0653.Two-Sum-IV---Input-is-a-BST) | 52.60% | Easy | |
-| 0654 | Maximum Binary Tree | | 76.40% | Medium | |
-| 0655 | Print Binary Tree | | 52.10% | Medium | |
-| 0656 | Coin Path | | 27.00% | Hard | |
-| 0657 | Robot Return to Origin | | 71.70% | Easy | |
-| 0658 | Find K Closest Elements |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements) | 38.20% | Medium | |
-| 0659 | Split Array into Consecutive Subsequences | | 40.80% | Medium | |
-| 0660 | Remove 9 | | 51.60% | Hard | |
-| 0661 | Image Smoother | | 49.00% | Easy | |
-| 0662 | Maximum Width of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0662.Maximum-Width-of-Binary-Tree) | 39.60% | Medium | |
-| 0663 | Equal Tree Partition | | 38.10% | Medium | |
-| 0664 | Strange Printer | | 36.90% | Hard | |
-| 0665 | Non-decreasing Array | | 19.50% | Easy | |
-| 0666 | Path Sum IV | | 52.50% | Medium | |
-| 0667 | Beautiful Arrangement II | | 52.10% | Medium | |
-| 0668 | Kth Smallest Number in Multiplication Table |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table) | 42.20% | Hard | |
-| 0669 | Trim a Binary Search Tree | | 60.50% | Easy | |
-| 0670 | Maximum Swap | | 39.80% | Medium | |
-| 0671 | Second Minimum Node In a Binary Tree | | 43.30% | Easy | |
-| 0672 | Bulb Switcher II | | 50.10% | Medium | |
-| 0673 | Number of Longest Increasing Subsequence | | 33.70% | Medium | |
-| 0674 | Longest Continuous Increasing Subsequence | | 44.40% | Easy | |
-| 0675 | Cut Off Trees for Golf Event | | 30.80% | Hard | |
-| 0676 | Implement Magic Dictionary | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0676.Implement-Magic-Dictionary) | 51.70% | Medium | |
-| 0677 | Map Sum Pairs | | 51.80% | Medium | |
-| 0678 | Valid Parenthesis String | | 32.90% | Medium | |
-| 0679 | 24 Game | | 43.00% | Hard | |
-| 0680 | Valid Palindrome II | | 34.30% | Easy | |
-| 0681 | Next Closest Time | | 42.70% | Medium | |
-| 0682 | Baseball Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0682.Baseball-Game) | 61.20% | Easy | |
-| 0683 | K Empty Slots | | 34.20% | Hard | |
-| 0684 | Redundant Connection | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0684.Redundant-Connection) | 52.10% | Medium | |
-| 0685 | Redundant Connection II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0685.Redundant-Connection-II) | 30.80% | Hard | |
-| 0686 | Repeated String Match | | 31.50% | Easy | |
-| 0687 | Longest Univalue Path | | 33.90% | Easy | |
-| 0688 | Knight Probability in Chessboard | | 44.60% | Medium | |
-| 0689 | Maximum Sum of 3 Non-Overlapping Subarrays | | 44.20% | Hard | |
-| 0690 | Employee Importance | | 54.40% | Easy | |
-| 0691 | Stickers to Spell Word | | 38.50% | Hard | |
-| 0692 | Top K Frequent Words | | 46.00% | Medium | |
-| 0693 | Binary Number with Alternating Bits |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0693.Binary-Number-with-Alternating-Bits) | 58.00% | Easy | |
-| 0694 | Number of Distinct Islands | | 51.40% | Medium | |
-| 0695 | Max Area of Island | | 57.60% | Medium | |
-| 0696 | Count Binary Substrings | | 53.60% | Easy | |
-| 0697 | Degree of an Array | | 50.60% | Easy | |
-| 0698 | Partition to K Equal Sum Subsets | | 42.50% | Medium | |
-| 0699 | Falling Squares | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0699.Falling-Squares) | 40.10% | Hard | |
-| 0700 | Search in a Binary Search Tree | | 68.60% | Easy | |
-| 0701 | Insert into a Binary Search Tree | | 76.10% | Medium | |
-| 0702 | Search in a Sorted Array of Unknown Size | | 59.30% | Medium | |
-| 0703 | Kth Largest Element in a Stream | | 46.60% | Easy | |
-| 0704 | Binary Search |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0704.Binary-Search) | 48.00% | Easy | |
-| 0705 | Design HashSet |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0705.Design-HashSet) | 53.90% | Easy | |
-| 0706 | Design HashMap |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0706.Design-HashMap) | 56.30% | Easy | |
-| 0707 | Design Linked List |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0707.Design-Linked-List) | 21.60% | Easy | |
-| 0708 | Insert into a Cyclic Sorted List | | 29.20% | Medium | |
-| 0709 | To Lower Case | | 77.00% | Easy | |
-| 0710 | Random Pick with Blacklist |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0710.Random-Pick-with-Blacklist) | 31.30% | Hard | |
-| 0711 | Number of Distinct Islands II | | 46.20% | Hard | |
-| 0712 | Minimum ASCII Delete Sum for Two Strings | | 54.80% | Medium | |
-| 0713 | Subarray Product Less Than K | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0713.Subarray-Product-Less-Than-K) | 36.80% | Medium | |
-| 0714 | Best Time to Buy and Sell Stock with Transaction Fee | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee) | 50.60% | Medium | |
-| 0715 | Range Module | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0715.Range-Module) | 35.70% | Hard | |
-| 0716 | Max Stack | | 40.20% | Easy | |
-| 0717 | 1-bit and 2-bit Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0717.1-bit-and-2-bit-Characters) | 49.20% | Easy | |
-| 0718 | Maximum Length of Repeated Subarray |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0718.Maximum-Length-of-Repeated-Subarray) | 46.30% | Medium | |
-| 0719 | Find K-th Smallest Pair Distance |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0719.Find-K-th-Smallest-Pair-Distance) | 29.30% | Hard | |
-| 0720 | Longest Word in Dictionary | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0720.Longest-Word-in-Dictionary) | 45.00% | Easy | |
-| 0721 | Accounts Merge | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0721.Accounts-Merge) | 40.80% | Medium | |
-| 0722 | Remove Comments | | 31.40% | Medium | |
-| 0723 | Candy Crush | | 63.40% | Medium | |
-| 0724 | Find Pivot Index | | 41.30% | Easy | |
-| 0725 | Split Linked List in Parts | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0725.Split-Linked-List-in-Parts) | 49.10% | Medium | |
-| 0726 | Number of Atoms | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0726.Number-of-Atoms) | 44.90% | Hard | |
-| 0727 | Minimum Window Subsequence | | 37.50% | Hard | |
-| 0728 | Self Dividing Numbers | | 70.50% | Easy | |
-| 0729 | My Calendar I | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0729.My-Calendar-I) | 47.60% | Medium | |
-| 0730 | Count Different Palindromic Subsequences | | 39.20% | Hard | |
-| 0731 | My Calendar II | | 44.80% | Medium | |
-| 0732 | My Calendar III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0732.My-Calendar-III) | 55.20% | Hard | |
-| 0733 | Flood Fill | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0733.Flood-Fill) | 51.10% | Easy | |
-| 0734 | Sentence Similarity | | 40.80% | Easy | |
-| 0735 | Asteroid Collision | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0735.Asteroid-Collision) | 38.60% | Medium | |
-| 0736 | Parse Lisp Expression | | 44.30% | Hard | |
-| 0737 | Sentence Similarity II | | 43.60% | Medium | |
-| 0738 | Monotone Increasing Digits | | 42.00% | Medium | |
-| 0739 | Daily Temperatures | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0739.Daily-Temperatures) | 60.10% | Medium | |
-| 0740 | Delete and Earn | | 46.10% | Medium | |
-| 0741 | Cherry Pickup | | 30.10% | Hard | |
-| 0742 | Closest Leaf in a Binary Tree | | 39.40% | Medium | |
-| 0743 | Network Delay Time | | 42.40% | Medium | |
-| 0744 | Find Smallest Letter Greater Than Target |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target) | 44.10% | Easy | |
-| 0745 | Prefix and Suffix Search | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0745.Prefix-and-Suffix-Search) | 30.90% | Hard | |
-| 0746 | Min Cost Climbing Stairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0746.Min-Cost-Climbing-Stairs) | 47.50% | Easy | |
-| 0747 | Largest Number At Least Twice of Others | | 40.70% | Easy | |
-| 0748 | Shortest Completing Word |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0748.Shortest-Completing-Word) | 54.50% | Easy | |
-| 0749 | Contain Virus | | 41.40% | Hard | |
-| 0750 | Number Of Corner Rectangles | | 64.80% | Medium | |
-| 0751 | IP to CIDR | | 59.70% | Easy | |
-| 0752 | Open the Lock | | 46.30% | Medium | |
-| 0753 | Cracking the Safe | | 46.60% | Hard | |
-| 0754 | Reach a Number | | 32.80% | Easy | |
-| 0755 | Pour Water | | 40.80% | Medium | |
-| 0756 | Pyramid Transition Matrix |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0756.Pyramid-Transition-Matrix) | 51.80% | Medium | |
-| 0757 | Set Intersection Size At Least Two | | 37.00% | Hard | |
-| 0758 | Bold Words in String | | 42.70% | Easy | |
-| 0759 | Employee Free Time | | 61.50% | Hard | |
-| 0760 | Find Anagram Mappings | | 79.40% | Easy | |
-| 0761 | Special Binary String | | 52.00% | Hard | |
-| 0762 | Prime Number of Set Bits in Binary Representation |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation) | 59.60% | Easy | |
-| 0763 | Partition Labels | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0763.Partition-Labels) | 70.80% | Medium | |
-| 0764 | Largest Plus Sign | | 43.50% | Medium | |
-| 0765 | Couples Holding Hands | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0765.Couples-Holding-Hands) | 51.70% | Hard | |
-| 0766 | Toeplitz Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0766.Toeplitz-Matrix) | 61.90% | Easy | |
-| 0767 | Reorganize String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0767.Reorganize-String) | 42.70% | Medium | |
-| 0768 | Max Chunks To Make Sorted II | | 46.10% | Hard | |
-| 0769 | Max Chunks To Make Sorted | | 51.90% | Medium | |
-| 0770 | Basic Calculator IV | | 45.70% | Hard | |
-| 0771 | Jewels and Stones |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0771.Jewels-and-Stones) | 83.20% | Easy | |
-| 0772 | Basic Calculator III | | 43.40% | Hard | |
-| 0773 | Sliding Puzzle | | 52.90% | Hard | |
-| 0774 | Minimize Max Distance to Gas Station | | 42.00% | Hard | |
-| 0775 | Global and Local Inversions | | 39.10% | Medium | |
-| 0776 | Split BST | | 52.70% | Medium | |
-| 0777 | Swap Adjacent in LR String | | 33.40% | Medium | |
-| 0778 | Swim in Rising Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0778.Swim-in-Rising-Water) | 47.80% | Hard | |
-| 0779 | K-th Symbol in Grammar | | 37.50% | Medium | |
-| 0780 | Reaching Points | | 27.60% | Hard | |
-| 0781 | Rabbits in Forest |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0781.Rabbits-in-Forest) | 51.80% | Medium | |
-| 0782 | Transform to Chessboard | | 39.80% | Hard | |
-| 0783 | Minimum Distance Between BST Nodes | | 50.60% | Easy | |
-| 0784 | Letter Case Permutation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0784.Letter-Case-Permutation) | 57.40% | Easy | |
-| 0785 | Is Graph Bipartite? | | 43.50% | Medium | |
-| 0786 | K-th Smallest Prime Fraction |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0786.K-th-Smallest-Prime-Fraction) | 39.90% | Hard | |
-| 0787 | Cheapest Flights Within K Stops | | 35.20% | Medium | |
-| 0788 | Rotated Digits | | 54.40% | Easy | |
-| 0789 | Escape The Ghosts | | 55.40% | Medium | |
-| 0790 | Domino and Tromino Tiling | | 36.00% | Medium | |
-| 0791 | Custom Sort String | | 62.30% | Medium | |
-| 0792 | Number of Matching Subsequences | | 43.40% | Medium | |
-| 0793 | Preimage Size of Factorial Zeroes Function | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function) | 39.10% | Hard | |
-| 0794 | Valid Tic-Tac-Toe State | | 29.80% | Medium | |
-| 0795 | Number of Subarrays with Bounded Maximum | | 43.40% | Medium | |
-| 0796 | Rotate String | | 49.10% | Easy | |
-| 0797 | All Paths From Source to Target | | 70.70% | Medium | |
-| 0798 | Smallest Rotation with Highest Score | | 40.40% | Hard | |
-| 0799 | Champagne Tower | | 34.20% | Medium | |
-| 0800 | Similar RGB Color | | 59.80% | Easy | |
-| 0801 | Minimum Swaps To Make Sequences Increasing | | 34.90% | Medium | |
-| 0802 | Find Eventual Safe States | | 44.10% | Medium | |
-| 0803 | Bricks Falling When Hit | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0803.Bricks-Falling-When-Hit) | 28.80% | Hard | |
-| 0804 | Unique Morse Code Words | | 74.90% | Easy | |
-| 0805 | Split Array With Same Average | | 24.50% | Hard | |
-| 0806 | Number of Lines To Write String | | 63.20% | Easy | |
-| 0807 | Max Increase to Keep City Skyline | | 81.60% | Medium | |
-| 0808 | Soup Servings | | 37.50% | Medium | |
-| 0809 | Expressive Words | | 43.70% | Medium | |
-| 0810 | Chalkboard XOR Game | | 45.10% | Hard | |
-| 0811 | Subdomain Visit Count |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0811.Subdomain-Visit-Count) | 65.60% | Easy | |
-| 0812 | Largest Triangle Area | | 56.30% | Easy | |
-| 0813 | Largest Sum of Averages | | 45.50% | Medium | |
-| 0814 | Binary Tree Pruning | | 71.20% | Medium | |
-| 0815 | Bus Routes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0815.Bus-Routes) | 40.30% | Hard | |
-| 0816 | Ambiguous Coordinates | | 44.20% | Medium | |
-| 0817 | Linked List Components | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0817.Linked-List-Components) | 54.80% | Medium | |
-| 0818 | Race Car | | 35.20% | Hard | |
-| 0819 | Most Common Word |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0819.Most-Common-Word) | 42.20% | Easy | |
-| 0820 | Short Encoding of Words | | 47.40% | Medium | |
-| 0821 | Shortest Distance to a Character | | 63.60% | Easy | |
-| 0822 | Card Flipping Game | | 40.50% | Medium | |
-| 0823 | Binary Trees With Factors | | 32.60% | Medium | |
-| 0824 | Goat Latin | | 57.90% | Easy | |
-| 0825 | Friends Of Appropriate Ages | | 36.50% | Medium | |
-| 0826 | Most Profit Assigning Work | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0826.Most-Profit-Assigning-Work) | 35.90% | Medium | |
-| 0827 | Making A Large Island | | 43.40% | Hard | |
-| 0828 | Unique Letter String |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0828.COPYRIGHT-PROBLEM-XXX) | 39.80% | Hard | |
-| 0829 | Consecutive Numbers Sum | | 33.50% | Hard | |
-| 0830 | Positions of Large Groups | | 47.90% | Easy | |
-| 0831 | Masking Personal Information | | 42.20% | Medium | |
-| 0832 | Flipping an Image | | 72.90% | Easy | |
-| 0833 | Find And Replace in String | | 46.50% | Medium | |
-| 0834 | Sum of Distances in Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0834.Sum-of-Distances-in-Tree) | 39.70% | Hard | |
-| 0835 | Image Overlap | | 52.90% | Medium | |
-| 0836 | Rectangle Overlap | | 46.60% | Easy | |
-| 0837 | New 21 Game | | 31.80% | Medium | |
-| 0838 | Push Dominoes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0838.Push-Dominoes) | 44.00% | Medium | |
-| 0839 | Similar String Groups | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0839.Similar-String-Groups) | 34.70% | Hard | |
-| 0840 | Magic Squares In Grid | | 35.60% | Easy | |
-| 0841 | Keys and Rooms | | 60.50% | Medium | |
-| 0842 | Split Array into Fibonacci Sequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence) | 34.90% | Medium | |
-| 0843 | Guess the Word | | 43.60% | Hard | |
-| 0844 | Backspace String Compare | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0844.Backspace-String-Compare) | 46.10% | Easy | |
-| 0845 | Longest Mountain in Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0845.Longest-Mountain-in-Array) | 34.40% | Medium | |
-| 0846 | Hand of Straights | | 49.50% | Medium | |
-| 0847 | Shortest Path Visiting All Nodes | | 47.10% | Hard | |
-| 0848 | Shifting Letters | | 41.00% | Medium | |
-| 0849 | Maximize Distance to Closest Person | | 41.00% | Easy | |
-| 0850 | Rectangle Area II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0850.Rectangle-Area-II) | 45.00% | Hard | |
-| 0851 | Loud and Rich | | 47.80% | Medium | |
-| 0852 | Peak Index in a Mountain Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0852.Peak-Index-in-a-Mountain-Array) | 69.70% | Easy | |
-| 0853 | Car Fleet | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0853.Car-Fleet) | 40.00% | Medium | |
-| 0854 | K-Similar Strings | | 33.80% | Hard | |
-| 0855 | Exam Room | | 38.60% | Medium | |
-| 0856 | Score of Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0856.Score-of-Parentheses) | 56.50% | Medium | |
-| 0857 | Minimum Cost to Hire K Workers | | 47.60% | Hard | |
-| 0858 | Mirror Reflection | | 52.00% | Medium | |
-| 0859 | Buddy Strings | | 27.60% | Easy | |
-| 0860 | Lemonade Change | | 50.60% | Easy | |
-| 0861 | Score After Flipping Matrix | | 69.80% | Medium | |
-| 0862 | Shortest Subarray with Sum at Least K | | 22.20% | Hard | |
-| 0863 | All Nodes Distance K in Binary Tree | | 48.00% | Medium | |
-| 0864 | Shortest Path to Get All Keys | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0864.Shortest-Path-to-Get-All-Keys) | 36.20% | Hard | |
-| 0865 | Smallest Subtree with all the Deepest Nodes | | 56.00% | Medium | |
-| 0866 | Prime Palindrome | | 20.30% | Medium | |
-| 0867 | Transpose Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0867.Transpose-Matrix) | 63.90% | Easy | |
-| 0868 | Binary Gap | | 59.50% | Easy | |
-| 0869 | Reordered Power of 2 | | 51.10% | Medium | |
-| 0870 | Advantage Shuffle | | 42.60% | Medium | |
-| 0871 | Minimum Number of Refueling Stops | | 29.10% | Hard | |
-| 0872 | Leaf-Similar Trees | | 63.50% | Easy | |
-| 0873 | Length of Longest Fibonacci Subsequence | | 46.40% | Medium | |
-| 0874 | Walking Robot Simulation | | 32.30% | Easy | |
-| 0875 | Koko Eating Bananas |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0875.Koko-Eating-Bananas) | 46.20% | Medium | |
-| 0876 | Middle of the Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0876.Middle-of-the-Linked-List) | 64.40% | Easy | |
-| 0877 | Stone Game | | 61.50% | Medium | |
-| 0878 | Nth Magical Number |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0878.Nth-Magical-Number) | 25.60% | Hard | |
-| 0879 | Profitable Schemes | | 36.80% | Hard | |
-| 0880 | Decoded String at Index | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0880.Decoded-String-at-Index) | 23.00% | Medium | |
-| 0881 | Boats to Save People | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0881.Boats-to-Save-People) | 44.00% | Medium | |
-| 0882 | Reachable Nodes In Subdivided Graph | | 38.30% | Hard | |
-| 0883 | Projection Area of 3D Shapes | | 65.80% | Easy | |
-| 0884 | Uncommon Words from Two Sentences |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0884.Uncommon-Words-from-Two-Sentences) | 60.90% | Easy | |
-| 0885 | Spiral Matrix III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0885.Spiral-Matrix-III) | 64.40% | Medium | |
-| 0886 | Possible Bipartition | | 40.90% | Medium | |
-| 0887 | Super Egg Drop |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0887.Super-Egg-Drop) | 24.80% | Hard | |
-| 0888 | Fair Candy Swap | | 56.80% | Easy | |
-| 0889 | Construct Binary Tree from Preorder and Postorder Traversal | | 60.30% | Medium | |
-| 0890 | Find and Replace Pattern | | 71.30% | Medium | |
-| 0891 | Sum of Subsequence Widths |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0891.Sum-of-Subsequence-Widths) | 29.10% | Hard | |
-| 0892 | Surface Area of 3D Shapes | | 56.10% | Easy | |
-| 0893 | Groups of Special-Equivalent Strings | | 62.80% | Easy | |
-| 0894 | All Possible Full Binary Trees | | 71.00% | Medium | |
-| 0895 | Maximum Frequency Stack | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0895.Maximum-Frequency-Stack) | 56.40% | Hard | |
-| 0896 | Monotonic Array | | 55.40% | Easy | |
-| 0897 | Increasing Order Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0897.Increasing-Order-Search-Tree) | 64.90% | Easy | |
-| 0898 | Bitwise ORs of Subarrays |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0898.Bitwise-ORs-of-Subarrays) | 34.40% | Medium | |
-| 0899 | Orderly Queue | | 47.50% | Hard | |
-| 0900 | RLE Iterator | | 50.30% | Medium | |
-| 0901 | Online Stock Span | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0901.Online-Stock-Span) | 49.40% | Medium | |
-| 0902 | Numbers At Most N Given Digit Set | | 28.70% | Hard | |
-| 0903 | Valid Permutations for DI Sequence | | 44.70% | Hard | |
-| 0904 | Fruit Into Baskets | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0904.Fruit-Into-Baskets) | 41.60% | Medium | |
-| 0905 | Sort Array By Parity | | 72.60% | Easy | |
-| 0906 | Super Palindromes | | 30.40% | Hard | |
-| 0907 | Sum of Subarray Minimums |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0907.Sum-of-Subarray-Minimums) | 27.60% | Medium | |
-| 0908 | Smallest Range I | | 64.60% | Easy | |
-| 0909 | Snakes and Ladders | | 33.80% | Medium | |
-| 0910 | Smallest Range II | | 23.70% | Medium | |
-| 0911 | Online Election |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0911.Online-Election) | 47.10% | Medium | |
-| 0912 | Sort an Array | | 63.60% | Medium | |
-| 0913 | Cat and Mouse | | 28.80% | Hard | |
-| 0914 | X of a Kind in a Deck of Cards | | 34.10% | Easy | |
-| 0915 | Partition Array into Disjoint Intervals | | 43.50% | Medium | |
-| 0916 | Word Subsets | | 45.40% | Medium | |
-| 0917 | Reverse Only Letters | | 55.90% | Easy | |
-| 0918 | Maximum Sum Circular Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0918.Maximum-Sum-Circular-Subarray) | 32.00% | Medium | |
-| 0919 | Complete Binary Tree Inserter | | 55.20% | Medium | |
-| 0920 | Number of Music Playlists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0920.Number-of-Music-Playlists) | 43.90% | Hard | |
-| 0921 | Minimum Add to Make Parentheses Valid | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid) | 70.30% | Medium | |
-| 0922 | Sort Array By Parity II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0922.Sort-Array-By-Parity-II) | 67.10% | Easy | |
-| 0923 | 3Sum With Multiplicity | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0923.3Sum-With-Multiplicity) | 33.90% | Medium | |
-| 0924 | Minimize Malware Spread | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0924.Minimize-Malware-Spread) | 40.10% | Hard | |
-| 0925 | Long Pressed Name | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0925.Long-Pressed-Name) | 44.50% | Easy | |
-| 0926 | Flip String to Monotone Increasing | | 49.80% | Medium | |
-| 0927 | Three Equal Parts | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0927.Three-Equal-Parts) | 30.40% | Hard | |
-| 0928 | Minimize Malware Spread II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0928.Minimize-Malware-Spread-II) | 39.50% | Hard | |
-| 0929 | Unique Email Addresses | | 70.50% | Easy | |
-| 0930 | Binary Subarrays With Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0930.Binary-Subarrays-With-Sum) | 38.20% | Medium | |
-| 0931 | Minimum Falling Path Sum | | 59.00% | Medium | |
-| 0932 | Beautiful Array | | 53.60% | Medium | |
-| 0933 | Number of Recent Calls | | 69.40% | Easy | |
-| 0934 | Shortest Bridge | | 44.20% | Medium | |
-| 0935 | Knight Dialer | | 41.10% | Medium | |
-| 0936 | Stamping The Sequence | | 36.20% | Hard | |
-| 0937 | Reorder Log Files | | 56.90% | Easy | |
-| 0938 | Range Sum of BST | | 78.80% | Easy | |
-| 0939 | Minimum Area Rectangle | | 50.50% | Medium | |
-| 0940 | Distinct Subsequences II | | 39.80% | Hard | |
-| 0941 | Valid Mountain Array | | 35.50% | Easy | |
-| 0942 | DI String Match | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0942.DI-String-Match) | 70.00% | Easy | |
-| 0943 | Find the Shortest Superstring | | 38.30% | Hard | |
-| 0944 | Delete Columns to Make Sorted | | 69.40% | Easy | |
-| 0945 | Minimum Increment to Make Array Unique | | 42.90% | Medium | |
-| 0946 | Validate Stack Sequences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0946.Validate-Stack-Sequences) | 57.60% | Medium | |
-| 0947 | Most Stones Removed with Same Row or Column | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column) | 54.20% | Medium | |
-| 0948 | Bag of Tokens | | 39.30% | Medium | |
-| 0949 | Largest Time for Given Digits | | 34.20% | Easy | |
-| 0950 | Reveal Cards In Increasing Order | | 72.20% | Medium | |
-| 0951 | Flip Equivalent Binary Trees | | 65.20% | Medium | |
-| 0952 | Largest Component Size by Common Factor | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0952.Largest-Component-Size-by-Common-Factor) | 26.60% | Hard | |
-| 0953 | Verifying an Alien Dictionary |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0953.Verifying-an-Alien-Dictionary) | 55.60% | Easy | |
-| 0954 | Array of Doubled Pairs | | 34.40% | Medium | |
-| 0955 | Delete Columns to Make Sorted II | | 31.60% | Medium | |
-| 0956 | Tallest Billboard | | 38.40% | Hard | |
-| 0957 | Prison Cells After N Days | | 38.20% | Medium | |
-| 0958 | Check Completeness of a Binary Tree | | 47.60% | Medium | |
-| 0959 | Regions Cut By Slashes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0959.Regions-Cut-By-Slashes) | 62.50% | Medium | |
-| 0960 | Delete Columns to Make Sorted III | | 52.80% | Hard | |
-| 0961 | N-Repeated Element in Size 2N Array |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0961.N-Repeated-Element-in-Size-2N-Array) | 72.40% | Easy | |
-| 0962 | Maximum Width Ramp | | 41.80% | Medium | |
-| 0963 | Minimum Area Rectangle II | | 44.50% | Medium | |
-| 0964 | Least Operators to Express Number | | 40.90% | Hard | |
-| 0965 | Univalued Binary Tree | | 66.90% | Easy | |
-| 0966 | Vowel Spellchecker | | 41.90% | Medium | |
-| 0967 | Numbers With Same Consecutive Differences | | 37.10% | Medium | |
-| 0968 | Binary Tree Cameras | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0968.Binary-Tree-Cameras) | 35.40% | Hard | |
-| 0969 | Pancake Sorting | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0969.Pancake-Sorting) | 62.40% | Medium | |
-| 0970 | Powerful Integers |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0970.Powerful-Integers) | 39.30% | Easy | |
-| 0971 | Flip Binary Tree To Match Preorder Traversal | | 43.00% | Medium | |
-| 0972 | Equal Rational Numbers | | 40.20% | Hard | |
-| 0973 | K Closest Points to Origin | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0973.K-Closest-Points-to-Origin) | 62.20% | Medium | |
-| 0974 | Subarray Sums Divisible by K | | 45.20% | Medium | |
-| 0975 | Odd Even Jump | | 47.20% | Hard | |
-| 0976 | Largest Perimeter Triangle | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0976.Largest-Perimeter-Triangle) | 57.20% | Easy | |
-| 0977 | Squares of a Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0977.Squares-of-a-Sorted-Array) | 72.00% | Easy | |
-| 0978 | Longest Turbulent Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0978.Longest-Turbulent-Subarray) | 45.60% | Medium | |
-| 0979 | Distribute Coins in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0979.Distribute-Coins-in-Binary-Tree) | 67.20% | Medium | |
-| 0980 | Unique Paths III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0980.Unique-Paths-III) | 71.20% | Hard | |
-| 0981 | Time Based Key-Value Store |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0981.Time-Based-Key-Value-Store) | 50.80% | Medium | |
-| 0982 | Triples with Bitwise AND Equal To Zero | | 54.00% | Hard | |
-| 0983 | Minimum Cost For Tickets | | 57.30% | Medium | |
-| 0984 | String Without AAA or BBB |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0984.String-Without-AAA-or-BBB) | 33.90% | Medium | |
-| 0985 | Sum of Even Numbers After Queries | | 63.40% | Easy | |
-| 0986 | Interval List Intersections | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0986.Interval-List-Intersections) | 63.30% | Medium | |
-| 0987 | Vertical Order Traversal of a Binary Tree | | 31.80% | Medium | |
-| 0988 | Smallest String Starting From Leaf | | 46.00% | Medium | |
-| 0989 | Add to Array-Form of Integer | | 44.70% | Easy | |
-| 0990 | Satisfiability of Equality Equations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0990.Satisfiability-of-Equality-Equations) | 40.10% | Medium | |
-| 0991 | Broken Calculator | | 40.40% | Medium | |
-| 0992 | Subarrays with K Different Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0992.Subarrays-with-K-Different-Integers) | 45.20% | Hard | |
-| 0993 | Cousins in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0993.Cousins-in-Binary-Tree) | 52.40% | Easy | |
-| 0994 | Rotting Oranges | | 46.40% | Easy | |
-| 0995 | Minimum Number of K Consecutive Bit Flips | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips) | 48.40% | Hard | |
-| 0996 | Number of Squareful Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0996.Number-of-Squareful-Arrays) | 47.80% | Hard | |
-| 0997 | Find the Town Judge | | 49.10% | Easy | |
-| 0998 | Maximum Binary Tree II | | 61.60% | Medium | |
-| 0999 | Available Captures for Rook | | 66.10% | Easy | |
-| 1000 | Minimum Cost to Merge Stones | | 32.10% | Hard | |
-| 1001 | Grid Illumination | | 34.40% | Hard | |
-| 1002 | Find Common Characters |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1002.Find-Common-Characters) | 65.80% | Easy | |
-| 1003 | Check If Word Is Valid After Substitutions | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions) | 51.80% | Medium | |
-| 1004 | Max Consecutive Ones III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1004.Max-Consecutive-Ones-III) | 53.40% | Medium | |
-| 1005 | Maximize Sum Of Array After K Negations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations) | 49.70% | Easy | |
-| 1006 | Clumsy Factorial | | 53.70% | Medium | |
-| 1007 | Minimum Domino Rotations For Equal Row | | 47.90% | Medium | |
-| 1008 | Construct Binary Search Tree from Preorder Traversal | | 73.10% | Medium | |
-| 1009 | Complement of Base 10 Integer | | 58.90% | Easy | |
-| 1010 | Pairs of Songs With Total Durations Divisible by 60 | | 45.60% | Easy | |
-| 1011 | Capacity To Ship Packages Within D Days | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days) | 53.30% | Medium | |
-| 1012 | Numbers With Repeated Digits | | 34.80% | Hard | |
-| 1013 | Partition Array Into Three Parts With Equal Sum | | 55.50% | Easy | |
-| 1014 | Best Sightseeing Pair | | 49.30% | Medium | |
-| 1015 | Smallest Integer Divisible by K | | 28.40% | Medium | |
-| 1016 | Binary String With Substrings Representing 1 To N | | 60.70% | Medium | |
-| 1017 | Convert to Base -2 | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1017.Convert-to-Base--2) | 56.70% | Medium | |
-| 1018 | Binary Prefix Divisible By 5 | | 46.60% | Easy | |
-| 1019 | Next Greater Node In Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1019.Next-Greater-Node-In-Linked-List) | 56.50% | Medium | |
-| 1020 | Number of Enclaves | | 54.70% | Medium | |
-| 1021 | Remove Outermost Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1021.Remove-Outermost-Parentheses) | 75.60% | Easy | |
-| 1022 | Sum of Root To Leaf Binary Numbers | | 55.90% | Easy | |
-| 1023 | Camelcase Matching | | 56.50% | Medium | |
-| 1024 | Video Stitching | | 47.20% | Medium | |
-| 1025 | Divisor Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1025.Divisor-Game) | 63.30% | Easy | |
-| 1026 | Maximum Difference Between Node and Ancestor | | 59.60% | Medium | |
-| 1027 | Longest Arithmetic Sequence | | 47.90% | Medium | |
-| 1028 | Recover a Tree From Preorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal) | 70.20% | Hard | |
-| 1029 | Two City Scheduling | | 53.90% | Easy | |
-| 1030 | Matrix Cells in Distance Order | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1030.Matrix-Cells-in-Distance-Order) | 65.20% | Easy | |
-| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | | 55.30% | Medium | |
-| 1032 | Stream of Characters | | 41.30% | Hard | |
-| 1033 | Moving Stones Until Consecutive | | 35.50% | Easy | |
-| 1034 | Coloring A Border | | 42.50% | Medium | |
-| 1035 | Uncrossed Lines | | 51.80% | Medium | |
-| 1036 | Escape a Large Maze | | 36.40% | Hard | |
-| 1037 | Valid Boomerang | | 37.60% | Easy | |
-| 1038 | Binary Search Tree to Greater Sum Tree | | 79.70% | Medium | |
-| 1039 | Minimum Score Triangulation of Polygon | | 41.50% | Medium | |
-| 1040 | Moving Stones Until Consecutive II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1040.Moving-Stones-Until-Consecutive-II) | 46.20% | Medium | |
-| 1041 | Robot Bounded In Circle | | 43.40% | Easy | |
-| 1042 | Flower Planting With No Adjacent | | 48.40% | Easy | |
-| 1043 | Partition Array for Maximum Sum | | 62.40% | Medium | |
-| 1044 | Longest Duplicate Substring | | 22.80% | Hard | |
-| 1045 | Customers Who Bought All Products | | 64.10% | Medium | |
-| 1046 | Last Stone Weight | | 62.40% | Easy | |
-| 1047 | Remove All Adjacent Duplicates In String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String) | 63.60% | Easy | |
-| 1048 | Longest String Chain | | 47.30% | Medium | |
-| 1049 | Last Stone Weight II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1049.Last-Stone-Weight-II) | 39.90% | Medium | |
-| 1050 | Actors and Directors Who Cooperated At Least Three Times | | 75.40% | Easy | |
-| 1051 | Height Checker | | 69.40% | Easy | |
-| 1052 | Grumpy Bookstore Owner | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1052.Grumpy-Bookstore-Owner) | 52.00% | Medium | |
-| 1053 | Previous Permutation With One Swap | | 47.10% | Medium | |
-| 1054 | Distant Barcodes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1054.Distant-Barcodes) | 38.60% | Medium | |
-| 1055 | Shortest Way to Form String | | 58.20% | Medium | |
-| 1056 | Confusing Number | | 52.10% | Easy | |
-| 1057 | Campus Bikes | | 58.90% | Medium | |
-| 1058 | Minimize Rounding Error to Meet Target | | 41.30% | Medium | |
-| 1059 | All Paths from Source Lead to Destination | | 45.60% | Medium | |
-| 1060 | Missing Element in Sorted Array | | 54.20% | Medium | |
-| 1061 | Lexicographically Smallest Equivalent String | | 59.30% | Medium | |
-| 1062 | Longest Repeating Substring | | 50.80% | Medium | |
-| 1063 | Number of Valid Subarrays | | 74.30% | Hard | |
-| 1064 | Fixed Point | | 79.90% | Easy | |
-| 1065 | Index Pairs of a String | | 59.30% | Easy | |
-| 1066 | Campus Bikes II | | 43.30% | Medium | |
-| 1067 | Digit Count in Range | | 34.40% | Hard | |
-| 1068 | Product Sales Analysis I | | 77.50% | Easy | |
-| 1069 | Product Sales Analysis II | | 79.90% | Easy | |
-| 1070 | Product Sales Analysis III | | 42.70% | Medium | |
-| 1071 | Greatest Common Divisor of Strings | | 53.60% | Easy | |
-| 1072 | Flip Columns For Maximum Number of Equal Rows | | 56.20% | Medium | |
-| 1073 | Adding Two Negabinary Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1073.Adding-Two-Negabinary-Numbers) | 31.60% | Medium | |
-| 1074 | Number of Submatrices That Sum to Target | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target) | 58.50% | Hard | |
-| 1075 | Project Employees I | | 58.70% | Easy | |
-| 1076 | Project Employees II | | 52.80% | Easy | |
-| 1077 | Project Employees III | | 76.90% | Medium | |
-| 1078 | Occurrences After Bigram |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1078.Occurrences-After-Bigram) | 67.40% | Easy | |
-| 1079 | Letter Tile Possibilities |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1079.Letter-Tile-Possibilities) | 76.50% | Medium | |
-| 1080 | Insufficient Nodes in Root to Leaf Paths | | 41.10% | Medium | |
-| 1081 | Smallest Subsequence of Distinct Characters | | 42.80% | Medium | |
-| 1082 | Sales Analysis I | | 74.20% | Easy | |
-| 1083 | Sales Analysis II | | 55.00% | Easy | |
-| 1084 | Sales Analysis III | | 57.80% | Easy | |
-| 1085 | Sum of Digits in the Minimum Number | | 75.30% | Easy | |
-| 1086 | High Five | | 76.90% | Easy | |
-| 1087 | Brace Expansion | | 57.50% | Medium | |
-| 1088 | Confusing Number II | | 34.10% | Hard | |
-| 1089 | Duplicate Zeros | | 58.80% | Easy | |
-| 1090 | Largest Values From Labels | | 56.00% | Medium | |
-| 1091 | Shortest Path in Binary Matrix | | 35.90% | Medium | |
-| 1092 | Shortest Common Supersequence | | 47.20% | Hard | |
-| 1093 | Statistics from a Large Sample |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1093.Statistics-from-a-Large-Sample) | 41.10% | Medium | |
-| 1094 | Car Pooling | | 57.10% | Medium | |
-| 1095 | Find in Mountain Array | | 32.50% | Hard | |
-| 1096 | Brace Expansion II | | 52.00% | Hard | |
-| 1097 | Game Play Analysis V | | 51.10% | Hard | |
-| 1098 | Unpopular Books | | 43.20% | Medium | |
-| 1099 | Two Sum Less Than K | | 62.80% | Easy | |
-| 1100 | Find K-Length Substrings With No Repeated Characters | | 72.40% | Medium | |
-| 1101 | The Earliest Moment When Everyone Become Friends | | 62.20% | Medium | |
-| 1102 | Path With Maximum Minimum Value | | 42.50% | Medium | |
-| 1103 | Distribute Candies to People | | 62.00% | Easy | |
-| 1104 | Path In Zigzag Labelled Binary Tree | | 71.10% | Medium | |
-| 1105 | Filling Bookcase Shelves | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1105.Filling-Bookcase-Shelves) | 53.80% | Medium | |
-| 1106 | Parsing A Boolean Expression | | 59.00% | Hard | |
-| 1107 | New Users Daily Count | | 46.30% | Medium | |
-| 1108 | Defanging an IP Address | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1108.Defanging-an-IP-Address) | 87.50% | Easy | |
-| 1109 | Corporate Flight Bookings | | 47.30% | Medium | |
-| 1110 | Delete Nodes And Return Forest | | 61.90% | Medium | |
-| 1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings) | 63.30% | Medium | |
-| 1112 | Highest Grade For Each Student | | 60.80% | Medium | |
-| 1113 | Reported Posts | | 68.20% | Easy | |
-| 1114 | Print in Order | | 59.20% | Easy | |
-| 1115 | Print FooBar Alternately | | 59.40% | Medium | |
-| 1116 | Print Zero Even Odd | | 55.40% | Medium | |
-| 1117 | Building H2O | | 50.40% | Hard | |
-| 1118 | Number of Days in a Month | | 57.50% | Easy | |
-| 1119 | Remove Vowels from a String | | 91.10% | Easy | |
-| 1120 | Maximum Average Subtree | | 60.90% | Medium | |
-| 1121 | Divide Array Into Increasing Sequences | | 51.20% | Hard | |
-| 1122 | Relative Sort Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1122.Relative-Sort-Array) | 68.50% | Easy | |
-| 1123 | Lowest Common Ancestor of Deepest Leaves | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves) | 64.60% | Medium | |
-| 1124 | Longest Well-Performing Interval | | 27.40% | Medium | |
-| 1125 | Smallest Sufficient Team | | 43.50% | Hard | |
-| 1126 | Active Businesses | | 70.80% | Medium | |
-| 1127 | User Purchase Platform | | 64.50% | Hard | |
-| 1128 | Number of Equivalent Domino Pairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1128.Number-of-Equivalent-Domino-Pairs) | 40.30% | Easy | |
-| 1129 | Shortest Path with Alternating Colors | | 34.20% | Medium | |
-| 1130 | Minimum Cost Tree From Leaf Values | | 58.80% | Medium | |
-| 1131 | Maximum of Absolute Value Expression | | 50.30% | Medium | |
-| 1132 | Reported Posts II | | 35.50% | Medium | |
-| 1133 | Largest Unique Number | | 70.40% | Easy | |
-| 1134 | Armstrong Number | | 79.90% | Easy | |
-| 1135 | Connecting Cities With Minimum Cost | | 49.40% | Medium | |
-| 1136 | Parallel Courses | | 58.80% | Hard | |
-| 1137 | N-th Tribonacci Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1137.N-th-Tribonacci-Number) | 61.10% | Easy | |
-| 1138 | Alphabet Board Path | | 42.40% | Medium | |
-| 1139 | Largest 1-Bordered Square | | 42.80% | Medium | |
-| 1140 | Stone Game II | | 60.60% | Medium | |
-| 1141 | User Activity for the Past 30 Days I | | 55.30% | Easy | |
-| 1142 | User Activity for the Past 30 Days II | | 38.10% | Easy | |
-| 1143 | Longest Common Subsequence | | 58.80% | Medium | |
-| 1144 | Decrease Elements To Make Array Zigzag | | 40.50% | Medium | |
-| 1145 | Binary Tree Coloring Game | | 45.10% | Medium | |
-| 1146 | Snapshot Array | | 29.80% | Medium | |
-| 1147 | Longest Chunked Palindrome Decomposition | | 58.40% | Hard | |
-| 1148 | Article Views I | | 68.30% | Easy | |
-| 1149 | Article Views II | | 50.10% | Medium | |
-| 1150 | Check If a Number Is Majority Element in a Sorted Array | | 72.40% | Easy | |
-| 1151 | Minimum Swaps to Group All 1's Together | | 51.60% | Medium | |
-| 1152 | Analyze User Website Visit Pattern | | 33.50% | Medium | |
-| 1153 | String Transforms Into Another String | | 23.60% | Hard | |
-| 1154 | Day of the Year | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1154.Day-of-the-Year) | 52.10% | Easy | |
-| 1155 | Number of Dice Rolls With Target Sum | | 48.60% | Medium | |
-| 1156 | Swap For Longest Repeated Character Substring | | 41.10% | Medium | |
-| 1157 | Online Majority Element In Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1157.Online-Majority-Element-In-Subarray) | 20.50% | Hard | |
-| 1158 | Market Analysis I | | 50.5% | Medium | |
-| 1159 | Market Analysis II | | 46.8% | Hard | |
-| 1160 | Find Words That Can Be Formed by Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters) | 67.6% | Easy | |
-| 1161 | Maximum Level Sum of a Binary Tree | | 71.4% | Medium | |
-| 1162 | As Far from Land as Possible | | 39.5% | Medium | |
-| 1163 | Last Substring in Lexicographical Order | | 30.2% | Hard | |
-| 1164 | Product Price at a Given Date | | 59.1% | Medium | |
-| 1165 | Single-Row Keyboard | | 84.9% | Easy | |
-| 1166 | Design File System | | 60.0% | Medium | |
-| 1167 | Minimum Cost to Connect Sticks | | 60.1% | Medium | |
-| 1168 | Optimize Water Distribution in a Village | | 52.6% | Hard | |
-| 1169 | Invalid Transactions | | 27.4% | Medium | |
-| 1170 | Compare Strings by Frequency of the Smallest Character | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character) | 60.5% | Easy | |
-| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List) | 42.3% | Medium | |
-| 1172 | Dinner Plate Stacks | | 41.6% | Hard | |
-| 1173 | Immediate Food Delivery I | | 72.5% | Easy | |
-| 1174 | Immediate Food Delivery II | | 52.3% | Medium | |
-| 1175 | Prime Arrangements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1175.Prime-Arrangements) | 50.3% | Easy | |
-| 1176 | Diet Plan Performance | | 48.6% | Easy | |
-| 1177 | Can Make Palindrome from Substring | | 32.0% | Medium | |
-| 1178 | Number of Valid Words for Each Puzzle | | 34.7% | Hard | |
-| 1179 | Reformat Department Table | | 67.1% | Easy | |
-| 1180 | Count Substrings with Only One Distinct Letter | | 78.3% | Easy | |
-| 1181 | Before and After Puzzle | | 41.9% | Medium | |
-| 1182 | Shortest Distance to Target Color | | 50.7% | Medium | |
-| 1183 | Maximum Number of Ones | | 45.7% | Hard | |
-| 1184 | Distance Between Bus Stops | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1184.Distance-Between-Bus-Stops) | 56.7% | Easy | |
-| 1185 | Day of the Week | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1185.Day-of-the-Week) | 65.8% | Easy | |
-| 1186 | Maximum Subarray Sum with One Deletion | | 33.2% | Medium | |
-| 1187 | Make Array Strictly Increasing | | 39.6% | Hard | |
-| 1188 | Design Bounded Blocking Queue | | 65.0% | Medium | |
-| 1189 | Maximum Number of Balloons | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1189.Maximum-Number-of-Balloons) | 62.7% | Easy | |
-| 1190 | Reverse Substrings Between Each Pair of Parentheses | | 57.8% | Medium | |
-| 1191 | K-Concatenation Maximum Sum | | 24.0% | Medium | |
-| 1192 | Critical Connections in a Network | | 45.2% | Hard | |
-| 1193 | Monthly Transactions I | | 58.8% | Medium | |
-| 1194 | Tournament Winners | | 52.2% | Hard | |
-| 1195 | Fizz Buzz Multithreaded | | 67.7% | Medium | |
-| 1196 | How Many Apples Can You Put into the Basket | | 68.7% | Easy | |
-| 1197 | Minimum Knight Moves | | 30.1% | Medium | |
-| 1198 | Find Smallest Common Element in All Rows | | 71.8% | Medium | |
-| 1199 | Minimum Time to Build Blocks | | 30.1% | Hard | |
-| 1200 | Minimum Absolute Difference | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1200.Minimum-Absolute-Difference) | 66.3% | Easy | |
-| 1201 | Ugly Number III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1201.Ugly-Number-III) | 23.9% | Medium | |
-| 1202 | Smallest String With Swaps | | 39.2% | Medium | |
-| 1203 | Sort Items by Groups Respecting Dependencies | | 46.9% | Hard | |
-| 1204 | Last Person to Fit in the Elevator New | | 65.8% | Medium | |
-| 1205 | Monthly Transactions II New | | 49.3% | Medium | |
-| 1206 | Design Skiplist New | | 61.8% | Hard | |
-| 1207 | Unique Number of Occurrences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1207.Unique-Number-of-Occurrences) | 77.4% | Easy | |
-| 1208 | Get Equal Substrings Within Budget | | 33.3% | Medium | |
-| 1209 | Remove All Adjacent Duplicates in String II | | 59.6% | Medium | |
-| 1210 | Minimum Moves to Reach Target with Rotations | | 40.1% | Hard | |
+| 0001 | Two Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0001.Two-Sum) | 45.6% | Easy | |
+| 0002 | Add Two Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0002.Add-Two-Numbers) | 33.9% | Medium | |
+| 0003 | Longest Substring Without Repeating Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters) | 30.4% | Medium | |
+| 0004 | Median of Two Sorted Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0004.Median-of-Two-Sorted-Arrays) | 29.6% | Hard | |
+| 0005 | Longest Palindromic Substring | | 29.4% | Medium | |
+| 0006 | ZigZag Conversion | | 36.3% | Medium | |
+| 0007 | Reverse Integer | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0007.Reverse-Integer) | 25.8% | Easy | |
+| 0008 | String to Integer (atoi) | | 15.4% | Medium | |
+| 0009 | Palindrome Number | | 48.4% | Easy | |
+| 0010 | Regular Expression Matching | | 26.8% | Hard | |
+| 0011 | Container With Most Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water) | 50.8% | Medium | |
+| 0012 | Integer to Roman | | 55.0% | Medium | |
+| 0013 | Roman to Integer | | 55.7% | Easy | |
+| 0014 | Longest Common Prefix | | 35.4% | Easy | |
+| 0015 | 3Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0015.3Sum) | 26.8% | Medium | |
+| 0016 | 3Sum Closest | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0016.3Sum-Closest) | 46.0% | Medium | |
+| 0017 | Letter Combinations of a Phone Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0017.Letter-Combinations-of-a-Phone-Number) | 46.8% | Medium | |
+| 0018 | 4Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0018.4Sum) | 33.6% | Medium | |
+| 0019 | Remove Nth Node From End of List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0019.Remove-Nth-Node-From-End-of-List) | 35.2% | Medium | |
+| 0020 | Valid Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0020.Valid-Parentheses) | 38.9% | Easy | |
+| 0021 | Merge Two Sorted Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0021.Merge-Two-Sorted-Lists) | 53.5% | Easy | |
+| 0022 | Generate Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0022.Generate-Parentheses) | 62.6% | Medium | |
+| 0023 | Merge k Sorted Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0023.Merge-k-Sorted-Lists) | 40.2% | Hard | |
+| 0024 | Swap Nodes in Pairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0024.Swap-Nodes-in-Pairs) | 50.3% | Medium | |
+| 0025 | Reverse Nodes in k-Group | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0025.Reverse-Nodes-in-k-Group) | 42.0% | Hard | |
+| 0026 | Remove Duplicates from Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0026.Remove-Duplicates-from-Sorted-Array) | 45.1% | Easy | |
+| 0027 | Remove Element | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0027.Remove-Element) | 48.2% | Easy | |
+| 0028 | Implement strStr() | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0028.Implement-strStr) | 34.5% | Easy | |
+| 0029 | Divide Two Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0029.Divide-Two-Integers) | 16.4% | Medium | |
+| 0030 | Substring with Concatenation of All Words | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0030.Substring-with-Concatenation-of-All-Words)(是否还有更优解) | 25.4% | Hard | |
+| 0031 | Next Permutation | | 32.6% | Medium | |
+| 0032 | Longest Valid Parentheses | | 28.4% | Hard | |
+| 0033 | Search in Rotated Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0033.Search-in-Rotated-Sorted-Array) | 34.5% | Medium | |
+| 0034 | Find First and Last Position of Element in Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array) | 36.1% | Medium | |
+| 0035 | Search Insert Position | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0035.Search-Insert-Position) | 42.6% | Easy | |
+| 0036 | Valid Sudoku | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0036.Valid-Sudoku) | 48.7% | Medium | |
+| 0037 | Sudoku Solver | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0037.Sudoku-Solver) | 43.5% | Hard | |
+| 0038 | Count and Say | | 44.6% | Easy | |
+| 0039 | Combination Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0039.Combination-Sum) | 56.0% | Medium | |
+| 0040 | Combination Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0040.Combination-Sum-II) | 48.1% | Medium | |
+| 0041 | First Missing Positive | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0041.First-Missing-Positive) | 32.0% | Hard | |
+| 0042 | Trapping Rain Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water) | 48.8% | Hard | |
+| 0043 | Multiply Strings | | 33.9% | Medium | |
+| 0044 | Wildcard Matching | | 24.7% | Hard | |
+| 0045 | Jump Game II | | 30.5% | Hard | |
+| 0046 | Permutations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0046.Permutations) | 63.5% | Medium | |
+| 0047 | Permutations II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0047.Permutations-II) | 46.4% | Medium | |
+| 0048 | Rotate Image | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0048.Rotate-Image) | 56.6% | Medium | |
+| 0049 | Group Anagrams | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0049.Group-Anagrams) | 56.8% | Medium | |
+| 0050 | Pow(x, n) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0050.Powx-n) | 30.3% | Medium | |
+| 0051 | N-Queens | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0051.N-Queens) | 46.6% | Hard | |
+| 0052 | N-Queens II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0052.N-Queens-II) | 57.8% | Hard | |
+| 0053 | Maximum Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray) | 46.5% | Easy | |
+| 0054 | Spiral Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix) | 34.1% | Medium | |
+| 0055 | Jump Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0055.Jump-Game) | 34.6% | Medium | |
+| 0056 | Merge Intervals | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0056.Merge-Intervals) | 39.3% | Medium | |
+| 0057 | Insert Interval | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0057.Insert-Interval) | 33.5% | Hard | |
+| 0058 | Length of Last Word | | 32.6% | Easy | |
+| 0059 | Spiral Matrix II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0059.Spiral-Matrix-II) | 53.8% | Medium | |
+| 0060 | Permutation Sequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0060.Permutation-Sequence) | 38.4% | Hard | |
+| 0061 | Rotate List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0061.Rotate-List) | 30.0% | Medium | |
+| 0062 | Unique Paths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0062.Unique-Paths) | 54.1% | Medium | |
+| 0063 | Unique Paths II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0063.Unique-Paths-II) | 34.5% | Medium | |
+| 0064 | Minimum Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0064.Minimum-Path-Sum) | 54.4% | Medium | |
+| 0065 | Valid Number | | 15.3% | Hard | |
+| 0066 | Plus One | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0066.Plus-One) | 43.0% | Easy | |
+| 0067 | Add Binary | | 45.2% | Easy | |
+| 0068 | Text Justification | | 27.7% | Hard | |
+| 0069 | Sqrt(x) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0069.Sqrtx) | 33.9% | Easy | |
+| 0070 | Climbing Stairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0070.Climbing-Stairs) | 47.8% | Easy | |
+| 0071 | Simplify Path | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0071.Simplify-Path) | 32.6% | Medium | |
+| 0072 | Edit Distance | | 44.8% | Hard | |
+| 0073 | Set Matrix Zeroes | | 43.1% | Medium | |
+| 0074 | Search a 2D Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0074.Search-a-2D-Matrix) | 36.5% | Medium | |
+| 0075 | Sort Colors | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0075.Sort-Colors) | 47.3% | Medium | |
+| 0076 | Minimum Window Substring | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring) | 34.6% | Hard | |
+| 0077 | Combinations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0077.Combinations) | 54.7% | Medium | |
+| 0078 | Subsets | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets) | 61.9% | Medium | |
+| 0079 | Word Search | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0079.Word-Search) | 35.6% | Medium | |
+| 0080 | Remove Duplicates from Sorted Array II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II) | 43.9% | Medium | |
+| 0081 | Search in Rotated Sorted Array II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0081.Search-in-Rotated-Sorted-Array-II) | 33.0% | Medium | |
+| 0082 | Remove Duplicates from Sorted List II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0082.Remove-Duplicates-from-Sorted-List-II) | 36.8% | Medium | |
+| 0083 | Remove Duplicates from Sorted List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0083.Remove-Duplicates-from-Sorted-List) | 45.4% | Easy | |
+| 0084 | Largest Rectangle in Histogram | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0084.Largest-Rectangle-in-Histogram) | 35.1% | Hard | |
+| 0085 | Maximal Rectangle | | 37.7% | Hard | |
+| 0086 | Partition List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0086.Partition-List) | 41.4% | Medium | |
+| 0087 | Scramble String | | 33.7% | Hard | |
+| 0088 | Merge Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0088.Merge-Sorted-Array) | 39.4% | Easy | |
+| 0089 | Gray Code | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0089.Gray-Code) | 49.1% | Medium | |
+| 0090 | Subsets II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0090.Subsets-II) | 47.1% | Medium | |
+| 0091 | Decode Ways | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0091.Decode-Ways) | 24.6% | Medium | |
+| 0092 | Reverse Linked List II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II) | 38.8% | Medium | |
+| 0093 | Restore IP Addresses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0093.Restore-IP-Addresses) | 35.6% | Medium | |
+| 0094 | Binary Tree Inorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0094.Binary-Tree-Inorder-Traversal) | 63.3% | Medium | |
+| 0095 | Unique Binary Search Trees II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0095.Unique-Binary-Search-Trees-II) | 40.6% | Medium | |
+| 0096 | Unique Binary Search Trees | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0096.Unique-Binary-Search-Trees) | 52.9% | Medium | |
+| 0097 | Interleaving String | | 31.5% | Hard | |
+| 0098 | Validate Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0098.Validate-Binary-Search-Tree) | 27.8% | Medium | |
+| 0099 | Recover Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0099.Recover-Binary-Search-Tree) | 39.6% | Hard | |
+| 0100 | Same Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0100.Same-Tree) | 53.4% | Easy | |
+| 0101 | Symmetric Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree) | 46.8% | Easy | |
+| 0102 | Binary Tree Level Order Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0102.Binary-Tree-Level-Order-Traversal) | 54.5% | Medium | |
+| 0103 | Binary Tree Zigzag Level Order Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal) | 48.3% | Medium | |
+| 0104 | Maximum Depth of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0104.Maximum-Depth-of-Binary-Tree) | 66.0% | Easy | |
+| 0105 | Construct Binary Tree from Preorder and Inorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal) | 48.8% | Medium | |
+| 0106 | Construct Binary Tree from Inorder and Postorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal) | 47.1% | Medium | |
+| 0107 | Binary Tree Level Order Traversal II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0107.Binary-Tree-Level-Order-Traversal-II) | 53.5% | Easy | |
+| 0108 | Convert Sorted Array to Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree) | 57.9% | Easy | |
+| 0109 | Convert Sorted List to Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree) | 47.6% | Medium | |
+| 0110 | Balanced Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0110.Balanced-Binary-Tree) | 43.5% | Easy | |
+| 0111 | Minimum Depth of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree) | 37.4% | Easy | |
+| 0112 | Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0112.Path-Sum) | 41.1% | Easy | |
+| 0113 | Path Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0113.Path-Sum-II) | 46.6% | Medium | |
+| 0114 | Flatten Binary Tree to Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0114.Flatten-Binary-Tree-to-Linked-List) | 49.2% | Medium | |
+| 0115 | Distinct Subsequences | | 38.2% | Hard | |
+| 0116 | Populating Next Right Pointers in Each Node | | 45.2% | Medium | |
+| 0117 | Populating Next Right Pointers in Each Node II | | 39.1% | Medium | |
+| 0118 | Pascal's Triangle | | 52.4% | Easy | |
+| 0119 | Pascal's Triangle II | | 49.0% | Easy | |
+| 0120 | Triangle | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0120.Triangle) | 44.1% | Medium | |
+| 0121 | Best Time to Buy and Sell Stock | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock) | 50.4% | Easy | |
+| 0122 | Best Time to Buy and Sell Stock II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II) | 56.9% | Easy | |
+| 0123 | Best Time to Buy and Sell Stock III | | 37.4% | Hard | |
+| 0124 | Binary Tree Maximum Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0124.Binary-Tree-Maximum-Path-Sum) | 34.3% | Hard | |
+| 0125 | Valid Palindrome | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0125.Valid-Palindrome) | 36.7% | Easy | |
+| 0126 | Word Ladder II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II) | 22.1% | Hard | |
+| 0127 | Word Ladder | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0127.Word-Ladder) | 29.5% | Medium | |
+| 0128 | Longest Consecutive Sequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0128.Longest-Consecutive-Sequence) | 45.1% | Hard | |
+| 0129 | Sum Root to Leaf Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0129.Sum-Root-to-Leaf-Numbers) | 49.0% | Medium | |
+| 0130 | Surrounded Regions | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0130.Surrounded-Regions) | 28.1% | Medium | |
+| 0131 | Palindrome Partitioning | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0131.Palindrome-Partitioning) | 47.5% | Medium | |
+| 0132 | Palindrome Partitioning II | | 30.2% | Hard | |
+| 0133 | Clone Graph | | 34.7% | Medium | |
+| 0134 | Gas Station | | 38.5% | Medium | |
+| 0135 | Candy | | 31.6% | Hard | |
+| 0136 | Single Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0136.Single-Number) | 65.5% | Easy | |
+| 0137 | Single Number II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0137.Single-Number-II) | 52.4% | Medium | |
+| 0138 | Copy List with Random Pointer | | 36.3% | Medium | |
+| 0139 | Word Break | | 40.0% | Medium | |
+| 0140 | Word Break II | | 32.6% | Hard | |
+| 0141 | Linked List Cycle | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0141.Linked-List-Cycle) | 41.1% | Easy | |
+| 0142 | Linked List Cycle II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0142.Linked-List-Cycle-II) | 37.3% | Medium | |
+| 0143 | Reorder List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0143.Reorder-List) | 37.0% | Medium | |
+| 0144 | Binary Tree Preorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0144.Binary-Tree-Preorder-Traversal) | 55.6% | Medium | |
+| 0145 | Binary Tree Postorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0145.Binary-Tree-Postorder-Traversal) | 54.9% | Hard | |
+| 0146 | LRU Cache | | 33.1% | Medium | |
+| 0147 | Insertion Sort List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0147.Insertion-Sort-List) | 41.1% | Medium | |
+| 0148 | Sort List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0148.Sort-List) | 42.3% | Medium | |
+| 0149 | Max Points on a Line | | 16.9% | Hard | |
+| 0150 | Evaluate Reverse Polish Notation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0150.Evaluate-Reverse-Polish-Notation) | 36.3% | Medium | |
+| 0151 | Reverse Words in a String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0151.Reverse-Words-in-a-String) | 21.9% | Medium | |
+| 0152 | Maximum Product Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0152.Maximum-Product-Subarray) | 31.7% | Medium | |
+| 0153 | Find Minimum in Rotated Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array) | 45.1% | Medium | |
+| 0154 | Find Minimum in Rotated Sorted Array II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II) | 41.6% | Hard | |
+| 0155 | Min Stack | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0155.Min-Stack) | 44.4% | Easy | |
+| 0156 | Binary Tree Upside Down | | 55.0% | Medium | |
+| 0157 | Read N Characters Given Read4 | | 34.2% | Easy | |
+| 0158 | Read N Characters Given Read4 II - Call multiple times | | 33.7% | Hard | |
+| 0159 | Longest Substring with At Most Two Distinct Characters | | 49.4% | Medium | |
+| 0160 | Intersection of Two Linked Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0160.Intersection-of-Two-Linked-Lists) | 40.5% | Easy | |
+| 0161 | One Edit Distance | | 32.3% | Medium | |
+| 0162 | Find Peak Element | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0162.Find-Peak-Element) | 43.3% | Medium | |
+| 0163 | Missing Ranges | | 24.3% | Medium | |
+| 0164 | Maximum Gap | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0164.Maximum-Gap) | 35.4% | Hard | |
+| 0165 | Compare Version Numbers | | 27.4% | Medium | |
+| 0166 | Fraction to Recurring Decimal | | 21.6% | Medium | |
+| 0167 | Two Sum II - Input array is sorted | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0167.Two-Sum-II---Input-array-is-sorted) | 54.0% | Easy | |
+| 0168 | Excel Sheet Column Title | | 31.0% | Easy | |
+| 0169 | Majority Element | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0169.Majority-Element) | 58.7% | Easy | |
+| 0170 | Two Sum III - Data structure design | | 33.5% | Easy | |
+| 0171 | Excel Sheet Column Number | | 54.6% | Easy | |
+| 0172 | Factorial Trailing Zeroes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0172.Factorial-Trailing-Zeroes) | 37.8% | Easy | |
+| 0173 | Binary Search Tree Iterator | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0173.Binary-Search-Tree-Iterator) | 56.5% | Medium | |
+| 0174 | Dungeon Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0174.Dungeon-Game) | 32.3% | Hard | |
+| 0175 | Combine Two Tables | | 60.7% | Easy | |
+| 0176 | Second Highest Salary | | 31.6% | Easy | |
+| 0177 | Nth Highest Salary | | 31.3% | Medium | |
+| 0178 | Rank Scores | | 45.8% | Medium | |
+| 0179 | Largest Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0179.Largest-Number) | 28.7% | Medium | |
+| 0180 | Consecutive Numbers | | 39.7% | Medium | |
+| 0181 | Employees Earning More Than Their Managers | | 56.8% | Easy | |
+| 0182 | Duplicate Emails | | 62.0% | Easy | |
+| 0183 | Customers Who Never Order | | 53.4% | Easy | |
+| 0184 | Department Highest Salary | | 36.6% | Medium | |
+| 0185 | Department Top Three Salaries | | 34.5% | Hard | |
+| 0186 | Reverse Words in a String II | | 43.3% | Medium | |
+| 0187 | Repeated DNA Sequences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0187.Repeated-DNA-Sequences) | 38.9% | Medium | |
+| 0188 | Best Time to Buy and Sell Stock IV | | 28.0% | Hard | |
+| 0189 | Rotate Array | | 34.7% | Easy | |
+| 0190 | Reverse Bits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0190.Reverse-Bits) | 39.7% | Easy | |
+| 0191 | Number of 1 Bits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0191.Number-of-1-Bits) | 49.8% | Easy | |
+| 0192 | Word Frequency | | 25.8% | Medium | |
+| 0193 | Valid Phone Numbers | | 25.3% | Easy | |
+| 0194 | Transpose File | | 24.1% | Medium | |
+| 0195 | Tenth Line | | 33.0% | Easy | |
+| 0196 | Delete Duplicate Emails | | 41.0% | Easy | |
+| 0197 | Rising Temperature | | 38.4% | Easy | |
+| 0198 | House Robber | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0198.House-Robber) | 42.0% | Easy | |
+| 0199 | Binary Tree Right Side View | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0199.Binary-Tree-Right-Side-View) | 54.0% | Medium | |
+| 0200 | Number of Islands | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0200.Number-of-Islands) | 46.8% | Medium | |
+| 0201 | Bitwise AND of Numbers Range | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0201.Bitwise-AND-of-Numbers-Range) | 39.3% | Medium | |
+| 0202 | Happy Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0202.Happy-Number) | 50.4% | Easy | |
+| 0203 | Remove Linked List Elements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0203.Remove-Linked-List-Elements) | 38.6% | Easy | |
+| 0204 | Count Primes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0204.Count-Primes) | 31.5% | Easy | |
+| 0205 | Isomorphic Strings | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0205.Isomorphic-Strings) | 39.8% | Easy | |
+| 0206 | Reverse Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0206.Reverse-Linked-List) | 62.5% | Easy | |
+| 0207 | Course Schedule | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0207.Course-Schedule) | 43.1% | Medium | |
+| 0208 | Implement Trie (Prefix Tree) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0208.Implement-Trie-Prefix-Tree) | 49.3% | Medium | |
+| 0209 | Minimum Size Subarray Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0209.Minimum-Size-Subarray-Sum) | 38.1% | Medium | |
+| 0210 | Course Schedule II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0210.Course-Schedule-II) | 40.7% | Medium | |
+| 0211 | Add and Search Word - Data structure design | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0211.Add-and-Search-Word---Data-structure-design) | 38.1% | Medium | |
+| 0212 | Word Search II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0212.Word-Search-II) | 34.8% | Hard | |
+| 0213 | House Robber II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0213.House-Robber-II) | 36.5% | Medium | |
+| 0214 | Shortest Palindrome | | 29.8% | Hard | |
+| 0215 | Kth Largest Element in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0215.Kth-Largest-Element-in-an-Array) | 55.3% | Medium | |
+| 0216 | Combination Sum III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0216.Combination-Sum-III) | 56.5% | Medium | |
+| 0217 | Contains Duplicate | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0217.Contains-Duplicate) | 56.0% | Easy | |
+| 0218 | The Skyline Problem | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0218.The-Skyline-Problem) | 34.5% | Hard | |
+| 0219 | Contains Duplicate II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0219.Contains-Duplicate-II) | 37.7% | Easy | |
+| 0220 | Contains Duplicate III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0220.Contains-Duplicate-III) | 20.9% | Medium | |
+| 0221 | Maximal Square | | 37.7% | Medium | |
+| 0222 | Count Complete Tree Nodes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0222.Count-Complete-Tree-Nodes) | 46.7% | Medium | |
+| 0223 | Rectangle Area | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0223.Rectangle-Area) | 37.8% | Medium | |
+| 0224 | Basic Calculator | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0224.Basic-Calculator) | 36.8% | Hard | |
+| 0225 | Implement Stack using Queues | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0225.Implement-Stack-using-Queues) | 45.1% | Easy | |
+| 0226 | Invert Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0226.Invert-Binary-Tree) | 64.9% | Easy | |
+| 0227 | Basic Calculator II | | 36.9% | Medium | |
+| 0228 | Summary Ranges | | 39.5% | Medium | |
+| 0229 | Majority Element II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0229.Majority-Element-II) | 35.6% | Medium | |
+| 0230 | Kth Smallest Element in a BST | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0230.Kth-Smallest-Element-in-a-BST) | 60.2% | Medium | |
+| 0231 | Power of Two | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0231.Power-of-Two) | 43.7% | Easy | |
+| 0232 | Implement Queue using Stacks | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0232.Implement-Queue-using-Stacks) | 49.5% | Easy | |
+| 0233 | Number of Digit One | | 31.3% | Hard | |
+| 0234 | Palindrome Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0234.Palindrome-Linked-List) | 39.2% | Easy | |
+| 0235 | Lowest Common Ancestor of a Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree) | 49.9% | Easy | |
+| 0236 | Lowest Common Ancestor of a Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree) | 45.6% | Medium | |
+| 0237 | Delete Node in a Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0237.Delete-Node-in-a-Linked-List) | 63.7% | Easy | |
+| 0238 | Product of Array Except Self | | 60.1% | Medium | |
+| 0239 | Sliding Window Maximum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0239.Sliding-Window-Maximum) | 43.0% | Hard | |
+| 0240 | Search a 2D Matrix II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0240.Search-a-2D-Matrix-II) | 43.1% | Medium | |
+| 0241 | Different Ways to Add Parentheses | | 55.2% | Medium | |
+| 0242 | Valid Anagram | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram) | 56.8% | Easy | |
+| 0243 | Shortest Word Distance | | 61.0% | Easy | |
+| 0244 | Shortest Word Distance II | | 52.3% | Medium | |
+| 0245 | Shortest Word Distance III | | 55.3% | Medium | |
+| 0246 | Strobogrammatic Number | | 45.0% | Easy | |
+| 0247 | Strobogrammatic Number II | | 47.6% | Medium | |
+| 0248 | Strobogrammatic Number III | | 39.6% | Hard | |
+| 0249 | Group Shifted Strings | | 55.0% | Medium | |
+| 0250 | Count Univalue Subtrees | | 51.9% | Medium | |
+| 0251 | Flatten 2D Vector | | 45.7% | Medium | |
+| 0252 | Meeting Rooms | | 54.6% | Easy | |
+| 0253 | Meeting Rooms II | | 45.7% | Medium | |
+| 0254 | Factor Combinations | | 46.7% | Medium | |
+| 0255 | Verify Preorder Sequence in Binary Search Tree | | 45.7% | Medium | |
+| 0256 | Paint House | | 52.1% | Easy | |
+| 0257 | Binary Tree Paths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0257.Binary-Tree-Paths) | 51.4% | Easy | |
+| 0258 | Add Digits | | 57.6% | Easy | |
+| 0259 | 3Sum Smaller | | 47.6% | Medium | |
+| 0260 | Single Number III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0260.Single-Number-III) | 64.3% | Medium | |
+| 0261 | Graph Valid Tree | | 42.2% | Medium | |
+| 0262 | Trips and Users | | 32.6% | Hard | |
+| 0263 | Ugly Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0263.Ugly-Number) | 41.6% | Easy | |
+| 0264 | Ugly Number II | | 42.0% | Medium | |
+| 0265 | Paint House II | | 44.6% | Hard | |
+| 0266 | Palindrome Permutation | | 61.9% | Easy | |
+| 0267 | Palindrome Permutation II | | 36.4% | Medium | |
+| 0268 | Missing Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0268.Missing-Number) | 51.7% | Easy | |
+| 0269 | Alien Dictionary | | 33.3% | Hard | |
+| 0270 | Closest Binary Search Tree Value | | 48.1% | Easy | |
+| 0271 | Encode and Decode Strings | | 31.5% | Medium | |
+| 0272 | Closest Binary Search Tree Value II | | 50.5% | Hard | |
+| 0273 | Integer to English Words | | 27.0% | Hard | |
+| 0274 | H-Index | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0274.H-Index) | 35.9% | Medium | |
+| 0275 | H-Index II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0275.H-Index-II) | 35.9% | Medium | |
+| 0276 | Paint Fence | | 38.3% | Easy | |
+| 0277 | Find the Celebrity | | 41.8% | Medium | |
+| 0278 | First Bad Version | | 35.7% | Easy | |
+| 0279 | Perfect Squares | | 47.3% | Medium | |
+| 0280 | Wiggle Sort | | 63.8% | Medium | |
+| 0281 | Zigzag Iterator | | 58.4% | Medium | |
+| 0282 | Expression Add Operators | | 35.5% | Hard | |
+| 0283 | Move Zeroes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0283.Move-Zeroes) | 57.8% | Easy | |
+| 0284 | Peeking Iterator | | 45.6% | Medium | |
+| 0285 | Inorder Successor in BST | | 40.3% | Medium | |
+| 0286 | Walls and Gates | | 54.5% | Medium | |
+| 0287 | Find the Duplicate Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0287.Find-the-Duplicate-Number) | 55.5% | Medium | |
+| 0288 | Unique Word Abbreviation | | 21.9% | Medium | |
+| 0289 | Game of Life | | 54.4% | Medium | |
+| 0290 | Word Pattern | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0290.Word-Pattern) | 37.0% | Easy | |
+| 0291 | Word Pattern II | | 43.4% | Hard | |
+| 0292 | Nim Game | | 54.9% | Easy | |
+| 0293 | Flip Game | | 60.6% | Easy | |
+| 0294 | Flip Game II | | 50.0% | Medium | |
+| 0295 | Find Median from Data Stream | | 44.3% | Hard | |
+| 0296 | Best Meeting Point | | 57.5% | Hard | |
+| 0297 | Serialize and Deserialize Binary Tree | | 47.4% | Hard | |
+| 0298 | Binary Tree Longest Consecutive Sequence | | 47.1% | Medium | |
+| 0299 | Bulls and Cows | | 42.4% | Easy | |
+| 0300 | Longest Increasing Subsequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0300.Longest-Increasing-Subsequence) | 42.6% | Medium | |
+| 0301 | Remove Invalid Parentheses | | 43.3% | Hard | |
+| 0302 | Smallest Rectangle Enclosing Black Pixels | | 51.6% | Hard | |
+| 0303 | Range Sum Query - Immutable | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0303.Range-Sum-Query---Immutable) | 44.7% | Easy | |
+| 0304 | Range Sum Query 2D - Immutable | | 38.5% | Medium | |
+| 0305 | Number of Islands II | | 40.1% | Hard | |
+| 0306 | Additive Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0306.Additive-Number) | 29.3% | Medium | |
+| 0307 | Range Sum Query - Mutable | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0307.Range-Sum-Query---Mutable) | 34.6% | Medium | |
+| 0308 | Range Sum Query 2D - Mutable | | 35.6% | Hard | |
+| 0309 | Best Time to Buy and Sell Stock with Cooldown | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown) | 47.4% | Medium | |
+| 0310 | Minimum Height Trees | | 32.3% | Medium | |
+| 0311 | Sparse Matrix Multiplication | | 61.8% | Medium | |
+| 0312 | Burst Balloons | | 51.7% | Hard | |
+| 0313 | Super Ugly Number | | 45.0% | Medium | |
+| 0314 | Binary Tree Vertical Order Traversal | | 45.2% | Medium | |
+| 0315 | Count of Smaller Numbers After Self | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0315.Count-of-Smaller-Numbers-After-Self) | 41.5% | Hard | |
+| 0316 | Remove Duplicate Letters | | 35.8% | Hard | |
+| 0317 | Shortest Distance from All Buildings | | 41.4% | Hard | |
+| 0318 | Maximum Product of Word Lengths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0318.Maximum-Product-of-Word-Lengths) | 51.2% | Medium | |
+| 0319 | Bulb Switcher | | 45.4% | Medium | |
+| 0320 | Generalized Abbreviation | | 52.0% | Medium | |
+| 0321 | Create Maximum Number | | 27.0% | Hard | |
+| 0322 | Coin Change | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0322.Coin-Change) | 35.4% | Medium | |
+| 0323 | Number of Connected Components in an Undirected Graph | | 56.0% | Medium | |
+| 0324 | Wiggle Sort II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0324.Wiggle-Sort-II) | 29.9% | Medium | |
+| 0325 | Maximum Size Subarray Sum Equals k | | 46.8% | Medium | |
+| 0326 | Power of Three | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0326.Power-of-Three) | 42.1% | Easy | |
+| 0327 | Count of Range Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0327.Count-of-Range-Sum) | 35.1% | Hard | |
+| 0328 | Odd Even Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0328.Odd-Even-Linked-List) | 55.7% | Medium | |
+| 0329 | Longest Increasing Path in a Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0329.Longest-Increasing-Path-in-a-Matrix) | 43.4% | Hard | |
+| 0330 | Patching Array | | 34.5% | Hard | |
+| 0331 | Verify Preorder Serialization of a Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree) | 40.4% | Medium | |
+| 0332 | Reconstruct Itinerary | | 36.7% | Medium | |
+| 0333 | Largest BST Subtree | | 35.8% | Medium | |
+| 0334 | Increasing Triplet Subsequence | | 40.0% | Medium | |
+| 0335 | Self Crossing | | 28.0% | Hard | |
+| 0336 | Palindrome Pairs | | 33.7% | Hard | |
+| 0337 | House Robber III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0337.House-Robber-III) | 50.6% | Medium | |
+| 0338 | Counting Bits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0338.Counting-Bits) | 69.5% | Medium | |
+| 0339 | Nested List Weight Sum | | 73.9% | Easy | |
+| 0340 | Longest Substring with At Most K Distinct Characters | | 44.0% | Hard | |
+| 0341 | Flatten Nested List Iterator | | 52.9% | Medium | |
+| 0342 | Power of Four | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0342.Power-of-Four) | 41.7% | Easy | |
+| 0343 | Integer Break | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0343.Integer-Break) | 50.4% | Medium | |
+| 0344 | Reverse String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String) | 68.5% | Easy | |
+| 0345 | Reverse Vowels of a String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0345.Reverse-Vowels-of-a-String) | 44.2% | Easy | |
+| 0346 | Moving Average from Data Stream | | 70.9% | Easy | |
+| 0347 | Top K Frequent Elements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0347.Top-K-Frequent-Elements) | 61.2% | Medium | |
+| 0348 | Design Tic-Tac-Toe | | 54.3% | Medium | |
+| 0349 | Intersection of Two Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays) | 62.5% | Easy | |
+| 0350 | Intersection of Two Arrays II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0350.Intersection-of-Two-Arrays-II) | 51.3% | Easy | |
+| 0351 | Android Unlock Patterns | | 48.4% | Medium | |
+| 0352 | Data Stream as Disjoint Intervals | | 47.3% | Hard | |
+| 0353 | Design Snake Game | | 34.1% | Medium | |
+| 0354 | Russian Doll Envelopes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0354.Russian-Doll-Envelopes) | 35.6% | Hard | |
+| 0355 | Design Twitter | | 30.3% | Medium | |
+| 0356 | Line Reflection | | 31.8% | Medium | |
+| 0357 | Count Numbers with Unique Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0357.Count-Numbers-with-Unique-Digits) | 48.4% | Medium | |
+| 0358 | Rearrange String k Distance Apart | | 34.9% | Hard | |
+| 0359 | Logger Rate Limiter | | 70.8% | Easy | |
+| 0360 | Sort Transformed Array | | 48.8% | Medium | |
+| 0361 | Bomb Enemy | | 46.0% | Medium | |
+| 0362 | Design Hit Counter | | 63.6% | Medium | |
+| 0363 | Max Sum of Rectangle No Larger Than K | | 37.3% | Hard | |
+| 0364 | Nested List Weight Sum II | | 62.7% | Medium | |
+| 0365 | Water and Jug Problem | | 30.6% | Medium | |
+| 0366 | Find Leaves of Binary Tree | | 70.6% | Medium | |
+| 0367 | Valid Perfect Square | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0367.Valid-Perfect-Square) | 41.7% | Easy | |
+| 0368 | Largest Divisible Subset | | 38.1% | Medium | |
+| 0369 | Plus One Linked List | | 58.2% | Medium | |
+| 0370 | Range Addition | | 62.8% | Medium | |
+| 0371 | Sum of Two Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0371.Sum-of-Two-Integers) | 50.7% | Medium | |
+| 0372 | Super Pow | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0372.Super-Pow) | 36.4% | Medium | |
+| 0373 | Find K Pairs with Smallest Sums | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0373.Find-K-Pairs-with-Smallest-Sums) | 36.7% | Medium | |
+| 0374 | Guess Number Higher or Lower | | 43.0% | Easy | |
+| 0375 | Guess Number Higher or Lower II | | 40.3% | Medium | |
+| 0376 | Wiggle Subsequence | | 39.6% | Medium | |
+| 0377 | Combination Sum IV | | 45.3% | Medium | |
+| 0378 | Kth Smallest Element in a Sorted Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix) | 54.3% | Medium | |
+| 0379 | Design Phone Directory | | 46.8% | Medium | |
+| 0380 | Insert Delete GetRandom O(1) | | 47.5% | Medium | |
+| 0381 | Insert Delete GetRandom O(1) - Duplicates allowed | | 34.1% | Hard | |
+| 0382 | Linked List Random Node | | 52.1% | Medium | |
+| 0383 | Ransom Note | | 53.1% | Easy | |
+| 0384 | Shuffle an Array | | 52.8% | Medium | |
+| 0385 | Mini Parser | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0385.Mini-Parser) | 33.8% | Medium | |
+| 0386 | Lexicographical Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0386.Lexicographical-Numbers) | 51.6% | Medium | |
+| 0387 | First Unique Character in a String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0387.First-Unique-Character-in-a-String) | 53.3% | Easy | |
+| 0388 | Longest Absolute File Path | | 41.7% | Medium | |
+| 0389 | Find the Difference | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0389.Find-the-Difference) | 55.3% | Easy | |
+| 0390 | Elimination Game | | 44.5% | Medium | |
+| 0391 | Perfect Rectangle | | 30.4% | Hard | |
+| 0392 | Is Subsequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0392.Is-Subsequence) | 49.2% | Easy | |
+| 0393 | UTF-8 Validation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0393.UTF-8-Validation) | 37.5% | Medium | |
+| 0394 | Decode String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0394.Decode-String) | 49.9% | Medium | |
+| 0395 | Longest Substring with At Least K Repeating Characters | | 41.4% | Medium | |
+| 0396 | Rotate Function | | 36.3% | Medium | |
+| 0397 | Integer Replacement | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0397.Integer-Replacement) | 32.9% | Medium | |
+| 0398 | Random Pick Index | | 55.9% | Medium | |
+| 0399 | Evaluate Division | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0399.Evaluate-Division) | 51.6% | Medium | |
+| 0400 | Nth Digit | | 31.7% | Medium | |
+| 0401 | Binary Watch | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0401.Binary-Watch) | 47.5% | Easy | |
+| 0402 | Remove K Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0402.Remove-K-Digits) | 28.4% | Medium | |
+| 0403 | Frog Jump | | 39.7% | Hard | |
+| 0404 | Sum of Left Leaves | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0404.Sum-of-Left-Leaves) | 50.9% | Easy | |
+| 0405 | Convert a Number to Hexadecimal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0405.Convert-a-Number-to-Hexadecimal) | 43.9% | Easy | |
+| 0406 | Queue Reconstruction by Height | | 66.8% | Medium | |
+| 0407 | Trapping Rain Water II | | 42.4% | Hard | |
+| 0408 | Valid Word Abbreviation | | 30.6% | Easy | |
+| 0409 | Longest Palindrome | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0409.Longest-Palindrome) | 50.3% | Easy | |
+| 0410 | Split Array Largest Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0410.Split-Array-Largest-Sum) | 44.5% | Hard | |
+| 0411 | Minimum Unique Word Abbreviation | | 36.3% | Hard | |
+| 0412 | Fizz Buzz | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0412.Fizz-Buzz) | 62.3% | Easy | |
+| 0413 | Arithmetic Slices | | 57.9% | Medium | |
+| 0414 | Third Maximum Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0414.Third-Maximum-Number) | 30.5% | Easy | |
+| 0415 | Add Strings | | 47.5% | Easy | |
+| 0416 | Partition Equal Subset Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0416.Partition-Equal-Subset-Sum) | 43.7% | Medium | |
+| 0417 | Pacific Atlantic Water Flow | | 41.1% | Medium | |
+| 0418 | Sentence Screen Fitting | | 32.6% | Medium | |
+| 0419 | Battleships in a Board | | 70.0% | Medium | |
+| 0420 | Strong Password Checker | | 14.1% | Hard | |
+| 0421 | Maximum XOR of Two Numbers in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array) | 53.5% | Medium | |
+| 0422 | Valid Word Square | | 37.7% | Easy | |
+| 0423 | Reconstruct Original Digits from English | | 46.9% | Medium | |
+| 0424 | Longest Repeating Character Replacement | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement) | 47.0% | Medium | |
+| 0425 | Word Squares | | 47.6% | Hard | |
+| 0426 | Convert Binary Search Tree to Sorted Doubly Linked List | | 59.1% | Medium | |
+| 0427 | Construct Quad Tree | | 61.4% | Medium | |
+| 0428 | Serialize and Deserialize N-ary Tree | | 59.4% | Hard | |
+| 0429 | N-ary Tree Level Order Traversal | | 65.0% | Medium | |
+| 0430 | Flatten a Multilevel Doubly Linked List | | 55.1% | Medium | |
+| 0431 | Encode N-ary Tree to Binary Tree | | 70.8% | Hard | |
+| 0432 | All O`one Data Structure | | 32.4% | Hard | |
+| 0433 | Minimum Genetic Mutation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0433.Minimum-Genetic-Mutation) | 41.8% | Medium | |
+| 0434 | Number of Segments in a String | | 37.7% | Easy | |
+| 0435 | Non-overlapping Intervals | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0435.Non-overlapping-Intervals) | 42.9% | Medium | |
+| 0436 | Find Right Interval | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0436.Find-Right-Interval) | 45.4% | Medium | |
+| 0437 | Path Sum III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0437.Path-Sum-III) | 46.5% | Medium | |
+| 0438 | Find All Anagrams in a String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0438.Find-All-Anagrams-in-a-String) | 43.3% | Medium | |
+| 0439 | Ternary Expression Parser | | 55.9% | Medium | |
+| 0440 | K-th Smallest in Lexicographical Order | | 29.1% | Hard | |
+| 0441 | Arranging Coins | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0441.Arranging-Coins) | 41.8% | Easy | |
+| 0442 | Find All Duplicates in an Array | | 67.7% | Medium | |
+| 0443 | String Compression | | 41.3% | Easy | |
+| 0444 | Sequence Reconstruction | | 22.2% | Medium | |
+| 0445 | Add Two Numbers II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0445.Add-Two-Numbers-II) | 54.5% | Medium | |
+| 0446 | Arithmetic Slices II - Subsequence | | 32.7% | Hard | |
+| 0447 | Number of Boomerangs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0447.Number-of-Boomerangs) | 51.8% | Easy | |
+| 0448 | Find All Numbers Disappeared in an Array | | 55.9% | Easy | |
+| 0449 | Serialize and Deserialize BST | | 52.0% | Medium | |
+| 0450 | Delete Node in a BST | | 43.1% | Medium | |
+| 0451 | Sort Characters By Frequency | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0451.Sort-Characters-By-Frequency) | 63.0% | Medium | |
+| 0452 | Minimum Number of Arrows to Burst Balloons | | 49.6% | Medium | |
+| 0453 | Minimum Moves to Equal Array Elements | | 50.2% | Easy | |
+| 0454 | 4Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0454.4Sum-II) | 53.1% | Medium | |
+| 0455 | Assign Cookies | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0455.Assign-Cookies) | 49.9% | Easy | |
+| 0456 | 132 Pattern | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0456.132-Pattern) | 28.9% | Medium | |
+| 0457 | Circular Array Loop | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0457.Circular-Array-Loop) | 29.4% | Medium | |
+| 0458 | Poor Pigs | | 47.4% | Hard | |
+| 0459 | Repeated Substring Pattern | | 42.2% | Easy | |
+| 0460 | LFU Cache | | 34.2% | Hard | |
+| 0461 | Hamming Distance | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0461.Hamming-Distance) | 72.8% | Easy | |
+| 0462 | Minimum Moves to Equal Array Elements II | | 53.8% | Medium | |
+| 0463 | Island Perimeter | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0463.Island-Perimeter) | 65.7% | Easy | |
+| 0464 | Can I Win | | 28.8% | Medium | |
+| 0465 | Optimal Account Balancing | | 46.8% | Hard | |
+| 0466 | Count The Repetitions | | 28.2% | Hard | |
+| 0467 | Unique Substrings in Wraparound String | | 35.6% | Medium | |
+| 0468 | Validate IP Address | | 24.0% | Medium | |
+| 0469 | Convex Polygon | | 37.0% | Medium | |
+| 0470 | Implement Rand10() Using Rand7() | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0470.Implement-Rand10-Using-Rand7) | 46.3% | Medium | |
+| 0471 | Encode String with Shortest Length | | 47.1% | Hard | |
+| 0472 | Concatenated Words | | 43.6% | Hard | |
+| 0473 | Matchsticks to Square | | 37.7% | Medium | |
+| 0474 | Ones and Zeroes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0474.Ones-and-Zeroes) | 42.8% | Medium | |
+| 0475 | Heaters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0475.Heaters) | 33.1% | Easy | |
+| 0476 | Number Complement | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0476.Number-Complement) | 64.8% | Easy | |
+| 0477 | Total Hamming Distance | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0477.Total-Hamming-Distance) | 50.5% | Medium | |
+| 0478 | Generate Random Point in a Circle | | 38.5% | Medium | |
+| 0479 | Largest Palindrome Product | | 29.0% | Hard | |
+| 0480 | Sliding Window Median | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0480.Sliding-Window-Median) | 37.2% | Hard | |
+| 0481 | Magical String | | 47.5% | Medium | |
+| 0482 | License Key Formatting | | 43.1% | Easy | |
+| 0483 | Smallest Good Base | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0483.Smallest-Good-Base) | 35.7% | Hard | |
+| 0484 | Find Permutation | | 60.5% | Medium | |
+| 0485 | Max Consecutive Ones | | 54.7% | Easy | |
+| 0486 | Predict the Winner | | 47.9% | Medium | |
+| 0487 | Max Consecutive Ones II | | 48.5% | Medium | |
+| 0488 | Zuma Game | | 39.8% | Hard | |
+| 0489 | Robot Room Cleaner | | 69.7% | Hard | |
+| 0490 | The Maze | | 51.4% | Medium | |
+| 0491 | Increasing Subsequences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0491.Increasing-Subsequences) | 46.1% | Medium | |
+| 0492 | Construct the Rectangle | | 49.6% | Easy | |
+| 0493 | Reverse Pairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0493.Reverse-Pairs) | 25.2% | Hard | |
+| 0494 | Target Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0494.Target-Sum) | 46.3% | Medium | |
+| 0495 | Teemo Attacking | | 53.6% | Medium | |
+| 0496 | Next Greater Element I | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0496.Next-Greater-Element-I) | 63.8% | Easy | |
+| 0497 | Random Point in Non-overlapping Rectangles | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles) | 37.8% | Medium | |
+| 0498 | Diagonal Traverse | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0498.Diagonal-Traverse) | 48.2% | Medium | |
+| 0499 | The Maze III | | 41.0% | Hard | |
+| 0500 | Keyboard Row | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0500.Keyboard-Row) | 64.7% | Easy | |
+| 0501 | Find Mode in Binary Search Tree | | 42.3% | Easy | |
+| 0502 | IPO | | 40.4% | Hard | |
+| 0503 | Next Greater Element II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0503.Next-Greater-Element-II) | 56.5% | Medium | |
+| 0504 | Base 7 | | 46.2% | Easy | |
+| 0505 | The Maze II | | 47.7% | Medium | |
+| 0506 | Relative Ranks | | 50.5% | Easy | |
+| 0507 | Perfect Number | | 35.5% | Easy | |
+| 0508 | Most Frequent Subtree Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0508.Most-Frequent-Subtree-Sum) | 57.9% | Medium | |
+| 0509 | Fibonacci Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0509.Fibonacci-Number) | 67.2% | Easy | |
+| 0510 | Inorder Successor in BST II | | 58.0% | Medium | |
+| 0511 | Game Play Analysis I | | 80.8% | Easy | |
+| 0512 | Game Play Analysis II | | 55.5% | Easy | |
+| 0513 | Find Bottom Left Tree Value | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0513.Find-Bottom-Left-Tree-Value) | 61.5% | Medium | |
+| 0514 | Freedom Trail | | 43.0% | Hard | |
+| 0515 | Find Largest Value in Each Tree Row | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row) | 61.1% | Medium | |
+| 0516 | Longest Palindromic Subsequence | | 53.2% | Medium | |
+| 0517 | Super Washing Machines | | 38.3% | Hard | |
+| 0518 | Coin Change 2 | | 50.2% | Medium | |
+| 0519 | Random Flip Matrix | | 36.7% | Medium | |
+| 0520 | Detect Capital | | 54.4% | Easy | |
+| 0521 | Longest Uncommon Subsequence I | | 57.6% | Easy | |
+| 0522 | Longest Uncommon Subsequence II | | 34.0% | Medium | |
+| 0523 | Continuous Subarray Sum | | 24.6% | Medium | |
+| 0524 | Longest Word in Dictionary through Deleting | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting) | 48.4% | Medium | |
+| 0525 | Contiguous Array | | 42.8% | Medium | |
+| 0526 | Beautiful Arrangement | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0526.Beautiful-Arrangement) | 57.8% | Medium | |
+| 0527 | Word Abbreviation | | 54.2% | Hard | |
+| 0528 | Random Pick with Weight | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0528.Random-Pick-with-Weight) | 43.9% | Medium | |
+| 0529 | Minesweeper | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0529.Minesweeper) | 59.1% | Medium | |
+| 0530 | Minimum Absolute Difference in BST | | 53.7% | Easy | |
+| 0531 | Lonely Pixel I | | 59.0% | Medium | |
+| 0532 | K-diff Pairs in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0532.K-diff-Pairs-in-an-Array) | 31.5% | Easy | |
+| 0533 | Lonely Pixel II | | 47.9% | Medium | |
+| 0534 | Game Play Analysis III | | 75.9% | Medium | |
+| 0535 | Encode and Decode TinyURL | | 79.9% | Medium | |
+| 0536 | Construct Binary Tree from String | | 48.3% | Medium | |
+| 0537 | Complex Number Multiplication | | 67.4% | Medium | |
+| 0538 | Convert BST to Greater Tree | | 55.3% | Easy | |
+| 0539 | Minimum Time Difference | | 51.5% | Medium | |
+| 0540 | Single Element in a Sorted Array | | 57.9% | Medium | |
+| 0541 | Reverse String II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0541.Reverse-String-II) | 48.4% | Easy | |
+| 0542 | 01 Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0542.01-Matrix) | 39.8% | Medium | |
+| 0543 | Diameter of Binary Tree | | 48.4% | Easy | |
+| 0544 | Output Contest Matches | | 75.2% | Medium | |
+| 0545 | Boundary of Binary Tree | | 38.9% | Medium | |
+| 0546 | Remove Boxes | | 42.7% | Hard | |
+| 0547 | Friend Circles | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0547.Friend-Circles) | 58.5% | Medium | |
+| 0548 | Split Array with Equal Sum | | 46.4% | Medium | |
+| 0549 | Binary Tree Longest Consecutive Sequence II | | 47.0% | Medium | |
+| 0550 | Game Play Analysis IV | | 45.2% | Medium | |
+| 0551 | Student Attendance Record I | | 46.0% | Easy | |
+| 0552 | Student Attendance Record II | | 36.7% | Hard | |
+| 0553 | Optimal Division | | 56.7% | Medium | |
+| 0554 | Brick Wall | | 50.0% | Medium | |
+| 0555 | Split Concatenated Strings | | 42.2% | Medium | |
+| 0556 | Next Greater Element III | | 31.7% | Medium | |
+| 0557 | Reverse Words in a String III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0557.Reverse-Words-in-a-String-III) | 69.8% | Easy | |
+| 0558 | Logical OR of Two Binary Grids Represented as Quad-Trees | | 44.6% | Medium | |
+| 0559 | Maximum Depth of N-ary Tree | | 68.6% | Easy | |
+| 0560 | Subarray Sum Equals K | | 43.8% | Medium | |
+| 0561 | Array Partition I | | 72.0% | Easy | |
+| 0562 | Longest Line of Consecutive One in Matrix | | 45.8% | Medium | |
+| 0563 | Binary Tree Tilt | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0563.Binary-Tree-Tilt) | 48.7% | Easy | |
+| 0564 | Find the Closest Palindrome | | 19.7% | Hard | |
+| 0565 | Array Nesting | | 55.5% | Medium | |
+| 0566 | Reshape the Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0566.Reshape-the-Matrix) | 60.5% | Easy | |
+| 0567 | Permutation in String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0567.Permutation-in-String) | 44.4% | Medium | |
+| 0568 | Maximum Vacation Days | | 40.8% | Hard | |
+| 0569 | Median Employee Salary | | 57.6% | Hard | |
+| 0570 | Managers with at Least 5 Direct Reports | | 66.0% | Medium | |
+| 0571 | Find Median Given Frequency of Numbers | | 44.7% | Hard | |
+| 0572 | Subtree of Another Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0572.Subtree-of-Another-Tree) | 44.1% | Easy | |
+| 0573 | Squirrel Simulation | | 55.6% | Medium | |
+| 0574 | Winning Candidate | | 47.5% | Medium | |
+| 0575 | Distribute Candies | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0575.Distribute-Candies) | 61.4% | Easy | |
+| 0576 | Out of Boundary Paths | | 35.1% | Medium | |
+| 0577 | Employee Bonus | | 68.1% | Easy | |
+| 0578 | Get Highest Answer Rate Question | | 39.3% | Medium | |
+| 0579 | Find Cumulative Salary of an Employee | | 37.0% | Hard | |
+| 0580 | Count Student Number in Departments | | 48.7% | Medium | |
+| 0581 | Shortest Unsorted Continuous Subarray | | 31.1% | Easy | |
+| 0582 | Kill Process | | 60.8% | Medium | |
+| 0583 | Delete Operation for Two Strings | | 48.6% | Medium | |
+| 0584 | Find Customer Referee | | 72.2% | Easy | |
+| 0585 | Investments in 2016 | | 54.7% | Medium | |
+| 0586 | Customer Placing the Largest Number of Orders | | 72.9% | Easy | |
+| 0587 | Erect the Fence | | 35.9% | Hard | |
+| 0588 | Design In-Memory File System | | 45.9% | Hard | |
+| 0589 | N-ary Tree Preorder Traversal | | 72.0% | Easy | |
+| 0590 | N-ary Tree Postorder Traversal | | 72.1% | Easy | |
+| 0591 | Tag Validator | | 34.3% | Hard | |
+| 0592 | Fraction Addition and Subtraction | | 49.0% | Medium | |
+| 0593 | Valid Square | | 43.1% | Medium | |
+| 0594 | Longest Harmonious Subsequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0594.Longest-Harmonious-Subsequence) | 46.6% | Easy | |
+| 0595 | Big Countries | | 77.3% | Easy | |
+| 0596 | Classes More Than 5 Students | | 38.0% | Easy | |
+| 0597 | Friend Requests I: Overall Acceptance Rate | | 40.9% | Easy | |
+| 0598 | Range Addition II | | 49.6% | Easy | |
+| 0599 | Minimum Index Sum of Two Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0599.Minimum-Index-Sum-of-Two-Lists) | 50.7% | Easy | |
+| 0600 | Non-negative Integers without Consecutive Ones | | 34.1% | Hard | |
+| 0601 | Human Traffic of Stadium | | 41.6% | Hard | |
+| 0602 | Friend Requests II: Who Has the Most Friends | | 53.3% | Medium | |
+| 0603 | Consecutive Available Seats | | 63.9% | Easy | |
+| 0604 | Design Compressed String Iterator | | 37.5% | Easy | |
+| 0605 | Can Place Flowers | | 31.6% | Easy | |
+| 0606 | Construct String from Binary Tree | | 54.1% | Easy | |
+| 0607 | Sales Person | | 62.9% | Easy | |
+| 0608 | Tree Node | | 67.0% | Medium | |
+| 0609 | Find Duplicate File in System | | 59.5% | Medium | |
+| 0610 | Triangle Judgement | | 65.9% | Easy | |
+| 0611 | Valid Triangle Number | | 48.4% | Medium | |
+| 0612 | Shortest Distance in a Plane | | 59.5% | Medium | |
+| 0613 | Shortest Distance in a Line | | 77.5% | Easy | |
+| 0614 | Second Degree Follower | | 30.2% | Medium | |
+| 0615 | Average Salary: Departments VS Company | | 46.8% | Hard | |
+| 0616 | Add Bold Tag in String | | 43.0% | Medium | |
+| 0617 | Merge Two Binary Trees | | 74.1% | Easy | |
+| 0618 | Students Report By Geography | | 54.8% | Hard | |
+| 0619 | Biggest Single Number | | 43.1% | Easy | |
+| 0620 | Not Boring Movies | | 67.5% | Easy | |
+| 0621 | Task Scheduler | | 50.0% | Medium | |
+| 0622 | Design Circular Queue | | 43.7% | Medium | |
+| 0623 | Add One Row to Tree | | 49.7% | Medium | |
+| 0624 | Maximum Distance in Arrays | | 38.9% | Easy | |
+| 0625 | Minimum Factorization | | 32.8% | Medium | |
+| 0626 | Exchange Seats | | 62.2% | Medium | |
+| 0627 | Swap Salary | | 75.2% | Easy | |
+| 0628 | Maximum Product of Three Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers) | 47.1% | Easy | |
+| 0629 | K Inverse Pairs Array | | 31.1% | Hard | |
+| 0630 | Course Schedule III | | 33.5% | Hard | |
+| 0631 | Design Excel Sum Formula | | 31.5% | Hard | |
+| 0632 | Smallest Range Covering Elements from K Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists) | 52.4% | Hard | |
+| 0633 | Sum of Square Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0633.Sum-of-Square-Numbers) | 32.2% | Easy | |
+| 0634 | Find the Derangement of An Array | | 40.1% | Medium | |
+| 0635 | Design Log Storage System | | 58.6% | Medium | |
+| 0636 | Exclusive Time of Functions | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0636.Exclusive-Time-of-Functions) | 52.0% | Medium | |
+| 0637 | Average of Levels in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0637.Average-of-Levels-in-Binary-Tree) | 63.0% | Easy | |
+| 0638 | Shopping Offers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0638.Shopping-Offers) | 51.5% | Medium | |
+| 0639 | Decode Ways II | | 26.6% | Hard | |
+| 0640 | Solve the Equation | | 42.0% | Medium | |
+| 0641 | Design Circular Deque | | 52.7% | Medium | |
+| 0642 | Design Search Autocomplete System | | 44.6% | Hard | |
+| 0643 | Maximum Average Subarray I | | 41.5% | Easy | |
+| 0644 | Maximum Average Subarray II | | 32.0% | Hard | |
+| 0645 | Set Mismatch | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0645.Set-Mismatch) | 42.1% | Easy | |
+| 0646 | Maximum Length of Pair Chain | | 51.8% | Medium | |
+| 0647 | Palindromic Substrings | | 60.6% | Medium | |
+| 0648 | Replace Words | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0648.Replace-Words) | 56.5% | Medium | |
+| 0649 | Dota2 Senate | | 39.2% | Medium | |
+| 0650 | 2 Keys Keyboard | | 49.2% | Medium | |
+| 0651 | 4 Keys Keyboard | | 52.4% | Medium | |
+| 0652 | Find Duplicate Subtrees | | 50.1% | Medium | |
+| 0653 | Two Sum IV - Input is a BST | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0653.Two-Sum-IV---Input-is-a-BST) | 55.5% | Easy | |
+| 0654 | Maximum Binary Tree | | 79.9% | Medium | |
+| 0655 | Print Binary Tree | | 55.0% | Medium | |
+| 0656 | Coin Path | | 29.0% | Hard | |
+| 0657 | Robot Return to Origin | | 73.5% | Easy | |
+| 0658 | Find K Closest Elements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements) | 40.9% | Medium | |
+| 0659 | Split Array into Consecutive Subsequences | | 43.7% | Medium | |
+| 0660 | Remove 9 | | 53.3% | Hard | |
+| 0661 | Image Smoother | | 51.5% | Easy | |
+| 0662 | Maximum Width of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0662.Maximum-Width-of-Binary-Tree) | 41.1% | Medium | |
+| 0663 | Equal Tree Partition | | 39.5% | Medium | |
+| 0664 | Strange Printer | | 40.2% | Hard | |
+| 0665 | Non-decreasing Array | | 19.5% | Easy | |
+| 0666 | Path Sum IV | | 54.7% | Medium | |
+| 0667 | Beautiful Arrangement II | | 54.2% | Medium | |
+| 0668 | Kth Smallest Number in Multiplication Table | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table) | 45.6% | Hard | |
+| 0669 | Trim a Binary Search Tree | | 63.0% | Easy | |
+| 0670 | Maximum Swap | | 43.6% | Medium | |
+| 0671 | Second Minimum Node In a Binary Tree | | 42.7% | Easy | |
+| 0672 | Bulb Switcher II | | 50.9% | Medium | |
+| 0673 | Number of Longest Increasing Subsequence | | 35.7% | Medium | |
+| 0674 | Longest Continuous Increasing Subsequence | | 45.9% | Easy | |
+| 0675 | Cut Off Trees for Golf Event | | 34.6% | Hard | |
+| 0676 | Implement Magic Dictionary | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0676.Implement-Magic-Dictionary) | 54.5% | Medium | |
+| 0677 | Map Sum Pairs | | 53.5% | Medium | |
+| 0678 | Valid Parenthesis String | | 31.0% | Medium | |
+| 0679 | 24 Game | | 46.4% | Hard | |
+| 0680 | Valid Palindrome II | | 36.6% | Easy | |
+| 0681 | Next Closest Time | | 45.0% | Medium | |
+| 0682 | Baseball Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0682.Baseball-Game) | 63.7% | Easy | |
+| 0683 | K Empty Slots | | 35.7% | Hard | |
+| 0684 | Redundant Connection | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0684.Redundant-Connection) | 57.3% | Medium | |
+| 0685 | Redundant Connection II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0685.Redundant-Connection-II) | 32.4% | Hard | |
+| 0686 | Repeated String Match | | 32.3% | Easy | |
+| 0687 | Longest Univalue Path | | 36.2% | Easy | |
+| 0688 | Knight Probability in Chessboard | | 48.9% | Medium | |
+| 0689 | Maximum Sum of 3 Non-Overlapping Subarrays | | 46.3% | Hard | |
+| 0690 | Employee Importance | | 57.3% | Easy | |
+| 0691 | Stickers to Spell Word | | 43.0% | Hard | |
+| 0692 | Top K Frequent Words | | 51.8% | Medium | |
+| 0693 | Binary Number with Alternating Bits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0693.Binary-Number-with-Alternating-Bits) | 59.4% | Easy | |
+| 0694 | Number of Distinct Islands | | 56.0% | Medium | |
+| 0695 | Max Area of Island | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0695.Max-Area-of-Island) | 62.7% | Medium | |
+| 0696 | Count Binary Substrings | | 56.0% | Easy | |
+| 0697 | Degree of an Array | | 53.8% | Easy | |
+| 0698 | Partition to K Equal Sum Subsets | | 44.9% | Medium | |
+| 0699 | Falling Squares | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0699.Falling-Squares) | 41.8% | Hard | |
+| 0700 | Search in a Binary Search Tree | | 73.1% | Easy | |
+| 0701 | Insert into a Binary Search Tree | | 77.8% | Medium | |
+| 0702 | Search in a Sorted Array of Unknown Size | | 66.7% | Medium | |
+| 0703 | Kth Largest Element in a Stream | | 49.7% | Easy | |
+| 0704 | Binary Search | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0704.Binary-Search) | 52.1% | Easy | |
+| 0705 | Design HashSet | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0705.Design-HashSet) | 64.3% | Easy | |
+| 0706 | Design HashMap | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0706.Design-HashMap) | 61.3% | Easy | |
+| 0707 | Design Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0707.Design-Linked-List) | 24.5% | Medium | |
+| 0708 | Insert into a Sorted Circular Linked List | | 31.6% | Medium | |
+| 0709 | To Lower Case | | 79.3% | Easy | |
+| 0710 | Random Pick with Blacklist | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0710.Random-Pick-with-Blacklist) | 32.4% | Hard | |
+| 0711 | Number of Distinct Islands II | | 47.3% | Hard | |
+| 0712 | Minimum ASCII Delete Sum for Two Strings | | 58.5% | Medium | |
+| 0713 | Subarray Product Less Than K | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0713.Subarray-Product-Less-Than-K) | 39.1% | Medium | |
+| 0714 | Best Time to Buy and Sell Stock with Transaction Fee | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee) | 54.7% | Medium | |
+| 0715 | Range Module | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0715.Range-Module) | 38.5% | Hard | |
+| 0716 | Max Stack | | 42.6% | Easy | |
+| 0717 | 1-bit and 2-bit Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0717.1-bit-and-2-bit-Characters) | 48.8% | Easy | |
+| 0718 | Maximum Length of Repeated Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0718.Maximum-Length-of-Repeated-Subarray) | 49.3% | Medium | |
+| 0719 | Find K-th Smallest Pair Distance | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0719.Find-K-th-Smallest-Pair-Distance) | 31.5% | Hard | |
+| 0720 | Longest Word in Dictionary | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0720.Longest-Word-in-Dictionary) | 48.2% | Easy | |
+| 0721 | Accounts Merge | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0721.Accounts-Merge) | 48.7% | Medium | |
+| 0722 | Remove Comments | | 34.6% | Medium | |
+| 0723 | Candy Crush | | 69.3% | Medium | |
+| 0724 | Find Pivot Index | | 44.0% | Easy | |
+| 0725 | Split Linked List in Parts | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0725.Split-Linked-List-in-Parts) | 52.1% | Medium | |
+| 0726 | Number of Atoms | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0726.Number-of-Atoms) | 48.9% | Hard | |
+| 0727 | Minimum Window Subsequence | | 41.8% | Hard | |
+| 0728 | Self Dividing Numbers | | 74.3% | Easy | |
+| 0729 | My Calendar I | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0729.My-Calendar-I) | 51.8% | Medium | |
+| 0730 | Count Different Palindromic Subsequences | | 41.7% | Hard | |
+| 0731 | My Calendar II | | 49.1% | Medium | |
+| 0732 | My Calendar III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0732.My-Calendar-III) | 59.9% | Hard | |
+| 0733 | Flood Fill | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0733.Flood-Fill) | 55.3% | Easy | |
+| 0734 | Sentence Similarity | | 42.1% | Easy | |
+| 0735 | Asteroid Collision | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0735.Asteroid-Collision) | 41.1% | Medium | |
+| 0736 | Parse Lisp Expression | | 47.5% | Hard | |
+| 0737 | Sentence Similarity II | | 45.8% | Medium | |
+| 0738 | Monotone Increasing Digits | | 44.3% | Medium | |
+| 0739 | Daily Temperatures | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0739.Daily-Temperatures) | 63.3% | Medium | |
+| 0740 | Delete and Earn | | 48.6% | Medium | |
+| 0741 | Cherry Pickup | | 33.9% | Hard | |
+| 0742 | Closest Leaf in a Binary Tree | | 43.5% | Medium | |
+| 0743 | Network Delay Time | | 44.9% | Medium | |
+| 0744 | Find Smallest Letter Greater Than Target | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target) | 45.4% | Easy | |
+| 0745 | Prefix and Suffix Search | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0745.Prefix-and-Suffix-Search) | 34.1% | Hard | |
+| 0746 | Min Cost Climbing Stairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0746.Min-Cost-Climbing-Stairs) | 50.3% | Easy | |
+| 0747 | Largest Number At Least Twice of Others | | 42.0% | Easy | |
+| 0748 | Shortest Completing Word | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0748.Shortest-Completing-Word) | 56.7% | Easy | |
+| 0749 | Contain Virus | | 44.5% | Hard | |
+| 0750 | Number Of Corner Rectangles | | 66.4% | Medium | |
+| 0751 | IP to CIDR | | 61.8% | Medium | |
+| 0752 | Open the Lock | | 51.8% | Medium | |
+| 0753 | Cracking the Safe | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0753.Cracking-the-Safe) | 50.5% | Hard | |
+| 0754 | Reach a Number | | 34.7% | Medium | |
+| 0755 | Pour Water | | 43.3% | Medium | |
+| 0756 | Pyramid Transition Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0756.Pyramid-Transition-Matrix) | 54.6% | Medium | |
+| 0757 | Set Intersection Size At Least Two | | 40.1% | Hard | |
+| 0758 | Bold Words in String | | 45.9% | Easy | |
+| 0759 | Employee Free Time | | 66.2% | Hard | |
+| 0760 | Find Anagram Mappings | | 81.1% | Easy | |
+| 0761 | Special Binary String | | 54.7% | Hard | |
+| 0762 | Prime Number of Set Bits in Binary Representation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation) | 63.2% | Easy | |
+| 0763 | Partition Labels | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0763.Partition-Labels) | 76.0% | Medium | |
+| 0764 | Largest Plus Sign | | 46.0% | Medium | |
+| 0765 | Couples Holding Hands | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0765.Couples-Holding-Hands) | 54.3% | Hard | |
+| 0766 | Toeplitz Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0766.Toeplitz-Matrix) | 65.0% | Easy | |
+| 0767 | Reorganize String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0767.Reorganize-String) | 48.7% | Medium | |
+| 0768 | Max Chunks To Make Sorted II | | 48.7% | Hard | |
+| 0769 | Max Chunks To Make Sorted | | 54.7% | Medium | |
+| 0770 | Basic Calculator IV | | 47.9% | Hard | |
+| 0771 | Jewels and Stones | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0771.Jewels-and-Stones) | 86.3% | Easy | |
+| 0772 | Basic Calculator III | | 41.2% | Hard | |
+| 0773 | Sliding Puzzle | | 59.3% | Hard | |
+| 0774 | Minimize Max Distance to Gas Station | | 46.9% | Hard | |
+| 0775 | Global and Local Inversions | | 42.1% | Medium | |
+| 0776 | Split BST | | 55.8% | Medium | |
+| 0777 | Swap Adjacent in LR String | | 34.8% | Medium | |
+| 0778 | Swim in Rising Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0778.Swim-in-Rising-Water) | 53.0% | Hard | |
+| 0779 | K-th Symbol in Grammar | | 37.2% | Medium | |
+| 0780 | Reaching Points | | 29.3% | Hard | |
+| 0781 | Rabbits in Forest | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0781.Rabbits-in-Forest) | 54.5% | Medium | |
+| 0782 | Transform to Chessboard | | 42.8% | Hard | |
+| 0783 | Minimum Distance Between BST Nodes | | 52.6% | Easy | |
+| 0784 | Letter Case Permutation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0784.Letter-Case-Permutation) | 64.6% | Medium | |
+| 0785 | Is Graph Bipartite? | | 47.5% | Medium | |
+| 0786 | K-th Smallest Prime Fraction | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0786.K-th-Smallest-Prime-Fraction) | 41.0% | Hard | |
+| 0787 | Cheapest Flights Within K Stops | | 39.3% | Medium | |
+| 0788 | Rotated Digits | | 57.1% | Easy | |
+| 0789 | Escape The Ghosts | | 57.4% | Medium | |
+| 0790 | Domino and Tromino Tiling | | 39.2% | Medium | |
+| 0791 | Custom Sort String | | 65.7% | Medium | |
+| 0792 | Number of Matching Subsequences | | 47.4% | Medium | |
+| 0793 | Preimage Size of Factorial Zeroes Function | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function) | 40.2% | Hard | |
+| 0794 | Valid Tic-Tac-Toe State | | 32.6% | Medium | |
+| 0795 | Number of Subarrays with Bounded Maximum | | 46.3% | Medium | |
+| 0796 | Rotate String | | 49.6% | Easy | |
+| 0797 | All Paths From Source to Target | | 77.9% | Medium | |
+| 0798 | Smallest Rotation with Highest Score | | 44.1% | Hard | |
+| 0799 | Champagne Tower | | 35.7% | Medium | |
+| 0800 | Similar RGB Color | | 61.4% | Easy | |
+| 0801 | Minimum Swaps To Make Sequences Increasing | | 38.9% | Medium | |
+| 0802 | Find Eventual Safe States | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0802.Find-Eventual-Safe-States) | 48.9% | Medium | |
+| 0803 | Bricks Falling When Hit | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0803.Bricks-Falling-When-Hit) | 30.8% | Hard | |
+| 0804 | Unique Morse Code Words | | 77.0% | Easy | |
+| 0805 | Split Array With Same Average | | 26.3% | Hard | |
+| 0806 | Number of Lines To Write String | | 64.9% | Easy | |
+| 0807 | Max Increase to Keep City Skyline | | 83.7% | Medium | |
+| 0808 | Soup Servings | | 39.9% | Medium | |
+| 0809 | Expressive Words | | 47.0% | Medium | |
+| 0810 | Chalkboard XOR Game | | 48.2% | Hard | |
+| 0811 | Subdomain Visit Count | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0811.Subdomain-Visit-Count) | 69.8% | Easy | |
+| 0812 | Largest Triangle Area | | 58.3% | Easy | |
+| 0813 | Largest Sum of Averages | | 49.9% | Medium | |
+| 0814 | Binary Tree Pruning | | 74.5% | Medium | |
+| 0815 | Bus Routes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0815.Bus-Routes) | 42.6% | Hard | |
+| 0816 | Ambiguous Coordinates | | 47.2% | Medium | |
+| 0817 | Linked List Components | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0817.Linked-List-Components) | 57.3% | Medium | |
+| 0818 | Race Car | | 39.0% | Hard | |
+| 0819 | Most Common Word | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0819.Most-Common-Word) | 44.8% | Easy | |
+| 0820 | Short Encoding of Words | | 50.7% | Medium | |
+| 0821 | Shortest Distance to a Character | | 66.9% | Easy | |
+| 0822 | Card Flipping Game | | 42.9% | Medium | |
+| 0823 | Binary Trees With Factors | | 35.8% | Medium | |
+| 0824 | Goat Latin | | 63.3% | Easy | |
+| 0825 | Friends Of Appropriate Ages | | 42.6% | Medium | |
+| 0826 | Most Profit Assigning Work | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0826.Most-Profit-Assigning-Work) | 38.5% | Medium | |
+| 0827 | Making A Large Island | | 45.6% | Hard | |
+| 0828 | Count Unique Characters of All Substrings of a Given String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0828.COPYRIGHT-PROBLEM-XXX) | 45.1% | Hard | |
+| 0829 | Consecutive Numbers Sum | | 37.4% | Hard | |
+| 0830 | Positions of Large Groups | | 49.6% | Easy | |
+| 0831 | Masking Personal Information | | 44.1% | Medium | |
+| 0832 | Flipping an Image | | 76.2% | Easy | |
+| 0833 | Find And Replace in String | | 50.4% | Medium | |
+| 0834 | Sum of Distances in Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0834.Sum-of-Distances-in-Tree) | 43.7% | Hard | |
+| 0835 | Image Overlap | | 58.5% | Medium | |
+| 0836 | Rectangle Overlap | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0836.Rectangle-Overlap) | 48.6% | Easy | |
+| 0837 | New 21 Game | | 34.6% | Medium | |
+| 0838 | Push Dominoes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0838.Push-Dominoes) | 48.4% | Medium | |
+| 0839 | Similar String Groups | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0839.Similar-String-Groups) | 38.6% | Hard | |
+| 0840 | Magic Squares In Grid | | 37.3% | Easy | |
+| 0841 | Keys and Rooms | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0841.Keys-and-Rooms) | 64.3% | Medium | |
+| 0842 | Split Array into Fibonacci Sequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence) | 36.3% | Medium | |
+| 0843 | Guess the Word | | 46.1% | Hard | |
+| 0844 | Backspace String Compare | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0844.Backspace-String-Compare) | 46.4% | Easy | |
+| 0845 | Longest Mountain in Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0845.Longest-Mountain-in-Array) | 37.2% | Medium | |
+| 0846 | Hand of Straights | | 54.2% | Medium | |
+| 0847 | Shortest Path Visiting All Nodes | | 52.0% | Hard | |
+| 0848 | Shifting Letters | | 44.6% | Medium | |
+| 0849 | Maximize Distance to Closest Person | | 42.6% | Easy | |
+| 0850 | Rectangle Area II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0850.Rectangle-Area-II) | 47.5% | Hard | |
+| 0851 | Loud and Rich | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0851.Loud-and-Rich) | 51.6% | Medium | |
+| 0852 | Peak Index in a Mountain Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0852.Peak-Index-in-a-Mountain-Array) | 71.6% | Easy | |
+| 0853 | Car Fleet | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0853.Car-Fleet) | 42.4% | Medium | |
+| 0854 | K-Similar Strings | | 38.2% | Hard | |
+| 0855 | Exam Room | | 43.1% | Medium | |
+| 0856 | Score of Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0856.Score-of-Parentheses) | 60.5% | Medium | |
+| 0857 | Minimum Cost to Hire K Workers | | 49.6% | Hard | |
+| 0858 | Mirror Reflection | | 53.7% | Medium | |
+| 0859 | Buddy Strings | | 27.4% | Easy | |
+| 0860 | Lemonade Change | | 51.6% | Easy | |
+| 0861 | Score After Flipping Matrix | | 72.8% | Medium | |
+| 0862 | Shortest Subarray with Sum at Least K | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K) | 24.6% | Hard | |
+| 0863 | All Nodes Distance K in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree) | 55.3% | Medium | |
+| 0864 | Shortest Path to Get All Keys | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0864.Shortest-Path-to-Get-All-Keys) | 40.1% | Hard | |
+| 0865 | Smallest Subtree with all the Deepest Nodes | | 60.8% | Medium | |
+| 0866 | Prime Palindrome | | 24.9% | Medium | |
+| 0867 | Transpose Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0867.Transpose-Matrix) | 62.8% | Easy | |
+| 0868 | Binary Gap | | 60.6% | Easy | |
+| 0869 | Reordered Power of 2 | | 53.3% | Medium | |
+| 0870 | Advantage Shuffle | | 45.6% | Medium | |
+| 0871 | Minimum Number of Refueling Stops | | 31.4% | Hard | |
+| 0872 | Leaf-Similar Trees | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0872.Leaf-Similar-Trees) | 64.5% | Easy | |
+| 0873 | Length of Longest Fibonacci Subsequence | | 48.0% | Medium | |
+| 0874 | Walking Robot Simulation | | 35.3% | Easy | |
+| 0875 | Koko Eating Bananas | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0875.Koko-Eating-Bananas) | 52.1% | Medium | |
+| 0876 | Middle of the Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0876.Middle-of-the-Linked-List) | 68.4% | Easy | |
+| 0877 | Stone Game | | 64.8% | Medium | |
+| 0878 | Nth Magical Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0878.Nth-Magical-Number) | 28.4% | Hard | |
+| 0879 | Profitable Schemes | | 39.7% | Hard | |
+| 0880 | Decoded String at Index | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0880.Decoded-String-at-Index) | 24.3% | Medium | |
+| 0881 | Boats to Save People | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0881.Boats-to-Save-People) | 46.8% | Medium | |
+| 0882 | Reachable Nodes In Subdivided Graph | | 41.3% | Hard | |
+| 0883 | Projection Area of 3D Shapes | | 67.7% | Easy | |
+| 0884 | Uncommon Words from Two Sentences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0884.Uncommon-Words-from-Two-Sentences) | 63.3% | Easy | |
+| 0885 | Spiral Matrix III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0885.Spiral-Matrix-III) | 69.3% | Medium | |
+| 0886 | Possible Bipartition | | 44.1% | Medium | |
+| 0887 | Super Egg Drop | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0887.Super-Egg-Drop) | 27.0% | Hard | |
+| 0888 | Fair Candy Swap | | 58.3% | Easy | |
+| 0889 | Construct Binary Tree from Preorder and Postorder Traversal | | 66.1% | Medium | |
+| 0890 | Find and Replace Pattern | | 73.4% | Medium | |
+| 0891 | Sum of Subsequence Widths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0891.Sum-of-Subsequence-Widths) | 31.9% | Hard | |
+| 0892 | Surface Area of 3D Shapes | | 58.9% | Easy | |
+| 0893 | Groups of Special-Equivalent Strings | | 66.5% | Easy | |
+| 0894 | All Possible Full Binary Trees | | 75.2% | Medium | |
+| 0895 | Maximum Frequency Stack | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0895.Maximum-Frequency-Stack) | 60.6% | Hard | |
+| 0896 | Monotonic Array | | 57.9% | Easy | |
+| 0897 | Increasing Order Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0897.Increasing-Order-Search-Tree) | 70.7% | Easy | |
+| 0898 | Bitwise ORs of Subarrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0898.Bitwise-ORs-of-Subarrays) | 34.8% | Medium | |
+| 0899 | Orderly Queue | | 52.2% | Hard | |
+| 0900 | RLE Iterator | | 53.5% | Medium | |
+| 0901 | Online Stock Span | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0901.Online-Stock-Span) | 60.1% | Medium | |
+| 0902 | Numbers At Most N Given Digit Set | | 31.5% | Hard | |
+| 0903 | Valid Permutations for DI Sequence | | 49.6% | Hard | |
+| 0904 | Fruit Into Baskets | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0904.Fruit-Into-Baskets) | 42.5% | Medium | |
+| 0905 | Sort Array By Parity | | 74.0% | Easy | |
+| 0906 | Super Palindromes | | 32.7% | Hard | |
+| 0907 | Sum of Subarray Minimums | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0907.Sum-of-Subarray-Minimums) | 32.3% | Medium | |
+| 0908 | Smallest Range I | | 65.8% | Easy | |
+| 0909 | Snakes and Ladders | | 38.4% | Medium | |
+| 0910 | Smallest Range II | | 26.6% | Medium | |
+| 0911 | Online Election | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0911.Online-Election) | 50.4% | Medium | |
+| 0912 | Sort an Array | | 63.8% | Medium | |
+| 0913 | Cat and Mouse | | 31.3% | Hard | |
+| 0914 | X of a Kind in a Deck of Cards | | 34.9% | Easy | |
+| 0915 | Partition Array into Disjoint Intervals | | 45.3% | Medium | |
+| 0916 | Word Subsets | | 47.8% | Medium | |
+| 0917 | Reverse Only Letters | | 57.9% | Easy | |
+| 0918 | Maximum Sum Circular Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0918.Maximum-Sum-Circular-Subarray) | 33.6% | Medium | |
+| 0919 | Complete Binary Tree Inserter | | 57.3% | Medium | |
+| 0920 | Number of Music Playlists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0920.Number-of-Music-Playlists) | 46.5% | Hard | |
+| 0921 | Minimum Add to Make Parentheses Valid | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid) | 73.6% | Medium | |
+| 0922 | Sort Array By Parity II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0922.Sort-Array-By-Parity-II) | 69.2% | Easy | |
+| 0923 | 3Sum With Multiplicity | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0923.3Sum-With-Multiplicity) | 35.7% | Medium | |
+| 0924 | Minimize Malware Spread | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0924.Minimize-Malware-Spread) | 42.0% | Hard | |
+| 0925 | Long Pressed Name | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0925.Long-Pressed-Name) | 40.6% | Easy | |
+| 0926 | Flip String to Monotone Increasing | | 52.3% | Medium | |
+| 0927 | Three Equal Parts | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0927.Three-Equal-Parts) | 33.6% | Hard | |
+| 0928 | Minimize Malware Spread II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0928.Minimize-Malware-Spread-II) | 40.5% | Hard | |
+| 0929 | Unique Email Addresses | | 67.4% | Easy | |
+| 0930 | Binary Subarrays With Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0930.Binary-Subarrays-With-Sum) | 43.0% | Medium | |
+| 0931 | Minimum Falling Path Sum | | 62.4% | Medium | |
+| 0932 | Beautiful Array | | 58.3% | Medium | |
+| 0933 | Number of Recent Calls | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0933.Number-of-Recent-Calls) | 71.9% | Easy | |
+| 0934 | Shortest Bridge | | 48.1% | Medium | |
+| 0935 | Knight Dialer | | 45.1% | Medium | |
+| 0936 | Stamping The Sequence | | 42.8% | Hard | |
+| 0937 | Reorder Data in Log Files | | 54.4% | Easy | |
+| 0938 | Range Sum of BST | | 81.3% | Easy | |
+| 0939 | Minimum Area Rectangle | | 51.8% | Medium | |
+| 0940 | Distinct Subsequences II | | 41.4% | Hard | |
+| 0941 | Valid Mountain Array | | 33.3% | Easy | |
+| 0942 | DI String Match | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0942.DI-String-Match) | 72.6% | Easy | |
+| 0943 | Find the Shortest Superstring | | 42.8% | Hard | |
+| 0944 | Delete Columns to Make Sorted | | 70.3% | Easy | |
+| 0945 | Minimum Increment to Make Array Unique | | 46.3% | Medium | |
+| 0946 | Validate Stack Sequences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0946.Validate-Stack-Sequences) | 61.8% | Medium | |
+| 0947 | Most Stones Removed with Same Row or Column | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column) | 55.3% | Medium | |
+| 0948 | Bag of Tokens | | 40.8% | Medium | |
+| 0949 | Largest Time for Given Digits | | 35.9% | Easy | |
+| 0950 | Reveal Cards In Increasing Order | | 74.6% | Medium | |
+| 0951 | Flip Equivalent Binary Trees | | 65.7% | Medium | |
+| 0952 | Largest Component Size by Common Factor | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0952.Largest-Component-Size-by-Common-Factor) | 30.3% | Hard | |
+| 0953 | Verifying an Alien Dictionary | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0953.Verifying-an-Alien-Dictionary) | 54.1% | Easy | |
+| 0954 | Array of Doubled Pairs | | 35.6% | Medium | |
+| 0955 | Delete Columns to Make Sorted II | | 33.2% | Medium | |
+| 0956 | Tallest Billboard | | 39.7% | Hard | |
+| 0957 | Prison Cells After N Days | | 40.7% | Medium | |
+| 0958 | Check Completeness of a Binary Tree | | 52.0% | Medium | |
+| 0959 | Regions Cut By Slashes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0959.Regions-Cut-By-Slashes) | 66.1% | Medium | |
+| 0960 | Delete Columns to Make Sorted III | | 53.6% | Hard | |
+| 0961 | N-Repeated Element in Size 2N Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0961.N-Repeated-Element-in-Size-2N-Array) | 73.7% | Easy | |
+| 0962 | Maximum Width Ramp | | 45.3% | Medium | |
+| 0963 | Minimum Area Rectangle II | | 50.8% | Medium | |
+| 0964 | Least Operators to Express Number | | 43.7% | Hard | |
+| 0965 | Univalued Binary Tree | | 67.7% | Easy | |
+| 0966 | Vowel Spellchecker | | 47.2% | Medium | |
+| 0967 | Numbers With Same Consecutive Differences | | 39.4% | Medium | |
+| 0968 | Binary Tree Cameras | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0968.Binary-Tree-Cameras) | 37.5% | Hard | |
+| 0969 | Pancake Sorting | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0969.Pancake-Sorting) | 67.5% | Medium | |
+| 0970 | Powerful Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0970.Powerful-Integers) | 39.8% | Easy | |
+| 0971 | Flip Binary Tree To Match Preorder Traversal | | 45.6% | Medium | |
+| 0972 | Equal Rational Numbers | | 41.6% | Hard | |
+| 0973 | K Closest Points to Origin | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0973.K-Closest-Points-to-Origin) | 63.8% | Medium | |
+| 0974 | Subarray Sums Divisible by K | | 48.9% | Medium | |
+| 0975 | Odd Even Jump | | 42.3% | Hard | |
+| 0976 | Largest Perimeter Triangle | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0976.Largest-Perimeter-Triangle) | 57.6% | Easy | |
+| 0977 | Squares of a Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0977.Squares-of-a-Sorted-Array) | 72.2% | Easy | |
+| 0978 | Longest Turbulent Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0978.Longest-Turbulent-Subarray) | 46.6% | Medium | |
+| 0979 | Distribute Coins in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0979.Distribute-Coins-in-Binary-Tree) | 68.8% | Medium | |
+| 0980 | Unique Paths III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0980.Unique-Paths-III) | 73.3% | Hard | |
+| 0981 | Time Based Key-Value Store | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0981.Time-Based-Key-Value-Store) | 53.1% | Medium | |
+| 0982 | Triples with Bitwise AND Equal To Zero | | 55.5% | Hard | |
+| 0983 | Minimum Cost For Tickets | | 60.5% | Medium | |
+| 0984 | String Without AAA or BBB | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0984.String-Without-AAA-or-BBB) | 37.7% | Medium | |
+| 0985 | Sum of Even Numbers After Queries | | 61.3% | Easy | |
+| 0986 | Interval List Intersections | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0986.Interval-List-Intersections) | 67.3% | Medium | |
+| 0987 | Vertical Order Traversal of a Binary Tree | | 36.6% | Medium | |
+| 0988 | Smallest String Starting From Leaf | | 46.0% | Medium | |
+| 0989 | Add to Array-Form of Integer | | 44.2% | Easy | |
+| 0990 | Satisfiability of Equality Equations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0990.Satisfiability-of-Equality-Equations) | 44.9% | Medium | |
+| 0991 | Broken Calculator | | 45.5% | Medium | |
+| 0992 | Subarrays with K Different Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0992.Subarrays-with-K-Different-Integers) | 48.6% | Hard | |
+| 0993 | Cousins in Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0993.Cousins-in-Binary-Tree) | 52.0% | Easy | |
+| 0994 | Rotting Oranges | | 47.8% | Medium | |
+| 0995 | Minimum Number of K Consecutive Bit Flips | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips) | 46.8% | Hard | |
+| 0996 | Number of Squareful Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0996.Number-of-Squareful-Arrays) | 47.9% | Hard | |
+| 0997 | Find the Town Judge | | 50.1% | Easy | |
+| 0998 | Maximum Binary Tree II | | 62.9% | Medium | |
+| 0999 | Available Captures for Rook | | 66.7% | Easy | |
+| 1000 | Minimum Cost to Merge Stones | | 39.6% | Hard | |
+| 1001 | Grid Illumination | | 35.9% | Hard | |
+| 1002 | Find Common Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1002.Find-Common-Characters) | 67.7% | Easy | |
+| 1003 | Check If Word Is Valid After Substitutions | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions) | 55.3% | Medium | |
+| 1004 | Max Consecutive Ones III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1004.Max-Consecutive-Ones-III) | 59.1% | Medium | |
+| 1005 | Maximize Sum Of Array After K Negations | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations) | 51.3% | Easy | |
+| 1006 | Clumsy Factorial | | 53.3% | Medium | |
+| 1007 | Minimum Domino Rotations For Equal Row | | 50.0% | Medium | |
+| 1008 | Construct Binary Search Tree from Preorder Traversal | | 78.4% | Medium | |
+| 1009 | Complement of Base 10 Integer | | 59.6% | Easy | |
+| 1010 | Pairs of Songs With Total Durations Divisible by 60 | | 47.4% | Easy | |
+| 1011 | Capacity To Ship Packages Within D Days | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days) | 58.1% | Medium | |
+| 1012 | Numbers With Repeated Digits | | 37.5% | Hard | |
+| 1013 | Partition Array Into Three Parts With Equal Sum | | 51.8% | Easy | |
+| 1014 | Best Sightseeing Pair | | 52.5% | Medium | |
+| 1015 | Smallest Integer Divisible by K | | 32.1% | Medium | |
+| 1016 | Binary String With Substrings Representing 1 To N | | 58.9% | Medium | |
+| 1017 | Convert to Base -2 | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1017.Convert-to-Base--2) | 59.0% | Medium | |
+| 1018 | Binary Prefix Divisible By 5 | | 47.7% | Easy | |
+| 1019 | Next Greater Node In Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1019.Next-Greater-Node-In-Linked-List) | 57.4% | Medium | |
+| 1020 | Number of Enclaves | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1020.Number-of-Enclaves) | 57.7% | Medium | |
+| 1021 | Remove Outermost Parentheses | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1021.Remove-Outermost-Parentheses) | 77.9% | Easy | |
+| 1022 | Sum of Root To Leaf Binary Numbers | | 67.2% | Easy | |
+| 1023 | Camelcase Matching | | 57.0% | Medium | |
+| 1024 | Video Stitching | | 49.2% | Medium | |
+| 1025 | Divisor Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1025.Divisor-Game) | 66.3% | Easy | |
+| 1026 | Maximum Difference Between Node and Ancestor | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor) | 65.9% | Medium | |
+| 1027 | Longest Arithmetic Sequence | | 53.5% | Medium | |
+| 1028 | Recover a Tree From Preorder Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal) | 69.9% | Hard | |
+| 1029 | Two City Scheduling | | 56.1% | Easy | |
+| 1030 | Matrix Cells in Distance Order | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1030.Matrix-Cells-in-Distance-Order) | 65.7% | Easy | |
+| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | | 57.8% | Medium | |
+| 1032 | Stream of Characters | | 48.3% | Hard | |
+| 1033 | Moving Stones Until Consecutive | | 41.7% | Easy | |
+| 1034 | Coloring A Border | | 44.7% | Medium | |
+| 1035 | Uncrossed Lines | | 56.1% | Medium | |
+| 1036 | Escape a Large Maze | | 35.4% | Hard | |
+| 1037 | Valid Boomerang | | 37.9% | Easy | |
+| 1038 | Binary Search Tree to Greater Sum Tree | | 80.8% | Medium | |
+| 1039 | Minimum Score Triangulation of Polygon | | 49.1% | Medium | |
+| 1040 | Moving Stones Until Consecutive II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1040.Moving-Stones-Until-Consecutive-II) | 52.9% | Medium | |
+| 1041 | Robot Bounded In Circle | | 49.5% | Medium | |
+| 1042 | Flower Planting With No Adjacent | | 48.5% | Easy | |
+| 1043 | Partition Array for Maximum Sum | | 65.1% | Medium | |
+| 1044 | Longest Duplicate Substring | | 32.0% | Hard | |
+| 1045 | Customers Who Bought All Products | | 67.8% | Medium | |
+| 1046 | Last Stone Weight | | 62.2% | Easy | |
+| 1047 | Remove All Adjacent Duplicates In String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String) | 68.5% | Easy | |
+| 1048 | Longest String Chain | | 54.7% | Medium | |
+| 1049 | Last Stone Weight II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1049.Last-Stone-Weight-II) | 44.1% | Medium | |
+| 1050 | Actors and Directors Who Cooperated At Least Three Times | | 71.7% | Easy | |
+| 1051 | Height Checker | | 71.1% | Easy | |
+| 1052 | Grumpy Bookstore Owner | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1052.Grumpy-Bookstore-Owner) | 55.4% | Medium | |
+| 1053 | Previous Permutation With One Swap | | 48.5% | Medium | |
+| 1054 | Distant Barcodes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1054.Distant-Barcodes) | 43.2% | Medium | |
+| 1055 | Shortest Way to Form String | | 56.9% | Medium | |
+| 1056 | Confusing Number | | 48.7% | Easy | |
+| 1057 | Campus Bikes | | 57.7% | Medium | |
+| 1058 | Minimize Rounding Error to Meet Target | | 41.7% | Medium | |
+| 1059 | All Paths from Source Lead to Destination | | 44.7% | Medium | |
+| 1060 | Missing Element in Sorted Array | | 54.5% | Medium | |
+| 1061 | Lexicographically Smallest Equivalent String | | 65.2% | Medium | |
+| 1062 | Longest Repeating Substring | | 57.2% | Medium | |
+| 1063 | Number of Valid Subarrays | | 71.1% | Hard | |
+| 1064 | Fixed Point | | 66.5% | Easy | |
+| 1065 | Index Pairs of a String | | 60.6% | Easy | |
+| 1066 | Campus Bikes II | | 54.2% | Medium | |
+| 1067 | Digit Count in Range | | 40.0% | Hard | |
+| 1068 | Product Sales Analysis I | | 83.1% | Easy | |
+| 1069 | Product Sales Analysis II | | 82.9% | Easy | |
+| 1070 | Product Sales Analysis III | | 48.9% | Medium | |
+| 1071 | Greatest Common Divisor of Strings | | 53.0% | Easy | |
+| 1072 | Flip Columns For Maximum Number of Equal Rows | | 60.8% | Medium | |
+| 1073 | Adding Two Negabinary Numbers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1073.Adding-Two-Negabinary-Numbers) | 34.0% | Medium | |
+| 1074 | Number of Submatrices That Sum to Target | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target) | 59.3% | Hard | |
+| 1075 | Project Employees I | | 64.9% | Easy | |
+| 1076 | Project Employees II | | 53.7% | Easy | |
+| 1077 | Project Employees III | | 75.4% | Medium | |
+| 1078 | Occurrences After Bigram | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1078.Occurrences-After-Bigram) | 64.7% | Easy | |
+| 1079 | Letter Tile Possibilities | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1079.Letter-Tile-Possibilities) | 75.4% | Medium | |
+| 1080 | Insufficient Nodes in Root to Leaf Paths | | 49.3% | Medium | |
+| 1081 | Smallest Subsequence of Distinct Characters | | 50.4% | Medium | |
+| 1082 | Sales Analysis I | | 71.7% | Easy | |
+| 1083 | Sales Analysis II | | 50.6% | Easy | |
+| 1084 | Sales Analysis III | | 54.2% | Easy | |
+| 1085 | Sum of Digits in the Minimum Number | | 74.6% | Easy | |
+| 1086 | High Five | | 79.6% | Easy | |
+| 1087 | Brace Expansion | | 62.7% | Medium | |
+| 1088 | Confusing Number II | | 43.9% | Hard | |
+| 1089 | Duplicate Zeros | | 53.0% | Easy | |
+| 1090 | Largest Values From Labels | | 58.9% | Medium | |
+| 1091 | Shortest Path in Binary Matrix | | 38.2% | Medium | |
+| 1092 | Shortest Common Supersequence | | 51.6% | Hard | |
+| 1093 | Statistics from a Large Sample | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1093.Statistics-from-a-Large-Sample) | 48.2% | Medium | |
+| 1094 | Car Pooling | | 56.7% | Medium | |
+| 1095 | Find in Mountain Array | | 35.7% | Hard | |
+| 1096 | Brace Expansion II | | 62.1% | Hard | |
+| 1097 | Game Play Analysis V | | 54.4% | Hard | |
+| 1098 | Unpopular Books | | 44.4% | Medium | |
+| 1099 | Two Sum Less Than K | | 60.6% | Easy | |
+| 1100 | Find K-Length Substrings With No Repeated Characters | | 72.7% | Medium | |
+| 1101 | The Earliest Moment When Everyone Become Friends | | 66.2% | Medium | |
+| 1102 | Path With Maximum Minimum Value | | 49.2% | Medium | |
+| 1103 | Distribute Candies to People | | 60.5% | Easy | |
+| 1104 | Path In Zigzag Labelled Binary Tree | | 72.0% | Medium | |
+| 1105 | Filling Bookcase Shelves | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1105.Filling-Bookcase-Shelves) | 58.1% | Medium | |
+| 1106 | Parsing A Boolean Expression | | 58.5% | Hard | |
+| 1107 | New Users Daily Count | | 45.1% | Medium | |
+| 1108 | Defanging an IP Address | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1108.Defanging-an-IP-Address) | 87.5% | Easy | |
+| 1109 | Corporate Flight Bookings | | 52.8% | Medium | |
+| 1110 | Delete Nodes And Return Forest | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1110.Delete-Nodes-And-Return-Forest) | 67.0% | Medium | |
+| 1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings) | 70.4% | Medium | |
+| 1112 | Highest Grade For Each Student | | 69.4% | Medium | |
+| 1113 | Reported Posts | | 64.1% | Easy | |
+| 1114 | Print in Order | | 65.7% | Easy | |
+| 1115 | Print FooBar Alternately | | 58.5% | Medium | |
+| 1116 | Print Zero Even Odd | | 56.0% | Medium | |
+| 1117 | Building H2O | | 52.6% | Medium | |
+| 1118 | Number of Days in a Month | | 57.4% | Easy | |
+| 1119 | Remove Vowels from a String | | 89.9% | Easy | |
+| 1120 | Maximum Average Subtree | | 62.0% | Medium | |
+| 1121 | Divide Array Into Increasing Sequences | | 56.8% | Hard | |
+| 1122 | Relative Sort Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1122.Relative-Sort-Array) | 67.7% | Easy | |
+| 1123 | Lowest Common Ancestor of Deepest Leaves | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves) | 66.8% | Medium | |
+| 1124 | Longest Well-Performing Interval | | 32.7% | Medium | |
+| 1125 | Smallest Sufficient Team | | 46.5% | Hard | |
+| 1126 | Active Businesses | | 68.5% | Medium | |
+| 1127 | User Purchase Platform | | 48.9% | Hard | |
+| 1128 | Number of Equivalent Domino Pairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1128.Number-of-Equivalent-Domino-Pairs) | 47.3% | Easy | |
+| 1129 | Shortest Path with Alternating Colors | | 38.9% | Medium | |
+| 1130 | Minimum Cost Tree From Leaf Values | | 66.1% | Medium | |
+| 1131 | Maximum of Absolute Value Expression | | 53.1% | Medium | |
+| 1132 | Reported Posts II | | 34.4% | Medium | |
+| 1133 | Largest Unique Number | | 66.9% | Easy | |
+| 1134 | Armstrong Number | | 78.3% | Easy | |
+| 1135 | Connecting Cities With Minimum Cost | | 57.5% | Medium | |
+| 1136 | Parallel Courses | | 61.1% | Hard | |
+| 1137 | N-th Tribonacci Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1137.N-th-Tribonacci-Number) | 55.9% | Easy | |
+| 1138 | Alphabet Board Path | | 48.4% | Medium | |
+| 1139 | Largest 1-Bordered Square | | 47.5% | Medium | |
+| 1140 | Stone Game II | | 63.3% | Medium | |
+| 1141 | User Activity for the Past 30 Days I | | 54.1% | Easy | |
+| 1142 | User Activity for the Past 30 Days II | | 34.5% | Easy | |
+| 1143 | Longest Common Subsequence | | 58.4% | Medium | |
+| 1144 | Decrease Elements To Make Array Zigzag | | 45.4% | Medium | |
+| 1145 | Binary Tree Coloring Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1145.Binary-Tree-Coloring-Game) | 51.3% | Medium | |
+| 1146 | Snapshot Array | | 37.1% | Medium | |
+| 1147 | Longest Chunked Palindrome Decomposition | | 58.6% | Hard | |
+| 1148 | Article Views I | | 75.8% | Easy | |
+| 1149 | Article Views II | | 48.1% | Medium | |
+| 1150 | Check If a Number Is Majority Element in a Sorted Array | | 59.2% | Easy | |
+| 1151 | Minimum Swaps to Group All 1's Together | | 59.3% | Medium | |
+| 1152 | Analyze User Website Visit Pattern | | 43.5% | Medium | |
+| 1153 | String Transforms Into Another String | | 35.8% | Hard | |
+| 1154 | Day of the Year | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1154.Day-of-the-Year) | 49.3% | Easy | |
+| 1155 | Number of Dice Rolls With Target Sum | | 49.1% | Medium | |
+| 1156 | Swap For Longest Repeated Character Substring | | 48.9% | Medium | |
+| 1157 | Online Majority Element In Subarray | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1157.Online-Majority-Element-In-Subarray) | 38.9% | Hard | |
+| 1158 | Market Analysis I | | 61.7% | Medium | |
+| 1159 | Market Analysis II | | 52.9% | Hard | |
+| 1160 | Find Words That Can Be Formed by Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters) | 67.4% | Easy | |
+| 1161 | Maximum Level Sum of a Binary Tree | | 72.2% | Medium | |
+| 1162 | As Far from Land as Possible | | 43.4% | Medium | |
+| 1163 | Last Substring in Lexicographical Order | | 33.8% | Hard | |
+| 1164 | Product Price at a Given Date | | 65.8% | Medium | |
+| 1165 | Single-Row Keyboard | | 84.8% | Easy | |
+| 1166 | Design File System | | 56.8% | Medium | |
+| 1167 | Minimum Cost to Connect Sticks | | 62.7% | Medium | |
+| 1168 | Optimize Water Distribution in a Village | | 60.9% | Hard | |
+| 1169 | Invalid Transactions | | 31.2% | Medium | |
+| 1170 | Compare Strings by Frequency of the Smallest Character | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character) | 58.6% | Easy | |
+| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List) | 41.4% | Medium | |
+| 1172 | Dinner Plate Stacks | | 38.2% | Hard | |
+| 1173 | Immediate Food Delivery I | | 80.4% | Easy | |
+| 1174 | Immediate Food Delivery II | | 58.4% | Medium | |
+| 1175 | Prime Arrangements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1175.Prime-Arrangements) | 51.0% | Easy | |
+| 1176 | Diet Plan Performance | | 53.9% | Easy | |
+| 1177 | Can Make Palindrome from Substring | | 34.6% | Medium | |
+| 1178 | Number of Valid Words for Each Puzzle | | 37.9% | Hard | |
+| 1179 | Reformat Department Table | | 80.5% | Easy | |
+| 1180 | Count Substrings with Only One Distinct Letter | | 77.0% | Easy | |
+| 1181 | Before and After Puzzle | | 44.4% | Medium | |
+| 1182 | Shortest Distance to Target Color | | 52.8% | Medium | |
+| 1183 | Maximum Number of Ones | | 54.4% | Hard | |
+| 1184 | Distance Between Bus Stops | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1184.Distance-Between-Bus-Stops) | 54.4% | Easy | |
+| 1185 | Day of the Week | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1185.Day-of-the-Week) | 64.0% | Easy | |
+| 1186 | Maximum Subarray Sum with One Deletion | | 37.4% | Medium | |
+| 1187 | Make Array Strictly Increasing | | 41.8% | Hard | |
+| 1188 | Design Bounded Blocking Queue | | 70.5% | Medium | |
+| 1189 | Maximum Number of Balloons | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1189.Maximum-Number-of-Balloons) | 61.2% | Easy | |
+| 1190 | Reverse Substrings Between Each Pair of Parentheses | | 61.5% | Medium | |
+| 1191 | K-Concatenation Maximum Sum | | 25.9% | Medium | |
+| 1192 | Critical Connections in a Network | | 48.6% | Hard | |
+| 1193 | Monthly Transactions I | | 68.2% | Medium | |
+| 1194 | Tournament Winners | | 52.8% | Hard | |
+| 1195 | Fizz Buzz Multithreaded | | 68.3% | Medium | |
+| 1196 | How Many Apples Can You Put into the Basket | | 68.1% | Easy | |
+| 1197 | Minimum Knight Moves | | 36.1% | Medium | |
+| 1198 | Find Smallest Common Element in All Rows | | 74.9% | Medium | |
+| 1199 | Minimum Time to Build Blocks | | 37.3% | Hard | |
+| 1200 | Minimum Absolute Difference | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1200.Minimum-Absolute-Difference) | 66.6% | Easy | |
+| 1201 | Ugly Number III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1201.Ugly-Number-III) | 25.9% | Medium | |
+| 1202 | Smallest String With Swaps | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1202.Smallest-String-With-Swaps) | 46.5% | Medium | |
+| 1203 | Sort Items by Groups Respecting Dependencies | | 47.6% | Hard | |
+| 1204 | Last Person to Fit in the Elevator | | 69.7% | Medium | |
+| 1205 | Monthly Transactions II | | 45.1% | Medium | |
+| 1206 | Design Skiplist | | 57.4% | Hard | |
+| 1207 | Unique Number of Occurrences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1207.Unique-Number-of-Occurrences) | 71.6% | Easy | |
+| 1208 | Get Equal Substrings Within Budget | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1208.Get-Equal-Substrings-Within-Budget) | 41.9% | Medium | |
+| 1209 | Remove All Adjacent Duplicates in String II | | 56.8% | Medium | |
+| 1210 | Minimum Moves to Reach Target with Rotations | | 45.2% | Hard | |
+| 1211 | Queries Quality and Percentage | | 68.3% | Easy | |
+| 1212 | Team Scores in Football Tournament | | 55.7% | Medium | |
+| 1213 | Intersection of Three Sorted Arrays | | 78.9% | Easy | |
+| 1214 | Two Sum BSTs | | 67.6% | Medium | |
+| 1215 | Stepping Numbers | | 41.6% | Medium | |
+| 1216 | Valid Palindrome III | | 47.7% | Hard | |
+| 1217 | Play with Chips | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1217.Play-with-Chips) | 64.3% | Easy | |
+| 1218 | Longest Arithmetic Subsequence of Given Difference | | 44.5% | Medium | |
+| 1219 | Path with Maximum Gold | | 65.1% | Medium | |
+| 1220 | Count Vowels Permutation | | 53.9% | Hard | |
+| 1221 | Split a String in Balanced Strings | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1221.Split-a-String-in-Balanced-Strings) | 83.2% | Easy | |
+| 1222 | Queens That Can Attack the King | | 68.7% | Medium | |
+| 1223 | Dice Roll Simulation | | 45.6% | Medium | |
+| 1224 | Maximum Equal Frequency | | 33.5% | Hard | |
+| 1225 | Report Contiguous Dates | | 61.2% | Hard | |
+| 1226 | The Dining Philosophers | | 55.7% | Medium | |
+| 1227 | Airplane Seat Assignment Probability | | 61.0% | Medium | |
+| 1228 | Missing Number In Arithmetic Progression | | 52.6% | Easy | |
+| 1229 | Meeting Scheduler | | 52.6% | Medium | |
+| 1230 | Toss Strange Coins | | 48.7% | Medium | |
+| 1231 | Divide Chocolate | | 52.3% | Hard | |
+| 1232 | Check If It Is a Straight Line | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1232.Check-If-It-Is-a-Straight-Line) | 45.3% | Easy | |
+| 1233 | Remove Sub-Folders from the Filesystem | | 59.5% | Medium | |
+| 1234 | Replace the Substring for Balanced String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1234.Replace-the-Substring-for-Balanced-String) | 33.3% | Medium | |
+| 1235 | Maximum Profit in Job Scheduling | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1235.Maximum-Profit-in-Job-Scheduling) | 44.1% | Hard | |
+| 1236 | Web Crawler | | 64.3% | Medium | |
+| 1237 | Find Positive Integer Solution for a Given Equation | | 69.6% | Easy | |
+| 1238 | Circular Permutation in Binary Representation | | 64.9% | Medium | |
+| 1239 | Maximum Length of a Concatenated String with Unique Characters | | 47.8% | Medium | |
+| 1240 | Tiling a Rectangle with the Fewest Squares | | 50.1% | Hard | |
+| 1241 | Number of Comments per Post | | 67.0% | Easy | |
+| 1242 | Web Crawler Multithreaded | | 45.9% | Medium | |
+| 1243 | Array Transformation | | 51.0% | Easy | |
+| 1244 | Design A Leaderboard | | 60.7% | Medium | |
+| 1245 | Tree Diameter | | 60.0% | Medium | |
+| 1246 | Palindrome Removal | | 46.0% | Hard | |
+| 1247 | Minimum Swaps to Make Strings Equal | | 60.0% | Medium | |
+| 1248 | Count Number of Nice Subarrays | | 56.4% | Medium | |
+| 1249 | Minimum Remove to Make Valid Parentheses | | 62.5% | Medium | |
+| 1250 | Check If It Is a Good Array | | 55.7% | Hard | |
+| 1251 | Average Selling Price | | 81.4% | Easy | |
+| 1252 | Cells with Odd Values in a Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1252.Cells-with-Odd-Values-in-a-Matrix) | 78.1% | Easy | |
+| 1253 | Reconstruct a 2-Row Binary Matrix | | 40.4% | Medium | |
+| 1254 | Number of Closed Islands | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1254.Number-of-Closed-Islands) | 60.3% | Medium | |
+| 1255 | Maximum Score Words Formed by Letters | | 69.3% | Hard | |
+| 1256 | Encode Number | | 66.0% | Medium | |
+| 1257 | Smallest Common Region | | 58.8% | Medium | |
+| 1258 | Synonymous Sentences | | 64.4% | Medium | |
+| 1259 | Handshakes That Don't Cross | | 53.5% | Hard | |
+| 1260 | Shift 2D Grid | | 61.3% | Easy | |
+| 1261 | Find Elements in a Contaminated Binary Tree | | 74.3% | Medium | |
+| 1262 | Greatest Sum Divisible by Three | | 47.6% | Medium | |
+| 1263 | Minimum Moves to Move a Box to Their Target Location | | 41.4% | Hard | |
+| 1264 | Page Recommendations | | 67.5% | Medium | |
+| 1265 | Print Immutable Linked List in Reverse | | 94.6% | Medium | |
+| 1266 | Minimum Time Visiting All Points | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1266.Minimum-Time-Visiting-All-Points) | 79.6% | Easy | |
+| 1267 | Count Servers that Communicate | | 57.9% | Medium | |
+| 1268 | Search Suggestions System | | 63.3% | Medium | |
+| 1269 | Number of Ways to Stay in the Same Place After Some Steps | | 43.2% | Hard | |
+| 1270 | All People Report to the Given Manager | | 87.0% | Medium | |
+| 1271 | Hexspeak | | 54.2% | Easy | |
+| 1272 | Remove Interval | | 58.6% | Medium | |
+| 1273 | Delete Tree Nodes | | 63.5% | Medium | |
+| 1274 | Number of Ships in a Rectangle | | 66.5% | Hard | |
+| 1275 | Find Winner on a Tic Tac Toe Game | | 52.9% | Easy | |
+| 1276 | Number of Burgers with No Waste of Ingredients | | 49.6% | Medium | |
+| 1277 | Count Square Submatrices with All Ones | | 73.2% | Medium | |
+| 1278 | Palindrome Partitioning III | | 59.9% | Hard | |
+| 1279 | Traffic Light Controlled Intersection | | 74.3% | Easy | |
+| 1280 | Students and Examinations | | 72.1% | Easy | |
+| 1281 | Subtract the Product and Sum of Digits of an Integer | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer) | 85.2% | Easy | |
+| 1282 | Group the People Given the Group Size They Belong To | | 83.9% | Medium | |
+| 1283 | Find the Smallest Divisor Given a Threshold | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold) | 47.6% | Medium | |
+| 1284 | Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | | 69.5% | Hard | |
+| 1285 | Find the Start and End Number of Continuous Ranges | | 83.7% | Medium | |
+| 1286 | Iterator for Combination | | 68.1% | Medium | |
+| 1287 | Element Appearing More Than 25% In Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array) | 60.2% | Easy | |
+| 1288 | Remove Covered Intervals | | 58.0% | Medium | |
+| 1289 | Minimum Falling Path Sum II | | 61.0% | Hard | |
+| 1290 | Convert Binary Number in a Linked List to Integer | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer) | 80.2% | Easy | |
+| 1291 | Sequential Digits | | 53.4% | Medium | |
+| 1292 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold | | 48.5% | Medium | |
+| 1293 | Shortest Path in a Grid with Obstacles Elimination | | 42.7% | Hard | |
+| 1294 | Weather Type in Each Country | | 63.1% | Easy | |
+| 1295 | Find Numbers with Even Number of Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1295.Find-Numbers-with-Even-Number-of-Digits) | 81.6% | Easy | |
+| 1296 | Divide Array in Sets of K Consecutive Numbers | | 53.7% | Medium | |
+| 1297 | Maximum Number of Occurrences of a Substring | | 47.3% | Medium | |
+| 1298 | Maximum Candies You Can Get from Boxes | | 58.9% | Hard | |
+| 1299 | Replace Elements with Greatest Element on Right Side | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side) | 75.4% | Easy | |
+| 1300 | Sum of Mutated Array Closest to Target | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target) | 44.2% | Medium | |
+| 1301 | Number of Paths with Max Score | | 37.2% | Hard | |
+| 1302 | Deepest Leaves Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1302.Deepest-Leaves-Sum) | 83.6% | Medium | |
+| 1303 | Find the Team Size | | 87.8% | Easy | |
+| 1304 | Find N Unique Integers Sum up to Zero | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero) | 76.3% | Easy | |
+| 1305 | All Elements in Two Binary Search Trees | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees) | 76.1% | Medium | |
+| 1306 | Jump Game III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1306.Jump-Game-III) | 60.5% | Medium | |
+| 1307 | Verbal Arithmetic Puzzle | | 37.6% | Hard | |
+| 1308 | Running Total for Different Genders | | 84.0% | Medium | |
+| 1309 | Decrypt String from Alphabet to Integer Mapping | | 76.7% | Easy | |
+| 1310 | XOR Queries of a Subarray | | 68.6% | Medium | |
+| 1311 | Get Watched Videos by Your Friends | | 43.1% | Medium | |
+| 1312 | Minimum Insertion Steps to Make a String Palindrome | | 58.1% | Hard | |
+| 1313 | Decompress Run-Length Encoded List | | 85.1% | Easy | |
+| 1314 | Matrix Block Sum | | 73.7% | Medium | |
+| 1315 | Sum of Nodes with Even-Valued Grandparent | | 83.5% | Medium | |
+| 1316 | Distinct Echo Substrings | | 46.4% | Hard | |
+| 1317 | Convert Integer to the Sum of Two No-Zero Integers | | 56.7% | Easy | |
+| 1318 | Minimum Flips to Make a OR b Equal to c | | 62.8% | Medium | |
+| 1319 | Number of Operations to Make Network Connected | | 53.1% | Medium | |
+| 1320 | Minimum Distance to Type a Word Using Two Fingers | | 62.3% | Hard | |
+| 1321 | Restaurant Growth | | 67.7% | Medium | |
+| 1322 | Ads Performance | | 57.8% | Easy | |
+| 1323 | Maximum 69 Number | | 77.9% | Easy | |
+| 1324 | Print Words Vertically | | 58.0% | Medium | |
+| 1325 | Delete Leaves With a Given Value | | 72.9% | Medium | |
+| 1326 | Minimum Number of Taps to Open to Water a Garden | | 43.5% | Hard | |
+| 1327 | List the Products Ordered in a Period | | 76.3% | Easy | |
+| 1328 | Break a Palindrome | | 43.3% | Medium | |
+| 1329 | Sort the Matrix Diagonally | | 78.4% | Medium | |
+| 1330 | Reverse Subarray To Maximize Array Value | | 35.1% | Hard | |
+| 1331 | Rank Transform of an Array | | 58.1% | Easy | |
+| 1332 | Remove Palindromic Subsequences | | 60.0% | Easy | |
+| 1333 | Filter Restaurants by Vegan-Friendly, Price and Distance | | 54.6% | Medium | |
+| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | | 44.5% | Medium | |
+| 1335 | Minimum Difficulty of a Job Schedule | | 57.5% | Hard | |
+| 1336 | Number of Transactions per Visit | | 43.5% | Hard | |
+| 1337 | The K Weakest Rows in a Matrix | | 68.7% | Easy | |
+| 1338 | Reduce Array Size to The Half | | 66.6% | Medium | |
+| 1339 | Maximum Product of Splitted Binary Tree | | 37.2% | Medium | |
+| 1340 | Jump Game V | | 57.5% | Hard | |
+| 1341 | Movie Rating | | 56.6% | Medium | |
+| 1342 | Number of Steps to Reduce a Number to Zero | | 86.3% | Easy | |
+| 1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | | 64.2% | Medium | |
+| 1344 | Angle Between Hands of a Clock | | 61.4% | Medium | |
+| 1345 | Jump Game IV | | 38.1% | Hard | |
+| 1346 | Check If N and Its Double Exist | | 38.0% | Easy | |
+| 1347 | Minimum Number of Steps to Make Two Strings Anagram | | 74.6% | Medium | |
+| 1348 | Tweet Counts Per Frequency | | 29.0% | Medium | |
+| 1349 | Maximum Students Taking Exam | | 41.9% | Hard | |
+| 1350 | Students With Invalid Departments | | 89.4% | Easy | |
+| 1351 | Count Negative Numbers in a Sorted Matrix | | 76.6% | Easy | |
+| 1352 | Product of the Last K Numbers | | 43.6% | Medium | |
+| 1353 | Maximum Number of Events That Can Be Attended | | 30.5% | Medium | |
+| 1354 | Construct Target Array With Multiple Sums | | 31.9% | Hard | |
+| 1355 | Activity Participants | | 69.2% | Medium | |
+| 1356 | Sort Integers by The Number of 1 Bits | | 68.6% | Easy | |
+| 1357 | Apply Discount Every n Orders | | 66.0% | Medium | |
+| 1358 | Number of Substrings Containing All Three Characters | | 58.0% | Medium | |
+| 1359 | Count All Valid Pickup and Delivery Options | | 57.9% | Hard | |
+| 1360 | Number of Days Between Two Dates | | 48.8% | Easy | |
+| 1361 | Validate Binary Tree Nodes | | 48.6% | Medium | |
+| 1362 | Closest Divisors | | 56.7% | Medium | |
+| 1363 | Largest Multiple of Three | | 33.5% | Hard | |
+| 1364 | Number of Trusted Contacts of a Customer | | 75.3% | Medium | |
+| 1365 | How Many Numbers Are Smaller Than the Current Number | | 85.6% | Easy | |
+| 1366 | Rank Teams by Votes | | 52.4% | Medium | |
+| 1367 | Linked List in Binary Tree | | 39.7% | Medium | |
+| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | | 54.4% | Hard | |
+| 1369 | Get the Second Most Recent Activity | | 64.7% | Hard | |
+| 1370 | Increasing Decreasing String | | 75.6% | Easy | |
+| 1371 | Find the Longest Substring Containing Vowels in Even Counts | | 57.3% | Medium | |
+| 1372 | Longest ZigZag Path in a Binary Tree | | 54.0% | Medium | |
+| 1373 | Maximum Sum BST in Binary Tree | | 40.2% | Hard | |
+| 1374 | Generate a String With Characters That Have Odd Counts | | 75.4% | Easy | |
+| 1375 | Bulb Switcher III | | 62.5% | Medium | |
+| 1376 | Time Needed to Inform All Employees | | 55.5% | Medium | |
+| 1377 | Frog Position After T Seconds | | 33.6% | Hard | |
+| 1378 | Replace Employee ID With The Unique Identifier | | 87.4% | Easy | |
+| 1379 | Find a Corresponding Node of a Binary Tree in a Clone of That Tree | | 83.8% | Medium | |
+| 1380 | Lucky Numbers in a Matrix | | 71.4% | Easy | |
+| 1381 | Design a Stack With Increment Operation | | 74.7% | Medium | |
+| 1382 | Balance a Binary Search Tree | | 74.8% | Medium | |
+| 1383 | Maximum Performance of a Team | | 31.8% | Hard | |
+| 1384 | Total Sales Amount by Year | | 62.8% | Hard | |
+| 1385 | Find the Distance Value Between Two Arrays | | 67.1% | Easy | |
+| 1386 | Cinema Seat Allocation | | 34.8% | Medium | |
+| 1387 | Sort Integers by The Power Value | | 70.1% | Medium | |
+| 1388 | Pizza With 3n Slices | | 44.7% | Hard | |
+| 1389 | Create Target Array in the Given Order | | 84.1% | Easy | |
+| 1390 | Four Divisors | | 38.1% | Medium | |
+| 1391 | Check if There is a Valid Path in a Grid | | 44.5% | Medium | |
+| 1392 | Longest Happy Prefix | | 40.0% | Hard | |
+| 1393 | Capital Gain/Loss | | 89.2% | Medium | |
+| 1394 | Find Lucky Integer in an Array | | 64.5% | Easy | |
+| 1395 | Count Number of Teams | | 81.9% | Medium | |
+| 1396 | Design Underground System | | 64.7% | Medium | |
+| 1397 | Find All Good Strings | | 37.2% | Hard | |
+| 1398 | Customers Who Bought Products A and B but Not C | | 80.6% | Medium | |
+| 1399 | Count Largest Group | | 65.0% | Easy | |
+| 1400 | Construct K Palindrome Strings | | 60.4% | Medium | |
+| 1401 | Circle and Rectangle Overlapping | | 41.8% | Medium | |
+| 1402 | Reducing Dishes | | 72.8% | Hard | |
+| 1403 | Minimum Subsequence in Non-Increasing Order | | 70.8% | Easy | |
+| 1404 | Number of Steps to Reduce a Number in Binary Representation to One | | 50.3% | Medium | |
+| 1405 | Longest Happy String | | 49.0% | Medium | |
+| 1406 | Stone Game III | | 56.0% | Hard | |
+| 1407 | Top Travellers | | 82.1% | Easy | |
+| 1408 | String Matching in an Array | | 61.4% | Easy | |
+| 1409 | Queries on a Permutation With Key | | 81.6% | Medium | |
+| 1410 | HTML Entity Parser | | 53.9% | Medium | |
+| 1411 | Number of Ways to Paint N × 3 Grid | | 61.2% | Hard | |
+| 1412 | Find the Quiet Students in All Exams | | 66.6% | Hard | |
+| 1413 | Minimum Value to Get Positive Step by Step Sum | | 65.2% | Easy | |
+| 1414 | Find the Minimum Number of Fibonacci Numbers Whose Sum Is K | | 62.4% | Medium | |
+| 1415 | The k-th Lexicographical String of All Happy Strings of Length n | | 70.4% | Medium | |
+| 1416 | Restore The Array | | 36.7% | Hard | |
+| 1417 | Reformat The String | | 55.0% | Easy | |
+| 1418 | Display Table of Food Orders in a Restaurant | | 65.6% | Medium | |
+| 1419 | Minimum Number of Frogs Croaking | | 46.3% | Medium | |
+| 1420 | Build Array Where You Can Find The Maximum Exactly K Comparisons | | 65.2% | Hard | |
+| 1421 | NPV Queries | | 80.5% | Medium | |
+| 1422 | Maximum Score After Splitting a String | | 54.7% | Easy | |
+| 1423 | Maximum Points You Can Obtain from Cards | | 42.5% | Medium | |
+| 1424 | Diagonal Traverse II | | 42.3% | Medium | |
+| 1425 | Constrained Subsequence Sum | | 44.1% | Hard | |
+| 1426 | Counting Elements | | 58.7% | Easy | |
+| 1427 | Perform String Shifts | | 53.0% | Easy | |
+| 1428 | Leftmost Column with at Least a One | | 46.8% | Medium | |
+| 1429 | First Unique Number | | 47.0% | Medium | |
+| 1430 | Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree | | 44.8% | Medium | |
+| 1431 | Kids With the Greatest Number of Candies | | 88.9% | Easy | |
+| 1432 | Max Difference You Can Get From Changing an Integer | | 42.8% | Medium | |
+| 1433 | Check If a String Can Break Another String | | 65.7% | Medium | |
+| 1434 | Number of Ways to Wear Different Hats to Each Other | | 38.0% | Hard | |
+| 1435 | Create a Session Bar Chart | | 76.7% | Easy | |
+| 1436 | Destination City | | 77.3% | Easy | |
+| 1437 | Check If All 1's Are at Least Length K Places Away | | 63.3% | Medium | |
+| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | | 41.9% | Medium | |
+| 1439 | Find the Kth Smallest Sum of a Matrix With Sorted Rows | | 59.4% | Hard | |
+| 1440 | Evaluate Boolean Expression | | 70.1% | Medium | |
+| 1441 | Build an Array With Stack Operations | | 68.8% | Easy | |
+| 1442 | Count Triplets That Can Form Two Arrays of Equal XOR | | 69.4% | Medium | |
+| 1443 | Minimum Time to Collect All Apples in a Tree | | 55.5% | Medium | |
+| 1444 | Number of Ways of Cutting a Pizza | | 52.7% | Hard | |
+| 1445 | Apples & Oranges | | 87.2% | Medium | |
+| 1446 | Consecutive Characters | | 60.4% | Easy | |
+| 1447 | Simplified Fractions | | 61.0% | Medium | |
+| 1448 | Count Good Nodes in Binary Tree | | 70.6% | Medium | |
+| 1449 | Form Largest Integer With Digits That Add up to Target | | 41.8% | Hard | |
+| 1450 | Number of Students Doing Homework at a Given Time | | 78.1% | Easy | |
+| 1451 | Rearrange Words in a Sentence | | 54.8% | Medium | |
+| 1452 | People Whose List of Favorite Companies Is Not a Subset of Another List | | 53.3% | Medium | |
+| 1453 | Maximum Number of Darts Inside of a Circular Dartboard | | 33.7% | Hard | |
+| 1454 | Active Users | | 37.5% | Medium | |
+| 1455 | Check If a Word Occurs As a Prefix of Any Word in a Sentence | | 64.7% | Easy | |
+| 1456 | Maximum Number of Vowels in a Substring of Given Length | | 52.4% | Medium | |
+| 1457 | Pseudo-Palindromic Paths in a Binary Tree | | 67.2% | Medium | |
+| 1458 | Max Dot Product of Two Subsequences | | 41.7% | Hard | |
+| 1459 | Rectangles Area | | 61.5% | Medium | |
+| 1460 | Make Two Arrays Equal by Reversing Sub-arrays | | 74.0% | Easy | |
+| 1461 | Check If a String Contains All Binary Codes of Size K | | 44.6% | Medium | |
+| 1462 | Course Schedule IV | | 41.7% | Medium | |
+| 1463 | Cherry Pickup II | | 65.5% | Hard | |
+| 1464 | Maximum Product of Two Elements in an Array | | 78.1% | Easy | |
+| 1465 | Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | | 30.8% | Medium | |
+| 1466 | Reorder Routes to Make All Paths Lead to the City Zero | | 63.6% | Medium | |
+| 1467 | Probability of a Two Boxes Having The Same Number of Distinct Balls | | 61.1% | Hard | |
+| 1468 | Calculate Salaries | | 78.0% | Medium | |
+| 1469 | Find All The Lonely Nodes | | 81.5% | Easy | |
+| 1470 | Shuffle the Array | | 89.0% | Easy | |
+| 1471 | The k Strongest Values in an Array | | 57.0% | Medium | |
+| 1472 | Design Browser History | | 64.5% | Medium | |
+| 1473 | Paint House III | | 48.1% | Hard | |
+| 1474 | Delete N Nodes After M Nodes of a Linked List | | 74.2% | Easy | |
+| 1475 | Final Prices With a Special Discount in a Shop | | 75.7% | Easy | |
+| 1476 | Subrectangle Queries | | 90.5% | Medium | |
+| 1477 | Find Two Non-overlapping Sub-arrays Each With Target Sum | | 29.8% | Medium | |
+| 1478 | Allocate Mailboxes | | 55.0% | Hard | |
+| 1479 | Sales by Day of the Week | | 83.4% | Hard | |
+| 1480 | Running Sum of 1d Array | | 90.6% | Easy | |
+| 1481 | Least Number of Unique Integers after K Removals | | 53.7% | Medium | |
+| 1482 | Minimum Number of Days to Make m Bouquets | | 45.7% | Medium | |
+| 1483 | Kth Ancestor of a Tree Node | | 27.6% | Hard | |
+| 1484 | Group Sold Products By The Date | | 86.0% | Easy | |
+| 1485 | Clone Binary Tree With Random Pointer | | 81.4% | Medium | |
+| 1486 | XOR Operation in an Array | | 85.1% | Easy | |
+| 1487 | Making File Names Unique | | 29.2% | Medium | |
+| 1488 | Avoid Flood in The City | | 25.3% | Medium | |
+| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | | 50.5% | Hard | |
+| 1490 | Clone N-ary Tree | | 84.7% | Medium | |
+| 1491 | Average Salary Excluding the Minimum and Maximum Salary | | 70.2% | Easy | |
+| 1492 | The kth Factor of n | | 68.0% | Medium | |
+| 1493 | Longest Subarray of 1's After Deleting One Element | | 58.4% | Medium | |
+| 1494 | Parallel Courses II | | 32.2% | Hard | |
+| 1495 | Friendly Movies Streamed Last Month | | 52.9% | Easy | |
+| 1496 | Path Crossing | | 55.9% | Easy | |
+| 1497 | Check If Array Pairs Are Divisible by k | | 41.2% | Medium | |
+| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | | 36.7% | Medium | |
+| 1499 | Max Value of Equation | | 44.6% | Hard | |
+| 1500 | Design a File Sharing System | | 46.4% | Medium | |
+| 1501 | Countries You Can Safely Invest In | | 63.8% | Medium | |
+| 1502 | Can Make Arithmetic Progression From Sequence | | 73.4% | Easy | |
+| 1503 | Last Moment Before All Ants Fall Out of a Plank | | 51.5% | Medium | |
+| 1504 | Count Submatrices With All Ones | | 61.6% | Medium | |
+| 1505 | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | | 36.1% | Hard | |
+| 1506 | Find Root of N-Ary Tree | | 79.8% | Medium | |
+| 1507 | Reformat Date | | 60.5% | Easy | |
+| 1508 | Range Sum of Sorted Subarray Sums | | 68.6% | Medium | |
+| 1509 | Minimum Difference Between Largest and Smallest Value in Three Moves | | 50.9% | Medium | |
+| 1510 | Stone Game IV | | 50.2% | Hard | |
+| 1511 | Customer Order Frequency | | 77.0% | Easy | |
+| 1512 | Number of Good Pairs | | 88.7% | Easy | |
+| 1513 | Number of Substrings With Only 1s | | 40.4% | Medium | |
+| 1514 | Path with Maximum Probability | | 36.5% | Medium | |
+| 1515 | Best Position for a Service Centre | | 35.8% | Hard | |
+| 1516 | Move Sub-Tree of N-Ary Tree | | 60.2% | Hard | |
+| 1517 | Find Users With Valid E-Mails | | 71.2% | Easy | |
+| 1518 | Water Bottles | | 63.1% | Easy | |
+| 1519 | Number of Nodes in the Sub-Tree With the Same Label | | 35.1% | Medium | |
+| 1520 | Maximum Number of Non-Overlapping Substrings | | 32.7% | Hard | |
+| 1521 | Find a Value of a Mysterious Function Closest to Target | | 43.3% | Hard | |
+| 1522 | Diameter of N-Ary Tree | | 70.0% | Medium | |
+| 1523 | Count Odd Numbers in an Interval Range | | 55.7% | Easy | |
+| 1524 | Number of Sub-arrays With Odd Sum | | 36.3% | Medium | |
+| 1525 | Number of Good Ways to Split a String | | 70.0% | Medium | |
+| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | | 57.5% | Hard | |
+| 1527 | Patients With a Condition | | 88.4% | Easy | |
+| 1528 | Shuffle String | | 86.1% | Easy | |
+| 1529 | Bulb Switcher IV | | 70.4% | Medium | |
+| 1530 | Number of Good Leaf Nodes Pairs | | 53.4% | Medium | |
+| 1531 | String Compression II | | 28.6% | Hard | |
+| 1532 | The Most Recent Three Orders | | 75.1% | Medium | |
+| 1533 | Find the Index of the Large Integer | | 57.7% | Medium | |
+| 1534 | Count Good Triplets | | 79.4% | Easy | |
+| 1535 | Find the Winner of an Array Game | | 45.5% | Medium | |
+| 1536 | Minimum Swaps to Arrange a Binary Grid | | 41.5% | Medium | |
+| 1537 | Get the Maximum Score | | 35.7% | Hard | |
+| 1538 | Guess the Majority in a Hidden Array | | 56.9% | Medium | |
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|
@@ -1770,7 +2098,7 @@ func updateMatrix_BFS(matrix [][]int) [][]int {
|-----------------------------------------------------------------|-------------|-------------| --------------------------| --------------------------|-------------|
-## Depth-first Search
+## Depth First Search
| Title | Solution | Difficulty | Time | Space |收藏|
@@ -1805,7 +2133,7 @@ func updateMatrix_BFS(matrix [][]int) [][]int {
-## Breadth-first Search
+## Breadth First Search
| Title | Solution | Difficulty | Time | Space |收藏|
diff --git a/leetcode/0004.Median-of-Two-Sorted-Arrays/README.md b/leetcode/0004.Median-of-Two-Sorted-Arrays/README.md
index 43f84e64..c6537dbc 100755
--- a/leetcode/0004.Median-of-Two-Sorted-Arrays/README.md
+++ b/leetcode/0004.Median-of-Two-Sorted-Arrays/README.md
@@ -1,7 +1,7 @@
# [4. Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)
-## 题目:
+## 题目
There are two sorted arrays **nums1** and **nums2** of size m and n respectively.
diff --git a/leetcode/0007.Reverse-Integer/README.md b/leetcode/0007.Reverse-Integer/README.md
index 8f89a895..84504f04 100755
--- a/leetcode/0007.Reverse-Integer/README.md
+++ b/leetcode/0007.Reverse-Integer/README.md
@@ -1,7 +1,7 @@
# [7. Reverse Integer](https://leetcode.com/problems/reverse-integer/)
-## 题目:
+## 题目
Given a 32-bit signed integer, reverse digits of an integer.
diff --git a/leetcode/0017.Letter-Combinations-of-a-Phone-Number/README.md b/leetcode/0017.Letter-Combinations-of-a-Phone-Number/README.md
index f60b400a..46f759a8 100755
--- a/leetcode/0017.Letter-Combinations-of-a-Phone-Number/README.md
+++ b/leetcode/0017.Letter-Combinations-of-a-Phone-Number/README.md
@@ -1,7 +1,7 @@
# [17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)
-## 题目:
+## 题目
Given a string containing digits from `2-9` inclusive, return all possible letter combinations that the number could represent.
diff --git a/leetcode/0029.Divide-Two-Integers/README.md b/leetcode/0029.Divide-Two-Integers/README.md
index 5fee84b1..761e4125 100755
--- a/leetcode/0029.Divide-Two-Integers/README.md
+++ b/leetcode/0029.Divide-Two-Integers/README.md
@@ -1,7 +1,7 @@
# [29. Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)
-## 题目:
+## 题目
Given two integers `dividend` and `divisor`, divide two integers without using multiplication, division and mod operator.
diff --git a/leetcode/0033.Search-in-Rotated-Sorted-Array/README.md b/leetcode/0033.Search-in-Rotated-Sorted-Array/README.md
index 6f69b743..d7b7284e 100755
--- a/leetcode/0033.Search-in-Rotated-Sorted-Array/README.md
+++ b/leetcode/0033.Search-in-Rotated-Sorted-Array/README.md
@@ -1,6 +1,6 @@
# [33. Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)
-## 题目:
+## 题目
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
diff --git a/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/README.md b/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/README.md
index 831b0756..cdd5e99e 100755
--- a/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/README.md
+++ b/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/README.md
@@ -1,7 +1,7 @@
# [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/)
-## 题目:
+## 题目
Given an array of integers `nums` sorted in ascending order, find the starting and ending position of a given `target` value.
diff --git a/leetcode/0035.Search-Insert-Position/README.md b/leetcode/0035.Search-Insert-Position/README.md
index cc592b66..9b8f67c8 100755
--- a/leetcode/0035.Search-Insert-Position/README.md
+++ b/leetcode/0035.Search-Insert-Position/README.md
@@ -1,7 +1,7 @@
# [35. Search Insert Position](https://leetcode.com/problems/search-insert-position/)
-## 题目:
+## 题目
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
diff --git a/leetcode/0036.Valid-Sudoku/README.md b/leetcode/0036.Valid-Sudoku/README.md
index f839190c..cfede681 100755
--- a/leetcode/0036.Valid-Sudoku/README.md
+++ b/leetcode/0036.Valid-Sudoku/README.md
@@ -1,7 +1,7 @@
# [36. Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)
-## 题目:
+## 题目
Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated **according to the following rules**:
diff --git a/leetcode/0037.Sudoku-Solver/README.md b/leetcode/0037.Sudoku-Solver/README.md
index 6bc84c78..9a2a86ec 100755
--- a/leetcode/0037.Sudoku-Solver/README.md
+++ b/leetcode/0037.Sudoku-Solver/README.md
@@ -2,7 +2,7 @@
-## 题目:
+## 题目
Write a program to solve a Sudoku puzzle by filling the empty cells.
diff --git a/leetcode/0055.Jump-Game/README.md b/leetcode/0055.Jump-Game/README.md
index b8b25a6a..84b7ddaf 100644
--- a/leetcode/0055.Jump-Game/README.md
+++ b/leetcode/0055.Jump-Game/README.md
@@ -1,4 +1,4 @@
-# 55. Jump Game
+# [55. Jump Game](https://leetcode.com/problems/jump-game/)
## 题目
diff --git a/leetcode/0066.Plus-One/README.md b/leetcode/0066.Plus-One/README.md
index 465bdcf1..6422b0fd 100755
--- a/leetcode/0066.Plus-One/README.md
+++ b/leetcode/0066.Plus-One/README.md
@@ -1,7 +1,7 @@
# [66. Plus One](https://leetcode.com/problems/plus-one/)
-## 题目:
+## 题目
Given a **non-empty** array of digits representing a non-negative integer, plus one to the integer.
diff --git a/leetcode/0074.Search-a-2D-Matrix/README.md b/leetcode/0074.Search-a-2D-Matrix/README.md
index b81dec7d..cd3f1ad8 100755
--- a/leetcode/0074.Search-a-2D-Matrix/README.md
+++ b/leetcode/0074.Search-a-2D-Matrix/README.md
@@ -1,7 +1,7 @@
# [74. Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)
-## 题目:
+## 题目
Write an efficient algorithm that searches for a value in an *m* x *n* matrix. This matrix has the following properties:
diff --git a/leetcode/0081.Search-in-Rotated-Sorted-Array-II/README.md b/leetcode/0081.Search-in-Rotated-Sorted-Array-II/README.md
index 133741cd..8ed8f89d 100755
--- a/leetcode/0081.Search-in-Rotated-Sorted-Array-II/README.md
+++ b/leetcode/0081.Search-in-Rotated-Sorted-Array-II/README.md
@@ -1,7 +1,7 @@
# [81. Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)
-## 题目:
+## 题目
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
diff --git a/leetcode/0095.Unique-Binary-Search-Trees-II/README.md b/leetcode/0095.Unique-Binary-Search-Trees-II/README.md
index 26a62638..bda2dd0e 100755
--- a/leetcode/0095.Unique-Binary-Search-Trees-II/README.md
+++ b/leetcode/0095.Unique-Binary-Search-Trees-II/README.md
@@ -1,7 +1,7 @@
# [95. Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/)
-## 题目:
+## 题目
Given an integer *n*, generate all structurally unique **BST's** (binary search trees) that store values 1 ... *n*.
diff --git a/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/README.md b/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/README.md
index a1d6526a..cd341a5e 100755
--- a/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/README.md
+++ b/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/README.md
@@ -1,7 +1,7 @@
# [105. Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)
-## 题目:
+## 题目
Given preorder and inorder traversal of a tree, construct the binary tree.
diff --git a/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/README.md b/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/README.md
index a57d0fce..5abc5adf 100755
--- a/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/README.md
+++ b/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/README.md
@@ -1,6 +1,6 @@
# [106. Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)
-## 题目:
+## 题目
Given inorder and postorder traversal of a tree, construct the binary tree.
diff --git a/leetcode/0128.Longest-Consecutive-Sequence/README.md b/leetcode/0128.Longest-Consecutive-Sequence/README.md
index 4809fe7a..82c8bace 100755
--- a/leetcode/0128.Longest-Consecutive-Sequence/README.md
+++ b/leetcode/0128.Longest-Consecutive-Sequence/README.md
@@ -1,7 +1,7 @@
# [128. Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)
-## 题目:
+## 题目
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
diff --git a/leetcode/0130.Surrounded-Regions/README.md b/leetcode/0130.Surrounded-Regions/README.md
index f8664a19..2c161a8e 100755
--- a/leetcode/0130.Surrounded-Regions/README.md
+++ b/leetcode/0130.Surrounded-Regions/README.md
@@ -2,7 +2,7 @@
-## 题目:
+## 题目
Given a 2D board containing `'X'` and `'O'` (**the letter O**), capture all regions surrounded by `'X'`.
diff --git a/leetcode/0136.Single-Number/README.md b/leetcode/0136.Single-Number/README.md
index ba4920e8..e36ce6b2 100755
--- a/leetcode/0136.Single-Number/README.md
+++ b/leetcode/0136.Single-Number/README.md
@@ -1,6 +1,6 @@
# [136. Single Number](https://leetcode.com/problems/single-number/)
-## 题目:
+## 题目
Given a **non-empty** array of integers, every element appears *twice* except for one. Find that single one.
diff --git a/leetcode/0137.Single-Number-II/README.md b/leetcode/0137.Single-Number-II/README.md
index 62ebda38..2bd63414 100755
--- a/leetcode/0137.Single-Number-II/README.md
+++ b/leetcode/0137.Single-Number-II/README.md
@@ -1,7 +1,7 @@
# [137. Single Number II](https://leetcode.com/problems/single-number-ii/)
-## 题目:
+## 题目
Given a **non-empty** array of integers, every element appears *three* times except for one, which appears exactly once. Find that single one.
diff --git a/leetcode/0151.Reverse-Words-in-a-String/README.md b/leetcode/0151.Reverse-Words-in-a-String/README.md
index fa7ff4f2..e9c8cb31 100755
--- a/leetcode/0151.Reverse-Words-in-a-String/README.md
+++ b/leetcode/0151.Reverse-Words-in-a-String/README.md
@@ -2,7 +2,7 @@
-## 题目:
+## 题目
Given an input string, reverse the string word by word.
diff --git a/leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/README.md b/leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/README.md
index 17cf0ab9..ed599443 100755
--- a/leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/README.md
+++ b/leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array/README.md
@@ -1,7 +1,7 @@
# [153. Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)
-## 题目:
+## 题目
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
diff --git a/leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II/README.md b/leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II/README.md
index 4cb62745..ba635eb3 100755
--- a/leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II/README.md
+++ b/leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II/README.md
@@ -1,7 +1,7 @@
# [154. Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/)
-## 题目:
+## 题目
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
diff --git a/leetcode/0162.Find-Peak-Element/README.md b/leetcode/0162.Find-Peak-Element/README.md
index 9304f0ab..9bc7c220 100755
--- a/leetcode/0162.Find-Peak-Element/README.md
+++ b/leetcode/0162.Find-Peak-Element/README.md
@@ -1,7 +1,7 @@
# [162. Find Peak Element](https://leetcode.com/problems/find-peak-element/)
-## 题目:
+## 题目
A peak element is an element that is greater than its neighbors.
diff --git a/leetcode/0169.Majority-Element/README.md b/leetcode/0169.Majority-Element/README.md
index b2e898ac..a8919533 100755
--- a/leetcode/0169.Majority-Element/README.md
+++ b/leetcode/0169.Majority-Element/README.md
@@ -1,7 +1,7 @@
# [169. Majority Element](https://leetcode.com/problems/majority-element/)
-## 题目:
+## 题目
Given an array of size n, find the majority element. The majority element is the element that appears **more than** `⌊ n/2 ⌋` times.
diff --git a/leetcode/0172.Factorial-Trailing-Zeroes/README.md b/leetcode/0172.Factorial-Trailing-Zeroes/README.md
index 987567d0..90f37798 100755
--- a/leetcode/0172.Factorial-Trailing-Zeroes/README.md
+++ b/leetcode/0172.Factorial-Trailing-Zeroes/README.md
@@ -1,7 +1,7 @@
# [172. Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/)
-## 题目:
+## 题目
Given an integer n, return the number of trailing zeroes in n!.
diff --git a/leetcode/0174.Dungeon-Game/README.md b/leetcode/0174.Dungeon-Game/README.md
index 756d39d4..886923cb 100755
--- a/leetcode/0174.Dungeon-Game/README.md
+++ b/leetcode/0174.Dungeon-Game/README.md
@@ -1,6 +1,6 @@
# [174. Dungeon Game](https://leetcode.com/problems/dungeon-game/)
-## 题目:
+## 题目
The demons had captured the princess (**P**) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (**K**) was initially positioned in the top-left room and must fight his way through the dungeon to rescue the princess.
diff --git a/leetcode/0187.Repeated-DNA-Sequences/README.md b/leetcode/0187.Repeated-DNA-Sequences/README.md
index b0c4b7fa..5532d563 100755
--- a/leetcode/0187.Repeated-DNA-Sequences/README.md
+++ b/leetcode/0187.Repeated-DNA-Sequences/README.md
@@ -1,7 +1,7 @@
# [187. Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/)
-## 题目:
+## 题目
All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify repeated sequences within the DNA.
diff --git a/leetcode/0190.Reverse-Bits/README.md b/leetcode/0190.Reverse-Bits/README.md
index b6fda04c..b04b5c29 100755
--- a/leetcode/0190.Reverse-Bits/README.md
+++ b/leetcode/0190.Reverse-Bits/README.md
@@ -1,7 +1,7 @@
# [190. Reverse Bits](https://leetcode.com/problems/reverse-bits/)
-## 题目:
+## 题目
Reverse bits of a given 32 bits unsigned integer.
diff --git a/leetcode/0201.Bitwise-AND-of-Numbers-Range/README.md b/leetcode/0201.Bitwise-AND-of-Numbers-Range/README.md
index a6e34d0d..7f6eb444 100755
--- a/leetcode/0201.Bitwise-AND-of-Numbers-Range/README.md
+++ b/leetcode/0201.Bitwise-AND-of-Numbers-Range/README.md
@@ -1,7 +1,7 @@
# [201. Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/)
-## 题目:
+## 题目
Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.
diff --git a/leetcode/0204.Count-Primes/README.md b/leetcode/0204.Count-Primes/README.md
index 94bdd565..90b9b4d9 100755
--- a/leetcode/0204.Count-Primes/README.md
+++ b/leetcode/0204.Count-Primes/README.md
@@ -1,7 +1,7 @@
# [204. Count Primes](https://leetcode.com/problems/count-primes/)
-## 题目:
+## 题目
Count the number of prime numbers less than a non-negative number, **n**.
diff --git a/leetcode/0218.The-Skyline-Problem/README.md b/leetcode/0218.The-Skyline-Problem/README.md
index 314d973c..f4b2e5ba 100755
--- a/leetcode/0218.The-Skyline-Problem/README.md
+++ b/leetcode/0218.The-Skyline-Problem/README.md
@@ -1,6 +1,6 @@
# [218. The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/)
-## 题目:
+## 题目
A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are **given the locations and height of all the buildings** as shown on a cityscape photo (Figure A), write a program to **output the skyline** formed by these buildings collectively (Figure B).
diff --git a/leetcode/0223.Rectangle-Area/README.md b/leetcode/0223.Rectangle-Area/README.md
index 90968f8f..bbb4b061 100755
--- a/leetcode/0223.Rectangle-Area/README.md
+++ b/leetcode/0223.Rectangle-Area/README.md
@@ -1,7 +1,7 @@
# [223. Rectangle Area](https://leetcode.com/problems/rectangle-area/)
-## 题目:
+## 题目
Find the total area covered by two **rectilinear** rectangles in a **2D** plane.
diff --git a/leetcode/0229.Majority-Element-II/README.md b/leetcode/0229.Majority-Element-II/README.md
index e01c44e2..cf5fbea1 100755
--- a/leetcode/0229.Majority-Element-II/README.md
+++ b/leetcode/0229.Majority-Element-II/README.md
@@ -1,7 +1,7 @@
# [229. Majority Element II](https://leetcode.com/problems/majority-element-ii/)
-## 题目:
+## 题目
Given an integer array of size n, find all elements that appear more than `⌊ n/3 ⌋` times.
diff --git a/leetcode/0240.Search-a-2D-Matrix-II/README.md b/leetcode/0240.Search-a-2D-Matrix-II/README.md
index d9b3e859..97cf4fc7 100755
--- a/leetcode/0240.Search-a-2D-Matrix-II/README.md
+++ b/leetcode/0240.Search-a-2D-Matrix-II/README.md
@@ -1,7 +1,7 @@
# [240. Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)
-## 题目:
+## 题目
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
diff --git a/leetcode/0260.Single-Number-III/README.md b/leetcode/0260.Single-Number-III/README.md
index f7dccbf1..ae445a5e 100755
--- a/leetcode/0260.Single-Number-III/README.md
+++ b/leetcode/0260.Single-Number-III/README.md
@@ -1,7 +1,7 @@
# [260. Single Number III](https://leetcode.com/problems/single-number-iii/)
-## 题目:
+## 题目
Given an array of numbers `nums`, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
diff --git a/leetcode/0268.Missing-Number/README.md b/leetcode/0268.Missing-Number/README.md
index d0d10493..97895940 100755
--- a/leetcode/0268.Missing-Number/README.md
+++ b/leetcode/0268.Missing-Number/README.md
@@ -1,7 +1,7 @@
# [268. Missing Number](https://leetcode.com/problems/missing-number/)
-## 题目:
+## 题目
Given an array containing n distinct numbers taken from `0, 1, 2, ..., n`, find the one that is missing from the array.
diff --git a/leetcode/0275.H-Index-II/README.md b/leetcode/0275.H-Index-II/README.md
index 1cfe6ffd..cc94f334 100755
--- a/leetcode/0275.H-Index-II/README.md
+++ b/leetcode/0275.H-Index-II/README.md
@@ -1,6 +1,6 @@
# [275. H-Index II](https://leetcode.com/problems/h-index-ii/)
-## 题目:
+## 题目
Given an array of citations **sorted in ascending order** (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.
diff --git a/leetcode/0303.Range-Sum-Query---Immutable/README.md b/leetcode/0303.Range-Sum-Query---Immutable/README.md
index 5b454207..95996ad0 100755
--- a/leetcode/0303.Range-Sum-Query---Immutable/README.md
+++ b/leetcode/0303.Range-Sum-Query---Immutable/README.md
@@ -1,7 +1,7 @@
# [303. Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/)
-## 题目:
+## 题目
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
diff --git a/leetcode/0307.Range-Sum-Query---Mutable/README.md b/leetcode/0307.Range-Sum-Query---Mutable/README.md
index 6cafb629..85da4839 100755
--- a/leetcode/0307.Range-Sum-Query---Mutable/README.md
+++ b/leetcode/0307.Range-Sum-Query---Mutable/README.md
@@ -1,7 +1,7 @@
# [307. Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/)
-## 题目:
+## 题目
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
diff --git a/leetcode/0315.Count-of-Smaller-Numbers-After-Self/README.md b/leetcode/0315.Count-of-Smaller-Numbers-After-Self/README.md
index 6c106b2c..d024ec99 100755
--- a/leetcode/0315.Count-of-Smaller-Numbers-After-Self/README.md
+++ b/leetcode/0315.Count-of-Smaller-Numbers-After-Self/README.md
@@ -1,7 +1,7 @@
# [315. Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/)
-## 题目:
+## 题目
You are given an integer array nums and you have to return a new counts array. The counts array has the property where `counts[i]` is the number of smaller elements to the right of `nums[i]`.
diff --git a/leetcode/0318.Maximum-Product-of-Word-Lengths/README.md b/leetcode/0318.Maximum-Product-of-Word-Lengths/README.md
index 03d60e42..b4189928 100755
--- a/leetcode/0318.Maximum-Product-of-Word-Lengths/README.md
+++ b/leetcode/0318.Maximum-Product-of-Word-Lengths/README.md
@@ -1,7 +1,7 @@
# [318. Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/)
-## 题目:
+## 题目
Given a string array `words`, find the maximum value of `length(word[i]) * length(word[j])` where the two words do not share common letters. You may assume that each word will contain only lower case letters. If no such two words exist, return 0.
diff --git a/leetcode/0327.Count-of-Range-Sum/README.md b/leetcode/0327.Count-of-Range-Sum/README.md
index d874dbc8..e764348c 100755
--- a/leetcode/0327.Count-of-Range-Sum/README.md
+++ b/leetcode/0327.Count-of-Range-Sum/README.md
@@ -1,7 +1,7 @@
# [327. Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/)
-## 题目:
+## 题目
Given an integer array `nums`, return the number of range sums that lie in `[lower, upper]` inclusive.Range sum `S(i, j)` is defined as the sum of the elements in `nums` between indices `i` and `j` (`i` ≤ `j`), inclusive.
diff --git a/leetcode/0329.Longest-Increasing-Path-in-a-Matrix/README.md b/leetcode/0329.Longest-Increasing-Path-in-a-Matrix/README.md
index 116aa4aa..2bd4e814 100755
--- a/leetcode/0329.Longest-Increasing-Path-in-a-Matrix/README.md
+++ b/leetcode/0329.Longest-Increasing-Path-in-a-Matrix/README.md
@@ -1,7 +1,7 @@
# [329. Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/)
-## 题目:
+## 题目
Given an integer matrix, find the length of the longest increasing path.
diff --git a/leetcode/0337.House-Robber-III/README.md b/leetcode/0337.House-Robber-III/README.md
index 9d7e070a..e8451881 100644
--- a/leetcode/0337.House-Robber-III/README.md
+++ b/leetcode/0337.House-Robber-III/README.md
@@ -1,4 +1,5 @@
-# 337. House Robber III
+# [337. House Robber III](https://leetcode.com/problems/house-robber-iii/)
+
## 题目
diff --git a/leetcode/0354.Russian-Doll-Envelopes/README.md b/leetcode/0354.Russian-Doll-Envelopes/README.md
index 193237f9..826264a8 100755
--- a/leetcode/0354.Russian-Doll-Envelopes/README.md
+++ b/leetcode/0354.Russian-Doll-Envelopes/README.md
@@ -1,7 +1,7 @@
# [354. Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/)
-## 题目:
+## 题目
You have a number of envelopes with widths and heights given as a pair of integers `(w, h)`. One envelope can fit into another if and only if both the width and height of one envelope is greater than the width and height of the other envelope.
diff --git a/leetcode/0367.Valid-Perfect-Square/README.md b/leetcode/0367.Valid-Perfect-Square/README.md
index 430bd1eb..7d8a8052 100755
--- a/leetcode/0367.Valid-Perfect-Square/README.md
+++ b/leetcode/0367.Valid-Perfect-Square/README.md
@@ -1,6 +1,6 @@
# [367. Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/)
-## 题目:
+## 题目
Given a positive integer num, write a function which returns True if num is a perfect square else False.
diff --git a/leetcode/0371.Sum-of-Two-Integers/README.md b/leetcode/0371.Sum-of-Two-Integers/README.md
index 57887ffe..187fbc8f 100755
--- a/leetcode/0371.Sum-of-Two-Integers/README.md
+++ b/leetcode/0371.Sum-of-Two-Integers/README.md
@@ -1,7 +1,7 @@
# [371. Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)
-## 题目:
+## 题目
Calculate the sum of two integers a and b, but you are **not allowed** to use the operator `+` and `-`.
diff --git a/leetcode/0372.Super-Pow/README.md b/leetcode/0372.Super-Pow/README.md
index 563a28a8..a08d0858 100755
--- a/leetcode/0372.Super-Pow/README.md
+++ b/leetcode/0372.Super-Pow/README.md
@@ -1,7 +1,7 @@
# [372. Super Pow](https://leetcode.com/problems/super-pow/)
-## 题目:
+## 题目
Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.
diff --git a/leetcode/0373.Find-K-Pairs-with-Smallest-Sums/README.md b/leetcode/0373.Find-K-Pairs-with-Smallest-Sums/README.md
index ebe536eb..68d5336c 100755
--- a/leetcode/0373.Find-K-Pairs-with-Smallest-Sums/README.md
+++ b/leetcode/0373.Find-K-Pairs-with-Smallest-Sums/README.md
@@ -1,7 +1,7 @@
# [373. Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/)
-## 题目:
+## 题目
You are given two integer arrays **nums1** and **nums2** sorted in ascending order and an integer **k**.
diff --git a/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/README.md b/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/README.md
index a14e3380..0eab9362 100755
--- a/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/README.md
+++ b/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/README.md
@@ -1,7 +1,7 @@
# [378. Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/)
-## 题目:
+## 题目
Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix.
diff --git a/leetcode/0385.Mini-Parser/README.md b/leetcode/0385.Mini-Parser/README.md
index 20c810ca..a7705d4e 100755
--- a/leetcode/0385.Mini-Parser/README.md
+++ b/leetcode/0385.Mini-Parser/README.md
@@ -1,7 +1,7 @@
# [385. Mini Parser](https://leetcode.com/problems/mini-parser/)
-## 题目:
+## 题目
Given a nested list of integers represented as a string, implement a parser to deserialize it.
diff --git a/leetcode/0386.Lexicographical-Numbers/README.md b/leetcode/0386.Lexicographical-Numbers/README.md
index f3e6b0a0..ff39b8bd 100755
--- a/leetcode/0386.Lexicographical-Numbers/README.md
+++ b/leetcode/0386.Lexicographical-Numbers/README.md
@@ -1,7 +1,7 @@
# [386. Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/)
-## 题目:
+## 题目
Given an integer n, return 1 - n in lexicographical order.
diff --git a/leetcode/0387.First-Unique-Character-in-a-String/README.md b/leetcode/0387.First-Unique-Character-in-a-String/README.md
index 2de71104..f5451531 100755
--- a/leetcode/0387.First-Unique-Character-in-a-String/README.md
+++ b/leetcode/0387.First-Unique-Character-in-a-String/README.md
@@ -1,6 +1,6 @@
# [387. First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/)
-## 题目:
+## 题目
Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.
diff --git a/leetcode/0389.Find-the-Difference/README.md b/leetcode/0389.Find-the-Difference/README.md
index ac93ced7..2c5cee2a 100755
--- a/leetcode/0389.Find-the-Difference/README.md
+++ b/leetcode/0389.Find-the-Difference/README.md
@@ -1,6 +1,6 @@
# [389. Find the Difference](https://leetcode.com/problems/find-the-difference/)
-## 题目:
+## 题目
Given two strings **s** and **t** which consist of only lowercase letters.
diff --git a/leetcode/0393.UTF-8-Validation/README.md b/leetcode/0393.UTF-8-Validation/README.md
index 0120374a..9f859f28 100755
--- a/leetcode/0393.UTF-8-Validation/README.md
+++ b/leetcode/0393.UTF-8-Validation/README.md
@@ -2,7 +2,7 @@
-## 题目:
+## 题目
A character in UTF8 can be from **1 to 4 bytes** long, subjected to the following rules:
diff --git a/leetcode/0397.Integer-Replacement/README.md b/leetcode/0397.Integer-Replacement/README.md
index a94c4501..953cbfc8 100755
--- a/leetcode/0397.Integer-Replacement/README.md
+++ b/leetcode/0397.Integer-Replacement/README.md
@@ -1,7 +1,7 @@
# [397. Integer Replacement](https://leetcode.com/problems/integer-replacement/)
-## 题目:
+## 题目
Given a positive integer n and you can do operations as follow:
diff --git a/leetcode/0399.Evaluate-Division/README.md b/leetcode/0399.Evaluate-Division/README.md
index 4494c7ce..69be00eb 100755
--- a/leetcode/0399.Evaluate-Division/README.md
+++ b/leetcode/0399.Evaluate-Division/README.md
@@ -1,7 +1,7 @@
# [399. Evaluate Division](https://leetcode.com/problems/evaluate-division/)
-## 题目:
+## 题目
Equations are given in the format `A / B = k`, where `A` and `B` are variables represented as strings, and `k` is a real number (floating point number). Given some queries, return the answers. If the answer does not exist, return `-1.0`.
diff --git a/leetcode/0405.Convert-a-Number-to-Hexadecimal/README.md b/leetcode/0405.Convert-a-Number-to-Hexadecimal/README.md
index 764349df..0026e4bb 100755
--- a/leetcode/0405.Convert-a-Number-to-Hexadecimal/README.md
+++ b/leetcode/0405.Convert-a-Number-to-Hexadecimal/README.md
@@ -1,7 +1,7 @@
# [405. Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal/)
-## 题目:
+## 题目
Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, [two’s complement](https://en.wikipedia.org/wiki/Two%27s_complement) method is used.
diff --git a/leetcode/0409.Longest-Palindrome/README.md b/leetcode/0409.Longest-Palindrome/README.md
index df76aec3..eb515067 100755
--- a/leetcode/0409.Longest-Palindrome/README.md
+++ b/leetcode/0409.Longest-Palindrome/README.md
@@ -1,7 +1,7 @@
# [409. Longest Palindrome](https://leetcode.com/problems/longest-palindrome/)
-## 题目:
+## 题目
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.
diff --git a/leetcode/0410.Split-Array-Largest-Sum/README.md b/leetcode/0410.Split-Array-Largest-Sum/README.md
index 6da33bda..45fef4cc 100755
--- a/leetcode/0410.Split-Array-Largest-Sum/README.md
+++ b/leetcode/0410.Split-Array-Largest-Sum/README.md
@@ -1,7 +1,7 @@
# [410. Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/)
-## 题目:
+## 题目
Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m subarrays.
diff --git a/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/README.md b/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/README.md
index b76b497f..54cf2f6e 100755
--- a/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/README.md
+++ b/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/README.md
@@ -1,7 +1,7 @@
# [421. Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/)
-## 题目:
+## 题目
Given a **non-empty** array of numbers, a0, a1, a2, … , an-1, where 0 ≤ ai < 231.
diff --git a/leetcode/0436.Find-Right-Interval/README.md b/leetcode/0436.Find-Right-Interval/README.md
index f0ae3248..056222d2 100755
--- a/leetcode/0436.Find-Right-Interval/README.md
+++ b/leetcode/0436.Find-Right-Interval/README.md
@@ -1,7 +1,7 @@
# [436. Find Right Interval](https://leetcode.com/problems/find-right-interval/)
-## 题目:
+## 题目
Given a set of intervals, for each of the interval i, check if there exists an interval j whose start point is bigger than or equal to the end point of the interval i, which can be called that j is on the "right" of i.
diff --git a/leetcode/0441.Arranging-Coins/README.md b/leetcode/0441.Arranging-Coins/README.md
index 85df77ba..83cc7c1d 100755
--- a/leetcode/0441.Arranging-Coins/README.md
+++ b/leetcode/0441.Arranging-Coins/README.md
@@ -1,6 +1,6 @@
# [441. Arranging Coins](https://leetcode.com/problems/arranging-coins/)
-## 题目:
+## 题目
You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.
diff --git a/leetcode/0457.Circular-Array-Loop/README.md b/leetcode/0457.Circular-Array-Loop/README.md
index 72222ea1..80bc7535 100755
--- a/leetcode/0457.Circular-Array-Loop/README.md
+++ b/leetcode/0457.Circular-Array-Loop/README.md
@@ -1,7 +1,7 @@
# [457. Circular Array Loop](https://leetcode.com/problems/circular-array-loop/)
-## 题目:
+## 题目
You are given a **circular** array `nums` of positive and negative integers. If a number k at an index is positive, then move forward k steps. Conversely, if it's negative (-k), move backward k steps. Since the array is circular, you may assume that the last element's next element is the first element, and the first element's previous element is the last element.
diff --git a/leetcode/0461.Hamming-Distance/README.md b/leetcode/0461.Hamming-Distance/README.md
index 34a8a426..3aeeb833 100755
--- a/leetcode/0461.Hamming-Distance/README.md
+++ b/leetcode/0461.Hamming-Distance/README.md
@@ -1,6 +1,6 @@
# [461. Hamming Distance](https://leetcode.com/problems/hamming-distance/)
-## 题目:
+## 题目
The [Hamming distance](https://en.wikipedia.org/wiki/Hamming_distance) between two integers is the number of positions at which the corresponding bits are different.
diff --git a/leetcode/0463.Island-Perimeter/README.md b/leetcode/0463.Island-Perimeter/README.md
index c702c23f..3d449883 100755
--- a/leetcode/0463.Island-Perimeter/README.md
+++ b/leetcode/0463.Island-Perimeter/README.md
@@ -1,6 +1,6 @@
# [463. Island Perimeter](https://leetcode.com/problems/island-perimeter/)
-## 题目:
+## 题目
You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water.
diff --git a/leetcode/0470.Implement-Rand10-Using-Rand7/README.md b/leetcode/0470.Implement-Rand10-Using-Rand7/README.md
index c88edd10..27b7a0a8 100755
--- a/leetcode/0470.Implement-Rand10-Using-Rand7/README.md
+++ b/leetcode/0470.Implement-Rand10-Using-Rand7/README.md
@@ -1,7 +1,7 @@
# [470. Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7/)
-## 题目:
+## 题目
Given a function `rand7` which generates a uniform random integer in the range 1 to 7, write a function `rand10` which generates a uniform random integer in the range 1 to 10.
diff --git a/leetcode/0474.Ones-and-Zeroes/README.md b/leetcode/0474.Ones-and-Zeroes/README.md
index 0b11e996..959d29cb 100755
--- a/leetcode/0474.Ones-and-Zeroes/README.md
+++ b/leetcode/0474.Ones-and-Zeroes/README.md
@@ -1,7 +1,7 @@
# [474. Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/)
-## 题目:
+## 题目
In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.
diff --git a/leetcode/0475.Heaters/README.md b/leetcode/0475.Heaters/README.md
index a0375170..1232dca1 100755
--- a/leetcode/0475.Heaters/README.md
+++ b/leetcode/0475.Heaters/README.md
@@ -1,6 +1,6 @@
# [475. Heaters](https://leetcode.com/problems/heaters/)
-## 题目:
+## 题目
Winter is coming! Your first job during the contest is to design a standard heater with fixed warm radius to warm all the houses.
diff --git a/leetcode/0476.Number-Complement/README.md b/leetcode/0476.Number-Complement/README.md
index 5c48041d..ce2adf04 100755
--- a/leetcode/0476.Number-Complement/README.md
+++ b/leetcode/0476.Number-Complement/README.md
@@ -1,7 +1,7 @@
# [476. Number Complement](https://leetcode.com/problems/number-complement/)
-## 题目:
+## 题目
Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.
diff --git a/leetcode/0477.Total-Hamming-Distance/README.md b/leetcode/0477.Total-Hamming-Distance/README.md
index bc25bb38..37d3e729 100755
--- a/leetcode/0477.Total-Hamming-Distance/README.md
+++ b/leetcode/0477.Total-Hamming-Distance/README.md
@@ -1,7 +1,7 @@
# [477. Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/)
-## 题目:
+## 题目
The [Hamming distance](https://en.wikipedia.org/wiki/Hamming_distance) between two integers is the number of positions at which the corresponding bits are different.
diff --git a/leetcode/0483.Smallest-Good-Base/README.md b/leetcode/0483.Smallest-Good-Base/README.md
index 5a1dedca..41d038a4 100755
--- a/leetcode/0483.Smallest-Good-Base/README.md
+++ b/leetcode/0483.Smallest-Good-Base/README.md
@@ -1,7 +1,7 @@
# [483. Smallest Good Base](https://leetcode.com/problems/smallest-good-base/)
-## 题目:
+## 题目
For an integer n, we call k>=2 a **good base** of n, if all digits of n base k are 1.
diff --git a/leetcode/0491.Increasing-Subsequences/README.md b/leetcode/0491.Increasing-Subsequences/README.md
index bb39e93d..79063dbc 100755
--- a/leetcode/0491.Increasing-Subsequences/README.md
+++ b/leetcode/0491.Increasing-Subsequences/README.md
@@ -1,7 +1,7 @@
# [491. Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/)
-## 题目:
+## 题目
Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2.
diff --git a/leetcode/0493.Reverse-Pairs/README.md b/leetcode/0493.Reverse-Pairs/README.md
index 82eb9119..2094a361 100755
--- a/leetcode/0493.Reverse-Pairs/README.md
+++ b/leetcode/0493.Reverse-Pairs/README.md
@@ -1,7 +1,7 @@
# [493. Reverse Pairs](https://leetcode.com/problems/reverse-pairs/)
-## 题目:
+## 题目
Given an array `nums`, we call `(i, j)` an **important reverse pair** if `i < j` and `nums[i] > 2*nums[j]`.
diff --git a/leetcode/0494.Target-Sum/README.md b/leetcode/0494.Target-Sum/README.md
index 12fe8a9d..dd3c2b10 100644
--- a/leetcode/0494.Target-Sum/README.md
+++ b/leetcode/0494.Target-Sum/README.md
@@ -1,4 +1,5 @@
-# 494. Target Sum
+# [494. Target Sum](https://leetcode.com/problems/target-sum/)
+
## 题目
diff --git a/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles/README.md b/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles/README.md
index da449ae9..449060b4 100755
--- a/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles/README.md
+++ b/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles/README.md
@@ -1,7 +1,7 @@
# [497. Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles)
-## 题目:
+## 题目
Given a list of **non-overlapping** axis-aligned rectangles `rects`, write a function `pick` which randomly and uniformily picks an **integer point** in the space covered by the rectangles.
diff --git a/leetcode/0498.Diagonal-Traverse/README.md b/leetcode/0498.Diagonal-Traverse/README.md
index bc12d88b..e4d28abd 100755
--- a/leetcode/0498.Diagonal-Traverse/README.md
+++ b/leetcode/0498.Diagonal-Traverse/README.md
@@ -1,7 +1,7 @@
# [498. Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse/)
-## 题目:
+## 题目
Given a matrix of M x N elements (M rows, N columns), return all elements of the matrix in diagonal order as shown in the below image.
diff --git a/leetcode/0500.Keyboard-Row/README.md b/leetcode/0500.Keyboard-Row/README.md
index 74599011..7d9fa5db 100755
--- a/leetcode/0500.Keyboard-Row/README.md
+++ b/leetcode/0500.Keyboard-Row/README.md
@@ -1,7 +1,7 @@
# [500. Keyboard Row](https://leetcode.com/problems/keyboard-row/)
-## 题目:
+## 题目
Given a List of words, return the words that can be typed using letters of **alphabet** on only one row's of American keyboard like the image below.
diff --git a/leetcode/0508.Most-Frequent-Subtree-Sum/README.md b/leetcode/0508.Most-Frequent-Subtree-Sum/README.md
index b142324f..c45494e8 100755
--- a/leetcode/0508.Most-Frequent-Subtree-Sum/README.md
+++ b/leetcode/0508.Most-Frequent-Subtree-Sum/README.md
@@ -1,7 +1,7 @@
# [508. Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/)
-## 题目:
+## 题目
Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (including the node itself). So what is the most frequent subtree sum value? If there is a tie, return all the values with the highest frequency in any order.
diff --git a/leetcode/0509.Fibonacci-Number/README.md b/leetcode/0509.Fibonacci-Number/README.md
index 4f37321a..d89eafad 100755
--- a/leetcode/0509.Fibonacci-Number/README.md
+++ b/leetcode/0509.Fibonacci-Number/README.md
@@ -1,7 +1,7 @@
# [509. Fibonacci Number](https://leetcode.com/problems/fibonacci-number/)
-## 题目:
+## 题目
The **Fibonacci numbers**, commonly denoted `F(n)` form a sequence, called the **Fibonacci sequence**, such that each number is the sum of the two preceding ones, starting from `0` and `1`. That is,
diff --git a/leetcode/0513.Find-Bottom-Left-Tree-Value/README.md b/leetcode/0513.Find-Bottom-Left-Tree-Value/README.md
index 3b8c2a09..d324af9f 100755
--- a/leetcode/0513.Find-Bottom-Left-Tree-Value/README.md
+++ b/leetcode/0513.Find-Bottom-Left-Tree-Value/README.md
@@ -1,7 +1,7 @@
# [513. Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/)
-## 题目:
+## 题目
Given a binary tree, find the leftmost value in the last row of the tree.
diff --git a/leetcode/0528.Random-Pick-with-Weight/README.md b/leetcode/0528.Random-Pick-with-Weight/README.md
index 4ce14b0d..054afa4c 100755
--- a/leetcode/0528.Random-Pick-with-Weight/README.md
+++ b/leetcode/0528.Random-Pick-with-Weight/README.md
@@ -1,7 +1,7 @@
# [528. Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/)
-## 题目:
+## 题目
Given an array `w` of positive integers, where `w[i]` describes the weight of index `i`, write a function `pickIndex` which randomly picks an index in proportion to its weight.
diff --git a/leetcode/0529.Minesweeper/README.md b/leetcode/0529.Minesweeper/README.md
index 2de52660..f2166a69 100644
--- a/leetcode/0529.Minesweeper/README.md
+++ b/leetcode/0529.Minesweeper/README.md
@@ -1,4 +1,5 @@
-# 529. Minesweeper
+# [529. Minesweeper](https://leetcode.com/problems/minesweeper/)
+
## 题目
diff --git a/leetcode/0541.Reverse-String-II/README.md b/leetcode/0541.Reverse-String-II/README.md
index f368ba5f..de8a18ec 100755
--- a/leetcode/0541.Reverse-String-II/README.md
+++ b/leetcode/0541.Reverse-String-II/README.md
@@ -1,7 +1,7 @@
# [541. Reverse String II](https://leetcode.com/problems/reverse-string-ii/)
-## 题目:
+## 题目
Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k characters left, reverse all of them. If there are less than 2k but greater than or equal to k characters, then reverse the first k characters and left the other as original.
diff --git a/leetcode/0547.Friend-Circles/README.md b/leetcode/0547.Friend-Circles/README.md
index 92b187a9..6cfe79b1 100755
--- a/leetcode/0547.Friend-Circles/README.md
+++ b/leetcode/0547.Friend-Circles/README.md
@@ -1,6 +1,6 @@
# [547. Friend Circles](https://leetcode.com/problems/friend-circles/)
-## 题目:
+## 题目
There are **N** students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a **direct** friend of B, and B is a **direct**friend of C, then A is an **indirect** friend of C. And we defined a friend circle is a group of students who are direct or indirect friends.
diff --git a/leetcode/0557.Reverse-Words-in-a-String-III/README.md b/leetcode/0557.Reverse-Words-in-a-String-III/README.md
index 5ce638e7..40de4c64 100755
--- a/leetcode/0557.Reverse-Words-in-a-String-III/README.md
+++ b/leetcode/0557.Reverse-Words-in-a-String-III/README.md
@@ -1,7 +1,7 @@
# [557. Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/)
-## 题目:
+## 题目
Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.
diff --git a/leetcode/0563.Binary-Tree-Tilt/README.md b/leetcode/0563.Binary-Tree-Tilt/README.md
index af9dde66..5f4f7016 100755
--- a/leetcode/0563.Binary-Tree-Tilt/README.md
+++ b/leetcode/0563.Binary-Tree-Tilt/README.md
@@ -1,7 +1,7 @@
# [563. Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/)
-## 题目:
+## 题目
Given a binary tree, return the tilt of the **whole tree**.
diff --git a/leetcode/0572.Subtree-of-Another-Tree/README.md b/leetcode/0572.Subtree-of-Another-Tree/README.md
index 479869a3..29045ec2 100755
--- a/leetcode/0572.Subtree-of-Another-Tree/README.md
+++ b/leetcode/0572.Subtree-of-Another-Tree/README.md
@@ -1,7 +1,7 @@
# [572. Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)
-## 题目:
+## 题目
Given two non-empty binary trees **s** and **t**, check whether tree **t** has exactly the same structure and node values with a subtree of **s**. A subtree of **s** is a tree consists of a node in **s** and all of this node's descendants. The tree **s** could also be considered as a subtree of itself.
diff --git a/leetcode/0575.Distribute-Candies/README.md b/leetcode/0575.Distribute-Candies/README.md
index 4fe69a71..7331b548 100755
--- a/leetcode/0575.Distribute-Candies/README.md
+++ b/leetcode/0575.Distribute-Candies/README.md
@@ -1,7 +1,7 @@
# [575. Distribute Candies](https://leetcode.com/problems/distribute-candies/)
-## 题目:
+## 题目
Given an integer array with **even** length, where different numbers in this array represent different **kinds** of candies. Each number means one candy of the corresponding kind. You need to distribute these candies **equally** in number to brother and sister. Return the maximum number of **kinds** of candies the sister could gain.
diff --git a/leetcode/0594.Longest-Harmonious-Subsequence/README.md b/leetcode/0594.Longest-Harmonious-Subsequence/README.md
index ce5484c8..7c715176 100755
--- a/leetcode/0594.Longest-Harmonious-Subsequence/README.md
+++ b/leetcode/0594.Longest-Harmonious-Subsequence/README.md
@@ -1,7 +1,7 @@
# [594. Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/)
-## 题目:
+## 题目
We define a harmounious array as an array where the difference between its maximum value and its minimum value is **exactly** 1.
diff --git a/leetcode/0599.Minimum-Index-Sum-of-Two-Lists/README.md b/leetcode/0599.Minimum-Index-Sum-of-Two-Lists/README.md
index 9c3630e3..0fa85361 100755
--- a/leetcode/0599.Minimum-Index-Sum-of-Two-Lists/README.md
+++ b/leetcode/0599.Minimum-Index-Sum-of-Two-Lists/README.md
@@ -1,6 +1,6 @@
# [599. Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists/)
-## 题目:
+## 题目
Suppose Andy and Doris want to choose a restaurant for dinner, and they both have a list of favorite restaurants represented by strings.
diff --git a/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists/README.md b/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists/README.md
index 391259c0..7385caf4 100755
--- a/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists/README.md
+++ b/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists/README.md
@@ -1,7 +1,7 @@
# [632. Smallest Range Covering Elements from K Lists](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/)
-## 题目:
+## 题目
You have `k` lists of sorted integers in ascending order. Find the **smallest** range that includes at least one number from each of the `k` lists.
diff --git a/leetcode/0633.Sum-of-Square-Numbers/README.md b/leetcode/0633.Sum-of-Square-Numbers/README.md
index b581b1ab..7bad9940 100755
--- a/leetcode/0633.Sum-of-Square-Numbers/README.md
+++ b/leetcode/0633.Sum-of-Square-Numbers/README.md
@@ -1,7 +1,7 @@
# [633. Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers/)
-## 题目:
+## 题目
Given a non-negative integer `c`, your task is to decide whether there're two integers `a` and `b` such that a^2 + b^2 = c.
diff --git a/leetcode/0638.Shopping-Offers/README.md b/leetcode/0638.Shopping-Offers/README.md
index db0c53d6..cf389acb 100644
--- a/leetcode/0638.Shopping-Offers/README.md
+++ b/leetcode/0638.Shopping-Offers/README.md
@@ -1,4 +1,5 @@
-# 638. Shopping Offers
+# [638. Shopping Offers](https://leetcode.com/problems/shopping-offers/)
+
## 题目
diff --git a/leetcode/0645.Set-Mismatch/README.md b/leetcode/0645.Set-Mismatch/README.md
index 09649d61..73de8da3 100755
--- a/leetcode/0645.Set-Mismatch/README.md
+++ b/leetcode/0645.Set-Mismatch/README.md
@@ -1,7 +1,7 @@
# [645. Set Mismatch](https://leetcode.com/problems/set-mismatch/)
-## 题目:
+## 题目
The set `S` originally contains numbers from 1 to `n`. But unfortunately, due to the data error, one of the numbers in the set got duplicated to **another** number in the set, which results in repetition of one number and loss of another number.
diff --git a/leetcode/0653.Two-Sum-IV---Input-is-a-BST/README.md b/leetcode/0653.Two-Sum-IV---Input-is-a-BST/README.md
index 332fea1a..32997243 100755
--- a/leetcode/0653.Two-Sum-IV---Input-is-a-BST/README.md
+++ b/leetcode/0653.Two-Sum-IV---Input-is-a-BST/README.md
@@ -1,6 +1,6 @@
# [653. Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/)
-## 题目:
+## 题目
Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.
diff --git a/leetcode/0658.Find-K-Closest-Elements/README.md b/leetcode/0658.Find-K-Closest-Elements/README.md
index 68336d50..d56c813a 100755
--- a/leetcode/0658.Find-K-Closest-Elements/README.md
+++ b/leetcode/0658.Find-K-Closest-Elements/README.md
@@ -1,7 +1,7 @@
# [658. Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/)
-## 题目:
+## 题目
Given a sorted array, two integers `k` and `x`, find the `k` closest elements to `x` in the array. The result should also be sorted in ascending order. If there is a tie, the smaller elements are always preferred.
diff --git a/leetcode/0662.Maximum-Width-of-Binary-Tree/README.md b/leetcode/0662.Maximum-Width-of-Binary-Tree/README.md
index a158b5ac..abff2481 100755
--- a/leetcode/0662.Maximum-Width-of-Binary-Tree/README.md
+++ b/leetcode/0662.Maximum-Width-of-Binary-Tree/README.md
@@ -1,7 +1,7 @@
# [662. Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/)
-## 题目:
+## 题目
Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has the same structure as a **full binary tree**, but some nodes are null.
diff --git a/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table/README.md b/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table/README.md
index 2d1f3526..f527ef2c 100755
--- a/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table/README.md
+++ b/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table/README.md
@@ -1,7 +1,7 @@
# [668. Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/)
-## 题目:
+## 题目
Nearly every one have used the [Multiplication Table](https://en.wikipedia.org/wiki/Multiplication_table). But could you find out the `k-th` smallest number quickly from the multiplication table?
diff --git a/leetcode/0684.Redundant-Connection/README.md b/leetcode/0684.Redundant-Connection/README.md
index 798d9e7c..57ee5510 100755
--- a/leetcode/0684.Redundant-Connection/README.md
+++ b/leetcode/0684.Redundant-Connection/README.md
@@ -1,7 +1,7 @@
# [684. Redundant Connection](https://leetcode.com/problems/redundant-connection/)
-## 题目:
+## 题目
In this problem, a tree is an **undirected** graph that is connected and has no cycles.
diff --git a/leetcode/0685.Redundant-Connection-II/README.md b/leetcode/0685.Redundant-Connection-II/README.md
index cb083104..d35e982f 100755
--- a/leetcode/0685.Redundant-Connection-II/README.md
+++ b/leetcode/0685.Redundant-Connection-II/README.md
@@ -1,7 +1,7 @@
# [685. Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii/)
-## 题目:
+## 题目
In this problem, a rooted tree is a **directed** graph such that, there is exactly one node (the root) for which all other nodes are descendants of this node, plus every node has exactly one parent, except for the root node which has no parents.
diff --git a/leetcode/0693.Binary-Number-with-Alternating-Bits/README.md b/leetcode/0693.Binary-Number-with-Alternating-Bits/README.md
index 71090ebb..8c8fb788 100755
--- a/leetcode/0693.Binary-Number-with-Alternating-Bits/README.md
+++ b/leetcode/0693.Binary-Number-with-Alternating-Bits/README.md
@@ -1,6 +1,6 @@
# [693. Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits/)
-## 题目:
+## 题目
Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.
diff --git a/leetcode/0695.Max-Area-of-Island/README.md b/leetcode/0695.Max-Area-of-Island/README.md
index de48bec2..2419d561 100644
--- a/leetcode/0695.Max-Area-of-Island/README.md
+++ b/leetcode/0695.Max-Area-of-Island/README.md
@@ -1,4 +1,5 @@
-# 695. Max Area of Island
+# [695. Max Area of Island](https://leetcode.com/problems/max-area-of-island/)
+
## 题目
diff --git a/leetcode/0699.Falling-Squares/README.md b/leetcode/0699.Falling-Squares/README.md
index ea5fd208..8f3284b2 100755
--- a/leetcode/0699.Falling-Squares/README.md
+++ b/leetcode/0699.Falling-Squares/README.md
@@ -1,7 +1,7 @@
# [699. Falling Squares](https://leetcode.com/problems/falling-squares/)
-## 题目:
+## 题目
On an infinite number line (x-axis), we drop given squares in the order they are given.
diff --git a/leetcode/0704.Binary-Search/README.md b/leetcode/0704.Binary-Search/README.md
index fd2c1b25..04e9647b 100755
--- a/leetcode/0704.Binary-Search/README.md
+++ b/leetcode/0704.Binary-Search/README.md
@@ -1,7 +1,7 @@
# [704. Binary Search](https://leetcode.com/problems/binary-search/)
-## 题目:
+## 题目
Given a **sorted** (in ascending order) integer array `nums` of `n` elements and a `target` value, write a function to search `target` in `nums`. If `target` exists, then return its index, otherwise return `-1`.
diff --git a/leetcode/0705.Design-HashSet/README.md b/leetcode/0705.Design-HashSet/README.md
index d4bb59c8..5377ace4 100755
--- a/leetcode/0705.Design-HashSet/README.md
+++ b/leetcode/0705.Design-HashSet/README.md
@@ -1,7 +1,7 @@
# [705. Design HashSet](https://leetcode.com/problems/design-hashset/)
-## 题目:
+## 题目
Design a HashSet without using any built-in hash table libraries.
diff --git a/leetcode/0706.Design-HashMap/README.md b/leetcode/0706.Design-HashMap/README.md
index e60ccc51..f0cbe681 100755
--- a/leetcode/0706.Design-HashMap/README.md
+++ b/leetcode/0706.Design-HashMap/README.md
@@ -1,7 +1,7 @@
# [706. Design HashMap](https://leetcode.com/problems/design-hashmap/)
-## 题目:
+## 题目
Design a HashMap without using any built-in hash table libraries.
diff --git a/leetcode/0715.Range-Module/README.md b/leetcode/0715.Range-Module/README.md
index 501a1678..1d5fefed 100755
--- a/leetcode/0715.Range-Module/README.md
+++ b/leetcode/0715.Range-Module/README.md
@@ -1,7 +1,7 @@
# [715. Range Module](https://leetcode.com/problems/range-module/)
-## 题目:
+## 题目
A Range Module is a module that tracks ranges of numbers. Your task is to design and implement the following interfaces in an efficient manner.
diff --git a/leetcode/0718.Maximum-Length-of-Repeated-Subarray/README.md b/leetcode/0718.Maximum-Length-of-Repeated-Subarray/README.md
index 71b2388e..6b6f3b10 100755
--- a/leetcode/0718.Maximum-Length-of-Repeated-Subarray/README.md
+++ b/leetcode/0718.Maximum-Length-of-Repeated-Subarray/README.md
@@ -1,7 +1,7 @@
# [718. Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/)
-## 题目:
+## 题目
Given two integer arrays `A` and `B`, return the maximum length of an subarray that appears in both arrays.
diff --git a/leetcode/0719.Find-K-th-Smallest-Pair-Distance/README.md b/leetcode/0719.Find-K-th-Smallest-Pair-Distance/README.md
index 7d74faac..980e93ed 100755
--- a/leetcode/0719.Find-K-th-Smallest-Pair-Distance/README.md
+++ b/leetcode/0719.Find-K-th-Smallest-Pair-Distance/README.md
@@ -1,7 +1,7 @@
# [719. Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance/)
-## 题目:
+## 题目
Given an integer array, return the k-th smallest **distance** among all the pairs. The distance of a pair (A, B) is defined as the absolute difference between A and B.
diff --git a/leetcode/0721.Accounts-Merge/README.md b/leetcode/0721.Accounts-Merge/README.md
index cb8f3bd2..c3f6a4c0 100755
--- a/leetcode/0721.Accounts-Merge/README.md
+++ b/leetcode/0721.Accounts-Merge/README.md
@@ -1,7 +1,7 @@
# [721. Accounts Merge](https://leetcode.com/problems/accounts-merge/)
-## 题目:
+## 题目
Given a list `accounts`, each element `accounts[i]` is a list of strings, where the first element `accounts[i][0]` is a name, and the rest of the elements are emailsrepresenting emails of the account.
diff --git a/leetcode/0729.My-Calendar-I/README.md b/leetcode/0729.My-Calendar-I/README.md
index 63ec80aa..a2c6a3ff 100755
--- a/leetcode/0729.My-Calendar-I/README.md
+++ b/leetcode/0729.My-Calendar-I/README.md
@@ -1,7 +1,7 @@
# [729. My Calendar I](https://leetcode.com/problems/my-calendar-i/)
-## 题目:
+## 题目
Implement a `MyCalendar` class to store your events. A new event can be added if adding the event will not cause a double booking.
diff --git a/leetcode/0732.My-Calendar-III/README.md b/leetcode/0732.My-Calendar-III/README.md
index 0f050dd1..44a6781c 100755
--- a/leetcode/0732.My-Calendar-III/README.md
+++ b/leetcode/0732.My-Calendar-III/README.md
@@ -1,7 +1,7 @@
# [732. My Calendar III](https://leetcode.com/problems/my-calendar-iii/)
-## 题目:
+## 题目
Implement a `MyCalendarThree` class to store your events. A new event can **always** be added.
diff --git a/leetcode/0733.Flood-Fill/README.md b/leetcode/0733.Flood-Fill/README.md
index 740e7faa..33f3c851 100755
--- a/leetcode/0733.Flood-Fill/README.md
+++ b/leetcode/0733.Flood-Fill/README.md
@@ -1,7 +1,7 @@
# [733. Flood Fill](https://leetcode.com/problems/flood-fill/)
-## 题目:
+## 题目
An `image` is represented by a 2-D array of integers, each integer representing the pixel value of the image (from 0 to 65535).
diff --git a/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target/README.md b/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target/README.md
index 545dd21f..1648f75f 100755
--- a/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target/README.md
+++ b/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target/README.md
@@ -1,7 +1,7 @@
# [744. Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target/)
-## 题目:
+## 题目
Given a list of sorted characters `letters` containing only lowercase letters, and given a target letter `target`, find the smallest element in the list that is larger than the given target.
diff --git a/leetcode/0748.Shortest-Completing-Word/README.md b/leetcode/0748.Shortest-Completing-Word/README.md
index 94d227c2..1002568d 100755
--- a/leetcode/0748.Shortest-Completing-Word/README.md
+++ b/leetcode/0748.Shortest-Completing-Word/README.md
@@ -1,7 +1,7 @@
# [748. Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word/)
-## 题目:
+## 题目
Find the minimum length word from a given dictionary `words`, which has all the letters from the string `licensePlate`. Such a word is said to complete the given string `licensePlate`
diff --git a/leetcode/0753.Cracking-the-Safe/README.md b/leetcode/0753.Cracking-the-Safe/README.md
index ff056cce..39c79a48 100644
--- a/leetcode/0753.Cracking-the-Safe/README.md
+++ b/leetcode/0753.Cracking-the-Safe/README.md
@@ -1,4 +1,5 @@
-# 753. Cracking the Safe
+# [753. Cracking the Safe](https://leetcode.com/problems/cracking-the-safe/)
+
## 题目
diff --git a/leetcode/0756.Pyramid-Transition-Matrix/README.md b/leetcode/0756.Pyramid-Transition-Matrix/README.md
index 445ab0e6..5b0acbcf 100755
--- a/leetcode/0756.Pyramid-Transition-Matrix/README.md
+++ b/leetcode/0756.Pyramid-Transition-Matrix/README.md
@@ -1,7 +1,7 @@
# [756. Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix/)
-## 题目:
+## 题目
We are stacking blocks to form a pyramid. Each block has a color which is a one letter string.
diff --git a/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/README.md b/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/README.md
index 1c81d5cd..4cc91b23 100755
--- a/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/README.md
+++ b/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/README.md
@@ -1,7 +1,7 @@
# [762. Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/)
-## 题目:
+## 题目
Given two integers `L` and `R`, find the count of numbers in the range `[L, R]` (inclusive) having a prime number of set bits in their binary representation.
diff --git a/leetcode/0765.Couples-Holding-Hands/README.md b/leetcode/0765.Couples-Holding-Hands/README.md
index e833ead3..631557d9 100755
--- a/leetcode/0765.Couples-Holding-Hands/README.md
+++ b/leetcode/0765.Couples-Holding-Hands/README.md
@@ -1,7 +1,7 @@
# [765. Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands/)
-## 题目:
+## 题目
N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum number of swaps so that every couple is sitting side by side. A swap consists of choosing **any** two people, then they stand up and switch seats.
diff --git a/leetcode/0771.Jewels-and-Stones/README.md b/leetcode/0771.Jewels-and-Stones/README.md
index 9b7ac381..9dd0e34c 100755
--- a/leetcode/0771.Jewels-and-Stones/README.md
+++ b/leetcode/0771.Jewels-and-Stones/README.md
@@ -2,7 +2,7 @@
-## 题目:
+## 题目
You're given strings `J` representing the types of stones that are jewels, and `S` representing the stones you have. Each character in `S` is a type of stone you have. You want to know how many of the stones you have are also jewels.
diff --git a/leetcode/0778.Swim-in-Rising-Water/README.md b/leetcode/0778.Swim-in-Rising-Water/README.md
index 237e932e..2e548932 100755
--- a/leetcode/0778.Swim-in-Rising-Water/README.md
+++ b/leetcode/0778.Swim-in-Rising-Water/README.md
@@ -1,7 +1,7 @@
# [778. Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water/)
-## 题目:
+## 题目
On an N x N `grid`, each square `grid[i][j]` represents the elevation at that point `(i,j)`.
diff --git a/leetcode/0781.Rabbits-in-Forest/README.md b/leetcode/0781.Rabbits-in-Forest/README.md
index c6c5576b..2684d656 100755
--- a/leetcode/0781.Rabbits-in-Forest/README.md
+++ b/leetcode/0781.Rabbits-in-Forest/README.md
@@ -1,7 +1,7 @@
# [781. Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest/)
-## 题目:
+## 题目
In a forest, each rabbit has some color. Some subset of rabbits (possibly all of them) tell you how many other rabbits have the same color as them. Those `answers` are placed in an array.
diff --git a/leetcode/0786.K-th-Smallest-Prime-Fraction/README.md b/leetcode/0786.K-th-Smallest-Prime-Fraction/README.md
index c8ee4797..0238ff8b 100755
--- a/leetcode/0786.K-th-Smallest-Prime-Fraction/README.md
+++ b/leetcode/0786.K-th-Smallest-Prime-Fraction/README.md
@@ -1,7 +1,7 @@
# [786. K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction/)
-## 题目:
+## 题目
A sorted list `A` contains 1, plus some number of primes. Then, for every p < q in the list, we consider the fraction p/q.
diff --git a/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function/README.md b/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function/README.md
index b461f259..2e01316e 100755
--- a/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function/README.md
+++ b/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function/README.md
@@ -1,7 +1,7 @@
# [793. Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function/)
-## 题目:
+## 题目
Let `f(x)` be the number of zeroes at the end of `x!`. (Recall that `x! = 1 * 2 * 3 * ... * x`, and by convention, `0! = 1`.)
diff --git a/leetcode/0802.Find-Eventual-Safe-States/README.md b/leetcode/0802.Find-Eventual-Safe-States/README.md
index 75e8eaee..f6879f30 100644
--- a/leetcode/0802.Find-Eventual-Safe-States/README.md
+++ b/leetcode/0802.Find-Eventual-Safe-States/README.md
@@ -1,4 +1,5 @@
-# 802. Find Eventual Safe States
+# [802. Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states/)
+
## 题目
diff --git a/leetcode/0803.Bricks-Falling-When-Hit/README.md b/leetcode/0803.Bricks-Falling-When-Hit/README.md
index 744d86e7..dd9719e5 100755
--- a/leetcode/0803.Bricks-Falling-When-Hit/README.md
+++ b/leetcode/0803.Bricks-Falling-When-Hit/README.md
@@ -1,7 +1,7 @@
# [803. Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit/)
-## 题目:
+## 题目
We have a grid of 1s and 0s; the 1s in a cell represent bricks. A brick will not drop if and only if it is directly connected to the top of the grid, or at least one of its (4-way) adjacent bricks will not drop.
diff --git a/leetcode/0811.Subdomain-Visit-Count/README.md b/leetcode/0811.Subdomain-Visit-Count/README.md
index e4933942..6348dfc5 100755
--- a/leetcode/0811.Subdomain-Visit-Count/README.md
+++ b/leetcode/0811.Subdomain-Visit-Count/README.md
@@ -1,7 +1,7 @@
# [811. Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/)
-## 题目:
+## 题目
A website domain like "discuss.leetcode.com" consists of various subdomains. At the top level, we have "com", at the next level, we have "leetcode.com", and at the lowest level, "discuss.leetcode.com". When we visit a domain like "discuss.leetcode.com", we will also visit the parent domains "leetcode.com" and "com" implicitly.
diff --git a/leetcode/0815.Bus-Routes/README.md b/leetcode/0815.Bus-Routes/README.md
index 59c8b1b9..2fd6e073 100755
--- a/leetcode/0815.Bus-Routes/README.md
+++ b/leetcode/0815.Bus-Routes/README.md
@@ -1,7 +1,7 @@
# [815. Bus Routes](https://leetcode.com/problems/bus-routes/)
-## 题目:
+## 题目
We have a list of bus routes. Each `routes[i]` is a bus route that the i-th bus repeats forever. For example if `routes[0] = [1, 5, 7]`, this means that the first bus (0-th indexed) travels in the sequence 1->5->7->1->5->7->1->... forever.
diff --git a/leetcode/0819.Most-Common-Word/README.md b/leetcode/0819.Most-Common-Word/README.md
index ec371373..2d4b3ad5 100755
--- a/leetcode/0819.Most-Common-Word/README.md
+++ b/leetcode/0819.Most-Common-Word/README.md
@@ -1,7 +1,7 @@
# [819. Most Common Word](https://leetcode.com/problems/most-common-word/)
-## 题目:
+## 题目
Given a paragraph and a list of banned words, return the most frequent word that is not in the list of banned words. It is guaranteed there is at least one word that isn't banned, and that the answer is unique.
diff --git a/leetcode/0834.Sum-of-Distances-in-Tree/README.md b/leetcode/0834.Sum-of-Distances-in-Tree/README.md
index c29d9c44..20d5b424 100755
--- a/leetcode/0834.Sum-of-Distances-in-Tree/README.md
+++ b/leetcode/0834.Sum-of-Distances-in-Tree/README.md
@@ -1,7 +1,7 @@
# [834. Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree/)
-## 题目:
+## 题目
An undirected, connected tree with `N` nodes labelled `0...N-1` and `N-1edges` are given.
diff --git a/leetcode/0836.Rectangle-Overlap/README.md b/leetcode/0836.Rectangle-Overlap/README.md
index fa9e4c77..a10a8f2b 100755
--- a/leetcode/0836.Rectangle-Overlap/README.md
+++ b/leetcode/0836.Rectangle-Overlap/README.md
@@ -1,7 +1,7 @@
# [836. Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap/)
-## 题目:
+## 题目
A rectangle is represented as a list `[x1, y1, x2, y2]`, where `(x1, y1)` are the coordinates of its bottom-left corner, and `(x2, y2)` are the coordinates of its top-right corner.
diff --git a/leetcode/0839.Similar-String-Groups/README.md b/leetcode/0839.Similar-String-Groups/README.md
index 4d20c601..aef19b6c 100755
--- a/leetcode/0839.Similar-String-Groups/README.md
+++ b/leetcode/0839.Similar-String-Groups/README.md
@@ -1,7 +1,7 @@
# [839. Similar String Groups](https://leetcode.com/problems/similar-string-groups/)
-## 题目:
+## 题目
Two strings `X` and `Y` are similar if we can swap two letters (in different positions) of `X`, so that it equals `Y`.
diff --git a/leetcode/0841.Keys-and-Rooms/README.md b/leetcode/0841.Keys-and-Rooms/README.md
index 66c1f23d..69d1da3a 100644
--- a/leetcode/0841.Keys-and-Rooms/README.md
+++ b/leetcode/0841.Keys-and-Rooms/README.md
@@ -1,4 +1,5 @@
-# 841. Keys and Rooms
+# [841. Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/)
+
## 题目
diff --git a/leetcode/0850.Rectangle-Area-II/README.md b/leetcode/0850.Rectangle-Area-II/README.md
index 4951f3dc..f21316d0 100755
--- a/leetcode/0850.Rectangle-Area-II/README.md
+++ b/leetcode/0850.Rectangle-Area-II/README.md
@@ -1,7 +1,7 @@
# [850. Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii/)
-## 题目:
+## 题目
We are given a list of (axis-aligned) `rectangles`. Each `rectangle[i] = [x1, y1, x2, y2]` , where (x1, y1) are the coordinates of the bottom-left corner, and (x2, y2) are the coordinates of the top-right corner of the `i`th rectangle.
diff --git a/leetcode/0851.Loud-and-Rich/README.md b/leetcode/0851.Loud-and-Rich/README.md
index 06fbd86e..26351328 100644
--- a/leetcode/0851.Loud-and-Rich/README.md
+++ b/leetcode/0851.Loud-and-Rich/README.md
@@ -1,4 +1,5 @@
-# 851. Loud and Rich
+# [851. Loud and Rich](https://leetcode.com/problems/loud-and-rich/)
+
## 题目
diff --git a/leetcode/0852.Peak-Index-in-a-Mountain-Array/README.md b/leetcode/0852.Peak-Index-in-a-Mountain-Array/README.md
index 3d1ed48d..ad167925 100755
--- a/leetcode/0852.Peak-Index-in-a-Mountain-Array/README.md
+++ b/leetcode/0852.Peak-Index-in-a-Mountain-Array/README.md
@@ -1,7 +1,7 @@
# [852. Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/)
-## 题目:
+## 题目
Let's call an array `A` a *mountain* if the following properties hold:
diff --git a/leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K/README.md b/leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K/README.md
index 60f0785c..469ca3bd 100644
--- a/leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K/README.md
+++ b/leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K/README.md
@@ -1,4 +1,5 @@
-# 862. Shortest Subarray with Sum at Least K
+# [862. Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/)
+
## 题目
diff --git a/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree/README.md b/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree/README.md
index db5a3d7e..4ea32b20 100644
--- a/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree/README.md
+++ b/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree/README.md
@@ -1,4 +1,5 @@
-# 863. All Nodes Distance K in Binary Tree
+# [863. All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/)
+
## 题目
diff --git a/leetcode/0864.Shortest-Path-to-Get-All-Keys/README.md b/leetcode/0864.Shortest-Path-to-Get-All-Keys/README.md
index 3b217024..b595b525 100755
--- a/leetcode/0864.Shortest-Path-to-Get-All-Keys/README.md
+++ b/leetcode/0864.Shortest-Path-to-Get-All-Keys/README.md
@@ -1,7 +1,7 @@
# [864. Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys/)
-## 题目:
+## 题目
We are given a 2-dimensional `grid`. `"."` is an empty cell, `"#"` is a wall, `"@"` is the starting point, (`"a"`, `"b"`, ...) are keys, and (`"A"`, `"B"`, ...) are locks.
diff --git a/leetcode/0872.Leaf-Similar-Trees/README.md b/leetcode/0872.Leaf-Similar-Trees/README.md
index 947eabd9..900b7e74 100644
--- a/leetcode/0872.Leaf-Similar-Trees/README.md
+++ b/leetcode/0872.Leaf-Similar-Trees/README.md
@@ -1,4 +1,5 @@
-# 872. Leaf-Similar Trees
+# [872. Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees/)
+
## 题目
diff --git a/leetcode/0875.Koko-Eating-Bananas/README.md b/leetcode/0875.Koko-Eating-Bananas/README.md
index cf22449e..f706668a 100755
--- a/leetcode/0875.Koko-Eating-Bananas/README.md
+++ b/leetcode/0875.Koko-Eating-Bananas/README.md
@@ -1,7 +1,7 @@
# [875. Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas/)
-## 题目:
+## 题目
Koko loves to eat bananas. There are `N` piles of bananas, the `i`-th pile has `piles[i]` bananas. The guards have gone and will come back in `H` hours.
diff --git a/leetcode/0878.Nth-Magical-Number/README.md b/leetcode/0878.Nth-Magical-Number/README.md
index 77f1a657..2ff41dc8 100755
--- a/leetcode/0878.Nth-Magical-Number/README.md
+++ b/leetcode/0878.Nth-Magical-Number/README.md
@@ -1,7 +1,7 @@
# [878. Nth Magical Number](https://leetcode.com/problems/nth-magical-number/)
-## 题目:
+## 题目
A positive integer is *magical* if it is divisible by either A or B.
diff --git a/leetcode/0884.Uncommon-Words-from-Two-Sentences/README.md b/leetcode/0884.Uncommon-Words-from-Two-Sentences/README.md
index 98be131c..fb1c5d8b 100755
--- a/leetcode/0884.Uncommon-Words-from-Two-Sentences/README.md
+++ b/leetcode/0884.Uncommon-Words-from-Two-Sentences/README.md
@@ -1,7 +1,7 @@
# [884. Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences/)
-## 题目:
+## 题目
We are given two sentences `A` and `B`. (A *sentence* is a string of space separated words. Each *word* consists only of lowercase letters.)
diff --git a/leetcode/0887.Super-Egg-Drop/README.md b/leetcode/0887.Super-Egg-Drop/README.md
index dc1d32ec..7c0a0b6c 100755
--- a/leetcode/0887.Super-Egg-Drop/README.md
+++ b/leetcode/0887.Super-Egg-Drop/README.md
@@ -1,7 +1,7 @@
# [887. Super Egg Drop](https://leetcode.com/problems/super-egg-drop/)
-## 题目:
+## 题目
You are given `K` eggs, and you have access to a building with `N` floors from `1` to `N`.
diff --git a/leetcode/0897.Increasing-Order-Search-Tree/README.md b/leetcode/0897.Increasing-Order-Search-Tree/README.md
index d5a5de4e..579e2fde 100755
--- a/leetcode/0897.Increasing-Order-Search-Tree/README.md
+++ b/leetcode/0897.Increasing-Order-Search-Tree/README.md
@@ -1,7 +1,7 @@
# [897. Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree/)
-## 题目:
+## 题目
Given a binary search tree, rearrange the tree in **in-order** so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only 1 right child.
diff --git a/leetcode/0898.Bitwise-ORs-of-Subarrays/README.md b/leetcode/0898.Bitwise-ORs-of-Subarrays/README.md
index 23df36dd..5dcb6eae 100755
--- a/leetcode/0898.Bitwise-ORs-of-Subarrays/README.md
+++ b/leetcode/0898.Bitwise-ORs-of-Subarrays/README.md
@@ -1,7 +1,7 @@
# [898. Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays/)
-## 题目:
+## 题目
We have an array `A` of non-negative integers.
diff --git a/leetcode/0911.Online-Election/README.md b/leetcode/0911.Online-Election/README.md
index 19b8607e..98a0bc69 100755
--- a/leetcode/0911.Online-Election/README.md
+++ b/leetcode/0911.Online-Election/README.md
@@ -1,7 +1,7 @@
# [911. Online Election](https://leetcode.com/problems/online-election/)
-## 题目:
+## 题目
In an election, the `i`-th vote was cast for `persons[i]` at time `times[i]`.
diff --git a/leetcode/0918.Maximum-Sum-Circular-Subarray/README.md b/leetcode/0918.Maximum-Sum-Circular-Subarray/README.md
index 080d27d3..81ade3d0 100755
--- a/leetcode/0918.Maximum-Sum-Circular-Subarray/README.md
+++ b/leetcode/0918.Maximum-Sum-Circular-Subarray/README.md
@@ -1,7 +1,7 @@
# [918. Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray/)
-## 题目:
+## 题目
Given a **circular array** **C** of integers represented by `A`, find the maximum possible sum of a non-empty subarray of **C**.
diff --git a/leetcode/0920.Number-of-Music-Playlists/README.md b/leetcode/0920.Number-of-Music-Playlists/README.md
index a328fde0..195802f4 100755
--- a/leetcode/0920.Number-of-Music-Playlists/README.md
+++ b/leetcode/0920.Number-of-Music-Playlists/README.md
@@ -1,7 +1,7 @@
# [920. Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists/)
-## 题目:
+## 题目
Your music player contains `N` different songs and she wants to listen to `L` ****(not necessarily different) songs during your trip. You create a playlist so that:
diff --git a/leetcode/0924.Minimize-Malware-Spread/README.md b/leetcode/0924.Minimize-Malware-Spread/README.md
index b293461f..7e990af9 100755
--- a/leetcode/0924.Minimize-Malware-Spread/README.md
+++ b/leetcode/0924.Minimize-Malware-Spread/README.md
@@ -1,7 +1,7 @@
# [924. Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread/)
-## 题目:
+## 题目
In a network of nodes, each node `i` is directly connected to another node `j` if and only if `graph[i][j] = 1`.
diff --git a/leetcode/0927.Three-Equal-Parts/README.md b/leetcode/0927.Three-Equal-Parts/README.md
index 02013846..27650b40 100755
--- a/leetcode/0927.Three-Equal-Parts/README.md
+++ b/leetcode/0927.Three-Equal-Parts/README.md
@@ -1,7 +1,7 @@
# [927. Three Equal Parts](https://leetcode.com/problems/three-equal-parts/)
-## 题目:
+## 题目
Given an array `A` of `0`s and `1`s, divide the array into 3 non-empty parts such that all of these parts represent the same binary value.
diff --git a/leetcode/0928.Minimize-Malware-Spread-II/README.md b/leetcode/0928.Minimize-Malware-Spread-II/README.md
index 3e39df6a..f245cebe 100755
--- a/leetcode/0928.Minimize-Malware-Spread-II/README.md
+++ b/leetcode/0928.Minimize-Malware-Spread-II/README.md
@@ -1,7 +1,7 @@
# [928. Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii/)
-## 题目:
+## 题目
(This problem is the same as *Minimize Malware Spread*, with the differences bolded.)
diff --git a/leetcode/0933.Number-of-Recent-Calls/README.md b/leetcode/0933.Number-of-Recent-Calls/README.md
index f50918b1..f4eebfaf 100644
--- a/leetcode/0933.Number-of-Recent-Calls/README.md
+++ b/leetcode/0933.Number-of-Recent-Calls/README.md
@@ -1,4 +1,5 @@
-# 933. Number of Recent Calls
+# [933. Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/)
+
### 题目
diff --git a/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column/README.md b/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column/README.md
index 1021516f..2343226d 100755
--- a/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column/README.md
+++ b/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column/README.md
@@ -1,7 +1,7 @@
# [947. Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/)
-## 题目:
+## 题目
On a 2D plane, we place stones at some integer coordinate points. Each coordinate point may have at most one stone.
diff --git a/leetcode/0952.Largest-Component-Size-by-Common-Factor/README.md b/leetcode/0952.Largest-Component-Size-by-Common-Factor/README.md
index 52074d79..4a2c9226 100755
--- a/leetcode/0952.Largest-Component-Size-by-Common-Factor/README.md
+++ b/leetcode/0952.Largest-Component-Size-by-Common-Factor/README.md
@@ -1,7 +1,7 @@
# [952. Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor/)
-## 题目:
+## 题目
Given a non-empty array of unique positive integers `A`, consider the following graph:
diff --git a/leetcode/0953.Verifying-an-Alien-Dictionary/README.md b/leetcode/0953.Verifying-an-Alien-Dictionary/README.md
index 3a1cadac..2f02a10a 100755
--- a/leetcode/0953.Verifying-an-Alien-Dictionary/README.md
+++ b/leetcode/0953.Verifying-an-Alien-Dictionary/README.md
@@ -1,7 +1,7 @@
# [953. Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary/)
-## 题目:
+## 题目
In an alien language, surprisingly they also use english lowercase letters, but possibly in a different `order`. The `order`of the alphabet is some permutation of lowercase letters.
diff --git a/leetcode/0959.Regions-Cut-By-Slashes/README.md b/leetcode/0959.Regions-Cut-By-Slashes/README.md
index 918e0531..f2ca8496 100755
--- a/leetcode/0959.Regions-Cut-By-Slashes/README.md
+++ b/leetcode/0959.Regions-Cut-By-Slashes/README.md
@@ -1,7 +1,7 @@
# [959. Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes/)
-## 题目:
+## 题目
In a N x N `grid` composed of 1 x 1 squares, each 1 x 1 square consists of a `/`, `\`, or blank space. These characters divide the square into contiguous regions.
diff --git a/leetcode/0961.N-Repeated-Element-in-Size-2N-Array/README.md b/leetcode/0961.N-Repeated-Element-in-Size-2N-Array/README.md
index 4ba8d390..a2687640 100755
--- a/leetcode/0961.N-Repeated-Element-in-Size-2N-Array/README.md
+++ b/leetcode/0961.N-Repeated-Element-in-Size-2N-Array/README.md
@@ -1,7 +1,7 @@
# [961. N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/)
-## 题目:
+## 题目
In a array `A` of size `2N`, there are `N+1` unique elements, and exactly one of these elements is repeated N times.
diff --git a/leetcode/0968.Binary-Tree-Cameras/README.md b/leetcode/0968.Binary-Tree-Cameras/README.md
index b68fffe3..03458332 100755
--- a/leetcode/0968.Binary-Tree-Cameras/README.md
+++ b/leetcode/0968.Binary-Tree-Cameras/README.md
@@ -1,6 +1,6 @@
# [968. Binary Tree Cameras](https://leetcode.com/problems/binary-tree-cameras/)
-## 题目:
+## 题目
Given a binary tree, we install cameras on the nodes of the tree.
diff --git a/leetcode/0970.Powerful-Integers/README.md b/leetcode/0970.Powerful-Integers/README.md
index 7f49306b..31176a5d 100755
--- a/leetcode/0970.Powerful-Integers/README.md
+++ b/leetcode/0970.Powerful-Integers/README.md
@@ -1,7 +1,7 @@
# [970. Powerful Integers](https://leetcode.com/problems/powerful-integers/)
-## 题目:
+## 题目
Given two positive integers `x` and `y`, an integer is *powerful* if it is equal to `x^i + y^j` for some integers `i >= 0` and `j >= 0`.
diff --git a/leetcode/0978.Longest-Turbulent-Subarray/README.md b/leetcode/0978.Longest-Turbulent-Subarray/README.md
index 4b0bbd49..01583dee 100755
--- a/leetcode/0978.Longest-Turbulent-Subarray/README.md
+++ b/leetcode/0978.Longest-Turbulent-Subarray/README.md
@@ -1,6 +1,6 @@
# [978. Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray/)
-## 题目:
+## 题目
A subarray `A[i], A[i+1], ..., A[j]` of `A` is said to be *turbulent* if and only if:
diff --git a/leetcode/0979.Distribute-Coins-in-Binary-Tree/README.md b/leetcode/0979.Distribute-Coins-in-Binary-Tree/README.md
index 13f801b4..45bff64f 100755
--- a/leetcode/0979.Distribute-Coins-in-Binary-Tree/README.md
+++ b/leetcode/0979.Distribute-Coins-in-Binary-Tree/README.md
@@ -1,7 +1,7 @@
# [979. Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree/)
-## 题目:
+## 题目
Given the `root` of a binary tree with `N` nodes, each `node` in the tree has `node.val` coins, and there are `N` coins total.
diff --git a/leetcode/0981.Time-Based-Key-Value-Store/README.md b/leetcode/0981.Time-Based-Key-Value-Store/README.md
index c4f32582..ae143664 100755
--- a/leetcode/0981.Time-Based-Key-Value-Store/README.md
+++ b/leetcode/0981.Time-Based-Key-Value-Store/README.md
@@ -1,7 +1,7 @@
# [981. Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/)
-## 题目:
+## 题目
Create a timebased key-value store class `TimeMap`, that supports two operations.
diff --git a/leetcode/0984.String-Without-AAA-or-BBB/README.md b/leetcode/0984.String-Without-AAA-or-BBB/README.md
index 9b7a0406..fbde8316 100755
--- a/leetcode/0984.String-Without-AAA-or-BBB/README.md
+++ b/leetcode/0984.String-Without-AAA-or-BBB/README.md
@@ -1,7 +1,7 @@
# [984. String Without AAA or BBB](https://leetcode.com/problems/string-without-aaa-or-bbb/)
-## 题目:
+## 题目
Given two integers `A` and `B`, return **any** string `S` such that:
diff --git a/leetcode/0990.Satisfiability-of-Equality-Equations/README.md b/leetcode/0990.Satisfiability-of-Equality-Equations/README.md
index 2d32532b..9b619683 100755
--- a/leetcode/0990.Satisfiability-of-Equality-Equations/README.md
+++ b/leetcode/0990.Satisfiability-of-Equality-Equations/README.md
@@ -1,7 +1,7 @@
# [990. Satisfiability of Equality Equations](https://leetcode.com/problems/satisfiability-of-equality-equations/)
-## 题目:
+## 题目
Given an array equations of strings that represent relationships between variables, each string `equations[i]` has length `4` and takes one of two different forms: `"a==b"` or `"a!=b"`. Here, `a` and `b` are lowercase letters (not necessarily different) that represent one-letter variable names.
diff --git a/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/README.md b/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/README.md
index 8a47847d..1c0d06ef 100755
--- a/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/README.md
+++ b/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/README.md
@@ -1,7 +1,7 @@
# [995. Minimum Number of K Consecutive Bit Flips](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/)
-## 题目:
+## 题目
In an array `A` containing only 0s and 1s, a `K`-bit flip consists of choosing a (contiguous) subarray of length `K` and simultaneously changing every 0 in the subarray to 1, and every 1 in the subarray to 0.
diff --git a/leetcode/1002.Find-Common-Characters/README.md b/leetcode/1002.Find-Common-Characters/README.md
index 612bb214..ced9fa2c 100755
--- a/leetcode/1002.Find-Common-Characters/README.md
+++ b/leetcode/1002.Find-Common-Characters/README.md
@@ -1,7 +1,7 @@
# [1002. Find Common Characters](https://leetcode.com/problems/find-common-characters/)
-## 题目:
+## 题目
Given an array `A` of strings made only from lowercase letters, return a list of all characters that show up in all strings within the list **(including duplicates)**. For example, if a character occurs 3 times in all strings but not 4 times, you need to include that character three times in the final answer.
diff --git a/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days/README.md b/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days/README.md
index 2da8d0d6..ba21809c 100755
--- a/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days/README.md
+++ b/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days/README.md
@@ -1,7 +1,7 @@
# [1011. Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/)
-## 题目:
+## 题目
A conveyor belt has packages that must be shipped from one port to another within `D` days.
diff --git a/leetcode/1017.Convert-to-Base--2/README.md b/leetcode/1017.Convert-to-Base--2/README.md
index 7c4bbfdd..addd0bea 100755
--- a/leetcode/1017.Convert-to-Base--2/README.md
+++ b/leetcode/1017.Convert-to-Base--2/README.md
@@ -1,7 +1,7 @@
# [1017. Convert to Base -2](https://leetcode.com/problems/convert-to-base-2/)
-## 题目:
+## 题目
Given a number `N`, return a string consisting of `"0"`s and `"1"`s that represents its value in base **`-2`** (negative two).
diff --git a/leetcode/1020.Number-of-Enclaves/README.md b/leetcode/1020.Number-of-Enclaves/README.md
index 0c906756..34b72b3d 100644
--- a/leetcode/1020.Number-of-Enclaves/README.md
+++ b/leetcode/1020.Number-of-Enclaves/README.md
@@ -1,4 +1,5 @@
-# 1020. Number of Enclaves
+# [1020. Number of Enclaves](https://leetcode.com/problems/number-of-enclaves/)
+
## 题目
diff --git a/leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor/README.md b/leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor/README.md
index 5be95e44..b2c94617 100644
--- a/leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor/README.md
+++ b/leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor/README.md
@@ -1,4 +1,5 @@
-# 1026. Maximum Difference Between Node and Ancestor
+# [1026. Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/)
+
## 题目
diff --git a/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/README.md b/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/README.md
index afd39d11..5e7aef50 100755
--- a/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/README.md
+++ b/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal/README.md
@@ -1,7 +1,7 @@
# [1028. Recover a Tree From Preorder Traversal](https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/)
-## 题目:
+## 题目
We run a preorder depth first search on the `root` of a binary tree.
diff --git a/leetcode/1040.Moving-Stones-Until-Consecutive-II/README.md b/leetcode/1040.Moving-Stones-Until-Consecutive-II/README.md
index 8867a535..290839cb 100755
--- a/leetcode/1040.Moving-Stones-Until-Consecutive-II/README.md
+++ b/leetcode/1040.Moving-Stones-Until-Consecutive-II/README.md
@@ -1,7 +1,7 @@
# [1040. Moving Stones Until Consecutive II](https://leetcode.com/problems/moving-stones-until-consecutive-ii/)
-## 题目:
+## 题目
On an **infinite** number line, the position of the i-th stone is given by `stones[i]`. Call a stone an *endpoint stone* if it has the smallest or largest position.
diff --git a/leetcode/1049.Last-Stone-Weight-II/README.md b/leetcode/1049.Last-Stone-Weight-II/README.md
index 865456fa..fa176f97 100755
--- a/leetcode/1049.Last-Stone-Weight-II/README.md
+++ b/leetcode/1049.Last-Stone-Weight-II/README.md
@@ -1,6 +1,6 @@
# [1049. Last Stone Weight II](https://leetcode.com/problems/last-stone-weight-ii/)
-## 题目:
+## 题目
We have a collection of rocks, each rock has a positive integer weight.
diff --git a/leetcode/1052.Grumpy-Bookstore-Owner/README.md b/leetcode/1052.Grumpy-Bookstore-Owner/README.md
index 01d3f866..80e6cc23 100755
--- a/leetcode/1052.Grumpy-Bookstore-Owner/README.md
+++ b/leetcode/1052.Grumpy-Bookstore-Owner/README.md
@@ -1,7 +1,7 @@
# [1052. Grumpy Bookstore Owner](https://leetcode.com/problems/grumpy-bookstore-owner/)
-## 题目:
+## 题目
Today, the bookstore owner has a store open for `customers.length`minutes. Every minute, some number of customers (`customers[i]`) enter the store, and all those customers leave after the end of that minute.
diff --git a/leetcode/1073.Adding-Two-Negabinary-Numbers/README.md b/leetcode/1073.Adding-Two-Negabinary-Numbers/README.md
index 120958ba..3f433c1d 100755
--- a/leetcode/1073.Adding-Two-Negabinary-Numbers/README.md
+++ b/leetcode/1073.Adding-Two-Negabinary-Numbers/README.md
@@ -1,7 +1,7 @@
# [1073. Adding Two Negabinary Numbers](https://leetcode.com/problems/adding-two-negabinary-numbers/)
-## 题目:
+## 题目
Given two numbers `arr1` and `arr2` in base **-2**, return the result of adding them together.
diff --git a/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/README.md b/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/README.md
index 7866daa2..641b694a 100755
--- a/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/README.md
+++ b/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target/README.md
@@ -1,7 +1,7 @@
# [1074. Number of Submatrices That Sum to Target](https://leetcode.com/problems/number-of-submatrices-that-sum-to-target/)
-## 题目:
+## 题目
Given a `matrix`, and a `target`, return the number of non-empty submatrices that sum to target.
diff --git a/leetcode/1078.Occurrences-After-Bigram/README.md b/leetcode/1078.Occurrences-After-Bigram/README.md
index 73de067b..b9c546b7 100755
--- a/leetcode/1078.Occurrences-After-Bigram/README.md
+++ b/leetcode/1078.Occurrences-After-Bigram/README.md
@@ -1,7 +1,7 @@
# [1078. Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/)
-## 题目:
+## 题目
Given words `first` and `second`, consider occurrences in some `text` of the form "`first second third`", where `second` comes immediately after `first`, and `third`comes immediately after `second`.
diff --git a/leetcode/1105.Filling-Bookcase-Shelves/README.md b/leetcode/1105.Filling-Bookcase-Shelves/README.md
index 5dc7bc7c..af55f48b 100755
--- a/leetcode/1105.Filling-Bookcase-Shelves/README.md
+++ b/leetcode/1105.Filling-Bookcase-Shelves/README.md
@@ -1,7 +1,7 @@
# [1105. Filling Bookcase Shelves](https://leetcode.com/problems/filling-bookcase-shelves/)
-## 题目:
+## 题目
We have a sequence of `books`: the `i`-th book has thickness `books[i][0]`and height `books[i][1]`.
diff --git a/leetcode/1108.Defanging-an-IP-Address/README.md b/leetcode/1108.Defanging-an-IP-Address/README.md
index e5389dd7..e5306ee3 100755
--- a/leetcode/1108.Defanging-an-IP-Address/README.md
+++ b/leetcode/1108.Defanging-an-IP-Address/README.md
@@ -1,7 +1,7 @@
# [1108. Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/)
-## 题目:
+## 题目
Given a valid (IPv4) IP `address`, return a defanged version of that IP address.
diff --git a/leetcode/1110.Delete-Nodes-And-Return-Forest/README.md b/leetcode/1110.Delete-Nodes-And-Return-Forest/README.md
index 25c27b96..40219a65 100644
--- a/leetcode/1110.Delete-Nodes-And-Return-Forest/README.md
+++ b/leetcode/1110.Delete-Nodes-And-Return-Forest/README.md
@@ -1,4 +1,5 @@
-# 1110. Delete Nodes And Return Forest
+# [1110. Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest/)
+
## 题目
diff --git a/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/README.md b/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/README.md
index 56bdf8d6..662a4a89 100755
--- a/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/README.md
+++ b/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/README.md
@@ -1,7 +1,7 @@
# [1111. Maximum Nesting Depth of Two Valid Parentheses Strings](https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/)
-## 题目:
+## 题目
A string is a *valid parentheses string* (denoted VPS) if and only if it consists of `"("` and `")"` characters only, and:
diff --git a/leetcode/1122.Relative-Sort-Array/README.md b/leetcode/1122.Relative-Sort-Array/README.md
index 5beea10b..03955707 100755
--- a/leetcode/1122.Relative-Sort-Array/README.md
+++ b/leetcode/1122.Relative-Sort-Array/README.md
@@ -1,7 +1,7 @@
# [1122. Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)
-## 题目:
+## 题目
Given two arrays `arr1` and `arr2`, the elements of `arr2` are distinct, and all elements in `arr2` are also in `arr1`.
diff --git a/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/README.md b/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/README.md
index f2fd7eaa..8e249344 100755
--- a/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/README.md
+++ b/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/README.md
@@ -1,7 +1,7 @@
# [1123. Lowest Common Ancestor of Deepest Leaves](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/)
-## 题目:
+## 题目
Given a rooted binary tree, return the lowest common ancestor of its deepest leaves.
diff --git a/leetcode/1128.Number-of-Equivalent-Domino-Pairs/README.md b/leetcode/1128.Number-of-Equivalent-Domino-Pairs/README.md
index cce466a2..46c04a21 100755
--- a/leetcode/1128.Number-of-Equivalent-Domino-Pairs/README.md
+++ b/leetcode/1128.Number-of-Equivalent-Domino-Pairs/README.md
@@ -1,7 +1,7 @@
# [1128. Number of Equivalent Domino Pairs](https://leetcode.com/problems/number-of-equivalent-domino-pairs/)
-## 题目:
+## 题目
Given a list of `dominoes`, `dominoes[i] = [a, b]` is *equivalent* to `dominoes[j] = [c, d]` if and only if either (`a==c` and `b==d`), or (`a==d` and `b==c`) - that is, one domino can be rotated to be equal to another domino.
diff --git a/leetcode/1137.N-th-Tribonacci-Number/README.md b/leetcode/1137.N-th-Tribonacci-Number/README.md
index 03cfa081..246e9fcf 100755
--- a/leetcode/1137.N-th-Tribonacci-Number/README.md
+++ b/leetcode/1137.N-th-Tribonacci-Number/README.md
@@ -1,7 +1,7 @@
# [1137. N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)
-## 题目:
+## 题目
The Tribonacci sequence Tn is defined as follows:
diff --git a/leetcode/1145.Binary-Tree-Coloring-Game/README.md b/leetcode/1145.Binary-Tree-Coloring-Game/README.md
index 0ba49fc4..02fbc682 100644
--- a/leetcode/1145.Binary-Tree-Coloring-Game/README.md
+++ b/leetcode/1145.Binary-Tree-Coloring-Game/README.md
@@ -1,4 +1,5 @@
-# 1145. Binary Tree Coloring Game
+# [1145. Binary Tree Coloring Game](https://leetcode.com/problems/binary-tree-coloring-game/)
+
## 题目
diff --git a/leetcode/1154.Day-of-the-Year/README.md b/leetcode/1154.Day-of-the-Year/README.md
index 24109a83..771bd8fd 100755
--- a/leetcode/1154.Day-of-the-Year/README.md
+++ b/leetcode/1154.Day-of-the-Year/README.md
@@ -1,7 +1,7 @@
# [1154. Day of the Year](https://leetcode.com/problems/day-of-the-year/)
-## 题目:
+## 题目
Given a string `date` representing a [Gregorian calendar](https://en.wikipedia.org/wiki/Gregorian_calendar) date formatted as `YYYY-MM-DD`, return the day number of the year.
diff --git a/leetcode/1157.Online-Majority-Element-In-Subarray/README.md b/leetcode/1157.Online-Majority-Element-In-Subarray/README.md
index 5c7e8a13..6e63f4de 100755
--- a/leetcode/1157.Online-Majority-Element-In-Subarray/README.md
+++ b/leetcode/1157.Online-Majority-Element-In-Subarray/README.md
@@ -1,7 +1,7 @@
# [1157. Online Majority Element In Subarray](https://leetcode.com/problems/online-majority-element-in-subarray/)
-## 题目:
+## 题目
Implementing the class `MajorityChecker`, which has the following API:
diff --git a/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters/README.md b/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters/README.md
index 65234a87..5323e4bf 100755
--- a/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters/README.md
+++ b/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters/README.md
@@ -1,7 +1,7 @@
# [1160. Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)
-## 题目:
+## 题目
You are given an array of strings `words` and a string `chars`.
diff --git a/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/README.md b/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/README.md
index b9e18ce8..df051ec1 100755
--- a/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/README.md
+++ b/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/README.md
@@ -1,6 +1,6 @@
# [1170. Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/)
-## 题目:
+## 题目
Let's define a function `f(s)` over a non-empty string `s`, which calculates the frequency of the smallest character in `s`. For example, if `s = "dcce"` then `f(s) = 2` because the smallest character is `"c"` and its frequency is 2.
diff --git a/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/README.md b/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/README.md
index 462b7297..ceccd5e3 100755
--- a/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/README.md
+++ b/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/README.md
@@ -1,7 +1,7 @@
# [1171. Remove Zero Sum Consecutive Nodes from Linked List](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/)
-## 题目:
+## 题目
Given the `head` of a linked list, we repeatedly delete consecutive sequences of nodes that sum to `0` until there are no such sequences.
diff --git a/leetcode/1175.Prime-Arrangements/README.md b/leetcode/1175.Prime-Arrangements/README.md
index 7a8efad7..9a06579b 100755
--- a/leetcode/1175.Prime-Arrangements/README.md
+++ b/leetcode/1175.Prime-Arrangements/README.md
@@ -1,7 +1,7 @@
# [1175. Prime Arrangements](https://leetcode.com/problems/prime-arrangements/)
-## 题目:
+## 题目
Return the number of permutations of 1 to `n` so that prime numbers are at prime indices (1-indexed.)
diff --git a/leetcode/1184.Distance-Between-Bus-Stops/README.md b/leetcode/1184.Distance-Between-Bus-Stops/README.md
index b77bce66..e9af503d 100755
--- a/leetcode/1184.Distance-Between-Bus-Stops/README.md
+++ b/leetcode/1184.Distance-Between-Bus-Stops/README.md
@@ -1,6 +1,6 @@
# [1184. Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/)
-## 题目:
+## 题目
A bus has `n` stops numbered from `0` to `n - 1` that form a circle. We know the distance between all pairs of neighboring stops where `distance[i]` is the distance between the stops number `i` and `(i + 1) % n`.
diff --git a/leetcode/1185.Day-of-the-Week/README.md b/leetcode/1185.Day-of-the-Week/README.md
index c8389b70..cebb127f 100755
--- a/leetcode/1185.Day-of-the-Week/README.md
+++ b/leetcode/1185.Day-of-the-Week/README.md
@@ -1,7 +1,7 @@
# [1185. Day of the Week](https://leetcode.com/problems/day-of-the-week/)
-## 题目:
+## 题目
Given a date, return the corresponding day of the week for that date.
diff --git a/leetcode/1189.Maximum-Number-of-Balloons/README.md b/leetcode/1189.Maximum-Number-of-Balloons/README.md
index b55129e8..b2858af8 100755
--- a/leetcode/1189.Maximum-Number-of-Balloons/README.md
+++ b/leetcode/1189.Maximum-Number-of-Balloons/README.md
@@ -1,7 +1,7 @@
# [1189. Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/)
-## 题目:
+## 题目
Given a string `text`, you want to use the characters of `text` to form as many instances of the word **"balloon"** as possible.
diff --git a/leetcode/1200.Minimum-Absolute-Difference/README.md b/leetcode/1200.Minimum-Absolute-Difference/README.md
index f028d2f6..8634c547 100755
--- a/leetcode/1200.Minimum-Absolute-Difference/README.md
+++ b/leetcode/1200.Minimum-Absolute-Difference/README.md
@@ -1,7 +1,7 @@
# [1200. Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/)
-## 题目:
+## 题目
Given an array of **distinct** integers `arr`, find all pairs of elements with the minimum absolute difference of any two elements.
diff --git a/leetcode/1201.Ugly-Number-III/README.md b/leetcode/1201.Ugly-Number-III/README.md
index f33a936f..4b7451d1 100755
--- a/leetcode/1201.Ugly-Number-III/README.md
+++ b/leetcode/1201.Ugly-Number-III/README.md
@@ -1,7 +1,7 @@
# [1201. Ugly Number III](https://leetcode.com/problems/ugly-number-iii/)
-## 题目:
+## 题目
Write a program to find the `n`-th ugly number.
diff --git a/leetcode/1202.Smallest-String-With-Swaps/README.md b/leetcode/1202.Smallest-String-With-Swaps/README.md
index dabbf5ce..dee01cff 100755
--- a/leetcode/1202.Smallest-String-With-Swaps/README.md
+++ b/leetcode/1202.Smallest-String-With-Swaps/README.md
@@ -1,7 +1,7 @@
# [1202. Smallest String With Swaps](https://leetcode.com/problems/smallest-string-with-swaps/)
-## 题目:
+## 题目
You are given a string `s`, and an array of pairs of indices in the string `pairs` where `pairs[i] = [a, b]` indicates 2 indices(0-indexed) of the string.
diff --git a/leetcode/1207.Unique-Number-of-Occurrences/README.md b/leetcode/1207.Unique-Number-of-Occurrences/README.md
index 9d028711..434a91f8 100755
--- a/leetcode/1207.Unique-Number-of-Occurrences/README.md
+++ b/leetcode/1207.Unique-Number-of-Occurrences/README.md
@@ -1,7 +1,7 @@
# [1207. Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/)
-## 题目:
+## 题目
Given an array of integers `arr`, write a function that returns `true` if and only if the number of occurrences of each value in the array is unique.
diff --git a/leetcode/1208.Get-Equal-Substrings-Within-Budget/README.md b/leetcode/1208.Get-Equal-Substrings-Within-Budget/README.md
index 926824dc..0f73f580 100755
--- a/leetcode/1208.Get-Equal-Substrings-Within-Budget/README.md
+++ b/leetcode/1208.Get-Equal-Substrings-Within-Budget/README.md
@@ -1,7 +1,7 @@
# [1208. Get Equal Substrings Within Budget](https://leetcode.com/problems/get-equal-substrings-within-budget/)
-## 题目:
+## 题目
You are given two strings `s` and `t` of the same length. You want to change `s` to `t`. Changing the `i`-th character of `s` to `i`-th character of `t` costs `|s[i] - t[i]|` that is, the absolute difference between the ASCII values of the characters.
diff --git a/leetcode/1217.Play-with-Chips/README.md b/leetcode/1217.Play-with-Chips/README.md
index 569eda5d..7eb9669f 100755
--- a/leetcode/1217.Play-with-Chips/README.md
+++ b/leetcode/1217.Play-with-Chips/README.md
@@ -1,7 +1,7 @@
# [1217. Play with Chips](https://leetcode.com/problems/play-with-chips/)
-## 题目:
+## 题目
There are some chips, and the i-th chip is at position `chips[i]`.
diff --git a/leetcode/1221.Split-a-String-in-Balanced-Strings/README.md b/leetcode/1221.Split-a-String-in-Balanced-Strings/README.md
index 65cf78af..a73faf2b 100755
--- a/leetcode/1221.Split-a-String-in-Balanced-Strings/README.md
+++ b/leetcode/1221.Split-a-String-in-Balanced-Strings/README.md
@@ -1,7 +1,7 @@
# [1221. Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings/)
-## 题目:
+## 题目
Balanced strings are those who have equal quantity of 'L' and 'R' characters.
diff --git a/leetcode/1232.Check-If-It-Is-a-Straight-Line/README.md b/leetcode/1232.Check-If-It-Is-a-Straight-Line/README.md
index 3a2b9ac6..0801daa4 100755
--- a/leetcode/1232.Check-If-It-Is-a-Straight-Line/README.md
+++ b/leetcode/1232.Check-If-It-Is-a-Straight-Line/README.md
@@ -1,7 +1,7 @@
# [1232. Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line/)
-## 题目:
+## 题目
You are given an array `coordinates`, `coordinates[i] = [x, y]`, where `[x, y]` represents the coordinate of a point. Check if these points make a straight line in the XY plane.
diff --git a/leetcode/1234.Replace-the-Substring-for-Balanced-String/README.md b/leetcode/1234.Replace-the-Substring-for-Balanced-String/README.md
index 7b7b7525..15f7827b 100755
--- a/leetcode/1234.Replace-the-Substring-for-Balanced-String/README.md
+++ b/leetcode/1234.Replace-the-Substring-for-Balanced-String/README.md
@@ -1,7 +1,7 @@
# [1234. Replace the Substring for Balanced String](https://leetcode.com/problems/replace-the-substring-for-balanced-string/)
-## 题目:
+## 题目
You are given a string containing only 4 kinds of characters `'Q',` `'W', 'E'` and `'R'`.
diff --git a/leetcode/1235.Maximum-Profit-in-Job-Scheduling/README.md b/leetcode/1235.Maximum-Profit-in-Job-Scheduling/README.md
index 546c649e..8734dbde 100755
--- a/leetcode/1235.Maximum-Profit-in-Job-Scheduling/README.md
+++ b/leetcode/1235.Maximum-Profit-in-Job-Scheduling/README.md
@@ -1,7 +1,7 @@
# [1235. Maximum Profit in Job Scheduling](https://leetcode.com/problems/maximum-profit-in-job-scheduling/)
-## 题目:
+## 题目
We have `n` jobs, where every job is scheduled to be done from `startTime[i]` to `endTime[i]`, obtaining a profit of `profit[i]`.
diff --git a/leetcode/1252.Cells-with-Odd-Values-in-a-Matrix/README.md b/leetcode/1252.Cells-with-Odd-Values-in-a-Matrix/README.md
index 9b3c9f4a..eca3e8ba 100755
--- a/leetcode/1252.Cells-with-Odd-Values-in-a-Matrix/README.md
+++ b/leetcode/1252.Cells-with-Odd-Values-in-a-Matrix/README.md
@@ -1,7 +1,7 @@
# [1252. Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/)
-## 题目:
+## 题目
Given `n` and `m` which are the dimensions of a matrix initialized by zeros and given an array `indices` where `indices[i] = [ri, ci]`. For each pair of `[ri, ci]` you have to increment all cells in row `ri` and column `ci` by 1.
diff --git a/leetcode/1254.Number-of-Closed-Islands/README.md b/leetcode/1254.Number-of-Closed-Islands/README.md
index 7e3ee74c..3ff8da1a 100755
--- a/leetcode/1254.Number-of-Closed-Islands/README.md
+++ b/leetcode/1254.Number-of-Closed-Islands/README.md
@@ -1,7 +1,7 @@
# [1254. Number of Closed Islands](https://leetcode.com/problems/number-of-closed-islands/)
-## 题目:
+## 题目
Given a 2D `grid` consists of `0s` (land) and `1s` (water). An *island* is a maximal 4-directionally connected group of `0s` and a *closed island* is an island **totally** (all left, top, right, bottom) surrounded by `1s.`
diff --git a/leetcode/1266.Minimum-Time-Visiting-All-Points/README.md b/leetcode/1266.Minimum-Time-Visiting-All-Points/README.md
index df503643..95d69b9d 100755
--- a/leetcode/1266.Minimum-Time-Visiting-All-Points/README.md
+++ b/leetcode/1266.Minimum-Time-Visiting-All-Points/README.md
@@ -1,7 +1,7 @@
# [1266. Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/)
-## 题目:
+## 题目
On a plane there are `n` points with integer coordinates `points[i] = [xi, yi]`. Your task is to find the minimum time in seconds to visit all points.
diff --git a/leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/README.md b/leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/README.md
index fd275aca..96cc347d 100644
--- a/leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/README.md
+++ b/leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/README.md
@@ -1,4 +1,5 @@
-# 1281. Subtract the Product and Sum of Digits of an Integer
+# [1281. Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/)
+
## 题目
diff --git a/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold/README.md b/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold/README.md
index 4dd22d20..f0359723 100644
--- a/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold/README.md
+++ b/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold/README.md
@@ -1,4 +1,5 @@
-# 1283. Find the Smallest Divisor Given a Threshold
+# [1283. Find the Smallest Divisor Given a Threshold](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/)
+
## 题目
diff --git a/leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array/README.md b/leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array/README.md
index 21b92fb5..f9714a4d 100644
--- a/leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array/README.md
+++ b/leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array/README.md
@@ -1,4 +1,5 @@
-# 1287. Element Appearing More Than 25% In Sorted Array
+# [1287. Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/)
+
## 题目
diff --git a/leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/README.md b/leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/README.md
index 915fb442..1c0f9be1 100644
--- a/leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/README.md
+++ b/leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/README.md
@@ -1,4 +1,5 @@
-# 1290. Convert Binary Number in a Linked List to Integer
+# [1290. Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/)
+
## 题目
diff --git a/leetcode/1295.Find-Numbers-with-Even-Number-of-Digits/README.md b/leetcode/1295.Find-Numbers-with-Even-Number-of-Digits/README.md
index cfa43e9d..ccaa6c49 100644
--- a/leetcode/1295.Find-Numbers-with-Even-Number-of-Digits/README.md
+++ b/leetcode/1295.Find-Numbers-with-Even-Number-of-Digits/README.md
@@ -1,4 +1,5 @@
-# 1295. Find Numbers with Even Number of Digits
+# [1295. Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)
+
## 题目
diff --git a/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/README.md b/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/README.md
index c3634829..633c6576 100644
--- a/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/README.md
+++ b/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/README.md
@@ -1,4 +1,5 @@
-# 1299. Replace Elements with Greatest Element on Right Side
+# [1299. Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/)
+
## 题目
diff --git a/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target/README.md b/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target/README.md
index 32dad76a..dcee2bcd 100644
--- a/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target/README.md
+++ b/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target/README.md
@@ -1,4 +1,5 @@
-# 1300. Sum of Mutated Array Closest to Target
+# [1300. Sum of Mutated Array Closest to Target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/)
+
## 题目
diff --git a/leetcode/1302.Deepest-Leaves-Sum/README.md b/leetcode/1302.Deepest-Leaves-Sum/README.md
index 81ee4659..70482634 100644
--- a/leetcode/1302.Deepest-Leaves-Sum/README.md
+++ b/leetcode/1302.Deepest-Leaves-Sum/README.md
@@ -1,4 +1,5 @@
-# 1302. Deepest Leaves Sum
+# [1302. Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/)
+
## 题目
diff --git a/leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero/README.md b/leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero/README.md
index b1a0bed0..1e15836e 100644
--- a/leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero/README.md
+++ b/leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero/README.md
@@ -1,4 +1,5 @@
-# 1304. Find N Unique Integers Sum up to Zero
+# [1304. Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/)
+
## 题目
diff --git a/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/README.md b/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/README.md
index d54117d3..247bbfbb 100644
--- a/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/README.md
+++ b/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees/README.md
@@ -1,4 +1,5 @@
-# 1305. All Elements in Two Binary Search Trees
+# [1305. All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/)
+
## 题目
diff --git a/leetcode/1306.Jump-Game-III/README.md b/leetcode/1306.Jump-Game-III/README.md
index 98b3315b..63f26345 100644
--- a/leetcode/1306.Jump-Game-III/README.md
+++ b/leetcode/1306.Jump-Game-III/README.md
@@ -1,4 +1,4 @@
-# 1306. Jump Game III
+# [1306. Jump Game III](https://leetcode.com/problems/jump-game-iii/)
## 题目
diff --git a/topic/Backtracking.png b/topic/Backtracking.png
index b8e05295..3bf789ec 100644
Binary files a/topic/Backtracking.png and b/topic/Backtracking.png differ
diff --git a/topic/Binary_Indexed_Tree.png b/topic/Binary_Indexed_Tree.png
index 446594e5..9aab9171 100644
Binary files a/topic/Binary_Indexed_Tree.png and b/topic/Binary_Indexed_Tree.png differ
diff --git a/topic/Bit_Manipulation.png b/topic/Bit_Manipulation.png
index 81b0eca9..1e08eb96 100644
Binary files a/topic/Bit_Manipulation.png and b/topic/Bit_Manipulation.png differ
diff --git a/topic/Linked_List.png b/topic/Linked_List.png
index d7abbeed..7382943a 100644
Binary files a/topic/Linked_List.png and b/topic/Linked_List.png differ
diff --git a/topic/Sliding_Window.png b/topic/Sliding_Window.png
index 24b992a8..b37d2528 100644
Binary files a/topic/Sliding_Window.png and b/topic/Sliding_Window.png differ
diff --git a/topic/Sort.png b/topic/Sort.png
index 83c787da..22f6d4cf 100644
Binary files a/topic/Sort.png and b/topic/Sort.png differ
diff --git a/topic/Stack.png b/topic/Stack.png
index 9dfa9519..03f1be5e 100644
Binary files a/topic/Stack.png and b/topic/Stack.png differ
diff --git a/topic/Two_pointers.png b/topic/Two_pointers.png
index 54d03e5d..e3b3789e 100644
Binary files a/topic/Two_pointers.png and b/topic/Two_pointers.png differ
diff --git a/topic/Union_Find.png b/topic/Union_Find.png
index 0a3fef99..0cf8f8db 100644
Binary files a/topic/Union_Find.png and b/topic/Union_Find.png differ
diff --git a/website/content/ChapterFour/0001. Two Sum.md b/website/content/ChapterFour/0001.Two-Sum.md
similarity index 100%
rename from website/content/ChapterFour/0001. Two Sum.md
rename to website/content/ChapterFour/0001.Two-Sum.md
diff --git a/website/content/ChapterFour/0002. Add Two Numbers.md b/website/content/ChapterFour/0002.Add-Two-Numbers.md
similarity index 100%
rename from website/content/ChapterFour/0002. Add Two Numbers.md
rename to website/content/ChapterFour/0002.Add-Two-Numbers.md
diff --git a/website/content/ChapterFour/0003. Longest Substring Without Repeating Characters.md b/website/content/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md
similarity index 100%
rename from website/content/ChapterFour/0003. Longest Substring Without Repeating Characters.md
rename to website/content/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md
diff --git a/website/content/ChapterFour/0004. Median of Two Sorted Arrays.md b/website/content/ChapterFour/0004.Median-of-Two-Sorted-Arrays.md
similarity index 99%
rename from website/content/ChapterFour/0004. Median of Two Sorted Arrays.md
rename to website/content/ChapterFour/0004.Median-of-Two-Sorted-Arrays.md
index 574e16a6..9ad0c55b 100755
--- a/website/content/ChapterFour/0004. Median of Two Sorted Arrays.md
+++ b/website/content/ChapterFour/0004.Median-of-Two-Sorted-Arrays.md
@@ -1,7 +1,7 @@
# [4. Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)
-## 题目:
+## 题目
There are two sorted arrays **nums1** and **nums2** of size m and n respectively.
diff --git a/website/content/ChapterFour/0007. Reverse Integer.md b/website/content/ChapterFour/0007.Reverse-Integer.md
similarity index 99%
rename from website/content/ChapterFour/0007. Reverse Integer.md
rename to website/content/ChapterFour/0007.Reverse-Integer.md
index a4b38c16..801d5088 100755
--- a/website/content/ChapterFour/0007. Reverse Integer.md
+++ b/website/content/ChapterFour/0007.Reverse-Integer.md
@@ -1,7 +1,7 @@
# [7. Reverse Integer](https://leetcode.com/problems/reverse-integer/)
-## 题目:
+## 题目
Given a 32-bit signed integer, reverse digits of an integer.
diff --git a/website/content/ChapterFour/0011. Container With Most Water.md b/website/content/ChapterFour/0011.Container-With-Most-Water.md
similarity index 100%
rename from website/content/ChapterFour/0011. Container With Most Water.md
rename to website/content/ChapterFour/0011.Container-With-Most-Water.md
diff --git a/website/content/ChapterFour/0015. 3Sum.md b/website/content/ChapterFour/0015.3Sum.md
similarity index 100%
rename from website/content/ChapterFour/0015. 3Sum.md
rename to website/content/ChapterFour/0015.3Sum.md
diff --git a/website/content/ChapterFour/0016. 3Sum Closest.md b/website/content/ChapterFour/0016.3Sum-Closest.md
similarity index 100%
rename from website/content/ChapterFour/0016. 3Sum Closest.md
rename to website/content/ChapterFour/0016.3Sum-Closest.md
diff --git a/website/content/ChapterFour/0017. Letter Combinations of a Phone Number.md b/website/content/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md
similarity index 99%
rename from website/content/ChapterFour/0017. Letter Combinations of a Phone Number.md
rename to website/content/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md
index 1af1041b..3c9f5296 100755
--- a/website/content/ChapterFour/0017. Letter Combinations of a Phone Number.md
+++ b/website/content/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md
@@ -1,7 +1,7 @@
# [17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)
-## 题目:
+## 题目
Given a string containing digits from `2-9` inclusive, return all possible letter combinations that the number could represent.
diff --git a/website/content/ChapterFour/0018. 4Sum.md b/website/content/ChapterFour/0018.4Sum.md
similarity index 100%
rename from website/content/ChapterFour/0018. 4Sum.md
rename to website/content/ChapterFour/0018.4Sum.md
diff --git a/website/content/ChapterFour/0019. Remove Nth Node From End of List.md b/website/content/ChapterFour/0019.Remove-Nth-Node-From-End-of-List.md
similarity index 100%
rename from website/content/ChapterFour/0019. Remove Nth Node From End of List.md
rename to website/content/ChapterFour/0019.Remove-Nth-Node-From-End-of-List.md
diff --git a/website/content/ChapterFour/0020. Valid-Parentheses.md b/website/content/ChapterFour/0020.Valid-Parentheses.md
similarity index 100%
rename from website/content/ChapterFour/0020. Valid-Parentheses.md
rename to website/content/ChapterFour/0020.Valid-Parentheses.md
diff --git a/website/content/ChapterFour/0021. Merge Two Sorted Lists.md b/website/content/ChapterFour/0021.Merge-Two-Sorted-Lists.md
similarity index 100%
rename from website/content/ChapterFour/0021. Merge Two Sorted Lists.md
rename to website/content/ChapterFour/0021.Merge-Two-Sorted-Lists.md
diff --git a/website/content/ChapterFour/0022. Generate Parentheses.md b/website/content/ChapterFour/0022.Generate-Parentheses.md
similarity index 100%
rename from website/content/ChapterFour/0022. Generate Parentheses.md
rename to website/content/ChapterFour/0022.Generate-Parentheses.md
diff --git a/website/content/ChapterFour/0023. Merge k Sorted Lists.md b/website/content/ChapterFour/0023.Merge-k-Sorted-Lists.md
similarity index 100%
rename from website/content/ChapterFour/0023. Merge k Sorted Lists.md
rename to website/content/ChapterFour/0023.Merge-k-Sorted-Lists.md
diff --git a/website/content/ChapterFour/0024. Swap Nodes in Pairs.md b/website/content/ChapterFour/0024.Swap-Nodes-in-Pairs.md
similarity index 100%
rename from website/content/ChapterFour/0024. Swap Nodes in Pairs.md
rename to website/content/ChapterFour/0024.Swap-Nodes-in-Pairs.md
diff --git a/website/content/ChapterFour/0025. Reverse Nodes in k Group.md b/website/content/ChapterFour/0025.Reverse-Nodes-in-k-Group.md
similarity index 100%
rename from website/content/ChapterFour/0025. Reverse Nodes in k Group.md
rename to website/content/ChapterFour/0025.Reverse-Nodes-in-k-Group.md
diff --git a/website/content/ChapterFour/0026. Remove Duplicates from Sorted Array.md b/website/content/ChapterFour/0026.Remove-Duplicates-from-Sorted-Array.md
similarity index 100%
rename from website/content/ChapterFour/0026. Remove Duplicates from Sorted Array.md
rename to website/content/ChapterFour/0026.Remove-Duplicates-from-Sorted-Array.md
diff --git a/website/content/ChapterFour/0027. Remove Element.md b/website/content/ChapterFour/0027.Remove-Element.md
similarity index 100%
rename from website/content/ChapterFour/0027. Remove Element.md
rename to website/content/ChapterFour/0027.Remove-Element.md
diff --git a/website/content/ChapterFour/0028. Implement strStr().md b/website/content/ChapterFour/0028.Implement-strStr.md
similarity index 100%
rename from website/content/ChapterFour/0028. Implement strStr().md
rename to website/content/ChapterFour/0028.Implement-strStr.md
diff --git a/website/content/ChapterFour/0029. Divide Two Integers.md b/website/content/ChapterFour/0029.Divide-Two-Integers.md
similarity index 99%
rename from website/content/ChapterFour/0029. Divide Two Integers.md
rename to website/content/ChapterFour/0029.Divide-Two-Integers.md
index 72c4a38c..c3f4a834 100755
--- a/website/content/ChapterFour/0029. Divide Two Integers.md
+++ b/website/content/ChapterFour/0029.Divide-Two-Integers.md
@@ -1,7 +1,7 @@
# [29. Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)
-## 题目:
+## 题目
Given two integers `dividend` and `divisor`, divide two integers without using multiplication, division and mod operator.
diff --git a/website/content/ChapterFour/0030. Substring with Concatenation of All Words.md b/website/content/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md
similarity index 100%
rename from website/content/ChapterFour/0030. Substring with Concatenation of All Words.md
rename to website/content/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md
diff --git a/website/content/ChapterFour/0033. Search in Rotated Sorted Array.md b/website/content/ChapterFour/0033.Search-in-Rotated-Sorted-Array.md
similarity index 99%
rename from website/content/ChapterFour/0033. Search in Rotated Sorted Array.md
rename to website/content/ChapterFour/0033.Search-in-Rotated-Sorted-Array.md
index 38ce586a..ac935c4d 100755
--- a/website/content/ChapterFour/0033. Search in Rotated Sorted Array.md
+++ b/website/content/ChapterFour/0033.Search-in-Rotated-Sorted-Array.md
@@ -1,6 +1,6 @@
# [33. Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)
-## 题目:
+## 题目
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
diff --git a/website/content/ChapterFour/0034. Find First and Last Position of Element in Sorted Array.md b/website/content/ChapterFour/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md
similarity index 99%
rename from website/content/ChapterFour/0034. Find First and Last Position of Element in Sorted Array.md
rename to website/content/ChapterFour/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md
index db3316a4..6d991286 100755
--- a/website/content/ChapterFour/0034. Find First and Last Position of Element in Sorted Array.md
+++ b/website/content/ChapterFour/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md
@@ -1,7 +1,7 @@
# [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/)
-## 题目:
+## 题目
Given an array of integers `nums` sorted in ascending order, find the starting and ending position of a given `target` value.
diff --git a/website/content/ChapterFour/0035. Search Insert Position.md b/website/content/ChapterFour/0035.Search-Insert-Position.md
similarity index 99%
rename from website/content/ChapterFour/0035. Search Insert Position.md
rename to website/content/ChapterFour/0035.Search-Insert-Position.md
index 049ad4a2..18339f1e 100755
--- a/website/content/ChapterFour/0035. Search Insert Position.md
+++ b/website/content/ChapterFour/0035.Search-Insert-Position.md
@@ -1,7 +1,7 @@
# [35. Search Insert Position](https://leetcode.com/problems/search-insert-position/)
-## 题目:
+## 题目
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
diff --git a/website/content/ChapterFour/0036. Valid Sudoku.md b/website/content/ChapterFour/0036.Valid-Sudoku.md
similarity index 99%
rename from website/content/ChapterFour/0036. Valid Sudoku.md
rename to website/content/ChapterFour/0036.Valid-Sudoku.md
index 3e50f9b9..72e8ba47 100755
--- a/website/content/ChapterFour/0036. Valid Sudoku.md
+++ b/website/content/ChapterFour/0036.Valid-Sudoku.md
@@ -1,7 +1,7 @@
# [36. Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)
-## 题目:
+## 题目
Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated **according to the following rules**:
diff --git a/website/content/ChapterFour/0037. Sudoku Solver.md b/website/content/ChapterFour/0037.Sudoku-Solver.md
similarity index 99%
rename from website/content/ChapterFour/0037. Sudoku Solver.md
rename to website/content/ChapterFour/0037.Sudoku-Solver.md
index 9c6399af..724076d3 100755
--- a/website/content/ChapterFour/0037. Sudoku Solver.md
+++ b/website/content/ChapterFour/0037.Sudoku-Solver.md
@@ -2,7 +2,7 @@
-## 题目:
+## 题目
Write a program to solve a Sudoku puzzle by filling the empty cells.
diff --git a/website/content/ChapterFour/0039. Combination Sum.md b/website/content/ChapterFour/0039.Combination-Sum.md
similarity index 100%
rename from website/content/ChapterFour/0039. Combination Sum.md
rename to website/content/ChapterFour/0039.Combination-Sum.md
diff --git a/website/content/ChapterFour/0040. Combination Sum II.md b/website/content/ChapterFour/0040.Combination-Sum-II.md
similarity index 100%
rename from website/content/ChapterFour/0040. Combination Sum II.md
rename to website/content/ChapterFour/0040.Combination-Sum-II.md
diff --git a/website/content/ChapterFour/0041. First-Missing-Positive.md b/website/content/ChapterFour/0041.First-Missing-Positive.md
similarity index 100%
rename from website/content/ChapterFour/0041. First-Missing-Positive.md
rename to website/content/ChapterFour/0041.First-Missing-Positive.md
diff --git a/website/content/ChapterFour/0042. Trapping Rain Water.md b/website/content/ChapterFour/0042.Trapping-Rain-Water.md
similarity index 100%
rename from website/content/ChapterFour/0042. Trapping Rain Water.md
rename to website/content/ChapterFour/0042.Trapping-Rain-Water.md
diff --git a/website/content/ChapterFour/0046. Permutations.md b/website/content/ChapterFour/0046.Permutations.md
similarity index 100%
rename from website/content/ChapterFour/0046. Permutations.md
rename to website/content/ChapterFour/0046.Permutations.md
diff --git a/website/content/ChapterFour/0047. Permutations II.md b/website/content/ChapterFour/0047.Permutations-II.md
similarity index 100%
rename from website/content/ChapterFour/0047. Permutations II.md
rename to website/content/ChapterFour/0047.Permutations-II.md
diff --git a/website/content/ChapterFour/0048. Rotate Image.md b/website/content/ChapterFour/0048.Rotate-Image.md
similarity index 100%
rename from website/content/ChapterFour/0048. Rotate Image.md
rename to website/content/ChapterFour/0048.Rotate-Image.md
diff --git a/website/content/ChapterFour/0049. Group Anagrams.md b/website/content/ChapterFour/0049.Group-Anagrams.md
similarity index 100%
rename from website/content/ChapterFour/0049. Group Anagrams.md
rename to website/content/ChapterFour/0049.Group-Anagrams.md
diff --git a/website/content/ChapterFour/0050. Pow(x, n).md b/website/content/ChapterFour/0050.Powx-n.md
similarity index 100%
rename from website/content/ChapterFour/0050. Pow(x, n).md
rename to website/content/ChapterFour/0050.Powx-n.md
diff --git a/website/content/ChapterFour/0051. N-Queens.md b/website/content/ChapterFour/0051.N-Queens.md
similarity index 100%
rename from website/content/ChapterFour/0051. N-Queens.md
rename to website/content/ChapterFour/0051.N-Queens.md
diff --git a/website/content/ChapterFour/0052. N-Queens II.md b/website/content/ChapterFour/0052.N-Queens-II.md
similarity index 100%
rename from website/content/ChapterFour/0052. N-Queens II.md
rename to website/content/ChapterFour/0052.N-Queens-II.md
diff --git a/website/content/ChapterFour/0053. Maximum Subarray.md b/website/content/ChapterFour/0053.Maximum-Subarray.md
similarity index 100%
rename from website/content/ChapterFour/0053. Maximum Subarray.md
rename to website/content/ChapterFour/0053.Maximum-Subarray.md
diff --git a/website/content/ChapterFour/0054. Spiral Matrix.md b/website/content/ChapterFour/0054.Spiral-Matrix.md
similarity index 100%
rename from website/content/ChapterFour/0054. Spiral Matrix.md
rename to website/content/ChapterFour/0054.Spiral-Matrix.md
diff --git a/website/content/ChapterFour/0055. Jump Game.md b/website/content/ChapterFour/0055.Jump-Game.md
similarity index 96%
rename from website/content/ChapterFour/0055. Jump Game.md
rename to website/content/ChapterFour/0055.Jump-Game.md
index b8b25a6a..84b7ddaf 100644
--- a/website/content/ChapterFour/0055. Jump Game.md
+++ b/website/content/ChapterFour/0055.Jump-Game.md
@@ -1,4 +1,4 @@
-# 55. Jump Game
+# [55. Jump Game](https://leetcode.com/problems/jump-game/)
## 题目
diff --git a/website/content/ChapterFour/0056. Merge Intervals.md b/website/content/ChapterFour/0056.Merge-Intervals.md
similarity index 100%
rename from website/content/ChapterFour/0056. Merge Intervals.md
rename to website/content/ChapterFour/0056.Merge-Intervals.md
diff --git a/website/content/ChapterFour/0057. Insert Interval.md b/website/content/ChapterFour/0057.Insert-Interval.md
similarity index 100%
rename from website/content/ChapterFour/0057. Insert Interval.md
rename to website/content/ChapterFour/0057.Insert-Interval.md
diff --git a/website/content/ChapterFour/0059. Spiral Matrix II.md b/website/content/ChapterFour/0059.Spiral-Matrix-II.md
similarity index 100%
rename from website/content/ChapterFour/0059. Spiral Matrix II.md
rename to website/content/ChapterFour/0059.Spiral-Matrix-II.md
diff --git a/website/content/ChapterFour/0060. Permutation Sequence.md b/website/content/ChapterFour/0060.Permutation-Sequence.md
similarity index 100%
rename from website/content/ChapterFour/0060. Permutation Sequence.md
rename to website/content/ChapterFour/0060.Permutation-Sequence.md
diff --git a/website/content/ChapterFour/0061. Rotate List.md b/website/content/ChapterFour/0061.Rotate-List.md
similarity index 100%
rename from website/content/ChapterFour/0061. Rotate List.md
rename to website/content/ChapterFour/0061.Rotate-List.md
diff --git a/website/content/ChapterFour/0062. Unique Paths.md b/website/content/ChapterFour/0062.Unique-Paths.md
similarity index 100%
rename from website/content/ChapterFour/0062. Unique Paths.md
rename to website/content/ChapterFour/0062.Unique-Paths.md
diff --git a/website/content/ChapterFour/0063. Unique Paths II.md b/website/content/ChapterFour/0063.Unique-Paths-II.md
similarity index 100%
rename from website/content/ChapterFour/0063. Unique Paths II.md
rename to website/content/ChapterFour/0063.Unique-Paths-II.md
diff --git a/website/content/ChapterFour/0064. Minimum Path Sum.md b/website/content/ChapterFour/0064.Minimum-Path-Sum.md
similarity index 100%
rename from website/content/ChapterFour/0064. Minimum Path Sum.md
rename to website/content/ChapterFour/0064.Minimum-Path-Sum.md
diff --git a/website/content/ChapterFour/0066. Plus One.md b/website/content/ChapterFour/0066.Plus-One.md
similarity index 99%
rename from website/content/ChapterFour/0066. Plus One.md
rename to website/content/ChapterFour/0066.Plus-One.md
index 9d90f5a0..441789f9 100755
--- a/website/content/ChapterFour/0066. Plus One.md
+++ b/website/content/ChapterFour/0066.Plus-One.md
@@ -1,7 +1,7 @@
# [66. Plus One](https://leetcode.com/problems/plus-one/)
-## 题目:
+## 题目
Given a **non-empty** array of digits representing a non-negative integer, plus one to the integer.
diff --git a/website/content/ChapterFour/0069. Sqrt(x).md b/website/content/ChapterFour/0069.Sqrtx.md
similarity index 100%
rename from website/content/ChapterFour/0069. Sqrt(x).md
rename to website/content/ChapterFour/0069.Sqrtx.md
diff --git a/website/content/ChapterFour/0070. Climbing Stairs.md b/website/content/ChapterFour/0070.Climbing-Stairs.md
similarity index 100%
rename from website/content/ChapterFour/0070. Climbing Stairs.md
rename to website/content/ChapterFour/0070.Climbing-Stairs.md
diff --git a/website/content/ChapterFour/0071. Simplify Path.md b/website/content/ChapterFour/0071.Simplify-Path.md
similarity index 100%
rename from website/content/ChapterFour/0071. Simplify Path.md
rename to website/content/ChapterFour/0071.Simplify-Path.md
diff --git a/website/content/ChapterFour/0074. Search a 2D Matrix.md b/website/content/ChapterFour/0074.Search-a-2D-Matrix.md
similarity index 99%
rename from website/content/ChapterFour/0074. Search a 2D Matrix.md
rename to website/content/ChapterFour/0074.Search-a-2D-Matrix.md
index 8e10b2f4..07290862 100755
--- a/website/content/ChapterFour/0074. Search a 2D Matrix.md
+++ b/website/content/ChapterFour/0074.Search-a-2D-Matrix.md
@@ -1,7 +1,7 @@
# [74. Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)
-## 题目:
+## 题目
Write an efficient algorithm that searches for a value in an *m* x *n* matrix. This matrix has the following properties:
diff --git a/website/content/ChapterFour/0075. Sort Colors.md b/website/content/ChapterFour/0075.Sort-Colors.md
similarity index 100%
rename from website/content/ChapterFour/0075. Sort Colors.md
rename to website/content/ChapterFour/0075.Sort-Colors.md
diff --git a/website/content/ChapterFour/0076. Minimum Window Substring.md b/website/content/ChapterFour/0076.Minimum-Window-Substring.md
similarity index 100%
rename from website/content/ChapterFour/0076. Minimum Window Substring.md
rename to website/content/ChapterFour/0076.Minimum-Window-Substring.md
diff --git a/website/content/ChapterFour/0077. Combinations.md b/website/content/ChapterFour/0077.Combinations.md
similarity index 100%
rename from website/content/ChapterFour/0077. Combinations.md
rename to website/content/ChapterFour/0077.Combinations.md
diff --git a/website/content/ChapterFour/0078. Subsets.md b/website/content/ChapterFour/0078.Subsets.md
similarity index 100%
rename from website/content/ChapterFour/0078. Subsets.md
rename to website/content/ChapterFour/0078.Subsets.md
diff --git a/website/content/ChapterFour/0079. Word Search.md b/website/content/ChapterFour/0079.Word-Search.md
similarity index 100%
rename from website/content/ChapterFour/0079. Word Search.md
rename to website/content/ChapterFour/0079.Word-Search.md
diff --git a/website/content/ChapterFour/0080. Remove Duplicates from Sorted Array II.md b/website/content/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md
similarity index 100%
rename from website/content/ChapterFour/0080. Remove Duplicates from Sorted Array II.md
rename to website/content/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md
diff --git a/website/content/ChapterFour/0081. Search in Rotated Sorted Array II.md b/website/content/ChapterFour/0081.Search-in-Rotated-Sorted-Array-II.md
similarity index 99%
rename from website/content/ChapterFour/0081. Search in Rotated Sorted Array II.md
rename to website/content/ChapterFour/0081.Search-in-Rotated-Sorted-Array-II.md
index 84e1fefd..e9b9a880 100755
--- a/website/content/ChapterFour/0081. Search in Rotated Sorted Array II.md
+++ b/website/content/ChapterFour/0081.Search-in-Rotated-Sorted-Array-II.md
@@ -1,7 +1,7 @@
# [81. Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)
-## 题目:
+## 题目
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
diff --git a/website/content/ChapterFour/0082. Remove Duplicates from Sorted List II.md b/website/content/ChapterFour/0082.Remove-Duplicates-from-Sorted-List-II.md
similarity index 100%
rename from website/content/ChapterFour/0082. Remove Duplicates from Sorted List II.md
rename to website/content/ChapterFour/0082.Remove-Duplicates-from-Sorted-List-II.md
diff --git a/website/content/ChapterFour/0083. Remove Duplicates from Sorted List.md b/website/content/ChapterFour/0083.Remove-Duplicates-from-Sorted-List.md
similarity index 100%
rename from website/content/ChapterFour/0083. Remove Duplicates from Sorted List.md
rename to website/content/ChapterFour/0083.Remove-Duplicates-from-Sorted-List.md
diff --git a/website/content/ChapterFour/0084. Largest Rectangle in Histogram.md b/website/content/ChapterFour/0084.Largest-Rectangle-in-Histogram.md
similarity index 100%
rename from website/content/ChapterFour/0084. Largest Rectangle in Histogram.md
rename to website/content/ChapterFour/0084.Largest-Rectangle-in-Histogram.md
diff --git a/website/content/ChapterFour/0086. Partition List.md b/website/content/ChapterFour/0086.Partition-List.md
similarity index 100%
rename from website/content/ChapterFour/0086. Partition List.md
rename to website/content/ChapterFour/0086.Partition-List.md
diff --git a/website/content/ChapterFour/0088. Merge Sorted Array.md b/website/content/ChapterFour/0088.Merge-Sorted-Array.md
similarity index 100%
rename from website/content/ChapterFour/0088. Merge Sorted Array.md
rename to website/content/ChapterFour/0088.Merge-Sorted-Array.md
diff --git a/website/content/ChapterFour/0089. Gray Code.md b/website/content/ChapterFour/0089.Gray-Code.md
similarity index 100%
rename from website/content/ChapterFour/0089. Gray Code.md
rename to website/content/ChapterFour/0089.Gray-Code.md
diff --git a/website/content/ChapterFour/0090. Subsets II.md b/website/content/ChapterFour/0090.Subsets-II.md
similarity index 100%
rename from website/content/ChapterFour/0090. Subsets II.md
rename to website/content/ChapterFour/0090.Subsets-II.md
diff --git a/website/content/ChapterFour/0091. Decode Ways.md b/website/content/ChapterFour/0091.Decode-Ways.md
similarity index 100%
rename from website/content/ChapterFour/0091. Decode Ways.md
rename to website/content/ChapterFour/0091.Decode-Ways.md
diff --git a/website/content/ChapterFour/0092. Reverse Linked List II.md b/website/content/ChapterFour/0092.Reverse-Linked-List-II.md
similarity index 100%
rename from website/content/ChapterFour/0092. Reverse Linked List II.md
rename to website/content/ChapterFour/0092.Reverse-Linked-List-II.md
diff --git a/website/content/ChapterFour/0093. Restore IP Addresses.md b/website/content/ChapterFour/0093.Restore-IP-Addresses.md
similarity index 100%
rename from website/content/ChapterFour/0093. Restore IP Addresses.md
rename to website/content/ChapterFour/0093.Restore-IP-Addresses.md
diff --git a/website/content/ChapterFour/0094. Binary Tree Inorder Traversal.md b/website/content/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md
similarity index 100%
rename from website/content/ChapterFour/0094. Binary Tree Inorder Traversal.md
rename to website/content/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md
diff --git a/website/content/ChapterFour/0095. Unique Binary Search Trees II.md b/website/content/ChapterFour/0095.Unique-Binary-Search-Trees-II.md
similarity index 99%
rename from website/content/ChapterFour/0095. Unique Binary Search Trees II.md
rename to website/content/ChapterFour/0095.Unique-Binary-Search-Trees-II.md
index 58e2cc18..20386399 100755
--- a/website/content/ChapterFour/0095. Unique Binary Search Trees II.md
+++ b/website/content/ChapterFour/0095.Unique-Binary-Search-Trees-II.md
@@ -1,7 +1,7 @@
# [95. Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/)
-## 题目:
+## 题目
Given an integer *n*, generate all structurally unique **BST's** (binary search trees) that store values 1 ... *n*.
diff --git a/website/content/ChapterFour/0096. Unique Binary Search Trees.md b/website/content/ChapterFour/0096.Unique-Binary-Search-Trees.md
similarity index 100%
rename from website/content/ChapterFour/0096. Unique Binary Search Trees.md
rename to website/content/ChapterFour/0096.Unique-Binary-Search-Trees.md
diff --git a/website/content/ChapterFour/0098. Validate Binary Search Tree.md b/website/content/ChapterFour/0098.Validate-Binary-Search-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0098. Validate Binary Search Tree.md
rename to website/content/ChapterFour/0098.Validate-Binary-Search-Tree.md
diff --git a/website/content/ChapterFour/0099. Recover Binary Search Tree.md b/website/content/ChapterFour/0099.Recover-Binary-Search-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0099. Recover Binary Search Tree.md
rename to website/content/ChapterFour/0099.Recover-Binary-Search-Tree.md
diff --git a/website/content/ChapterFour/0100. Same Tree.md b/website/content/ChapterFour/0100.Same-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0100. Same Tree.md
rename to website/content/ChapterFour/0100.Same-Tree.md
diff --git a/website/content/ChapterFour/0101. Symmetric Tree.md b/website/content/ChapterFour/0101.Symmetric-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0101. Symmetric Tree.md
rename to website/content/ChapterFour/0101.Symmetric-Tree.md
diff --git a/website/content/ChapterFour/0102. Binary Tree Level Order Traversal.md b/website/content/ChapterFour/0102.Binary-Tree-Level-Order-Traversal.md
similarity index 100%
rename from website/content/ChapterFour/0102. Binary Tree Level Order Traversal.md
rename to website/content/ChapterFour/0102.Binary-Tree-Level-Order-Traversal.md
diff --git a/website/content/ChapterFour/0103. Binary Tree Zigzag Level Order Traversal.md b/website/content/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md
similarity index 100%
rename from website/content/ChapterFour/0103. Binary Tree Zigzag Level Order Traversal.md
rename to website/content/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md
diff --git a/website/content/ChapterFour/0104. Maximum Depth of Binary Tree.md b/website/content/ChapterFour/0104.Maximum-Depth-of-Binary-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0104. Maximum Depth of Binary Tree.md
rename to website/content/ChapterFour/0104.Maximum-Depth-of-Binary-Tree.md
diff --git a/website/content/ChapterFour/0105. Construct Binary Tree from Preorder and Inorder Traversal.md b/website/content/ChapterFour/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md
similarity index 99%
rename from website/content/ChapterFour/0105. Construct Binary Tree from Preorder and Inorder Traversal.md
rename to website/content/ChapterFour/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md
index a2155f53..98012d2d 100755
--- a/website/content/ChapterFour/0105. Construct Binary Tree from Preorder and Inorder Traversal.md
+++ b/website/content/ChapterFour/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md
@@ -1,7 +1,7 @@
# [105. Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)
-## 题目:
+## 题目
Given preorder and inorder traversal of a tree, construct the binary tree.
diff --git a/website/content/ChapterFour/0106. Construct Binary Tree from Inorder and Postorder Traversal.md b/website/content/ChapterFour/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md
similarity index 99%
rename from website/content/ChapterFour/0106. Construct Binary Tree from Inorder and Postorder Traversal.md
rename to website/content/ChapterFour/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md
index e3c47818..62ea1c8a 100755
--- a/website/content/ChapterFour/0106. Construct Binary Tree from Inorder and Postorder Traversal.md
+++ b/website/content/ChapterFour/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md
@@ -1,6 +1,6 @@
# [106. Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)
-## 题目:
+## 题目
Given inorder and postorder traversal of a tree, construct the binary tree.
diff --git a/website/content/ChapterFour/0107. Binary Tree Level Order Traversal II.md b/website/content/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.md
similarity index 100%
rename from website/content/ChapterFour/0107. Binary Tree Level Order Traversal II.md
rename to website/content/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.md
diff --git a/website/content/ChapterFour/0108. Convert Sorted Array to Binary Search Tree.md b/website/content/ChapterFour/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0108. Convert Sorted Array to Binary Search Tree.md
rename to website/content/ChapterFour/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md
diff --git a/website/content/ChapterFour/0109. Convert Sorted List to Binary Search Tree.md b/website/content/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0109. Convert Sorted List to Binary Search Tree.md
rename to website/content/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md
diff --git a/website/content/ChapterFour/0110. Balanced Binary Tree.md b/website/content/ChapterFour/0110.Balanced-Binary-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0110. Balanced Binary Tree.md
rename to website/content/ChapterFour/0110.Balanced-Binary-Tree.md
diff --git a/website/content/ChapterFour/0111. Minimum Depth of Binary Tree.md b/website/content/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0111. Minimum Depth of Binary Tree.md
rename to website/content/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md
diff --git a/website/content/ChapterFour/0112. Path Sum.md b/website/content/ChapterFour/0112.Path-Sum.md
similarity index 100%
rename from website/content/ChapterFour/0112. Path Sum.md
rename to website/content/ChapterFour/0112.Path-Sum.md
diff --git a/website/content/ChapterFour/0113. Path Sum II.md b/website/content/ChapterFour/0113.Path-Sum-II.md
similarity index 100%
rename from website/content/ChapterFour/0113. Path Sum II.md
rename to website/content/ChapterFour/0113.Path-Sum-II.md
diff --git a/website/content/ChapterFour/0114. Flatten Binary Tree to Linked List.md b/website/content/ChapterFour/0114.Flatten-Binary-Tree-to-Linked-List.md
similarity index 100%
rename from website/content/ChapterFour/0114. Flatten Binary Tree to Linked List.md
rename to website/content/ChapterFour/0114.Flatten-Binary-Tree-to-Linked-List.md
diff --git a/website/content/ChapterFour/0120. Triangle.md b/website/content/ChapterFour/0120.Triangle.md
similarity index 100%
rename from website/content/ChapterFour/0120. Triangle.md
rename to website/content/ChapterFour/0120.Triangle.md
diff --git a/website/content/ChapterFour/0121. Best Time to Buy and Sell Stock.md b/website/content/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md
similarity index 100%
rename from website/content/ChapterFour/0121. Best Time to Buy and Sell Stock.md
rename to website/content/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md
diff --git a/website/content/ChapterFour/0122. Best Time to Buy and Sell Stock II.md b/website/content/ChapterFour/0122.Best-Time-to-Buy-and-Sell-Stock-II.md
similarity index 100%
rename from website/content/ChapterFour/0122. Best Time to Buy and Sell Stock II.md
rename to website/content/ChapterFour/0122.Best-Time-to-Buy-and-Sell-Stock-II.md
diff --git a/website/content/ChapterFour/0124. Binary Tree Maximum Path Sum.md b/website/content/ChapterFour/0124.Binary-Tree-Maximum-Path-Sum.md
similarity index 100%
rename from website/content/ChapterFour/0124. Binary Tree Maximum Path Sum.md
rename to website/content/ChapterFour/0124.Binary-Tree-Maximum-Path-Sum.md
diff --git a/website/content/ChapterFour/0125. Valid-Palindrome.md b/website/content/ChapterFour/0125.Valid-Palindrome.md
similarity index 100%
rename from website/content/ChapterFour/0125. Valid-Palindrome.md
rename to website/content/ChapterFour/0125.Valid-Palindrome.md
diff --git a/website/content/ChapterFour/0126. Word Ladder II.md b/website/content/ChapterFour/0126.Word-Ladder-II.md
similarity index 100%
rename from website/content/ChapterFour/0126. Word Ladder II.md
rename to website/content/ChapterFour/0126.Word-Ladder-II.md
diff --git a/website/content/ChapterFour/0127. Word Ladder.md b/website/content/ChapterFour/0127.Word-Ladder.md
similarity index 100%
rename from website/content/ChapterFour/0127. Word Ladder.md
rename to website/content/ChapterFour/0127.Word-Ladder.md
diff --git a/website/content/ChapterFour/0128. Longest Consecutive Sequence.md b/website/content/ChapterFour/0128.Longest-Consecutive-Sequence.md
similarity index 99%
rename from website/content/ChapterFour/0128. Longest Consecutive Sequence.md
rename to website/content/ChapterFour/0128.Longest-Consecutive-Sequence.md
index d6fc4a21..80d7a5f4 100755
--- a/website/content/ChapterFour/0128. Longest Consecutive Sequence.md
+++ b/website/content/ChapterFour/0128.Longest-Consecutive-Sequence.md
@@ -1,7 +1,7 @@
# [128. Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)
-## 题目:
+## 题目
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
diff --git a/website/content/ChapterFour/0129. Sum Root to Leaf Numbers.md b/website/content/ChapterFour/0129.Sum-Root-to-Leaf-Numbers.md
similarity index 100%
rename from website/content/ChapterFour/0129. Sum Root to Leaf Numbers.md
rename to website/content/ChapterFour/0129.Sum-Root-to-Leaf-Numbers.md
diff --git a/website/content/ChapterFour/0130. Surrounded Regions.md b/website/content/ChapterFour/0130.Surrounded-Regions.md
similarity index 99%
rename from website/content/ChapterFour/0130. Surrounded Regions.md
rename to website/content/ChapterFour/0130.Surrounded-Regions.md
index 419099c5..4ba38197 100755
--- a/website/content/ChapterFour/0130. Surrounded Regions.md
+++ b/website/content/ChapterFour/0130.Surrounded-Regions.md
@@ -2,7 +2,7 @@
-## 题目:
+## 题目
Given a 2D board containing `'X'` and `'O'` (**the letter O**), capture all regions surrounded by `'X'`.
diff --git a/website/content/ChapterFour/0131. Palindrome Partitioning.md b/website/content/ChapterFour/0131.Palindrome-Partitioning.md
similarity index 100%
rename from website/content/ChapterFour/0131. Palindrome Partitioning.md
rename to website/content/ChapterFour/0131.Palindrome-Partitioning.md
diff --git a/website/content/ChapterFour/0136. Single Number.md b/website/content/ChapterFour/0136.Single-Number.md
similarity index 99%
rename from website/content/ChapterFour/0136. Single Number.md
rename to website/content/ChapterFour/0136.Single-Number.md
index 55d0f289..e3d24d83 100755
--- a/website/content/ChapterFour/0136. Single Number.md
+++ b/website/content/ChapterFour/0136.Single-Number.md
@@ -1,6 +1,6 @@
# [136. Single Number](https://leetcode.com/problems/single-number/)
-## 题目:
+## 题目
Given a **non-empty** array of integers, every element appears *twice* except for one. Find that single one.
diff --git a/website/content/ChapterFour/0137. Single Number II.md b/website/content/ChapterFour/0137.Single-Number-II.md
similarity index 99%
rename from website/content/ChapterFour/0137. Single Number II.md
rename to website/content/ChapterFour/0137.Single-Number-II.md
index 92788b88..5e82a6b7 100755
--- a/website/content/ChapterFour/0137. Single Number II.md
+++ b/website/content/ChapterFour/0137.Single-Number-II.md
@@ -1,7 +1,7 @@
# [137. Single Number II](https://leetcode.com/problems/single-number-ii/)
-## 题目:
+## 题目
Given a **non-empty** array of integers, every element appears *three* times except for one, which appears exactly once. Find that single one.
diff --git a/website/content/ChapterFour/0141. Linked List Cycle.md b/website/content/ChapterFour/0141.Linked-List-Cycle.md
similarity index 100%
rename from website/content/ChapterFour/0141. Linked List Cycle.md
rename to website/content/ChapterFour/0141.Linked-List-Cycle.md
diff --git a/website/content/ChapterFour/0142. Linked List Cycle II.md b/website/content/ChapterFour/0142.Linked-List-Cycle-II.md
similarity index 100%
rename from website/content/ChapterFour/0142. Linked List Cycle II.md
rename to website/content/ChapterFour/0142.Linked-List-Cycle-II.md
diff --git a/website/content/ChapterFour/0143. Reorder List.md b/website/content/ChapterFour/0143.Reorder-List.md
similarity index 100%
rename from website/content/ChapterFour/0143. Reorder List.md
rename to website/content/ChapterFour/0143.Reorder-List.md
diff --git a/website/content/ChapterFour/0144. Binary Tree Preorder Traversal.md b/website/content/ChapterFour/0144.Binary-Tree-Preorder-Traversal.md
similarity index 100%
rename from website/content/ChapterFour/0144. Binary Tree Preorder Traversal.md
rename to website/content/ChapterFour/0144.Binary-Tree-Preorder-Traversal.md
diff --git a/website/content/ChapterFour/0145. Binary Tree Postorder Traversal.md b/website/content/ChapterFour/0145.Binary-Tree-Postorder-Traversal.md
similarity index 100%
rename from website/content/ChapterFour/0145. Binary Tree Postorder Traversal.md
rename to website/content/ChapterFour/0145.Binary-Tree-Postorder-Traversal.md
diff --git a/website/content/ChapterFour/0147. Insertion Sort List.md b/website/content/ChapterFour/0147.Insertion-Sort-List.md
similarity index 100%
rename from website/content/ChapterFour/0147. Insertion Sort List.md
rename to website/content/ChapterFour/0147.Insertion-Sort-List.md
diff --git a/website/content/ChapterFour/0148. Sort List.md b/website/content/ChapterFour/0148.Sort-List.md
similarity index 100%
rename from website/content/ChapterFour/0148. Sort List.md
rename to website/content/ChapterFour/0148.Sort-List.md
diff --git a/website/content/ChapterFour/0150. Evaluate Reverse Polish Notation.md b/website/content/ChapterFour/0150.Evaluate-Reverse-Polish-Notation.md
similarity index 100%
rename from website/content/ChapterFour/0150. Evaluate Reverse Polish Notation.md
rename to website/content/ChapterFour/0150.Evaluate-Reverse-Polish-Notation.md
diff --git a/website/content/ChapterFour/0151. Reverse Words in a String.md b/website/content/ChapterFour/0151.Reverse-Words-in-a-String.md
similarity index 99%
rename from website/content/ChapterFour/0151. Reverse Words in a String.md
rename to website/content/ChapterFour/0151.Reverse-Words-in-a-String.md
index dcd90ea6..e7d47d72 100755
--- a/website/content/ChapterFour/0151. Reverse Words in a String.md
+++ b/website/content/ChapterFour/0151.Reverse-Words-in-a-String.md
@@ -2,7 +2,7 @@
-## 题目:
+## 题目
Given an input string, reverse the string word by word.
diff --git a/website/content/ChapterFour/0152. Maximum Product Subarray.md b/website/content/ChapterFour/0152.Maximum-Product-Subarray.md
similarity index 100%
rename from website/content/ChapterFour/0152. Maximum Product Subarray.md
rename to website/content/ChapterFour/0152.Maximum-Product-Subarray.md
diff --git a/website/content/ChapterFour/0153. Find Minimum in Rotated Sorted Array.md b/website/content/ChapterFour/0153.Find-Minimum-in-Rotated-Sorted-Array.md
similarity index 99%
rename from website/content/ChapterFour/0153. Find Minimum in Rotated Sorted Array.md
rename to website/content/ChapterFour/0153.Find-Minimum-in-Rotated-Sorted-Array.md
index c9c4c459..b2a6d6e6 100755
--- a/website/content/ChapterFour/0153. Find Minimum in Rotated Sorted Array.md
+++ b/website/content/ChapterFour/0153.Find-Minimum-in-Rotated-Sorted-Array.md
@@ -1,7 +1,7 @@
# [153. Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)
-## 题目:
+## 题目
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
diff --git a/website/content/ChapterFour/0154. Find Minimum in Rotated Sorted Array II.md b/website/content/ChapterFour/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md
similarity index 99%
rename from website/content/ChapterFour/0154. Find Minimum in Rotated Sorted Array II.md
rename to website/content/ChapterFour/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md
index 70864603..4ddfaa71 100755
--- a/website/content/ChapterFour/0154. Find Minimum in Rotated Sorted Array II.md
+++ b/website/content/ChapterFour/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md
@@ -1,7 +1,7 @@
# [154. Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/)
-## 题目:
+## 题目
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
diff --git a/website/content/ChapterFour/0155. Min Stack.md b/website/content/ChapterFour/0155.Min-Stack.md
similarity index 100%
rename from website/content/ChapterFour/0155. Min Stack.md
rename to website/content/ChapterFour/0155.Min-Stack.md
diff --git a/website/content/ChapterFour/0160. Intersection of Two Linked Lists.md b/website/content/ChapterFour/0160.Intersection-of-Two-Linked-Lists.md
similarity index 100%
rename from website/content/ChapterFour/0160. Intersection of Two Linked Lists.md
rename to website/content/ChapterFour/0160.Intersection-of-Two-Linked-Lists.md
diff --git a/website/content/ChapterFour/0162. Find Peak Element.md b/website/content/ChapterFour/0162.Find-Peak-Element.md
similarity index 99%
rename from website/content/ChapterFour/0162. Find Peak Element.md
rename to website/content/ChapterFour/0162.Find-Peak-Element.md
index 031a74a7..2b69dbdb 100755
--- a/website/content/ChapterFour/0162. Find Peak Element.md
+++ b/website/content/ChapterFour/0162.Find-Peak-Element.md
@@ -1,7 +1,7 @@
# [162. Find Peak Element](https://leetcode.com/problems/find-peak-element/)
-## 题目:
+## 题目
A peak element is an element that is greater than its neighbors.
diff --git a/website/content/ChapterFour/0164. Maximum Gap.md b/website/content/ChapterFour/0164.Maximum-Gap.md
similarity index 100%
rename from website/content/ChapterFour/0164. Maximum Gap.md
rename to website/content/ChapterFour/0164.Maximum-Gap.md
diff --git a/website/content/ChapterFour/0167. Two Sum II - Input array is sorted.md b/website/content/ChapterFour/0167.Two-Sum-II---Input-array-is-sorted.md
similarity index 100%
rename from website/content/ChapterFour/0167. Two Sum II - Input array is sorted.md
rename to website/content/ChapterFour/0167.Two-Sum-II---Input-array-is-sorted.md
diff --git a/website/content/ChapterFour/0169. Majority Element.md b/website/content/ChapterFour/0169.Majority-Element.md
similarity index 99%
rename from website/content/ChapterFour/0169. Majority Element.md
rename to website/content/ChapterFour/0169.Majority-Element.md
index 469b2323..548fb3ed 100755
--- a/website/content/ChapterFour/0169. Majority Element.md
+++ b/website/content/ChapterFour/0169.Majority-Element.md
@@ -1,7 +1,7 @@
# [169. Majority Element](https://leetcode.com/problems/majority-element/)
-## 题目:
+## 题目
Given an array of size n, find the majority element. The majority element is the element that appears **more than** `⌊ n/2 ⌋` times.
diff --git a/website/content/ChapterFour/0172. Factorial Trailing Zeroes.md b/website/content/ChapterFour/0172.Factorial-Trailing-Zeroes.md
similarity index 99%
rename from website/content/ChapterFour/0172. Factorial Trailing Zeroes.md
rename to website/content/ChapterFour/0172.Factorial-Trailing-Zeroes.md
index f27191db..4c6db632 100755
--- a/website/content/ChapterFour/0172. Factorial Trailing Zeroes.md
+++ b/website/content/ChapterFour/0172.Factorial-Trailing-Zeroes.md
@@ -1,7 +1,7 @@
# [172. Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/)
-## 题目:
+## 题目
Given an integer n, return the number of trailing zeroes in n!.
diff --git a/website/content/ChapterFour/0173. Binary Search Tree Iterator.md b/website/content/ChapterFour/0173.Binary-Search-Tree-Iterator.md
similarity index 100%
rename from website/content/ChapterFour/0173. Binary Search Tree Iterator.md
rename to website/content/ChapterFour/0173.Binary-Search-Tree-Iterator.md
diff --git a/website/content/ChapterFour/0174. Dungeon Game.md b/website/content/ChapterFour/0174.Dungeon-Game.md
similarity index 99%
rename from website/content/ChapterFour/0174. Dungeon Game.md
rename to website/content/ChapterFour/0174.Dungeon-Game.md
index 487166f9..d95cc1ac 100755
--- a/website/content/ChapterFour/0174. Dungeon Game.md
+++ b/website/content/ChapterFour/0174.Dungeon-Game.md
@@ -1,6 +1,6 @@
# [174. Dungeon Game](https://leetcode.com/problems/dungeon-game/)
-## 题目:
+## 题目
The demons had captured the princess (**P**) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (**K**) was initially positioned in the top-left room and must fight his way through the dungeon to rescue the princess.
diff --git a/website/content/ChapterFour/0179. Largest Number.md b/website/content/ChapterFour/0179.Largest-Number.md
similarity index 100%
rename from website/content/ChapterFour/0179. Largest Number.md
rename to website/content/ChapterFour/0179.Largest-Number.md
diff --git a/website/content/ChapterFour/0187. Repeated DNA Sequences.md b/website/content/ChapterFour/0187.Repeated-DNA-Sequences.md
similarity index 99%
rename from website/content/ChapterFour/0187. Repeated DNA Sequences.md
rename to website/content/ChapterFour/0187.Repeated-DNA-Sequences.md
index 13b434f1..5f917e03 100755
--- a/website/content/ChapterFour/0187. Repeated DNA Sequences.md
+++ b/website/content/ChapterFour/0187.Repeated-DNA-Sequences.md
@@ -1,7 +1,7 @@
# [187. Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/)
-## 题目:
+## 题目
All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for Example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify repeated sequences within the DNA.
diff --git a/website/content/ChapterFour/0190. Reverse Bits.md b/website/content/ChapterFour/0190.Reverse-Bits.md
similarity index 99%
rename from website/content/ChapterFour/0190. Reverse Bits.md
rename to website/content/ChapterFour/0190.Reverse-Bits.md
index e1540e11..47b9b939 100755
--- a/website/content/ChapterFour/0190. Reverse Bits.md
+++ b/website/content/ChapterFour/0190.Reverse-Bits.md
@@ -1,7 +1,7 @@
# [190. Reverse Bits](https://leetcode.com/problems/reverse-bits/)
-## 题目:
+## 题目
Reverse bits of a given 32 bits unsigned integer.
diff --git a/website/content/ChapterFour/0191. Number of 1 Bits.md b/website/content/ChapterFour/0191.Number-of-1-Bits.md
similarity index 100%
rename from website/content/ChapterFour/0191. Number of 1 Bits.md
rename to website/content/ChapterFour/0191.Number-of-1-Bits.md
diff --git a/website/content/ChapterFour/0198. House Robber.md b/website/content/ChapterFour/0198.House-Robber.md
similarity index 100%
rename from website/content/ChapterFour/0198. House Robber.md
rename to website/content/ChapterFour/0198.House-Robber.md
diff --git a/website/content/ChapterFour/0199. Binary Tree Right Side View.md b/website/content/ChapterFour/0199.Binary-Tree-Right-Side-View.md
similarity index 100%
rename from website/content/ChapterFour/0199. Binary Tree Right Side View.md
rename to website/content/ChapterFour/0199.Binary-Tree-Right-Side-View.md
diff --git a/website/content/ChapterFour/0200. Number of Islands.md b/website/content/ChapterFour/0200.Number-of-Islands.md
similarity index 100%
rename from website/content/ChapterFour/0200. Number of Islands.md
rename to website/content/ChapterFour/0200.Number-of-Islands.md
diff --git a/website/content/ChapterFour/0201. Bitwise AND of Numbers Range.md b/website/content/ChapterFour/0201.Bitwise-AND-of-Numbers-Range.md
similarity index 99%
rename from website/content/ChapterFour/0201. Bitwise AND of Numbers Range.md
rename to website/content/ChapterFour/0201.Bitwise-AND-of-Numbers-Range.md
index 7c1647a7..cccdb75b 100755
--- a/website/content/ChapterFour/0201. Bitwise AND of Numbers Range.md
+++ b/website/content/ChapterFour/0201.Bitwise-AND-of-Numbers-Range.md
@@ -1,7 +1,7 @@
# [201. Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/)
-## 题目:
+## 题目
Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.
diff --git a/website/content/ChapterFour/0202. Happy Number.md b/website/content/ChapterFour/0202.Happy-Number.md
similarity index 100%
rename from website/content/ChapterFour/0202. Happy Number.md
rename to website/content/ChapterFour/0202.Happy-Number.md
diff --git a/website/content/ChapterFour/0203. Remove Linked List Elements.md b/website/content/ChapterFour/0203.Remove-Linked-List-Elements.md
similarity index 100%
rename from website/content/ChapterFour/0203. Remove Linked List Elements.md
rename to website/content/ChapterFour/0203.Remove-Linked-List-Elements.md
diff --git a/website/content/ChapterFour/0204. Count Primes.md b/website/content/ChapterFour/0204.Count-Primes.md
similarity index 98%
rename from website/content/ChapterFour/0204. Count Primes.md
rename to website/content/ChapterFour/0204.Count-Primes.md
index 99259457..81f49cdc 100755
--- a/website/content/ChapterFour/0204. Count Primes.md
+++ b/website/content/ChapterFour/0204.Count-Primes.md
@@ -1,7 +1,7 @@
# [204. Count Primes](https://leetcode.com/problems/count-primes/)
-## 题目:
+## 题目
Count the number of prime numbers less than a non-negative number, **n**.
diff --git a/website/content/ChapterFour/0205. Isomorphic Strings.md b/website/content/ChapterFour/0205.Isomorphic-Strings.md
similarity index 100%
rename from website/content/ChapterFour/0205. Isomorphic Strings.md
rename to website/content/ChapterFour/0205.Isomorphic-Strings.md
diff --git a/website/content/ChapterFour/0206. Reverse-Linked-List.md b/website/content/ChapterFour/0206.Reverse-Linked-List.md
similarity index 100%
rename from website/content/ChapterFour/0206. Reverse-Linked-List.md
rename to website/content/ChapterFour/0206.Reverse-Linked-List.md
diff --git a/website/content/ChapterFour/0207. Course Schedule.md b/website/content/ChapterFour/0207.Course-Schedule.md
similarity index 100%
rename from website/content/ChapterFour/0207. Course Schedule.md
rename to website/content/ChapterFour/0207.Course-Schedule.md
diff --git a/website/content/ChapterFour/0208. Implement Trie (Prefix Tree).md b/website/content/ChapterFour/0208.Implement-Trie-Prefix-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0208. Implement Trie (Prefix Tree).md
rename to website/content/ChapterFour/0208.Implement-Trie-Prefix-Tree.md
diff --git a/website/content/ChapterFour/0209. Minimum Size Subarray Sum.md b/website/content/ChapterFour/0209.Minimum-Size-Subarray-Sum.md
similarity index 100%
rename from website/content/ChapterFour/0209. Minimum Size Subarray Sum.md
rename to website/content/ChapterFour/0209.Minimum-Size-Subarray-Sum.md
diff --git a/website/content/ChapterFour/0210. Course Schedule II.md b/website/content/ChapterFour/0210.Course-Schedule-II.md
similarity index 100%
rename from website/content/ChapterFour/0210. Course Schedule II.md
rename to website/content/ChapterFour/0210.Course-Schedule-II.md
diff --git a/website/content/ChapterFour/0211. Add and Search Word - Data structure design.md b/website/content/ChapterFour/0211.Add-and-Search-Word---Data-structure-design.md
similarity index 100%
rename from website/content/ChapterFour/0211. Add and Search Word - Data structure design.md
rename to website/content/ChapterFour/0211.Add-and-Search-Word---Data-structure-design.md
diff --git a/website/content/ChapterFour/0212. Word Search II.md b/website/content/ChapterFour/0212.Word-Search-II.md
similarity index 100%
rename from website/content/ChapterFour/0212. Word Search II.md
rename to website/content/ChapterFour/0212.Word-Search-II.md
diff --git a/website/content/ChapterFour/0213. House Robber II.md b/website/content/ChapterFour/0213.House-Robber-II.md
similarity index 100%
rename from website/content/ChapterFour/0213. House Robber II.md
rename to website/content/ChapterFour/0213.House-Robber-II.md
diff --git a/website/content/ChapterFour/0215. Kth Largest Element in an Array.md b/website/content/ChapterFour/0215.Kth-Largest-Element-in-an-Array.md
similarity index 100%
rename from website/content/ChapterFour/0215. Kth Largest Element in an Array.md
rename to website/content/ChapterFour/0215.Kth-Largest-Element-in-an-Array.md
diff --git a/website/content/ChapterFour/0216. Combination Sum III.md b/website/content/ChapterFour/0216.Combination-Sum-III.md
similarity index 100%
rename from website/content/ChapterFour/0216. Combination Sum III.md
rename to website/content/ChapterFour/0216.Combination-Sum-III.md
diff --git a/website/content/ChapterFour/0217. Contains Duplicate.md b/website/content/ChapterFour/0217.Contains-Duplicate.md
similarity index 100%
rename from website/content/ChapterFour/0217. Contains Duplicate.md
rename to website/content/ChapterFour/0217.Contains-Duplicate.md
diff --git a/website/content/ChapterFour/0218. The Skyline Problem.md b/website/content/ChapterFour/0218.The-Skyline-Problem.md
similarity index 99%
rename from website/content/ChapterFour/0218. The Skyline Problem.md
rename to website/content/ChapterFour/0218.The-Skyline-Problem.md
index ec9d0d50..0a4f2bc6 100755
--- a/website/content/ChapterFour/0218. The Skyline Problem.md
+++ b/website/content/ChapterFour/0218.The-Skyline-Problem.md
@@ -1,6 +1,6 @@
# [218. The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/)
-## 题目:
+## 题目
A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are **given the locations and height of all the buildings** as shown on a cityscape photo (Figure A), write a program to **output the skyline** formed by these buildings collectively (Figure B).
diff --git a/website/content/ChapterFour/0219. Contains Duplicate II.md b/website/content/ChapterFour/0219.Contains-Duplicate-II.md
similarity index 100%
rename from website/content/ChapterFour/0219. Contains Duplicate II.md
rename to website/content/ChapterFour/0219.Contains-Duplicate-II.md
diff --git a/website/content/ChapterFour/0220. Contains Duplicate III.md b/website/content/ChapterFour/0220.Contains-Duplicate-III.md
similarity index 100%
rename from website/content/ChapterFour/0220. Contains Duplicate III.md
rename to website/content/ChapterFour/0220.Contains-Duplicate-III.md
diff --git a/website/content/ChapterFour/0222. Count Complete Tree Nodes.md b/website/content/ChapterFour/0222.Count-Complete-Tree-Nodes.md
similarity index 100%
rename from website/content/ChapterFour/0222. Count Complete Tree Nodes.md
rename to website/content/ChapterFour/0222.Count-Complete-Tree-Nodes.md
diff --git a/website/content/ChapterFour/0223. Rectangle Area.md b/website/content/ChapterFour/0223.Rectangle-Area.md
similarity index 99%
rename from website/content/ChapterFour/0223. Rectangle Area.md
rename to website/content/ChapterFour/0223.Rectangle-Area.md
index 1a068cd6..08d9c64d 100755
--- a/website/content/ChapterFour/0223. Rectangle Area.md
+++ b/website/content/ChapterFour/0223.Rectangle-Area.md
@@ -1,7 +1,7 @@
# [223. Rectangle Area](https://leetcode.com/problems/rectangle-area/)
-## 题目:
+## 题目
Find the total area covered by two **rectilinear** rectangles in a **2D** plane.
diff --git a/website/content/ChapterFour/0224. Basic Calculator.md b/website/content/ChapterFour/0224.Basic-Calculator.md
similarity index 100%
rename from website/content/ChapterFour/0224. Basic Calculator.md
rename to website/content/ChapterFour/0224.Basic-Calculator.md
diff --git a/website/content/ChapterFour/0225. Implement Stack using Queues.md b/website/content/ChapterFour/0225.Implement-Stack-using-Queues.md
similarity index 100%
rename from website/content/ChapterFour/0225. Implement Stack using Queues.md
rename to website/content/ChapterFour/0225.Implement-Stack-using-Queues.md
diff --git a/website/content/ChapterFour/0226. Invert Binary Tree.md b/website/content/ChapterFour/0226.Invert-Binary-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0226. Invert Binary Tree.md
rename to website/content/ChapterFour/0226.Invert-Binary-Tree.md
diff --git a/website/content/ChapterFour/0229. Majority Element II.md b/website/content/ChapterFour/0229.Majority-Element-II.md
similarity index 99%
rename from website/content/ChapterFour/0229. Majority Element II.md
rename to website/content/ChapterFour/0229.Majority-Element-II.md
index 2f94b7fe..ce926058 100755
--- a/website/content/ChapterFour/0229. Majority Element II.md
+++ b/website/content/ChapterFour/0229.Majority-Element-II.md
@@ -1,7 +1,7 @@
# [229. Majority Element II](https://leetcode.com/problems/majority-element-ii/)
-## 题目:
+## 题目
Given an integer array of size n, find all elements that appear more than `⌊ n/3 ⌋` times.
diff --git a/website/content/ChapterFour/0230. Kth Smallest Element in a BST.md b/website/content/ChapterFour/0230.Kth-Smallest-Element-in-a-BST.md
similarity index 100%
rename from website/content/ChapterFour/0230. Kth Smallest Element in a BST.md
rename to website/content/ChapterFour/0230.Kth-Smallest-Element-in-a-BST.md
diff --git a/website/content/ChapterFour/0231. Power of Two.md b/website/content/ChapterFour/0231.Power-of-Two.md
similarity index 100%
rename from website/content/ChapterFour/0231. Power of Two.md
rename to website/content/ChapterFour/0231.Power-of-Two.md
diff --git a/website/content/ChapterFour/0232. Implement Queue using Stacks.md b/website/content/ChapterFour/0232.Implement-Queue-using-Stacks.md
similarity index 100%
rename from website/content/ChapterFour/0232. Implement Queue using Stacks.md
rename to website/content/ChapterFour/0232.Implement-Queue-using-Stacks.md
diff --git a/website/content/ChapterFour/0234. Palindrome Linked List.md b/website/content/ChapterFour/0234.Palindrome-Linked-List.md
similarity index 100%
rename from website/content/ChapterFour/0234. Palindrome Linked List.md
rename to website/content/ChapterFour/0234.Palindrome-Linked-List.md
diff --git a/website/content/ChapterFour/0235. Lowest Common Ancestor of a Binary Search Tree.md b/website/content/ChapterFour/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0235. Lowest Common Ancestor of a Binary Search Tree.md
rename to website/content/ChapterFour/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md
diff --git a/website/content/ChapterFour/0236. Lowest Common Ancestor of a Binary Tree.md b/website/content/ChapterFour/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0236. Lowest Common Ancestor of a Binary Tree.md
rename to website/content/ChapterFour/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md
diff --git a/website/content/ChapterFour/0237. Delete Node in a Linked List.md b/website/content/ChapterFour/0237.Delete-Node-in-a-Linked-List.md
similarity index 100%
rename from website/content/ChapterFour/0237. Delete Node in a Linked List.md
rename to website/content/ChapterFour/0237.Delete-Node-in-a-Linked-List.md
diff --git a/website/content/ChapterFour/0239. Sliding Window Maximum.md b/website/content/ChapterFour/0239.Sliding-Window-Maximum.md
similarity index 100%
rename from website/content/ChapterFour/0239. Sliding Window Maximum.md
rename to website/content/ChapterFour/0239.Sliding-Window-Maximum.md
diff --git a/website/content/ChapterFour/0240. Search a 2D Matrix II.md b/website/content/ChapterFour/0240.Search-a-2D-Matrix-II.md
similarity index 99%
rename from website/content/ChapterFour/0240. Search a 2D Matrix II.md
rename to website/content/ChapterFour/0240.Search-a-2D-Matrix-II.md
index 3cbda0c3..d8d92a10 100755
--- a/website/content/ChapterFour/0240. Search a 2D Matrix II.md
+++ b/website/content/ChapterFour/0240.Search-a-2D-Matrix-II.md
@@ -1,7 +1,7 @@
# [240. Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)
-## 题目:
+## 题目
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
diff --git a/website/content/ChapterFour/0242. Valid Anagram.md b/website/content/ChapterFour/0242.Valid-Anagram.md
similarity index 100%
rename from website/content/ChapterFour/0242. Valid Anagram.md
rename to website/content/ChapterFour/0242.Valid-Anagram.md
diff --git a/website/content/ChapterFour/0257. Binary Tree Paths.md b/website/content/ChapterFour/0257.Binary-Tree-Paths.md
similarity index 100%
rename from website/content/ChapterFour/0257. Binary Tree Paths.md
rename to website/content/ChapterFour/0257.Binary-Tree-Paths.md
diff --git a/website/content/ChapterFour/0260. Single Number III.md b/website/content/ChapterFour/0260.Single-Number-III.md
similarity index 99%
rename from website/content/ChapterFour/0260. Single Number III.md
rename to website/content/ChapterFour/0260.Single-Number-III.md
index a0afcad6..fa8e45b5 100755
--- a/website/content/ChapterFour/0260. Single Number III.md
+++ b/website/content/ChapterFour/0260.Single-Number-III.md
@@ -1,7 +1,7 @@
# [260. Single Number III](https://leetcode.com/problems/single-number-iii/)
-## 题目:
+## 题目
Given an array of numbers `nums`, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
diff --git a/website/content/ChapterFour/0263. Ugly Number.md b/website/content/ChapterFour/0263.Ugly-Number.md
similarity index 100%
rename from website/content/ChapterFour/0263. Ugly Number.md
rename to website/content/ChapterFour/0263.Ugly-Number.md
diff --git a/website/content/ChapterFour/0268. Missing Number.md b/website/content/ChapterFour/0268.Missing-Number.md
similarity index 98%
rename from website/content/ChapterFour/0268. Missing Number.md
rename to website/content/ChapterFour/0268.Missing-Number.md
index 05e3abb3..cf72f8c0 100755
--- a/website/content/ChapterFour/0268. Missing Number.md
+++ b/website/content/ChapterFour/0268.Missing-Number.md
@@ -1,7 +1,7 @@
# [268. Missing Number](https://leetcode.com/problems/missing-number/)
-## 题目:
+## 题目
Given an array containing n distinct numbers taken from `0, 1, 2, ..., n`, find the one that is missing from the array.
diff --git a/website/content/ChapterFour/0274. H-Index.md b/website/content/ChapterFour/0274.H-Index.md
similarity index 100%
rename from website/content/ChapterFour/0274. H-Index.md
rename to website/content/ChapterFour/0274.H-Index.md
diff --git a/website/content/ChapterFour/0275. H-Index II.md b/website/content/ChapterFour/0275.H-Index-II.md
similarity index 99%
rename from website/content/ChapterFour/0275. H-Index II.md
rename to website/content/ChapterFour/0275.H-Index-II.md
index 06f90238..21310f01 100755
--- a/website/content/ChapterFour/0275. H-Index II.md
+++ b/website/content/ChapterFour/0275.H-Index-II.md
@@ -1,6 +1,6 @@
# [275. H-Index II](https://leetcode.com/problems/h-index-ii/)
-## 题目:
+## 题目
Given an array of citations **sorted in ascending order** (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.
diff --git a/website/content/ChapterFour/0283. Move Zeroes.md b/website/content/ChapterFour/0283.Move-Zeroes.md
similarity index 100%
rename from website/content/ChapterFour/0283. Move Zeroes.md
rename to website/content/ChapterFour/0283.Move-Zeroes.md
diff --git a/website/content/ChapterFour/0287. Find the Duplicate Number.md b/website/content/ChapterFour/0287.Find-the-Duplicate-Number.md
similarity index 100%
rename from website/content/ChapterFour/0287. Find the Duplicate Number.md
rename to website/content/ChapterFour/0287.Find-the-Duplicate-Number.md
diff --git a/website/content/ChapterFour/0290. Word Pattern.md b/website/content/ChapterFour/0290.Word-Pattern.md
similarity index 100%
rename from website/content/ChapterFour/0290. Word Pattern.md
rename to website/content/ChapterFour/0290.Word-Pattern.md
diff --git a/website/content/ChapterFour/0300. Longest Increasing Subsequence.md b/website/content/ChapterFour/0300.Longest-Increasing-Subsequence.md
similarity index 100%
rename from website/content/ChapterFour/0300. Longest Increasing Subsequence.md
rename to website/content/ChapterFour/0300.Longest-Increasing-Subsequence.md
diff --git a/website/content/ChapterFour/0303. Range Sum Query - Immutable.md b/website/content/ChapterFour/0303.Range-Sum-Query---Immutable.md
similarity index 99%
rename from website/content/ChapterFour/0303. Range Sum Query - Immutable.md
rename to website/content/ChapterFour/0303.Range-Sum-Query---Immutable.md
index 50e4158c..12ebbe67 100755
--- a/website/content/ChapterFour/0303. Range Sum Query - Immutable.md
+++ b/website/content/ChapterFour/0303.Range-Sum-Query---Immutable.md
@@ -1,7 +1,7 @@
# [303. Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/)
-## 题目:
+## 题目
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
diff --git a/website/content/ChapterFour/0306. Additive Number.md b/website/content/ChapterFour/0306.Additive-Number.md
similarity index 100%
rename from website/content/ChapterFour/0306. Additive Number.md
rename to website/content/ChapterFour/0306.Additive-Number.md
diff --git a/website/content/ChapterFour/0307. Range Sum Query - Mutable.md b/website/content/ChapterFour/0307.Range-Sum-Query---Mutable.md
similarity index 99%
rename from website/content/ChapterFour/0307. Range Sum Query - Mutable.md
rename to website/content/ChapterFour/0307.Range-Sum-Query---Mutable.md
index e52228ab..1d17bbec 100755
--- a/website/content/ChapterFour/0307. Range Sum Query - Mutable.md
+++ b/website/content/ChapterFour/0307.Range-Sum-Query---Mutable.md
@@ -1,7 +1,7 @@
# [307. Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/)
-## 题目:
+## 题目
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
diff --git a/website/content/ChapterFour/0309. Best Time to Buy and Sell Stock with Cooldown.md b/website/content/ChapterFour/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md
similarity index 100%
rename from website/content/ChapterFour/0309. Best Time to Buy and Sell Stock with Cooldown.md
rename to website/content/ChapterFour/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md
diff --git a/website/content/ChapterFour/0315. Count of Smaller Numbers After Self.md b/website/content/ChapterFour/0315.Count-of-Smaller-Numbers-After-Self.md
similarity index 99%
rename from website/content/ChapterFour/0315. Count of Smaller Numbers After Self.md
rename to website/content/ChapterFour/0315.Count-of-Smaller-Numbers-After-Self.md
index b0ed2c99..e82ba661 100755
--- a/website/content/ChapterFour/0315. Count of Smaller Numbers After Self.md
+++ b/website/content/ChapterFour/0315.Count-of-Smaller-Numbers-After-Self.md
@@ -1,7 +1,7 @@
# [315. Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/)
-## 题目:
+## 题目
You are given an integer array nums and you have to return a new counts array. The counts array has the property where `counts[i]` is the number of smaller elements to the right of `nums[i]`.
diff --git a/website/content/ChapterFour/0318. Maximum Product of Word Lengths.md b/website/content/ChapterFour/0318.Maximum-Product-of-Word-Lengths.md
similarity index 99%
rename from website/content/ChapterFour/0318. Maximum Product of Word Lengths.md
rename to website/content/ChapterFour/0318.Maximum-Product-of-Word-Lengths.md
index 5a536d2b..7020a8bd 100755
--- a/website/content/ChapterFour/0318. Maximum Product of Word Lengths.md
+++ b/website/content/ChapterFour/0318.Maximum-Product-of-Word-Lengths.md
@@ -1,7 +1,7 @@
# [318. Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/)
-## 题目:
+## 题目
Given a string array `words`, find the maximum value of `length(word[i]) * length(word[j])` where the two words do not share common letters. You may assume that each word will contain only lower case letters. If no such two words exist, return 0.
diff --git a/website/content/ChapterFour/0322. Coin Change.md b/website/content/ChapterFour/0322.Coin-Change.md
similarity index 100%
rename from website/content/ChapterFour/0322. Coin Change.md
rename to website/content/ChapterFour/0322.Coin-Change.md
diff --git a/website/content/ChapterFour/0324. Wiggle Sort II.md b/website/content/ChapterFour/0324.Wiggle-Sort-II.md
similarity index 100%
rename from website/content/ChapterFour/0324. Wiggle Sort II.md
rename to website/content/ChapterFour/0324.Wiggle-Sort-II.md
diff --git a/website/content/ChapterFour/0326. Power of Three.md b/website/content/ChapterFour/0326.Power-of-Three.md
similarity index 100%
rename from website/content/ChapterFour/0326. Power of Three.md
rename to website/content/ChapterFour/0326.Power-of-Three.md
diff --git a/website/content/ChapterFour/0327. Count of Range Sum.md b/website/content/ChapterFour/0327.Count-of-Range-Sum.md
similarity index 99%
rename from website/content/ChapterFour/0327. Count of Range Sum.md
rename to website/content/ChapterFour/0327.Count-of-Range-Sum.md
index 0c6f21cc..87a5d324 100755
--- a/website/content/ChapterFour/0327. Count of Range Sum.md
+++ b/website/content/ChapterFour/0327.Count-of-Range-Sum.md
@@ -1,7 +1,7 @@
# [327. Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/)
-## 题目:
+## 题目
Given an integer array `nums`, return the number of range sums that lie in `[lower, upper]` inclusive.Range sum `S(i, j)` is defined as the sum of the elements in `nums` between indices `i` and `j` (`i` ≤ `j`), inclusive.
diff --git a/website/content/ChapterFour/0328. Odd Even Linked List.md b/website/content/ChapterFour/0328.Odd-Even-Linked-List.md
similarity index 100%
rename from website/content/ChapterFour/0328. Odd Even Linked List.md
rename to website/content/ChapterFour/0328.Odd-Even-Linked-List.md
diff --git a/website/content/ChapterFour/0329. Longest Increasing Path in a Matrix.md b/website/content/ChapterFour/0329.Longest-Increasing-Path-in-a-Matrix.md
similarity index 99%
rename from website/content/ChapterFour/0329. Longest Increasing Path in a Matrix.md
rename to website/content/ChapterFour/0329.Longest-Increasing-Path-in-a-Matrix.md
index 6b59c294..4ae43112 100755
--- a/website/content/ChapterFour/0329. Longest Increasing Path in a Matrix.md
+++ b/website/content/ChapterFour/0329.Longest-Increasing-Path-in-a-Matrix.md
@@ -1,7 +1,7 @@
# [329. Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/)
-## 题目:
+## 题目
Given an integer matrix, find the length of the longest increasing path.
diff --git a/website/content/ChapterFour/0331. Verify Preorder Serialization of a Binary Tree.md b/website/content/ChapterFour/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0331. Verify Preorder Serialization of a Binary Tree.md
rename to website/content/ChapterFour/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md
diff --git a/website/content/ChapterFour/0337. House Robber III.md b/website/content/ChapterFour/0337.House-Robber-III.md
similarity index 96%
rename from website/content/ChapterFour/0337. House Robber III.md
rename to website/content/ChapterFour/0337.House-Robber-III.md
index 9d7e070a..e8451881 100644
--- a/website/content/ChapterFour/0337. House Robber III.md
+++ b/website/content/ChapterFour/0337.House-Robber-III.md
@@ -1,4 +1,5 @@
-# 337. House Robber III
+# [337. House Robber III](https://leetcode.com/problems/house-robber-iii/)
+
## 题目
diff --git a/website/content/ChapterFour/0338. Counting Bits.md b/website/content/ChapterFour/0338.Counting-Bits.md
similarity index 100%
rename from website/content/ChapterFour/0338. Counting Bits.md
rename to website/content/ChapterFour/0338.Counting-Bits.md
diff --git a/website/content/ChapterFour/0342. Power of Four.md b/website/content/ChapterFour/0342.Power-of-Four.md
similarity index 100%
rename from website/content/ChapterFour/0342. Power of Four.md
rename to website/content/ChapterFour/0342.Power-of-Four.md
diff --git a/website/content/ChapterFour/0343. Integer Break.md b/website/content/ChapterFour/0343.Integer-Break.md
similarity index 100%
rename from website/content/ChapterFour/0343. Integer Break.md
rename to website/content/ChapterFour/0343.Integer-Break.md
diff --git a/website/content/ChapterFour/0344. Reverse String.md b/website/content/ChapterFour/0344.Reverse-String.md
similarity index 100%
rename from website/content/ChapterFour/0344. Reverse String.md
rename to website/content/ChapterFour/0344.Reverse-String.md
diff --git a/website/content/ChapterFour/0345. Reverse Vowels of a String.md b/website/content/ChapterFour/0345.Reverse-Vowels-of-a-String.md
similarity index 100%
rename from website/content/ChapterFour/0345. Reverse Vowels of a String.md
rename to website/content/ChapterFour/0345.Reverse-Vowels-of-a-String.md
diff --git a/website/content/ChapterFour/0347. Top K Frequent Elements.md b/website/content/ChapterFour/0347.Top-K-Frequent-Elements.md
similarity index 100%
rename from website/content/ChapterFour/0347. Top K Frequent Elements.md
rename to website/content/ChapterFour/0347.Top-K-Frequent-Elements.md
diff --git a/website/content/ChapterFour/0349. Intersection of Two Arrays.md b/website/content/ChapterFour/0349.Intersection-of-Two-Arrays.md
similarity index 100%
rename from website/content/ChapterFour/0349. Intersection of Two Arrays.md
rename to website/content/ChapterFour/0349.Intersection-of-Two-Arrays.md
diff --git a/website/content/ChapterFour/0350. Intersection of Two Arrays II.md b/website/content/ChapterFour/0350.Intersection-of-Two-Arrays-II.md
similarity index 100%
rename from website/content/ChapterFour/0350. Intersection of Two Arrays II.md
rename to website/content/ChapterFour/0350.Intersection-of-Two-Arrays-II.md
diff --git a/website/content/ChapterFour/0354. Russian Doll Envelopes.md b/website/content/ChapterFour/0354.Russian-Doll-Envelopes.md
similarity index 99%
rename from website/content/ChapterFour/0354. Russian Doll Envelopes.md
rename to website/content/ChapterFour/0354.Russian-Doll-Envelopes.md
index eb1ef366..810345d3 100755
--- a/website/content/ChapterFour/0354. Russian Doll Envelopes.md
+++ b/website/content/ChapterFour/0354.Russian-Doll-Envelopes.md
@@ -1,7 +1,7 @@
# [354. Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/)
-## 题目:
+## 题目
You have a number of envelopes with widths and heights given as a pair of integers `(w, h)`. One envelope can fit into another if and only if both the width and height of one envelope is greater than the width and height of the other envelope.
diff --git a/website/content/ChapterFour/0357. Count Numbers with Unique Digits.md b/website/content/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md
similarity index 100%
rename from website/content/ChapterFour/0357. Count Numbers with Unique Digits.md
rename to website/content/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md
diff --git a/website/content/ChapterFour/0367. Valid Perfect Square.md b/website/content/ChapterFour/0367.Valid-Perfect-Square.md
similarity index 98%
rename from website/content/ChapterFour/0367. Valid Perfect Square.md
rename to website/content/ChapterFour/0367.Valid-Perfect-Square.md
index 2cdfb93e..50584b0d 100755
--- a/website/content/ChapterFour/0367. Valid Perfect Square.md
+++ b/website/content/ChapterFour/0367.Valid-Perfect-Square.md
@@ -1,6 +1,6 @@
# [367. Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/)
-## 题目:
+## 题目
Given a positive integer num, write a function which returns True if num is a perfect square else False.
diff --git a/website/content/ChapterFour/0371. Sum of Two Integers.md b/website/content/ChapterFour/0371.Sum-of-Two-Integers.md
similarity index 98%
rename from website/content/ChapterFour/0371. Sum of Two Integers.md
rename to website/content/ChapterFour/0371.Sum-of-Two-Integers.md
index cd9405f8..31318dd7 100755
--- a/website/content/ChapterFour/0371. Sum of Two Integers.md
+++ b/website/content/ChapterFour/0371.Sum-of-Two-Integers.md
@@ -1,7 +1,7 @@
# [371. Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)
-## 题目:
+## 题目
Calculate the sum of two integers a and b, but you are **not allowed** to use the operator `+` and `-`.
diff --git a/website/content/ChapterFour/0372. Super Pow.md b/website/content/ChapterFour/0372.Super-Pow.md
similarity index 99%
rename from website/content/ChapterFour/0372. Super Pow.md
rename to website/content/ChapterFour/0372.Super-Pow.md
index a5907889..79b2830c 100755
--- a/website/content/ChapterFour/0372. Super Pow.md
+++ b/website/content/ChapterFour/0372.Super-Pow.md
@@ -1,7 +1,7 @@
# [372. Super Pow](https://leetcode.com/problems/super-pow/)
-## 题目:
+## 题目
Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.
diff --git a/website/content/ChapterFour/0373. Find K Pairs with Smallest Sums.md b/website/content/ChapterFour/0373.Find-K-Pairs-with-Smallest-Sums.md
similarity index 99%
rename from website/content/ChapterFour/0373. Find K Pairs with Smallest Sums.md
rename to website/content/ChapterFour/0373.Find-K-Pairs-with-Smallest-Sums.md
index e02c7f9c..237c063d 100755
--- a/website/content/ChapterFour/0373. Find K Pairs with Smallest Sums.md
+++ b/website/content/ChapterFour/0373.Find-K-Pairs-with-Smallest-Sums.md
@@ -1,7 +1,7 @@
# [373. Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/)
-## 题目:
+## 题目
You are given two integer arrays **nums1** and **nums2** sorted in ascending order and an integer **k**.
diff --git a/website/content/ChapterFour/0378. Kth Smallest Element in a Sorted Matrix.md b/website/content/ChapterFour/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md
similarity index 99%
rename from website/content/ChapterFour/0378. Kth Smallest Element in a Sorted Matrix.md
rename to website/content/ChapterFour/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md
index 36d0ddb1..922adeeb 100755
--- a/website/content/ChapterFour/0378. Kth Smallest Element in a Sorted Matrix.md
+++ b/website/content/ChapterFour/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md
@@ -1,7 +1,7 @@
# [378. Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/)
-## 题目:
+## 题目
Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix.
diff --git a/website/content/ChapterFour/0385. Mini Parser.md b/website/content/ChapterFour/0385.Mini-Parser.md
similarity index 99%
rename from website/content/ChapterFour/0385. Mini Parser.md
rename to website/content/ChapterFour/0385.Mini-Parser.md
index f75e76d3..57a00d32 100755
--- a/website/content/ChapterFour/0385. Mini Parser.md
+++ b/website/content/ChapterFour/0385.Mini-Parser.md
@@ -1,7 +1,7 @@
# [385. Mini Parser](https://leetcode.com/problems/mini-parser/)
-## 题目:
+## 题目
Given a nested list of integers represented as a string, implement a parser to deserialize it.
diff --git a/website/content/ChapterFour/0386. Lexicographical Numbers.md b/website/content/ChapterFour/0386.Lexicographical-Numbers.md
similarity index 98%
rename from website/content/ChapterFour/0386. Lexicographical Numbers.md
rename to website/content/ChapterFour/0386.Lexicographical-Numbers.md
index a62f887c..7bb82d4b 100755
--- a/website/content/ChapterFour/0386. Lexicographical Numbers.md
+++ b/website/content/ChapterFour/0386.Lexicographical-Numbers.md
@@ -1,7 +1,7 @@
# [386. Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/)
-## 题目:
+## 题目
Given an integer n, return 1 - n in lexicographical order.
diff --git a/website/content/ChapterFour/0387. First Unique Character in a String.md b/website/content/ChapterFour/0387.First-Unique-Character-in-a-String.md
similarity index 98%
rename from website/content/ChapterFour/0387. First Unique Character in a String.md
rename to website/content/ChapterFour/0387.First-Unique-Character-in-a-String.md
index 28f0b07b..b3ccff4c 100755
--- a/website/content/ChapterFour/0387. First Unique Character in a String.md
+++ b/website/content/ChapterFour/0387.First-Unique-Character-in-a-String.md
@@ -1,6 +1,6 @@
# [387. First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/)
-## 题目:
+## 题目
Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.
diff --git a/website/content/ChapterFour/0389. Find the Difference.md b/website/content/ChapterFour/0389.Find-the-Difference.md
similarity index 98%
rename from website/content/ChapterFour/0389. Find the Difference.md
rename to website/content/ChapterFour/0389.Find-the-Difference.md
index 121fee29..57b53354 100755
--- a/website/content/ChapterFour/0389. Find the Difference.md
+++ b/website/content/ChapterFour/0389.Find-the-Difference.md
@@ -1,6 +1,6 @@
# [389. Find the Difference](https://leetcode.com/problems/find-the-difference/)
-## 题目:
+## 题目
Given two strings **s** and **t** which consist of only lowercase letters.
diff --git a/website/content/ChapterFour/0392. Is Subsequence.md b/website/content/ChapterFour/0392.Is-Subsequence.md
similarity index 100%
rename from website/content/ChapterFour/0392. Is Subsequence.md
rename to website/content/ChapterFour/0392.Is-Subsequence.md
diff --git a/website/content/ChapterFour/0393. UTF-8 Validation.md b/website/content/ChapterFour/0393.UTF-8-Validation.md
similarity index 99%
rename from website/content/ChapterFour/0393. UTF-8 Validation.md
rename to website/content/ChapterFour/0393.UTF-8-Validation.md
index c090de30..1d8b50fb 100755
--- a/website/content/ChapterFour/0393. UTF-8 Validation.md
+++ b/website/content/ChapterFour/0393.UTF-8-Validation.md
@@ -2,7 +2,7 @@
-## 题目:
+## 题目
A character in UTF8 can be from **1 to 4 bytes** long, subjected to the following rules:
diff --git a/website/content/ChapterFour/0394. Decode String.md b/website/content/ChapterFour/0394.Decode-String.md
similarity index 100%
rename from website/content/ChapterFour/0394. Decode String.md
rename to website/content/ChapterFour/0394.Decode-String.md
diff --git a/website/content/ChapterFour/0397. Integer Replacement.md b/website/content/ChapterFour/0397.Integer-Replacement.md
similarity index 99%
rename from website/content/ChapterFour/0397. Integer Replacement.md
rename to website/content/ChapterFour/0397.Integer-Replacement.md
index cb068196..1dea6f59 100755
--- a/website/content/ChapterFour/0397. Integer Replacement.md
+++ b/website/content/ChapterFour/0397.Integer-Replacement.md
@@ -1,7 +1,7 @@
# [397. Integer Replacement](https://leetcode.com/problems/integer-replacement/)
-## 题目:
+## 题目
Given a positive integer n and you can do operations as follow:
diff --git a/website/content/ChapterFour/0399. Evaluate Division.md b/website/content/ChapterFour/0399.Evaluate-Division.md
similarity index 99%
rename from website/content/ChapterFour/0399. Evaluate Division.md
rename to website/content/ChapterFour/0399.Evaluate-Division.md
index 5e4dc78c..d4cf4524 100755
--- a/website/content/ChapterFour/0399. Evaluate Division.md
+++ b/website/content/ChapterFour/0399.Evaluate-Division.md
@@ -1,7 +1,7 @@
# [399. Evaluate Division](https://leetcode.com/problems/evaluate-division/)
-## 题目:
+## 题目
Equations are given in the format `A / B = k`, where `A` and `B` are variables represented as strings, and `k` is a real number (floating point number). Given some queries, return the answers. If the answer does not exist, return `-1.0`.
diff --git a/website/content/ChapterFour/0401. Binary Watch.md b/website/content/ChapterFour/0401.Binary-Watch.md
similarity index 100%
rename from website/content/ChapterFour/0401. Binary Watch.md
rename to website/content/ChapterFour/0401.Binary-Watch.md
diff --git a/website/content/ChapterFour/0402. Remove K Digits.md b/website/content/ChapterFour/0402.Remove-K-Digits.md
similarity index 100%
rename from website/content/ChapterFour/0402. Remove K Digits.md
rename to website/content/ChapterFour/0402.Remove-K-Digits.md
diff --git a/website/content/ChapterFour/0404. Sum of Left Leaves.md b/website/content/ChapterFour/0404.Sum-of-Left-Leaves.md
similarity index 100%
rename from website/content/ChapterFour/0404. Sum of Left Leaves.md
rename to website/content/ChapterFour/0404.Sum-of-Left-Leaves.md
diff --git a/website/content/ChapterFour/0405. Convert a Number to Hexadecimal.md b/website/content/ChapterFour/0405.Convert-a-Number-to-Hexadecimal.md
similarity index 99%
rename from website/content/ChapterFour/0405. Convert a Number to Hexadecimal.md
rename to website/content/ChapterFour/0405.Convert-a-Number-to-Hexadecimal.md
index cc4393cf..c77a0258 100755
--- a/website/content/ChapterFour/0405. Convert a Number to Hexadecimal.md
+++ b/website/content/ChapterFour/0405.Convert-a-Number-to-Hexadecimal.md
@@ -1,7 +1,7 @@
# [405. Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal/)
-## 题目:
+## 题目
Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, [two’s complement](https://en.wikipedia.org/wiki/Two%27s_complement) method is used.
diff --git a/website/content/ChapterFour/0409. Longest Palindrome.md b/website/content/ChapterFour/0409.Longest-Palindrome.md
similarity index 99%
rename from website/content/ChapterFour/0409. Longest Palindrome.md
rename to website/content/ChapterFour/0409.Longest-Palindrome.md
index ccc70a68..a0e18ad1 100755
--- a/website/content/ChapterFour/0409. Longest Palindrome.md
+++ b/website/content/ChapterFour/0409.Longest-Palindrome.md
@@ -1,7 +1,7 @@
# [409. Longest Palindrome](https://leetcode.com/problems/longest-palindrome/)
-## 题目:
+## 题目
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.
diff --git a/website/content/ChapterFour/0410. Split Array Largest Sum.md b/website/content/ChapterFour/0410.Split-Array-Largest-Sum.md
similarity index 99%
rename from website/content/ChapterFour/0410. Split Array Largest Sum.md
rename to website/content/ChapterFour/0410.Split-Array-Largest-Sum.md
index 5659df60..f4ce4e9b 100755
--- a/website/content/ChapterFour/0410. Split Array Largest Sum.md
+++ b/website/content/ChapterFour/0410.Split-Array-Largest-Sum.md
@@ -1,7 +1,7 @@
# [410. Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/)
-## 题目:
+## 题目
Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m subarrays.
diff --git a/website/content/ChapterFour/0412. Fizz Buzz.md b/website/content/ChapterFour/0412.Fizz-Buzz.md
similarity index 100%
rename from website/content/ChapterFour/0412. Fizz Buzz.md
rename to website/content/ChapterFour/0412.Fizz-Buzz.md
diff --git a/website/content/ChapterFour/0414. Third Maximum Number.md b/website/content/ChapterFour/0414.Third-Maximum-Number.md
similarity index 100%
rename from website/content/ChapterFour/0414. Third Maximum Number.md
rename to website/content/ChapterFour/0414.Third-Maximum-Number.md
diff --git a/website/content/ChapterFour/0416. Partition Equal Subset Sum.md b/website/content/ChapterFour/0416.Partition-Equal-Subset-Sum.md
similarity index 100%
rename from website/content/ChapterFour/0416. Partition Equal Subset Sum.md
rename to website/content/ChapterFour/0416.Partition-Equal-Subset-Sum.md
diff --git a/website/content/ChapterFour/0421. Maximum XOR of Two Numbers in an Array.md b/website/content/ChapterFour/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md
similarity index 99%
rename from website/content/ChapterFour/0421. Maximum XOR of Two Numbers in an Array.md
rename to website/content/ChapterFour/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md
index 150f5975..e4c527b3 100755
--- a/website/content/ChapterFour/0421. Maximum XOR of Two Numbers in an Array.md
+++ b/website/content/ChapterFour/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md
@@ -1,7 +1,7 @@
# [421. Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/)
-## 题目:
+## 题目
Given a **non-empty** array of numbers, a0, a1, a2, … , an-1, where 0 ≤ ai < 231.
diff --git a/website/content/ChapterFour/0424. Longest Repeating Character Replacement.md b/website/content/ChapterFour/0424.Longest-Repeating-Character-Replacement.md
similarity index 100%
rename from website/content/ChapterFour/0424. Longest Repeating Character Replacement.md
rename to website/content/ChapterFour/0424.Longest-Repeating-Character-Replacement.md
diff --git a/website/content/ChapterFour/0433. Minimum Genetic Mutation.md b/website/content/ChapterFour/0433.Minimum-Genetic-Mutation.md
similarity index 100%
rename from website/content/ChapterFour/0433. Minimum Genetic Mutation.md
rename to website/content/ChapterFour/0433.Minimum-Genetic-Mutation.md
diff --git a/website/content/ChapterFour/0435. Non-overlapping Intervals.md b/website/content/ChapterFour/0435.Non-overlapping-Intervals.md
similarity index 100%
rename from website/content/ChapterFour/0435. Non-overlapping Intervals.md
rename to website/content/ChapterFour/0435.Non-overlapping-Intervals.md
diff --git a/website/content/ChapterFour/0436. Find Right Interval.md b/website/content/ChapterFour/0436.Find-Right-Interval.md
similarity index 99%
rename from website/content/ChapterFour/0436. Find Right Interval.md
rename to website/content/ChapterFour/0436.Find-Right-Interval.md
index 40b11ce7..2bb73c8d 100755
--- a/website/content/ChapterFour/0436. Find Right Interval.md
+++ b/website/content/ChapterFour/0436.Find-Right-Interval.md
@@ -1,7 +1,7 @@
# [436. Find Right Interval](https://leetcode.com/problems/find-right-interval/)
-## 题目:
+## 题目
Given a set of intervals, for each of the interval i, check if there exists an interval j whose start point is bigger than or equal to the end point of the interval i, which can be called that j is on the "right" of i.
diff --git a/website/content/ChapterFour/0437. Path Sum III.md b/website/content/ChapterFour/0437.Path-Sum-III.md
similarity index 100%
rename from website/content/ChapterFour/0437. Path Sum III.md
rename to website/content/ChapterFour/0437.Path-Sum-III.md
diff --git a/website/content/ChapterFour/0438. Find All Anagrams in a String.md b/website/content/ChapterFour/0438.Find-All-Anagrams-in-a-String.md
similarity index 100%
rename from website/content/ChapterFour/0438. Find All Anagrams in a String.md
rename to website/content/ChapterFour/0438.Find-All-Anagrams-in-a-String.md
diff --git a/website/content/ChapterFour/0441. Arranging Coins.md b/website/content/ChapterFour/0441.Arranging-Coins.md
similarity index 99%
rename from website/content/ChapterFour/0441. Arranging Coins.md
rename to website/content/ChapterFour/0441.Arranging-Coins.md
index 47a6c191..d76eb626 100755
--- a/website/content/ChapterFour/0441. Arranging Coins.md
+++ b/website/content/ChapterFour/0441.Arranging-Coins.md
@@ -1,6 +1,6 @@
# [441. Arranging Coins](https://leetcode.com/problems/arranging-coins/)
-## 题目:
+## 题目
You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.
diff --git a/website/content/ChapterFour/0445. Add Two Numbers II.md b/website/content/ChapterFour/0445.Add-Two-Numbers-II.md
similarity index 100%
rename from website/content/ChapterFour/0445. Add Two Numbers II.md
rename to website/content/ChapterFour/0445.Add-Two-Numbers-II.md
diff --git a/website/content/ChapterFour/0447. Number of Boomerangs.md b/website/content/ChapterFour/0447.Number-of-Boomerangs.md
similarity index 100%
rename from website/content/ChapterFour/0447. Number of Boomerangs.md
rename to website/content/ChapterFour/0447.Number-of-Boomerangs.md
diff --git a/website/content/ChapterFour/0451. Sort Characters By Frequency.md b/website/content/ChapterFour/0451.Sort-Characters-By-Frequency.md
similarity index 100%
rename from website/content/ChapterFour/0451. Sort Characters By Frequency.md
rename to website/content/ChapterFour/0451.Sort-Characters-By-Frequency.md
diff --git a/website/content/ChapterFour/0454. 4Sum II.md b/website/content/ChapterFour/0454.4Sum-II.md
similarity index 100%
rename from website/content/ChapterFour/0454. 4Sum II.md
rename to website/content/ChapterFour/0454.4Sum-II.md
diff --git a/website/content/ChapterFour/0455. Assign Cookies.md b/website/content/ChapterFour/0455.Assign-Cookies.md
similarity index 100%
rename from website/content/ChapterFour/0455. Assign Cookies.md
rename to website/content/ChapterFour/0455.Assign-Cookies.md
diff --git a/website/content/ChapterFour/0456. 132 Pattern.md b/website/content/ChapterFour/0456.132-Pattern.md
similarity index 100%
rename from website/content/ChapterFour/0456. 132 Pattern.md
rename to website/content/ChapterFour/0456.132-Pattern.md
diff --git a/website/content/ChapterFour/0457. Circular Array Loop.md b/website/content/ChapterFour/0457.Circular-Array-Loop.md
similarity index 99%
rename from website/content/ChapterFour/0457. Circular Array Loop.md
rename to website/content/ChapterFour/0457.Circular-Array-Loop.md
index 517a5d5a..89756b22 100755
--- a/website/content/ChapterFour/0457. Circular Array Loop.md
+++ b/website/content/ChapterFour/0457.Circular-Array-Loop.md
@@ -1,7 +1,7 @@
# [457. Circular Array Loop](https://leetcode.com/problems/circular-array-loop/)
-## 题目:
+## 题目
You are given a **circular** array `nums` of positive and negative integers. If a number k at an index is positive, then move forward k steps. Conversely, if it's negative (-k), move backward k steps. Since the array is circular, you may assume that the last element's next element is the first element, and the first element's previous element is the last element.
diff --git a/website/content/ChapterFour/0461. Hamming Distance.md b/website/content/ChapterFour/0461.Hamming-Distance.md
similarity index 98%
rename from website/content/ChapterFour/0461. Hamming Distance.md
rename to website/content/ChapterFour/0461.Hamming-Distance.md
index 480b8767..9d0d75c0 100755
--- a/website/content/ChapterFour/0461. Hamming Distance.md
+++ b/website/content/ChapterFour/0461.Hamming-Distance.md
@@ -1,6 +1,6 @@
# [461. Hamming Distance](https://leetcode.com/problems/hamming-distance/)
-## 题目:
+## 题目
The [Hamming distance](https://en.wikipedia.org/wiki/Hamming_distance) between two integers is the number of positions at which the corresponding bits are different.
diff --git a/website/content/ChapterFour/0463. Island Perimeter.md b/website/content/ChapterFour/0463.Island-Perimeter.md
similarity index 99%
rename from website/content/ChapterFour/0463. Island Perimeter.md
rename to website/content/ChapterFour/0463.Island-Perimeter.md
index c7c4fd07..7a319887 100755
--- a/website/content/ChapterFour/0463. Island Perimeter.md
+++ b/website/content/ChapterFour/0463.Island-Perimeter.md
@@ -1,6 +1,6 @@
# [463. Island Perimeter](https://leetcode.com/problems/island-perimeter/)
-## 题目:
+## 题目
You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water.
diff --git a/website/content/ChapterFour/0470. Implement Rand10() Using Rand7().md b/website/content/ChapterFour/0470.Implement-Rand10-Using-Rand7.md
similarity index 99%
rename from website/content/ChapterFour/0470. Implement Rand10() Using Rand7().md
rename to website/content/ChapterFour/0470.Implement-Rand10-Using-Rand7.md
index 12c58bf4..1c650ca3 100755
--- a/website/content/ChapterFour/0470. Implement Rand10() Using Rand7().md
+++ b/website/content/ChapterFour/0470.Implement-Rand10-Using-Rand7.md
@@ -1,7 +1,7 @@
# [470. Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7/)
-## 题目:
+## 题目
Given a function `rand7` which generates a uniform random integer in the range 1 to 7, write a function `rand10` which generates a uniform random integer in the range 1 to 10.
diff --git a/website/content/ChapterFour/0474. Ones and Zeroes.md b/website/content/ChapterFour/0474.Ones-and-Zeroes.md
similarity index 99%
rename from website/content/ChapterFour/0474. Ones and Zeroes.md
rename to website/content/ChapterFour/0474.Ones-and-Zeroes.md
index 47ac8ffd..65e29392 100755
--- a/website/content/ChapterFour/0474. Ones and Zeroes.md
+++ b/website/content/ChapterFour/0474.Ones-and-Zeroes.md
@@ -1,7 +1,7 @@
# [474. Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/)
-## 题目:
+## 题目
In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.
diff --git a/website/content/ChapterFour/0475. Heaters.md b/website/content/ChapterFour/0475.Heaters.md
similarity index 99%
rename from website/content/ChapterFour/0475. Heaters.md
rename to website/content/ChapterFour/0475.Heaters.md
index fdea3c54..bbe46ca7 100755
--- a/website/content/ChapterFour/0475. Heaters.md
+++ b/website/content/ChapterFour/0475.Heaters.md
@@ -1,6 +1,6 @@
# [475. Heaters](https://leetcode.com/problems/heaters/)
-## 题目:
+## 题目
Winter is coming! Your first job during the contest is to design a standard heater with fixed warm radius to warm all the houses.
diff --git a/website/content/ChapterFour/0476. Number Complement.md b/website/content/ChapterFour/0476.Number-Complement.md
similarity index 99%
rename from website/content/ChapterFour/0476. Number Complement.md
rename to website/content/ChapterFour/0476.Number-Complement.md
index bd2da0fa..1bc61a9e 100755
--- a/website/content/ChapterFour/0476. Number Complement.md
+++ b/website/content/ChapterFour/0476.Number-Complement.md
@@ -1,7 +1,7 @@
# [476. Number Complement](https://leetcode.com/problems/number-complement/)
-## 题目:
+## 题目
Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.
diff --git a/website/content/ChapterFour/0477. Total Hamming Distance.md b/website/content/ChapterFour/0477.Total-Hamming-Distance.md
similarity index 99%
rename from website/content/ChapterFour/0477. Total Hamming Distance.md
rename to website/content/ChapterFour/0477.Total-Hamming-Distance.md
index bf377617..f3e64a05 100755
--- a/website/content/ChapterFour/0477. Total Hamming Distance.md
+++ b/website/content/ChapterFour/0477.Total-Hamming-Distance.md
@@ -1,7 +1,7 @@
# [477. Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/)
-## 题目:
+## 题目
The [Hamming distance](https://en.wikipedia.org/wiki/Hamming_distance) between two integers is the number of positions at which the corresponding bits are different.
diff --git a/website/content/ChapterFour/0480. Sliding Window Median.md b/website/content/ChapterFour/0480.Sliding-Window-Median.md
similarity index 100%
rename from website/content/ChapterFour/0480. Sliding Window Median.md
rename to website/content/ChapterFour/0480.Sliding-Window-Median.md
diff --git a/website/content/ChapterFour/0483. Smallest Good Base.md b/website/content/ChapterFour/0483.Smallest-Good-Base.md
similarity index 99%
rename from website/content/ChapterFour/0483. Smallest Good Base.md
rename to website/content/ChapterFour/0483.Smallest-Good-Base.md
index 0c01297b..117d95c4 100755
--- a/website/content/ChapterFour/0483. Smallest Good Base.md
+++ b/website/content/ChapterFour/0483.Smallest-Good-Base.md
@@ -1,7 +1,7 @@
# [483. Smallest Good Base](https://leetcode.com/problems/smallest-good-base/)
-## 题目:
+## 题目
For an integer n, we call k>=2 a **good base** of n, if all digits of n base k are 1.
diff --git a/website/content/ChapterFour/0491. Increasing Subsequences.md b/website/content/ChapterFour/0491.Increasing-Subsequences.md
similarity index 99%
rename from website/content/ChapterFour/0491. Increasing Subsequences.md
rename to website/content/ChapterFour/0491.Increasing-Subsequences.md
index c34229f1..9a262bb7 100755
--- a/website/content/ChapterFour/0491. Increasing Subsequences.md
+++ b/website/content/ChapterFour/0491.Increasing-Subsequences.md
@@ -1,7 +1,7 @@
# [491. Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/)
-## 题目:
+## 题目
Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2.
diff --git a/website/content/ChapterFour/0493. Reverse Pairs.md b/website/content/ChapterFour/0493.Reverse-Pairs.md
similarity index 99%
rename from website/content/ChapterFour/0493. Reverse Pairs.md
rename to website/content/ChapterFour/0493.Reverse-Pairs.md
index 31235732..6335db07 100755
--- a/website/content/ChapterFour/0493. Reverse Pairs.md
+++ b/website/content/ChapterFour/0493.Reverse-Pairs.md
@@ -1,7 +1,7 @@
# [493. Reverse Pairs](https://leetcode.com/problems/reverse-pairs/)
-## 题目:
+## 题目
Given an array `nums`, we call `(i, j)` an **important reverse pair** if `i < j` and `nums[i] > 2*nums[j]`.
diff --git a/website/content/ChapterFour/0494. Target Sum.md b/website/content/ChapterFour/0494.Target-Sum.md
similarity index 98%
rename from website/content/ChapterFour/0494. Target Sum.md
rename to website/content/ChapterFour/0494.Target-Sum.md
index 12fe8a9d..dd3c2b10 100644
--- a/website/content/ChapterFour/0494. Target Sum.md
+++ b/website/content/ChapterFour/0494.Target-Sum.md
@@ -1,4 +1,5 @@
-# 494. Target Sum
+# [494. Target Sum](https://leetcode.com/problems/target-sum/)
+
## 题目
diff --git a/website/content/ChapterFour/0496. Next Greater Element I.md b/website/content/ChapterFour/0496.Next-Greater-Element-I.md
similarity index 100%
rename from website/content/ChapterFour/0496. Next Greater Element I.md
rename to website/content/ChapterFour/0496.Next-Greater-Element-I.md
diff --git a/website/content/ChapterFour/0497. Random Point in Non-overlapping Rectangles.md b/website/content/ChapterFour/0497.Random-Point-in-Non-overlapping-Rectangles.md
similarity index 99%
rename from website/content/ChapterFour/0497. Random Point in Non-overlapping Rectangles.md
rename to website/content/ChapterFour/0497.Random-Point-in-Non-overlapping-Rectangles.md
index 58ede9a7..3c68e053 100755
--- a/website/content/ChapterFour/0497. Random Point in Non-overlapping Rectangles.md
+++ b/website/content/ChapterFour/0497.Random-Point-in-Non-overlapping-Rectangles.md
@@ -1,7 +1,7 @@
# [497. Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles)
-## 题目:
+## 题目
Given a list of **non-overlapping** axis-aligned rectangles `rects`, write a function `pick` which randomly and uniformily picks an **integer point** in the space covered by the rectangles.
diff --git a/website/content/ChapterFour/0498. Diagonal Traverse.md b/website/content/ChapterFour/0498.Diagonal-Traverse.md
similarity index 99%
rename from website/content/ChapterFour/0498. Diagonal Traverse.md
rename to website/content/ChapterFour/0498.Diagonal-Traverse.md
index 8e89c6ea..f28348a6 100755
--- a/website/content/ChapterFour/0498. Diagonal Traverse.md
+++ b/website/content/ChapterFour/0498.Diagonal-Traverse.md
@@ -1,7 +1,7 @@
# [498. Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse/)
-## 题目:
+## 题目
Given a matrix of M x N elements (M rows, N columns), return all elements of the matrix in diagonal order as shown in the below image.
diff --git a/website/content/ChapterFour/0500. Keyboard Row.md b/website/content/ChapterFour/0500.Keyboard-Row.md
similarity index 98%
rename from website/content/ChapterFour/0500. Keyboard Row.md
rename to website/content/ChapterFour/0500.Keyboard-Row.md
index ef7bb175..6d6eda08 100755
--- a/website/content/ChapterFour/0500. Keyboard Row.md
+++ b/website/content/ChapterFour/0500.Keyboard-Row.md
@@ -1,7 +1,7 @@
# [500. Keyboard Row](https://leetcode.com/problems/keyboard-row/)
-## 题目:
+## 题目
Given a List of words, return the words that can be typed using letters of **alphabet** on only one row's of American keyboard like the image below.
diff --git a/website/content/ChapterFour/0503. Next Greater Element II.md b/website/content/ChapterFour/0503.Next-Greater-Element-II.md
similarity index 100%
rename from website/content/ChapterFour/0503. Next Greater Element II.md
rename to website/content/ChapterFour/0503.Next-Greater-Element-II.md
diff --git a/website/content/ChapterFour/0508. Most Frequent Subtree Sum.md b/website/content/ChapterFour/0508.Most-Frequent-Subtree-Sum.md
similarity index 99%
rename from website/content/ChapterFour/0508. Most Frequent Subtree Sum.md
rename to website/content/ChapterFour/0508.Most-Frequent-Subtree-Sum.md
index c04adc55..91c2a9a6 100755
--- a/website/content/ChapterFour/0508. Most Frequent Subtree Sum.md
+++ b/website/content/ChapterFour/0508.Most-Frequent-Subtree-Sum.md
@@ -1,7 +1,7 @@
# [508. Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/)
-## 题目:
+## 题目
Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (including the node itself). So what is the most frequent subtree sum value? If there is a tie, return all the values with the highest frequency in any order.
diff --git a/website/content/ChapterFour/0509. Fibonacci Number.md b/website/content/ChapterFour/0509.Fibonacci-Number.md
similarity index 99%
rename from website/content/ChapterFour/0509. Fibonacci Number.md
rename to website/content/ChapterFour/0509.Fibonacci-Number.md
index 64eb23bd..ee304607 100755
--- a/website/content/ChapterFour/0509. Fibonacci Number.md
+++ b/website/content/ChapterFour/0509.Fibonacci-Number.md
@@ -1,7 +1,7 @@
# [509. Fibonacci Number](https://leetcode.com/problems/fibonacci-number/)
-## 题目:
+## 题目
The **Fibonacci numbers**, commonly denoted `F(n)` form a sequence, called the **Fibonacci sequence**, such that each number is the sum of the two preceding ones, starting from `0` and `1`. That is,
diff --git a/website/content/ChapterFour/0513. Find Bottom Left Tree Value.md b/website/content/ChapterFour/0513.Find-Bottom-Left-Tree-Value.md
similarity index 99%
rename from website/content/ChapterFour/0513. Find Bottom Left Tree Value.md
rename to website/content/ChapterFour/0513.Find-Bottom-Left-Tree-Value.md
index 7e0fdc02..c4f7f083 100755
--- a/website/content/ChapterFour/0513. Find Bottom Left Tree Value.md
+++ b/website/content/ChapterFour/0513.Find-Bottom-Left-Tree-Value.md
@@ -1,7 +1,7 @@
# [513. Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/)
-## 题目:
+## 题目
Given a binary tree, find the leftmost value in the last row of the tree.
diff --git a/website/content/ChapterFour/0515. Find Largest Value in Each Tree Row.md b/website/content/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md
similarity index 100%
rename from website/content/ChapterFour/0515. Find Largest Value in Each Tree Row.md
rename to website/content/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md
diff --git a/website/content/ChapterFour/0524. Longest Word in Dictionary through Deleting.md b/website/content/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md
similarity index 100%
rename from website/content/ChapterFour/0524. Longest Word in Dictionary through Deleting.md
rename to website/content/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md
diff --git a/website/content/ChapterFour/0526. Beautiful Arrangement.md b/website/content/ChapterFour/0526.Beautiful-Arrangement.md
similarity index 100%
rename from website/content/ChapterFour/0526. Beautiful Arrangement.md
rename to website/content/ChapterFour/0526.Beautiful-Arrangement.md
diff --git a/website/content/ChapterFour/0528. Random Pick with Weight.md b/website/content/ChapterFour/0528.Random-Pick-with-Weight.md
similarity index 99%
rename from website/content/ChapterFour/0528. Random Pick with Weight.md
rename to website/content/ChapterFour/0528.Random-Pick-with-Weight.md
index 0c71cb5f..9e5d6397 100755
--- a/website/content/ChapterFour/0528. Random Pick with Weight.md
+++ b/website/content/ChapterFour/0528.Random-Pick-with-Weight.md
@@ -1,7 +1,7 @@
# [528. Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/)
-## 题目:
+## 题目
Given an array `w` of positive integers, where `w[i]` describes the weight of index `i`, write a function `pickIndex` which randomly picks an index in proportion to its weight.
diff --git a/website/content/ChapterFour/0529. Minesweeper.md b/website/content/ChapterFour/0529.Minesweeper.md
similarity index 98%
rename from website/content/ChapterFour/0529. Minesweeper.md
rename to website/content/ChapterFour/0529.Minesweeper.md
index 2de52660..f2166a69 100644
--- a/website/content/ChapterFour/0529. Minesweeper.md
+++ b/website/content/ChapterFour/0529.Minesweeper.md
@@ -1,4 +1,5 @@
-# 529. Minesweeper
+# [529. Minesweeper](https://leetcode.com/problems/minesweeper/)
+
## 题目
diff --git a/website/content/ChapterFour/0532. K-diff Pairs in an Array.md b/website/content/ChapterFour/0532.K-diff-Pairs-in-an-Array.md
similarity index 100%
rename from website/content/ChapterFour/0532. K-diff Pairs in an Array.md
rename to website/content/ChapterFour/0532.K-diff-Pairs-in-an-Array.md
diff --git a/website/content/ChapterFour/0541. Reverse String II.md b/website/content/ChapterFour/0541.Reverse-String-II.md
similarity index 99%
rename from website/content/ChapterFour/0541. Reverse String II.md
rename to website/content/ChapterFour/0541.Reverse-String-II.md
index 31de69cf..8d9ebdaf 100755
--- a/website/content/ChapterFour/0541. Reverse String II.md
+++ b/website/content/ChapterFour/0541.Reverse-String-II.md
@@ -1,7 +1,7 @@
# [541. Reverse String II](https://leetcode.com/problems/reverse-string-ii/)
-## 题目:
+## 题目
Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k characters left, reverse all of them. If there are less than 2k but greater than or equal to k characters, then reverse the first k characters and left the other as original.
diff --git a/website/content/ChapterFour/0542. 01 Matrix.md b/website/content/ChapterFour/0542.01-Matrix.md
similarity index 100%
rename from website/content/ChapterFour/0542. 01 Matrix.md
rename to website/content/ChapterFour/0542.01-Matrix.md
diff --git a/website/content/ChapterFour/0547. Friend Circles.md b/website/content/ChapterFour/0547.Friend-Circles.md
similarity index 99%
rename from website/content/ChapterFour/0547. Friend Circles.md
rename to website/content/ChapterFour/0547.Friend-Circles.md
index 80e7f1a8..a5597297 100755
--- a/website/content/ChapterFour/0547. Friend Circles.md
+++ b/website/content/ChapterFour/0547.Friend-Circles.md
@@ -1,6 +1,6 @@
# [547. Friend Circles](https://leetcode.com/problems/friend-circles/)
-## 题目:
+## 题目
There are **N** students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a **direct** friend of B, and B is a **direct**friend of C, then A is an **indirect** friend of C. And we defined a friend circle is a group of students who are direct or indirect friends.
diff --git a/website/content/ChapterFour/0557. Reverse Words in a String III.md b/website/content/ChapterFour/0557.Reverse-Words-in-a-String-III.md
similarity index 98%
rename from website/content/ChapterFour/0557. Reverse Words in a String III.md
rename to website/content/ChapterFour/0557.Reverse-Words-in-a-String-III.md
index f5d79a41..68363ed8 100755
--- a/website/content/ChapterFour/0557. Reverse Words in a String III.md
+++ b/website/content/ChapterFour/0557.Reverse-Words-in-a-String-III.md
@@ -1,7 +1,7 @@
# [557. Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/)
-## 题目:
+## 题目
Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.
diff --git a/website/content/ChapterFour/0563. Binary Tree Tilt.md b/website/content/ChapterFour/0563.Binary-Tree-Tilt.md
similarity index 99%
rename from website/content/ChapterFour/0563. Binary Tree Tilt.md
rename to website/content/ChapterFour/0563.Binary-Tree-Tilt.md
index b51e48c8..b5a8ce5c 100755
--- a/website/content/ChapterFour/0563. Binary Tree Tilt.md
+++ b/website/content/ChapterFour/0563.Binary-Tree-Tilt.md
@@ -1,7 +1,7 @@
# [563. Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/)
-## 题目:
+## 题目
Given a binary tree, return the tilt of the **whole tree**.
diff --git a/website/content/ChapterFour/0566. Reshape the Matrix.md b/website/content/ChapterFour/0566.Reshape-the-Matrix.md
similarity index 100%
rename from website/content/ChapterFour/0566. Reshape the Matrix.md
rename to website/content/ChapterFour/0566.Reshape-the-Matrix.md
diff --git a/website/content/ChapterFour/0567. Permutation in String.md b/website/content/ChapterFour/0567.Permutation-in-String.md
similarity index 100%
rename from website/content/ChapterFour/0567. Permutation in String.md
rename to website/content/ChapterFour/0567.Permutation-in-String.md
diff --git a/website/content/ChapterFour/0572. Subtree of Another Tree.md b/website/content/ChapterFour/0572.Subtree-of-Another-Tree.md
similarity index 99%
rename from website/content/ChapterFour/0572. Subtree of Another Tree.md
rename to website/content/ChapterFour/0572.Subtree-of-Another-Tree.md
index 850e66dd..21611c12 100755
--- a/website/content/ChapterFour/0572. Subtree of Another Tree.md
+++ b/website/content/ChapterFour/0572.Subtree-of-Another-Tree.md
@@ -1,7 +1,7 @@
# [572. Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)
-## 题目:
+## 题目
Given two non-empty binary trees **s** and **t**, check whether tree **t** has exactly the same structure and node values with a subtree of **s**. A subtree of **s** is a tree consists of a node in **s** and all of this node's descendants. The tree **s** could also be considered as a subtree of itself.
diff --git a/website/content/ChapterFour/0575. Distribute Candies.md b/website/content/ChapterFour/0575.Distribute-Candies.md
similarity index 99%
rename from website/content/ChapterFour/0575. Distribute Candies.md
rename to website/content/ChapterFour/0575.Distribute-Candies.md
index bc43db88..4e329936 100755
--- a/website/content/ChapterFour/0575. Distribute Candies.md
+++ b/website/content/ChapterFour/0575.Distribute-Candies.md
@@ -1,7 +1,7 @@
# [575. Distribute Candies](https://leetcode.com/problems/distribute-candies/)
-## 题目:
+## 题目
Given an integer array with **even** length, where different numbers in this array represent different **kinds** of candies. Each number means one candy of the corresponding kind. You need to distribute these candies **equally** in number to brother and sister. Return the maximum number of **kinds** of candies the sister could gain.
diff --git a/website/content/ChapterFour/0594. Longest Harmonious Subsequence.md b/website/content/ChapterFour/0594.Longest-Harmonious-Subsequence.md
similarity index 99%
rename from website/content/ChapterFour/0594. Longest Harmonious Subsequence.md
rename to website/content/ChapterFour/0594.Longest-Harmonious-Subsequence.md
index aa69541f..380ad65a 100755
--- a/website/content/ChapterFour/0594. Longest Harmonious Subsequence.md
+++ b/website/content/ChapterFour/0594.Longest-Harmonious-Subsequence.md
@@ -1,7 +1,7 @@
# [594. Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/)
-## 题目:
+## 题目
We define a harmounious array as an array where the difference between its maximum value and its minimum value is **exactly** 1.
diff --git a/website/content/ChapterFour/0599. Minimum Index Sum of Two Lists.md b/website/content/ChapterFour/0599.Minimum-Index-Sum-of-Two-Lists.md
similarity index 99%
rename from website/content/ChapterFour/0599. Minimum Index Sum of Two Lists.md
rename to website/content/ChapterFour/0599.Minimum-Index-Sum-of-Two-Lists.md
index 6b562516..01cc155e 100755
--- a/website/content/ChapterFour/0599. Minimum Index Sum of Two Lists.md
+++ b/website/content/ChapterFour/0599.Minimum-Index-Sum-of-Two-Lists.md
@@ -1,6 +1,6 @@
# [599. Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists/)
-## 题目:
+## 题目
Suppose Andy and Doris want to choose a restaurant for dinner, and they both have a list of favorite restaurants represented by strings.
diff --git a/website/content/ChapterFour/0628. Maximum Product of Three Numbers.md b/website/content/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md
similarity index 100%
rename from website/content/ChapterFour/0628. Maximum Product of Three Numbers.md
rename to website/content/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md
diff --git a/website/content/ChapterFour/0632. Smallest Range Covering Elements from K Lists.md b/website/content/ChapterFour/0632.Smallest-Range-Covering-Elements-from-K-Lists.md
similarity index 99%
rename from website/content/ChapterFour/0632. Smallest Range Covering Elements from K Lists.md
rename to website/content/ChapterFour/0632.Smallest-Range-Covering-Elements-from-K-Lists.md
index 18d57d14..b1187be9 100755
--- a/website/content/ChapterFour/0632. Smallest Range Covering Elements from K Lists.md
+++ b/website/content/ChapterFour/0632.Smallest-Range-Covering-Elements-from-K-Lists.md
@@ -1,7 +1,7 @@
# [632. Smallest Range Covering Elements from K Lists](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/)
-## 题目:
+## 题目
You have `k` lists of sorted integers in ascending order. Find the **smallest** range that includes at least one number from each of the `k` lists.
diff --git a/website/content/ChapterFour/0633. Sum of Square Numbers.md b/website/content/ChapterFour/0633.Sum-of-Square-Numbers.md
similarity index 98%
rename from website/content/ChapterFour/0633. Sum of Square Numbers.md
rename to website/content/ChapterFour/0633.Sum-of-Square-Numbers.md
index d0bce859..4af1d2a4 100755
--- a/website/content/ChapterFour/0633. Sum of Square Numbers.md
+++ b/website/content/ChapterFour/0633.Sum-of-Square-Numbers.md
@@ -1,7 +1,7 @@
# [633. Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers/)
-## 题目:
+## 题目
Given a non-negative integer `c`, your task is to decide whether there're two integers `a` and `b` such that a^2 + b^2 = c.
diff --git a/website/content/ChapterFour/0636. Exclusive Time of Functions.md b/website/content/ChapterFour/0636.Exclusive-Time-of-Functions.md
similarity index 100%
rename from website/content/ChapterFour/0636. Exclusive Time of Functions.md
rename to website/content/ChapterFour/0636.Exclusive-Time-of-Functions.md
diff --git a/website/content/ChapterFour/0637. Average of Levels in Binary Tree.md b/website/content/ChapterFour/0637.Average-of-Levels-in-Binary-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0637. Average of Levels in Binary Tree.md
rename to website/content/ChapterFour/0637.Average-of-Levels-in-Binary-Tree.md
diff --git a/website/content/ChapterFour/0638. Shopping Offers.md b/website/content/ChapterFour/0638.Shopping-Offers.md
similarity index 98%
rename from website/content/ChapterFour/0638. Shopping Offers.md
rename to website/content/ChapterFour/0638.Shopping-Offers.md
index db0c53d6..cf389acb 100644
--- a/website/content/ChapterFour/0638. Shopping Offers.md
+++ b/website/content/ChapterFour/0638.Shopping-Offers.md
@@ -1,4 +1,5 @@
-# 638. Shopping Offers
+# [638. Shopping Offers](https://leetcode.com/problems/shopping-offers/)
+
## 题目
diff --git a/website/content/ChapterFour/0645. Set Mismatch.md b/website/content/ChapterFour/0645.Set-Mismatch.md
similarity index 99%
rename from website/content/ChapterFour/0645. Set Mismatch.md
rename to website/content/ChapterFour/0645.Set-Mismatch.md
index 247194ca..9236fd4c 100755
--- a/website/content/ChapterFour/0645. Set Mismatch.md
+++ b/website/content/ChapterFour/0645.Set-Mismatch.md
@@ -1,7 +1,7 @@
# [645. Set Mismatch](https://leetcode.com/problems/set-mismatch/)
-## 题目:
+## 题目
The set `S` originally contains numbers from 1 to `n`. But unfortunately, due to the data error, one of the numbers in the set got duplicated to **another** number in the set, which results in repetition of one number and loss of another number.
diff --git a/website/content/ChapterFour/0648. Replace Words.md b/website/content/ChapterFour/0648.Replace-Words.md
similarity index 100%
rename from website/content/ChapterFour/0648. Replace Words.md
rename to website/content/ChapterFour/0648.Replace-Words.md
diff --git a/website/content/ChapterFour/0653. Two Sum IV - Input is a BST.md b/website/content/ChapterFour/0653.Two-Sum-IV---Input-is-a-BST.md
similarity index 99%
rename from website/content/ChapterFour/0653. Two Sum IV - Input is a BST.md
rename to website/content/ChapterFour/0653.Two-Sum-IV---Input-is-a-BST.md
index 77468173..e203db03 100755
--- a/website/content/ChapterFour/0653. Two Sum IV - Input is a BST.md
+++ b/website/content/ChapterFour/0653.Two-Sum-IV---Input-is-a-BST.md
@@ -1,6 +1,6 @@
# [653. Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/)
-## 题目:
+## 题目
Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.
diff --git a/website/content/ChapterFour/0658. Find K Closest Elements.md b/website/content/ChapterFour/0658.Find-K-Closest-Elements.md
similarity index 99%
rename from website/content/ChapterFour/0658. Find K Closest Elements.md
rename to website/content/ChapterFour/0658.Find-K-Closest-Elements.md
index 0445450f..b55ced18 100755
--- a/website/content/ChapterFour/0658. Find K Closest Elements.md
+++ b/website/content/ChapterFour/0658.Find-K-Closest-Elements.md
@@ -1,7 +1,7 @@
# [658. Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/)
-## 题目:
+## 题目
Given a sorted array, two integers `k` and `x`, find the `k` closest elements to `x` in the array. The result should also be sorted in ascending order. If there is a tie, the smaller elements are always preferred.
diff --git a/website/content/ChapterFour/0662. Maximum Width of Binary Tree.md b/website/content/ChapterFour/0662.Maximum-Width-of-Binary-Tree.md
similarity index 99%
rename from website/content/ChapterFour/0662. Maximum Width of Binary Tree.md
rename to website/content/ChapterFour/0662.Maximum-Width-of-Binary-Tree.md
index 6c381049..d60af025 100755
--- a/website/content/ChapterFour/0662. Maximum Width of Binary Tree.md
+++ b/website/content/ChapterFour/0662.Maximum-Width-of-Binary-Tree.md
@@ -1,7 +1,7 @@
# [662. Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/)
-## 题目:
+## 题目
Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has the same structure as a **full binary tree**, but some nodes are null.
diff --git a/website/content/ChapterFour/0668. Kth Smallest Number in Multiplication Table.md b/website/content/ChapterFour/0668.Kth-Smallest-Number-in-Multiplication-Table.md
similarity index 99%
rename from website/content/ChapterFour/0668. Kth Smallest Number in Multiplication Table.md
rename to website/content/ChapterFour/0668.Kth-Smallest-Number-in-Multiplication-Table.md
index 2a1e8ae7..491973cb 100755
--- a/website/content/ChapterFour/0668. Kth Smallest Number in Multiplication Table.md
+++ b/website/content/ChapterFour/0668.Kth-Smallest-Number-in-Multiplication-Table.md
@@ -1,7 +1,7 @@
# [668. Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/)
-## 题目:
+## 题目
Nearly every one have used the [Multiplication Table](https://en.wikipedia.org/wiki/Multiplication_table). But could you find out the `k-th` smallest number quickly from the multiplication table?
diff --git a/website/content/ChapterFour/0676. Implement Magic Dictionary.md b/website/content/ChapterFour/0676.Implement-Magic-Dictionary.md
similarity index 100%
rename from website/content/ChapterFour/0676. Implement Magic Dictionary.md
rename to website/content/ChapterFour/0676.Implement-Magic-Dictionary.md
diff --git a/website/content/ChapterFour/0682. Baseball Game.md b/website/content/ChapterFour/0682.Baseball-Game.md
similarity index 100%
rename from website/content/ChapterFour/0682. Baseball Game.md
rename to website/content/ChapterFour/0682.Baseball-Game.md
diff --git a/website/content/ChapterFour/0684. Redundant Connection.md b/website/content/ChapterFour/0684.Redundant-Connection.md
similarity index 99%
rename from website/content/ChapterFour/0684. Redundant Connection.md
rename to website/content/ChapterFour/0684.Redundant-Connection.md
index 5ae4181e..527d61be 100755
--- a/website/content/ChapterFour/0684. Redundant Connection.md
+++ b/website/content/ChapterFour/0684.Redundant-Connection.md
@@ -1,7 +1,7 @@
# [684. Redundant Connection](https://leetcode.com/problems/redundant-connection/)
-## 题目:
+## 题目
In this problem, a tree is an **undirected** graph that is connected and has no cycles.
diff --git a/website/content/ChapterFour/0685. Redundant Connection II.md b/website/content/ChapterFour/0685.Redundant-Connection-II.md
similarity index 99%
rename from website/content/ChapterFour/0685. Redundant Connection II.md
rename to website/content/ChapterFour/0685.Redundant-Connection-II.md
index de64cf3b..d6436f4b 100755
--- a/website/content/ChapterFour/0685. Redundant Connection II.md
+++ b/website/content/ChapterFour/0685.Redundant-Connection-II.md
@@ -1,7 +1,7 @@
# [685. Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii/)
-## 题目:
+## 题目
In this problem, a rooted tree is a **directed** graph such that, there is exactly one node (the root) for which all other nodes are descendants of this node, plus every node has exactly one parent, except for the root node which has no parents.
diff --git a/website/content/ChapterFour/0693. Binary Number with Alternating Bits.md b/website/content/ChapterFour/0693.Binary-Number-with-Alternating-Bits.md
similarity index 99%
rename from website/content/ChapterFour/0693. Binary Number with Alternating Bits.md
rename to website/content/ChapterFour/0693.Binary-Number-with-Alternating-Bits.md
index 851b4af9..290e2cda 100755
--- a/website/content/ChapterFour/0693. Binary Number with Alternating Bits.md
+++ b/website/content/ChapterFour/0693.Binary-Number-with-Alternating-Bits.md
@@ -1,6 +1,6 @@
# [693. Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits/)
-## 题目:
+## 题目
Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.
diff --git a/website/content/ChapterFour/0695. Max Area of Island.md b/website/content/ChapterFour/0695.Max-Area-of-Island.md
similarity index 96%
rename from website/content/ChapterFour/0695. Max Area of Island.md
rename to website/content/ChapterFour/0695.Max-Area-of-Island.md
index de48bec2..2419d561 100644
--- a/website/content/ChapterFour/0695. Max Area of Island.md
+++ b/website/content/ChapterFour/0695.Max-Area-of-Island.md
@@ -1,4 +1,5 @@
-# 695. Max Area of Island
+# [695. Max Area of Island](https://leetcode.com/problems/max-area-of-island/)
+
## 题目
diff --git a/website/content/ChapterFour/0699. Falling Squares.md b/website/content/ChapterFour/0699.Falling-Squares.md
similarity index 99%
rename from website/content/ChapterFour/0699. Falling Squares.md
rename to website/content/ChapterFour/0699.Falling-Squares.md
index 4c627a4c..a3228a87 100755
--- a/website/content/ChapterFour/0699. Falling Squares.md
+++ b/website/content/ChapterFour/0699.Falling-Squares.md
@@ -1,7 +1,7 @@
# [699. Falling Squares](https://leetcode.com/problems/falling-squares/)
-## 题目:
+## 题目
On an infinite number line (x-axis), we drop given squares in the order they are given.
diff --git a/website/content/ChapterFour/0704. Binary Search.md b/website/content/ChapterFour/0704.Binary-Search.md
similarity index 99%
rename from website/content/ChapterFour/0704. Binary Search.md
rename to website/content/ChapterFour/0704.Binary-Search.md
index 4a66af98..b10293d9 100755
--- a/website/content/ChapterFour/0704. Binary Search.md
+++ b/website/content/ChapterFour/0704.Binary-Search.md
@@ -1,7 +1,7 @@
# [704. Binary Search](https://leetcode.com/problems/binary-search/)
-## 题目:
+## 题目
Given a **sorted** (in ascending order) integer array `nums` of `n` elements and a `target` value, write a function to search `target` in `nums`. If `target` exists, then return its index, otherwise return `-1`.
diff --git a/website/content/ChapterFour/0705. Design HashSet.md b/website/content/ChapterFour/0705.Design-HashSet.md
similarity index 99%
rename from website/content/ChapterFour/0705. Design HashSet.md
rename to website/content/ChapterFour/0705.Design-HashSet.md
index f81f30c0..d4d241f7 100755
--- a/website/content/ChapterFour/0705. Design HashSet.md
+++ b/website/content/ChapterFour/0705.Design-HashSet.md
@@ -1,7 +1,7 @@
# [705. Design HashSet](https://leetcode.com/problems/design-hashset/)
-## 题目:
+## 题目
Design a HashSet without using any built-in hash table libraries.
diff --git a/website/content/ChapterFour/0706. Design HashMap.md b/website/content/ChapterFour/0706.Design-HashMap.md
similarity index 99%
rename from website/content/ChapterFour/0706. Design HashMap.md
rename to website/content/ChapterFour/0706.Design-HashMap.md
index 7909336d..80146098 100755
--- a/website/content/ChapterFour/0706. Design HashMap.md
+++ b/website/content/ChapterFour/0706.Design-HashMap.md
@@ -1,7 +1,7 @@
# [706. Design HashMap](https://leetcode.com/problems/design-hashmap/)
-## 题目:
+## 题目
Design a HashMap without using any built-in hash table libraries.
diff --git a/website/content/ChapterFour/0707. Design Linked List.md b/website/content/ChapterFour/0707.Design-Linked-List.md
similarity index 100%
rename from website/content/ChapterFour/0707. Design Linked List.md
rename to website/content/ChapterFour/0707.Design-Linked-List.md
diff --git a/website/content/ChapterFour/0710. Random Pick with Blacklist.md b/website/content/ChapterFour/0710.Random-Pick-with-Blacklist.md
similarity index 100%
rename from website/content/ChapterFour/0710. Random Pick with Blacklist.md
rename to website/content/ChapterFour/0710.Random-Pick-with-Blacklist.md
diff --git a/website/content/ChapterFour/0713. Subarray Product Less Than K.md b/website/content/ChapterFour/0713.Subarray-Product-Less-Than-K.md
similarity index 100%
rename from website/content/ChapterFour/0713. Subarray Product Less Than K.md
rename to website/content/ChapterFour/0713.Subarray-Product-Less-Than-K.md
diff --git a/website/content/ChapterFour/0714. Best Time to Buy and Sell Stock with Transaction Fee.md b/website/content/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md
similarity index 100%
rename from website/content/ChapterFour/0714. Best Time to Buy and Sell Stock with Transaction Fee.md
rename to website/content/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md
diff --git a/website/content/ChapterFour/0715. Range Module.md b/website/content/ChapterFour/0715.Range-Module.md
similarity index 99%
rename from website/content/ChapterFour/0715. Range Module.md
rename to website/content/ChapterFour/0715.Range-Module.md
index 0537b1c4..acd40364 100755
--- a/website/content/ChapterFour/0715. Range Module.md
+++ b/website/content/ChapterFour/0715.Range-Module.md
@@ -1,7 +1,7 @@
# [715. Range Module](https://leetcode.com/problems/range-module/)
-## 题目:
+## 题目
A Range Module is a module that tracks ranges of numbers. Your task is to design and implement the following interfaces in an efficient manner.
diff --git a/website/content/ChapterFour/0717. 1-bit and 2-bit Characters.md b/website/content/ChapterFour/0717.1-bit-and-2-bit-Characters.md
similarity index 100%
rename from website/content/ChapterFour/0717. 1-bit and 2-bit Characters.md
rename to website/content/ChapterFour/0717.1-bit-and-2-bit-Characters.md
diff --git a/website/content/ChapterFour/0718. Maximum Length of Repeated Subarray.md b/website/content/ChapterFour/0718.Maximum-Length-of-Repeated-Subarray.md
similarity index 99%
rename from website/content/ChapterFour/0718. Maximum Length of Repeated Subarray.md
rename to website/content/ChapterFour/0718.Maximum-Length-of-Repeated-Subarray.md
index 399602f5..eec248fe 100755
--- a/website/content/ChapterFour/0718. Maximum Length of Repeated Subarray.md
+++ b/website/content/ChapterFour/0718.Maximum-Length-of-Repeated-Subarray.md
@@ -1,7 +1,7 @@
# [718. Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/)
-## 题目:
+## 题目
Given two integer arrays `A` and `B`, return the maximum length of an subarray that appears in both arrays.
diff --git a/website/content/ChapterFour/0719. Find K-th Smallest Pair Distance.md b/website/content/ChapterFour/0719.Find-K-th-Smallest-Pair-Distance.md
similarity index 99%
rename from website/content/ChapterFour/0719. Find K-th Smallest Pair Distance.md
rename to website/content/ChapterFour/0719.Find-K-th-Smallest-Pair-Distance.md
index 8e5be618..836b8922 100755
--- a/website/content/ChapterFour/0719. Find K-th Smallest Pair Distance.md
+++ b/website/content/ChapterFour/0719.Find-K-th-Smallest-Pair-Distance.md
@@ -1,7 +1,7 @@
# [719. Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance/)
-## 题目:
+## 题目
Given an integer array, return the k-th smallest **distance** among all the pairs. The distance of a pair (A, B) is defined as the absolute difference between A and B.
diff --git a/website/content/ChapterFour/0720. Longest Word in Dictionary.md b/website/content/ChapterFour/0720.Longest-Word-in-Dictionary.md
similarity index 100%
rename from website/content/ChapterFour/0720. Longest Word in Dictionary.md
rename to website/content/ChapterFour/0720.Longest-Word-in-Dictionary.md
diff --git a/website/content/ChapterFour/0721. Accounts Merge.md b/website/content/ChapterFour/0721.Accounts-Merge.md
similarity index 99%
rename from website/content/ChapterFour/0721. Accounts Merge.md
rename to website/content/ChapterFour/0721.Accounts-Merge.md
index f99cc3f2..352343d9 100755
--- a/website/content/ChapterFour/0721. Accounts Merge.md
+++ b/website/content/ChapterFour/0721.Accounts-Merge.md
@@ -1,7 +1,7 @@
# [721. Accounts Merge](https://leetcode.com/problems/accounts-merge/)
-## 题目:
+## 题目
Given a list `accounts`, each element `accounts[i]` is a list of strings, where the first element `accounts[i][0]` is a name, and the rest of the elements are emailsrepresenting emails of the account.
diff --git a/website/content/ChapterFour/0725. Split Linked List in Parts.md b/website/content/ChapterFour/0725.Split-Linked-List-in-Parts.md
similarity index 100%
rename from website/content/ChapterFour/0725. Split Linked List in Parts.md
rename to website/content/ChapterFour/0725.Split-Linked-List-in-Parts.md
diff --git a/website/content/ChapterFour/0726. Number of Atoms.md b/website/content/ChapterFour/0726.Number-of-Atoms.md
similarity index 100%
rename from website/content/ChapterFour/0726. Number of Atoms.md
rename to website/content/ChapterFour/0726.Number-of-Atoms.md
diff --git a/website/content/ChapterFour/0729. My Calendar I.md b/website/content/ChapterFour/0729.My-Calendar-I.md
similarity index 99%
rename from website/content/ChapterFour/0729. My Calendar I.md
rename to website/content/ChapterFour/0729.My-Calendar-I.md
index 7e59574e..bc957aba 100755
--- a/website/content/ChapterFour/0729. My Calendar I.md
+++ b/website/content/ChapterFour/0729.My-Calendar-I.md
@@ -1,7 +1,7 @@
# [729. My Calendar I](https://leetcode.com/problems/my-calendar-i/)
-## 题目:
+## 题目
Implement a `MyCalendar` class to store your events. A new event can be added if adding the event will not cause a double booking.
diff --git a/website/content/ChapterFour/0732. My Calendar III.md b/website/content/ChapterFour/0732.My-Calendar-III.md
similarity index 99%
rename from website/content/ChapterFour/0732. My Calendar III.md
rename to website/content/ChapterFour/0732.My-Calendar-III.md
index 666dc152..5b953911 100755
--- a/website/content/ChapterFour/0732. My Calendar III.md
+++ b/website/content/ChapterFour/0732.My-Calendar-III.md
@@ -1,7 +1,7 @@
# [732. My Calendar III](https://leetcode.com/problems/my-calendar-iii/)
-## 题目:
+## 题目
Implement a `MyCalendarThree` class to store your events. A new event can **always** be added.
diff --git a/website/content/ChapterFour/0733. Flood Fill.md b/website/content/ChapterFour/0733.Flood-Fill.md
similarity index 99%
rename from website/content/ChapterFour/0733. Flood Fill.md
rename to website/content/ChapterFour/0733.Flood-Fill.md
index c49c406d..8fd2bba3 100755
--- a/website/content/ChapterFour/0733. Flood Fill.md
+++ b/website/content/ChapterFour/0733.Flood-Fill.md
@@ -1,7 +1,7 @@
# [733. Flood Fill](https://leetcode.com/problems/flood-fill/)
-## 题目:
+## 题目
An `image` is represented by a 2-D array of integers, each integer representing the pixel value of the image (from 0 to 65535).
diff --git a/website/content/ChapterFour/0735. Asteroid Collision.md b/website/content/ChapterFour/0735.Asteroid-Collision.md
similarity index 100%
rename from website/content/ChapterFour/0735. Asteroid Collision.md
rename to website/content/ChapterFour/0735.Asteroid-Collision.md
diff --git a/website/content/ChapterFour/0739. Daily Temperatures.md b/website/content/ChapterFour/0739.Daily-Temperatures.md
similarity index 100%
rename from website/content/ChapterFour/0739. Daily Temperatures.md
rename to website/content/ChapterFour/0739.Daily-Temperatures.md
diff --git a/website/content/ChapterFour/0744. Find Smallest Letter Greater Than Target.md b/website/content/ChapterFour/0744.Find-Smallest-Letter-Greater-Than-Target.md
similarity index 99%
rename from website/content/ChapterFour/0744. Find Smallest Letter Greater Than Target.md
rename to website/content/ChapterFour/0744.Find-Smallest-Letter-Greater-Than-Target.md
index f384ec22..fc6e6208 100755
--- a/website/content/ChapterFour/0744. Find Smallest Letter Greater Than Target.md
+++ b/website/content/ChapterFour/0744.Find-Smallest-Letter-Greater-Than-Target.md
@@ -1,7 +1,7 @@
# [744. Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target/)
-## 题目:
+## 题目
Given a list of sorted characters `letters` containing only lowercase letters, and given a target letter `target`, find the smallest element in the list that is larger than the given target.
diff --git a/website/content/ChapterFour/0745. Prefix and Suffix Search.md b/website/content/ChapterFour/0745.Prefix-and-Suffix-Search.md
similarity index 100%
rename from website/content/ChapterFour/0745. Prefix and Suffix Search.md
rename to website/content/ChapterFour/0745.Prefix-and-Suffix-Search.md
diff --git a/website/content/ChapterFour/0746. Min Cost Climbing Stairs.md b/website/content/ChapterFour/0746.Min-Cost-Climbing-Stairs.md
similarity index 100%
rename from website/content/ChapterFour/0746. Min Cost Climbing Stairs.md
rename to website/content/ChapterFour/0746.Min-Cost-Climbing-Stairs.md
diff --git a/website/content/ChapterFour/0748. Shortest Completing Word.md b/website/content/ChapterFour/0748.Shortest-Completing-Word.md
similarity index 99%
rename from website/content/ChapterFour/0748. Shortest Completing Word.md
rename to website/content/ChapterFour/0748.Shortest-Completing-Word.md
index e368a1ca..ec0267e3 100755
--- a/website/content/ChapterFour/0748. Shortest Completing Word.md
+++ b/website/content/ChapterFour/0748.Shortest-Completing-Word.md
@@ -1,7 +1,7 @@
# [748. Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word/)
-## 题目:
+## 题目
Find the minimum length word from a given dictionary `words`, which has all the letters from the string `licensePlate`. Such a word is said to complete the given string `licensePlate`
diff --git a/website/content/ChapterFour/0753. Cracking the Safe.md b/website/content/ChapterFour/0753.Cracking-the-Safe.md
similarity index 97%
rename from website/content/ChapterFour/0753. Cracking the Safe.md
rename to website/content/ChapterFour/0753.Cracking-the-Safe.md
index ff056cce..39c79a48 100644
--- a/website/content/ChapterFour/0753. Cracking the Safe.md
+++ b/website/content/ChapterFour/0753.Cracking-the-Safe.md
@@ -1,4 +1,5 @@
-# 753. Cracking the Safe
+# [753. Cracking the Safe](https://leetcode.com/problems/cracking-the-safe/)
+
## 题目
diff --git a/website/content/ChapterFour/0756. Pyramid Transition Matrix.md b/website/content/ChapterFour/0756.Pyramid-Transition-Matrix.md
similarity index 99%
rename from website/content/ChapterFour/0756. Pyramid Transition Matrix.md
rename to website/content/ChapterFour/0756.Pyramid-Transition-Matrix.md
index 524a0c44..1b158131 100755
--- a/website/content/ChapterFour/0756. Pyramid Transition Matrix.md
+++ b/website/content/ChapterFour/0756.Pyramid-Transition-Matrix.md
@@ -1,7 +1,7 @@
# [756. Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix/)
-## 题目:
+## 题目
We are stacking blocks to form a pyramid. Each block has a color which is a one letter string.
diff --git a/website/content/ChapterFour/0762. Prime Number of Set Bits in Binary Representation.md b/website/content/ChapterFour/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md
similarity index 99%
rename from website/content/ChapterFour/0762. Prime Number of Set Bits in Binary Representation.md
rename to website/content/ChapterFour/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md
index 21a349a2..8c01e90f 100755
--- a/website/content/ChapterFour/0762. Prime Number of Set Bits in Binary Representation.md
+++ b/website/content/ChapterFour/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md
@@ -1,7 +1,7 @@
# [762. Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/)
-## 题目:
+## 题目
Given two integers `L` and `R`, find the count of numbers in the range `[L, R]` (inclusive) having a prime number of set bits in their binary representation.
diff --git a/website/content/ChapterFour/0763. Partition Labels.md b/website/content/ChapterFour/0763.Partition-Labels.md
similarity index 100%
rename from website/content/ChapterFour/0763. Partition Labels.md
rename to website/content/ChapterFour/0763.Partition-Labels.md
diff --git a/website/content/ChapterFour/0765. Couples Holding Hands.md b/website/content/ChapterFour/0765.Couples-Holding-Hands.md
similarity index 99%
rename from website/content/ChapterFour/0765. Couples Holding Hands.md
rename to website/content/ChapterFour/0765.Couples-Holding-Hands.md
index 9dfdf077..035512fe 100755
--- a/website/content/ChapterFour/0765. Couples Holding Hands.md
+++ b/website/content/ChapterFour/0765.Couples-Holding-Hands.md
@@ -1,7 +1,7 @@
# [765. Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands/)
-## 题目:
+## 题目
N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum number of swaps so that every couple is sitting side by side. A swap consists of choosing **any** two people, then they stand up and switch seats.
diff --git a/website/content/ChapterFour/0766. Toeplitz Matrix.md b/website/content/ChapterFour/0766.Toeplitz-Matrix.md
similarity index 100%
rename from website/content/ChapterFour/0766. Toeplitz Matrix.md
rename to website/content/ChapterFour/0766.Toeplitz-Matrix.md
diff --git a/website/content/ChapterFour/0767. Reorganize String.md b/website/content/ChapterFour/0767.Reorganize-String.md
similarity index 100%
rename from website/content/ChapterFour/0767. Reorganize String.md
rename to website/content/ChapterFour/0767.Reorganize-String.md
diff --git a/website/content/ChapterFour/0771. Jewels and Stones.md b/website/content/ChapterFour/0771.Jewels-and-Stones.md
similarity index 99%
rename from website/content/ChapterFour/0771. Jewels and Stones.md
rename to website/content/ChapterFour/0771.Jewels-and-Stones.md
index a4542d2e..e5490bed 100755
--- a/website/content/ChapterFour/0771. Jewels and Stones.md
+++ b/website/content/ChapterFour/0771.Jewels-and-Stones.md
@@ -2,7 +2,7 @@
-## 题目:
+## 题目
You're given strings `J` representing the types of stones that are jewels, and `S` representing the stones you have. Each character in `S` is a type of stone you have. You want to know how many of the stones you have are also jewels.
diff --git a/website/content/ChapterFour/0778. Swim in Rising Water.md b/website/content/ChapterFour/0778.Swim-in-Rising-Water.md
similarity index 99%
rename from website/content/ChapterFour/0778. Swim in Rising Water.md
rename to website/content/ChapterFour/0778.Swim-in-Rising-Water.md
index 99860515..7153069f 100755
--- a/website/content/ChapterFour/0778. Swim in Rising Water.md
+++ b/website/content/ChapterFour/0778.Swim-in-Rising-Water.md
@@ -1,7 +1,7 @@
# [778. Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water/)
-## 题目:
+## 题目
On an N x N `grid`, each square `grid[i][j]` represents the elevation at that point `(i,j)`.
diff --git a/website/content/ChapterFour/0781. Rabbits in Forest.md b/website/content/ChapterFour/0781.Rabbits-in-Forest.md
similarity index 99%
rename from website/content/ChapterFour/0781. Rabbits in Forest.md
rename to website/content/ChapterFour/0781.Rabbits-in-Forest.md
index 90f5ffbe..61aa4555 100755
--- a/website/content/ChapterFour/0781. Rabbits in Forest.md
+++ b/website/content/ChapterFour/0781.Rabbits-in-Forest.md
@@ -1,7 +1,7 @@
# [781. Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest/)
-## 题目:
+## 题目
In a forest, each rabbit has some color. Some subset of rabbits (possibly all of them) tell you how many other rabbits have the same color as them. Those `answers` are placed in an array.
diff --git a/website/content/ChapterFour/0784. Letter Case Permutation.md b/website/content/ChapterFour/0784.Letter-Case-Permutation.md
similarity index 100%
rename from website/content/ChapterFour/0784. Letter Case Permutation.md
rename to website/content/ChapterFour/0784.Letter-Case-Permutation.md
diff --git a/website/content/ChapterFour/0786. K-th Smallest Prime Fraction.md b/website/content/ChapterFour/0786.K-th-Smallest-Prime-Fraction.md
similarity index 99%
rename from website/content/ChapterFour/0786. K-th Smallest Prime Fraction.md
rename to website/content/ChapterFour/0786.K-th-Smallest-Prime-Fraction.md
index a785e0a7..9646d5af 100755
--- a/website/content/ChapterFour/0786. K-th Smallest Prime Fraction.md
+++ b/website/content/ChapterFour/0786.K-th-Smallest-Prime-Fraction.md
@@ -1,7 +1,7 @@
# [786. K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction/)
-## 题目:
+## 题目
A sorted list `A` contains 1, plus some number of primes. Then, for every p < q in the list, we consider the fraction p/q.
diff --git a/website/content/ChapterFour/0793. Preimage Size of Factorial Zeroes Function.md b/website/content/ChapterFour/0793.Preimage-Size-of-Factorial-Zeroes-Function.md
similarity index 99%
rename from website/content/ChapterFour/0793. Preimage Size of Factorial Zeroes Function.md
rename to website/content/ChapterFour/0793.Preimage-Size-of-Factorial-Zeroes-Function.md
index 8e90f7c1..b784e046 100755
--- a/website/content/ChapterFour/0793. Preimage Size of Factorial Zeroes Function.md
+++ b/website/content/ChapterFour/0793.Preimage-Size-of-Factorial-Zeroes-Function.md
@@ -1,7 +1,7 @@
# [793. Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function/)
-## 题目:
+## 题目
Let `f(x)` be the number of zeroes at the end of `x!`. (Recall that `x! = 1 * 2 * 3 * ... * x`, and by convention, `0! = 1`.)
diff --git a/website/content/ChapterFour/0802. Find Eventual Safe States.md b/website/content/ChapterFour/0802.Find-Eventual-Safe-States.md
similarity index 97%
rename from website/content/ChapterFour/0802. Find Eventual Safe States.md
rename to website/content/ChapterFour/0802.Find-Eventual-Safe-States.md
index 75e8eaee..f6879f30 100644
--- a/website/content/ChapterFour/0802. Find Eventual Safe States.md
+++ b/website/content/ChapterFour/0802.Find-Eventual-Safe-States.md
@@ -1,4 +1,5 @@
-# 802. Find Eventual Safe States
+# [802. Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states/)
+
## 题目
diff --git a/website/content/ChapterFour/0803. Bricks Falling When Hit.md b/website/content/ChapterFour/0803.Bricks-Falling-When-Hit.md
similarity index 99%
rename from website/content/ChapterFour/0803. Bricks Falling When Hit.md
rename to website/content/ChapterFour/0803.Bricks-Falling-When-Hit.md
index 3e30501e..6f5335ed 100755
--- a/website/content/ChapterFour/0803. Bricks Falling When Hit.md
+++ b/website/content/ChapterFour/0803.Bricks-Falling-When-Hit.md
@@ -1,7 +1,7 @@
# [803. Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit/)
-## 题目:
+## 题目
We have a grid of 1s and 0s; the 1s in a cell represent bricks. A brick will not drop if and only if it is directly connected to the top of the grid, or at least one of its (4-way) adjacent bricks will not drop.
diff --git a/website/content/ChapterFour/0811. Subdomain Visit Count.md b/website/content/ChapterFour/0811.Subdomain-Visit-Count.md
similarity index 99%
rename from website/content/ChapterFour/0811. Subdomain Visit Count.md
rename to website/content/ChapterFour/0811.Subdomain-Visit-Count.md
index 6cb59fd8..69840bd9 100755
--- a/website/content/ChapterFour/0811. Subdomain Visit Count.md
+++ b/website/content/ChapterFour/0811.Subdomain-Visit-Count.md
@@ -1,7 +1,7 @@
# [811. Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/)
-## 题目:
+## 题目
A website domain like "discuss.leetcode.com" consists of various subdomains. At the top level, we have "com", at the next level, we have "leetcode.com", and at the lowest level, "discuss.leetcode.com". When we visit a domain like "discuss.leetcode.com", we will also visit the parent domains "leetcode.com" and "com" implicitly.
diff --git a/website/content/ChapterFour/0815. Bus Routes.md b/website/content/ChapterFour/0815.Bus-Routes.md
similarity index 99%
rename from website/content/ChapterFour/0815. Bus Routes.md
rename to website/content/ChapterFour/0815.Bus-Routes.md
index 2e39dbbf..bddbd3b0 100755
--- a/website/content/ChapterFour/0815. Bus Routes.md
+++ b/website/content/ChapterFour/0815.Bus-Routes.md
@@ -1,7 +1,7 @@
# [815. Bus Routes](https://leetcode.com/problems/bus-routes/)
-## 题目:
+## 题目
We have a list of bus routes. Each `routes[i]` is a bus route that the i-th bus repeats forever. For example if `routes[0] = [1, 5, 7]`, this means that the first bus (0-th indexed) travels in the sequence 1->5->7->1->5->7->1->... forever.
diff --git a/website/content/ChapterFour/0817. Linked List Components.md b/website/content/ChapterFour/0817.Linked-List-Components.md
similarity index 100%
rename from website/content/ChapterFour/0817. Linked List Components.md
rename to website/content/ChapterFour/0817.Linked-List-Components.md
diff --git a/website/content/ChapterFour/0819. Most Common Word.md b/website/content/ChapterFour/0819.Most-Common-Word.md
similarity index 99%
rename from website/content/ChapterFour/0819. Most Common Word.md
rename to website/content/ChapterFour/0819.Most-Common-Word.md
index 94fd33b7..e37b45ee 100755
--- a/website/content/ChapterFour/0819. Most Common Word.md
+++ b/website/content/ChapterFour/0819.Most-Common-Word.md
@@ -1,7 +1,7 @@
# [819. Most Common Word](https://leetcode.com/problems/most-common-word/)
-## 题目:
+## 题目
Given a paragraph and a list of banned words, return the most frequent word that is not in the list of banned words. It is guaranteed there is at least one word that isn't banned, and that the answer is unique.
diff --git a/website/content/ChapterFour/0826. Most Profit Assigning Work.md b/website/content/ChapterFour/0826.Most-Profit-Assigning-Work.md
similarity index 100%
rename from website/content/ChapterFour/0826. Most Profit Assigning Work.md
rename to website/content/ChapterFour/0826.Most-Profit-Assigning-Work.md
diff --git a/website/content/ChapterFour/0828. COPYRIGHT PROBLEM XXX.md b/website/content/ChapterFour/0828.COPYRIGHT-PROBLEM-XXX.md
similarity index 100%
rename from website/content/ChapterFour/0828. COPYRIGHT PROBLEM XXX.md
rename to website/content/ChapterFour/0828.COPYRIGHT-PROBLEM-XXX.md
diff --git a/website/content/ChapterFour/0834. Sum of Distances in Tree.md b/website/content/ChapterFour/0834.Sum-of-Distances-in-Tree.md
similarity index 99%
rename from website/content/ChapterFour/0834. Sum of Distances in Tree.md
rename to website/content/ChapterFour/0834.Sum-of-Distances-in-Tree.md
index 77262d39..b0390a4a 100755
--- a/website/content/ChapterFour/0834. Sum of Distances in Tree.md
+++ b/website/content/ChapterFour/0834.Sum-of-Distances-in-Tree.md
@@ -1,7 +1,7 @@
# [834. Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree/)
-## 题目:
+## 题目
An undirected, connected tree with `N` nodes labelled `0...N-1` and `N-1edges` are given.
diff --git a/website/content/ChapterFour/0836. Rectangle Overlap.md b/website/content/ChapterFour/0836.Rectangle-Overlap.md
similarity index 99%
rename from website/content/ChapterFour/0836. Rectangle Overlap.md
rename to website/content/ChapterFour/0836.Rectangle-Overlap.md
index 74a635a2..2cce0169 100755
--- a/website/content/ChapterFour/0836. Rectangle Overlap.md
+++ b/website/content/ChapterFour/0836.Rectangle-Overlap.md
@@ -1,7 +1,7 @@
# [836. Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap/)
-## 题目:
+## 题目
A rectangle is represented as a list `[x1, y1, x2, y2]`, where `(x1, y1)` are the coordinates of its bottom-left corner, and `(x2, y2)` are the coordinates of its top-right corner.
diff --git a/website/content/ChapterFour/0838. Push Dominoes.md b/website/content/ChapterFour/0838.Push-Dominoes.md
similarity index 100%
rename from website/content/ChapterFour/0838. Push Dominoes.md
rename to website/content/ChapterFour/0838.Push-Dominoes.md
diff --git a/website/content/ChapterFour/0839. Similar String Groups.md b/website/content/ChapterFour/0839.Similar-String-Groups.md
similarity index 99%
rename from website/content/ChapterFour/0839. Similar String Groups.md
rename to website/content/ChapterFour/0839.Similar-String-Groups.md
index c1ae7b05..217ee2da 100755
--- a/website/content/ChapterFour/0839. Similar String Groups.md
+++ b/website/content/ChapterFour/0839.Similar-String-Groups.md
@@ -1,7 +1,7 @@
# [839. Similar String Groups](https://leetcode.com/problems/similar-string-groups/)
-## 题目:
+## 题目
Two strings `X` and `Y` are similar if we can swap two letters (in different positions) of `X`, so that it equals `Y`.
diff --git a/website/content/ChapterFour/0841. Keys and Rooms.md b/website/content/ChapterFour/0841.Keys-and-Rooms.md
similarity index 97%
rename from website/content/ChapterFour/0841. Keys and Rooms.md
rename to website/content/ChapterFour/0841.Keys-and-Rooms.md
index 66c1f23d..69d1da3a 100644
--- a/website/content/ChapterFour/0841. Keys and Rooms.md
+++ b/website/content/ChapterFour/0841.Keys-and-Rooms.md
@@ -1,4 +1,5 @@
-# 841. Keys and Rooms
+# [841. Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/)
+
## 题目
diff --git a/website/content/ChapterFour/0842. Split Array into Fibonacci Sequence.md b/website/content/ChapterFour/0842.Split-Array-into-Fibonacci-Sequence.md
similarity index 100%
rename from website/content/ChapterFour/0842. Split Array into Fibonacci Sequence.md
rename to website/content/ChapterFour/0842.Split-Array-into-Fibonacci-Sequence.md
diff --git a/website/content/ChapterFour/0844. Backspace String Compare.md b/website/content/ChapterFour/0844.Backspace-String-Compare.md
similarity index 100%
rename from website/content/ChapterFour/0844. Backspace String Compare.md
rename to website/content/ChapterFour/0844.Backspace-String-Compare.md
diff --git a/website/content/ChapterFour/0845. Longest Mountain in Array.md b/website/content/ChapterFour/0845.Longest-Mountain-in-Array.md
similarity index 100%
rename from website/content/ChapterFour/0845. Longest Mountain in Array.md
rename to website/content/ChapterFour/0845.Longest-Mountain-in-Array.md
diff --git a/website/content/ChapterFour/0850. Rectangle Area II.md b/website/content/ChapterFour/0850.Rectangle-Area-II.md
similarity index 99%
rename from website/content/ChapterFour/0850. Rectangle Area II.md
rename to website/content/ChapterFour/0850.Rectangle-Area-II.md
index 90d1d79f..1dad9faf 100755
--- a/website/content/ChapterFour/0850. Rectangle Area II.md
+++ b/website/content/ChapterFour/0850.Rectangle-Area-II.md
@@ -1,7 +1,7 @@
# [850. Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii/)
-## 题目:
+## 题目
We are given a list of (axis-aligned) `rectangles`. Each `rectangle[i] = [x1, y1, x2, y2]` , where (x1, y1) are the coordinates of the bottom-left corner, and (x2, y2) are the coordinates of the top-right corner of the `i`th rectangle.
diff --git a/website/content/ChapterFour/0851. Loud and Rich.md b/website/content/ChapterFour/0851.Loud-and-Rich.md
similarity index 98%
rename from website/content/ChapterFour/0851. Loud and Rich.md
rename to website/content/ChapterFour/0851.Loud-and-Rich.md
index 06fbd86e..26351328 100644
--- a/website/content/ChapterFour/0851. Loud and Rich.md
+++ b/website/content/ChapterFour/0851.Loud-and-Rich.md
@@ -1,4 +1,5 @@
-# 851. Loud and Rich
+# [851. Loud and Rich](https://leetcode.com/problems/loud-and-rich/)
+
## 题目
diff --git a/website/content/ChapterFour/0852. Peak Index in a Mountain Array.md b/website/content/ChapterFour/0852.Peak-Index-in-a-Mountain-Array.md
similarity index 99%
rename from website/content/ChapterFour/0852. Peak Index in a Mountain Array.md
rename to website/content/ChapterFour/0852.Peak-Index-in-a-Mountain-Array.md
index 276e358a..ea6ae942 100755
--- a/website/content/ChapterFour/0852. Peak Index in a Mountain Array.md
+++ b/website/content/ChapterFour/0852.Peak-Index-in-a-Mountain-Array.md
@@ -1,7 +1,7 @@
# [852. Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/)
-## 题目:
+## 题目
Let's call an array `A` a *mountain* if the following properties hold:
diff --git a/website/content/ChapterFour/0853. Car Fleet.md b/website/content/ChapterFour/0853.Car-Fleet.md
similarity index 100%
rename from website/content/ChapterFour/0853. Car Fleet.md
rename to website/content/ChapterFour/0853.Car-Fleet.md
diff --git a/website/content/ChapterFour/0856. Score of Parentheses.md b/website/content/ChapterFour/0856.Score-of-Parentheses.md
similarity index 100%
rename from website/content/ChapterFour/0856. Score of Parentheses.md
rename to website/content/ChapterFour/0856.Score-of-Parentheses.md
diff --git a/website/content/ChapterFour/0862. Shortest Subarray with Sum at Least K.md b/website/content/ChapterFour/0862.Shortest-Subarray-with-Sum-at-Least-K.md
similarity index 97%
rename from website/content/ChapterFour/0862. Shortest Subarray with Sum at Least K.md
rename to website/content/ChapterFour/0862.Shortest-Subarray-with-Sum-at-Least-K.md
index 60f0785c..469ca3bd 100644
--- a/website/content/ChapterFour/0862. Shortest Subarray with Sum at Least K.md
+++ b/website/content/ChapterFour/0862.Shortest-Subarray-with-Sum-at-Least-K.md
@@ -1,4 +1,5 @@
-# 862. Shortest Subarray with Sum at Least K
+# [862. Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/)
+
## 题目
diff --git a/website/content/ChapterFour/0863. All Nodes Distance K in Binary Tree.md b/website/content/ChapterFour/0863.All-Nodes-Distance-K-in-Binary-Tree.md
similarity index 95%
rename from website/content/ChapterFour/0863. All Nodes Distance K in Binary Tree.md
rename to website/content/ChapterFour/0863.All-Nodes-Distance-K-in-Binary-Tree.md
index db5a3d7e..4ea32b20 100644
--- a/website/content/ChapterFour/0863. All Nodes Distance K in Binary Tree.md
+++ b/website/content/ChapterFour/0863.All-Nodes-Distance-K-in-Binary-Tree.md
@@ -1,4 +1,5 @@
-# 863. All Nodes Distance K in Binary Tree
+# [863. All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/)
+
## 题目
diff --git a/website/content/ChapterFour/0864. Shortest Path to Get All Keys.md b/website/content/ChapterFour/0864.Shortest-Path-to-Get-All-Keys.md
similarity index 99%
rename from website/content/ChapterFour/0864. Shortest Path to Get All Keys.md
rename to website/content/ChapterFour/0864.Shortest-Path-to-Get-All-Keys.md
index 87a79c0b..d6d65b49 100755
--- a/website/content/ChapterFour/0864. Shortest Path to Get All Keys.md
+++ b/website/content/ChapterFour/0864.Shortest-Path-to-Get-All-Keys.md
@@ -1,7 +1,7 @@
# [864. Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys/)
-## 题目:
+## 题目
We are given a 2-dimensional `grid`. `"."` is an empty cell, `"#"` is a wall, `"@"` is the starting point, (`"a"`, `"b"`, ...) are keys, and (`"A"`, `"B"`, ...) are locks.
diff --git a/website/content/ChapterFour/0867. Transpose Matrix.md b/website/content/ChapterFour/0867.Transpose-Matrix.md
similarity index 100%
rename from website/content/ChapterFour/0867. Transpose Matrix.md
rename to website/content/ChapterFour/0867.Transpose-Matrix.md
diff --git a/website/content/ChapterFour/0872. Leaf-Similar Trees.md b/website/content/ChapterFour/0872.Leaf-Similar-Trees.md
similarity index 96%
rename from website/content/ChapterFour/0872. Leaf-Similar Trees.md
rename to website/content/ChapterFour/0872.Leaf-Similar-Trees.md
index 947eabd9..900b7e74 100644
--- a/website/content/ChapterFour/0872. Leaf-Similar Trees.md
+++ b/website/content/ChapterFour/0872.Leaf-Similar-Trees.md
@@ -1,4 +1,5 @@
-# 872. Leaf-Similar Trees
+# [872. Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees/)
+
## 题目
diff --git a/website/content/ChapterFour/0875. Koko Eating Bananas.md b/website/content/ChapterFour/0875.Koko-Eating-Bananas.md
similarity index 99%
rename from website/content/ChapterFour/0875. Koko Eating Bananas.md
rename to website/content/ChapterFour/0875.Koko-Eating-Bananas.md
index 6cf0c2a2..f2c7c411 100755
--- a/website/content/ChapterFour/0875. Koko Eating Bananas.md
+++ b/website/content/ChapterFour/0875.Koko-Eating-Bananas.md
@@ -1,7 +1,7 @@
# [875. Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas/)
-## 题目:
+## 题目
Koko loves to eat bananas. There are `N` piles of bananas, the `i`-th pile has `piles[i]` bananas. The guards have gone and will come back in `H` hours.
diff --git a/website/content/ChapterFour/0876. Middle of the Linked List.md b/website/content/ChapterFour/0876.Middle-of-the-Linked-List.md
similarity index 100%
rename from website/content/ChapterFour/0876. Middle of the Linked List.md
rename to website/content/ChapterFour/0876.Middle-of-the-Linked-List.md
diff --git a/website/content/ChapterFour/0878. Nth Magical Number.md b/website/content/ChapterFour/0878.Nth-Magical-Number.md
similarity index 99%
rename from website/content/ChapterFour/0878. Nth Magical Number.md
rename to website/content/ChapterFour/0878.Nth-Magical-Number.md
index d103d999..d78c5ed9 100755
--- a/website/content/ChapterFour/0878. Nth Magical Number.md
+++ b/website/content/ChapterFour/0878.Nth-Magical-Number.md
@@ -1,7 +1,7 @@
# [878. Nth Magical Number](https://leetcode.com/problems/nth-magical-number/)
-## 题目:
+## 题目
A positive integer is *magical* if it is divisible by either A or B.
diff --git a/website/content/ChapterFour/0880. Decoded String at Index.md b/website/content/ChapterFour/0880.Decoded-String-at-Index.md
similarity index 100%
rename from website/content/ChapterFour/0880. Decoded String at Index.md
rename to website/content/ChapterFour/0880.Decoded-String-at-Index.md
diff --git a/website/content/ChapterFour/0881. Boats to Save People.md b/website/content/ChapterFour/0881.Boats-to-Save-People.md
similarity index 100%
rename from website/content/ChapterFour/0881. Boats to Save People.md
rename to website/content/ChapterFour/0881.Boats-to-Save-People.md
diff --git a/website/content/ChapterFour/0884. Uncommon Words from Two Sentences.md b/website/content/ChapterFour/0884.Uncommon-Words-from-Two-Sentences.md
similarity index 99%
rename from website/content/ChapterFour/0884. Uncommon Words from Two Sentences.md
rename to website/content/ChapterFour/0884.Uncommon-Words-from-Two-Sentences.md
index 351de621..66fc23b0 100755
--- a/website/content/ChapterFour/0884. Uncommon Words from Two Sentences.md
+++ b/website/content/ChapterFour/0884.Uncommon-Words-from-Two-Sentences.md
@@ -1,7 +1,7 @@
# [884. Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences/)
-## 题目:
+## 题目
We are given two sentences `A` and `B`. (A *sentence* is a string of space separated words. Each *word* consists only of lowercase letters.)
diff --git a/website/content/ChapterFour/0885. Spiral Matrix III.md b/website/content/ChapterFour/0885.Spiral-Matrix-III.md
similarity index 100%
rename from website/content/ChapterFour/0885. Spiral Matrix III.md
rename to website/content/ChapterFour/0885.Spiral-Matrix-III.md
diff --git a/website/content/ChapterFour/0887. Super Egg Drop.md b/website/content/ChapterFour/0887.Super-Egg-Drop.md
similarity index 99%
rename from website/content/ChapterFour/0887. Super Egg Drop.md
rename to website/content/ChapterFour/0887.Super-Egg-Drop.md
index 18c998fd..a79b6085 100755
--- a/website/content/ChapterFour/0887. Super Egg Drop.md
+++ b/website/content/ChapterFour/0887.Super-Egg-Drop.md
@@ -1,7 +1,7 @@
# [887. Super Egg Drop](https://leetcode.com/problems/super-egg-drop/)
-## 题目:
+## 题目
You are given `K` eggs, and you have access to a building with `N` floors from `1` to `N`.
diff --git a/website/content/ChapterFour/0891. Sum of Subsequence Widths.md b/website/content/ChapterFour/0891.Sum-of-Subsequence-Widths.md
similarity index 100%
rename from website/content/ChapterFour/0891. Sum of Subsequence Widths.md
rename to website/content/ChapterFour/0891.Sum-of-Subsequence-Widths.md
diff --git a/website/content/ChapterFour/0895. Maximum Frequency Stack.md b/website/content/ChapterFour/0895.Maximum-Frequency-Stack.md
similarity index 100%
rename from website/content/ChapterFour/0895. Maximum Frequency Stack.md
rename to website/content/ChapterFour/0895.Maximum-Frequency-Stack.md
diff --git a/website/content/ChapterFour/0897. Increasing Order Search Tree.md b/website/content/ChapterFour/0897.Increasing-Order-Search-Tree.md
similarity index 99%
rename from website/content/ChapterFour/0897. Increasing Order Search Tree.md
rename to website/content/ChapterFour/0897.Increasing-Order-Search-Tree.md
index c26e8061..4c1946f3 100755
--- a/website/content/ChapterFour/0897. Increasing Order Search Tree.md
+++ b/website/content/ChapterFour/0897.Increasing-Order-Search-Tree.md
@@ -1,7 +1,7 @@
# [897. Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree/)
-## 题目:
+## 题目
Given a binary search tree, rearrange the tree in **in-order** so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only 1 right child.
diff --git a/website/content/ChapterFour/0898. Bitwise ORs of Subarrays.md b/website/content/ChapterFour/0898.Bitwise-ORs-of-Subarrays.md
similarity index 99%
rename from website/content/ChapterFour/0898. Bitwise ORs of Subarrays.md
rename to website/content/ChapterFour/0898.Bitwise-ORs-of-Subarrays.md
index caa25e82..259871f1 100755
--- a/website/content/ChapterFour/0898. Bitwise ORs of Subarrays.md
+++ b/website/content/ChapterFour/0898.Bitwise-ORs-of-Subarrays.md
@@ -1,7 +1,7 @@
# [898. Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays/)
-## 题目:
+## 题目
We have an array `A` of non-negative integers.
diff --git a/website/content/ChapterFour/0901. Online Stock Span.md b/website/content/ChapterFour/0901.Online-Stock-Span.md
similarity index 100%
rename from website/content/ChapterFour/0901. Online Stock Span.md
rename to website/content/ChapterFour/0901.Online-Stock-Span.md
diff --git a/website/content/ChapterFour/0904. Fruit Into Baskets.md b/website/content/ChapterFour/0904.Fruit-Into-Baskets.md
similarity index 100%
rename from website/content/ChapterFour/0904. Fruit Into Baskets.md
rename to website/content/ChapterFour/0904.Fruit-Into-Baskets.md
diff --git a/website/content/ChapterFour/0907. Sum of Subarray Minimums.md b/website/content/ChapterFour/0907.Sum-of-Subarray-Minimums.md
similarity index 100%
rename from website/content/ChapterFour/0907. Sum of Subarray Minimums.md
rename to website/content/ChapterFour/0907.Sum-of-Subarray-Minimums.md
diff --git a/website/content/ChapterFour/0911. Online Election.md b/website/content/ChapterFour/0911.Online-Election.md
similarity index 99%
rename from website/content/ChapterFour/0911. Online Election.md
rename to website/content/ChapterFour/0911.Online-Election.md
index d01f5404..63a73bb6 100755
--- a/website/content/ChapterFour/0911. Online Election.md
+++ b/website/content/ChapterFour/0911.Online-Election.md
@@ -1,7 +1,7 @@
# [911. Online Election](https://leetcode.com/problems/online-election/)
-## 题目:
+## 题目
In an election, the `i`-th vote was cast for `persons[i]` at time `times[i]`.
diff --git a/website/content/ChapterFour/0918. Maximum Sum Circular Subarray.md b/website/content/ChapterFour/0918.Maximum-Sum-Circular-Subarray.md
similarity index 99%
rename from website/content/ChapterFour/0918. Maximum Sum Circular Subarray.md
rename to website/content/ChapterFour/0918.Maximum-Sum-Circular-Subarray.md
index 7c39c095..1b60e16e 100755
--- a/website/content/ChapterFour/0918. Maximum Sum Circular Subarray.md
+++ b/website/content/ChapterFour/0918.Maximum-Sum-Circular-Subarray.md
@@ -1,7 +1,7 @@
# [918. Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray/)
-## 题目:
+## 题目
Given a **circular array** **C** of integers represented by `A`, find the maximum possible sum of a non-empty subarray of **C**.
diff --git a/website/content/ChapterFour/0920. Number of Music Playlists.md b/website/content/ChapterFour/0920.Number-of-Music-Playlists.md
similarity index 99%
rename from website/content/ChapterFour/0920. Number of Music Playlists.md
rename to website/content/ChapterFour/0920.Number-of-Music-Playlists.md
index aafe84ff..b0efa478 100755
--- a/website/content/ChapterFour/0920. Number of Music Playlists.md
+++ b/website/content/ChapterFour/0920.Number-of-Music-Playlists.md
@@ -1,7 +1,7 @@
# [920. Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists/)
-## 题目:
+## 题目
Your music player contains `N` different songs and she wants to listen to `L` ****(not necessarily different) songs during your trip. You create a playlist so that:
diff --git a/website/content/ChapterFour/0921. Minimum Add to Make Parentheses Valid.md b/website/content/ChapterFour/0921.Minimum-Add-to-Make-Parentheses-Valid.md
similarity index 100%
rename from website/content/ChapterFour/0921. Minimum Add to Make Parentheses Valid.md
rename to website/content/ChapterFour/0921.Minimum-Add-to-Make-Parentheses-Valid.md
diff --git a/website/content/ChapterFour/0922. Sort Array By Parity II.md b/website/content/ChapterFour/0922.Sort-Array-By-Parity-II.md
similarity index 100%
rename from website/content/ChapterFour/0922. Sort Array By Parity II.md
rename to website/content/ChapterFour/0922.Sort-Array-By-Parity-II.md
diff --git a/website/content/ChapterFour/0923. 3Sum With Multiplicity.md b/website/content/ChapterFour/0923.3Sum-With-Multiplicity.md
similarity index 100%
rename from website/content/ChapterFour/0923. 3Sum With Multiplicity.md
rename to website/content/ChapterFour/0923.3Sum-With-Multiplicity.md
diff --git a/website/content/ChapterFour/0924. Minimize Malware Spread.md b/website/content/ChapterFour/0924.Minimize-Malware-Spread.md
similarity index 99%
rename from website/content/ChapterFour/0924. Minimize Malware Spread.md
rename to website/content/ChapterFour/0924.Minimize-Malware-Spread.md
index c78107cb..ce5c8970 100755
--- a/website/content/ChapterFour/0924. Minimize Malware Spread.md
+++ b/website/content/ChapterFour/0924.Minimize-Malware-Spread.md
@@ -1,7 +1,7 @@
# [924. Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread/)
-## 题目:
+## 题目
In a network of nodes, each node `i` is directly connected to another node `j` if and only if `graph[i][j] = 1`.
diff --git a/website/content/ChapterFour/0925. Long Pressed Name.md b/website/content/ChapterFour/0925.Long-Pressed-Name.md
similarity index 100%
rename from website/content/ChapterFour/0925. Long Pressed Name.md
rename to website/content/ChapterFour/0925.Long-Pressed-Name.md
diff --git a/website/content/ChapterFour/0927. Three Equal Parts.md b/website/content/ChapterFour/0927.Three-Equal-Parts.md
similarity index 99%
rename from website/content/ChapterFour/0927. Three Equal Parts.md
rename to website/content/ChapterFour/0927.Three-Equal-Parts.md
index b4026ed9..311b8c49 100755
--- a/website/content/ChapterFour/0927. Three Equal Parts.md
+++ b/website/content/ChapterFour/0927.Three-Equal-Parts.md
@@ -1,7 +1,7 @@
# [927. Three Equal Parts](https://leetcode.com/problems/three-equal-parts/)
-## 题目:
+## 题目
Given an array `A` of `0`s and `1`s, divide the array into 3 non-empty parts such that all of these parts represent the same binary value.
diff --git a/website/content/ChapterFour/0928. Minimize Malware Spread II.md b/website/content/ChapterFour/0928.Minimize-Malware-Spread-II.md
similarity index 99%
rename from website/content/ChapterFour/0928. Minimize Malware Spread II.md
rename to website/content/ChapterFour/0928.Minimize-Malware-Spread-II.md
index f31a8c6e..4d83986b 100755
--- a/website/content/ChapterFour/0928. Minimize Malware Spread II.md
+++ b/website/content/ChapterFour/0928.Minimize-Malware-Spread-II.md
@@ -1,7 +1,7 @@
# [928. Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii/)
-## 题目:
+## 题目
(This problem is the same as *Minimize Malware Spread*, with the differences bolded.)
diff --git a/website/content/ChapterFour/0930. Binary Subarrays With Sum.md b/website/content/ChapterFour/0930.Binary-Subarrays-With-Sum.md
similarity index 100%
rename from website/content/ChapterFour/0930. Binary Subarrays With Sum.md
rename to website/content/ChapterFour/0930.Binary-Subarrays-With-Sum.md
diff --git a/website/content/ChapterFour/0933. Number of Recent Calls.md b/website/content/ChapterFour/0933.Number-of-Recent-Calls.md
similarity index 95%
rename from website/content/ChapterFour/0933. Number of Recent Calls.md
rename to website/content/ChapterFour/0933.Number-of-Recent-Calls.md
index f50918b1..f4eebfaf 100644
--- a/website/content/ChapterFour/0933. Number of Recent Calls.md
+++ b/website/content/ChapterFour/0933.Number-of-Recent-Calls.md
@@ -1,4 +1,5 @@
-# 933. Number of Recent Calls
+# [933. Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/)
+
### 题目
diff --git a/website/content/ChapterFour/0942. DI String Match.md b/website/content/ChapterFour/0942.DI-String-Match.md
similarity index 100%
rename from website/content/ChapterFour/0942. DI String Match.md
rename to website/content/ChapterFour/0942.DI-String-Match.md
diff --git a/website/content/ChapterFour/0946. Validate Stack Sequences.md b/website/content/ChapterFour/0946.Validate-Stack-Sequences.md
similarity index 100%
rename from website/content/ChapterFour/0946. Validate Stack Sequences.md
rename to website/content/ChapterFour/0946.Validate-Stack-Sequences.md
diff --git a/website/content/ChapterFour/0947. Most Stones Removed with Same Row or Column.md b/website/content/ChapterFour/0947.Most-Stones-Removed-with-Same-Row-or-Column.md
similarity index 99%
rename from website/content/ChapterFour/0947. Most Stones Removed with Same Row or Column.md
rename to website/content/ChapterFour/0947.Most-Stones-Removed-with-Same-Row-or-Column.md
index 8b660e8c..886bb036 100755
--- a/website/content/ChapterFour/0947. Most Stones Removed with Same Row or Column.md
+++ b/website/content/ChapterFour/0947.Most-Stones-Removed-with-Same-Row-or-Column.md
@@ -1,7 +1,7 @@
# [947. Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/)
-## 题目:
+## 题目
On a 2D plane, we place stones at some integer coordinate points. Each coordinate point may have at most one stone.
diff --git a/website/content/ChapterFour/0952. Largest Component Size by Common Factor.md b/website/content/ChapterFour/0952.Largest-Component-Size-by-Common-Factor.md
similarity index 99%
rename from website/content/ChapterFour/0952. Largest Component Size by Common Factor.md
rename to website/content/ChapterFour/0952.Largest-Component-Size-by-Common-Factor.md
index cf5558ed..d37262bc 100755
--- a/website/content/ChapterFour/0952. Largest Component Size by Common Factor.md
+++ b/website/content/ChapterFour/0952.Largest-Component-Size-by-Common-Factor.md
@@ -1,7 +1,7 @@
# [952. Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor/)
-## 题目:
+## 题目
Given a non-empty array of unique positive integers `A`, consider the following graph:
diff --git a/website/content/ChapterFour/0953. Verifying an Alien Dictionary.md b/website/content/ChapterFour/0953.Verifying-an-Alien-Dictionary.md
similarity index 99%
rename from website/content/ChapterFour/0953. Verifying an Alien Dictionary.md
rename to website/content/ChapterFour/0953.Verifying-an-Alien-Dictionary.md
index a1482193..ff648c14 100755
--- a/website/content/ChapterFour/0953. Verifying an Alien Dictionary.md
+++ b/website/content/ChapterFour/0953.Verifying-an-Alien-Dictionary.md
@@ -1,7 +1,7 @@
# [953. Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary/)
-## 题目:
+## 题目
In an alien language, surprisingly they also use english lowercase letters, but possibly in a different `order`. The `order`of the alphabet is some permutation of lowercase letters.
diff --git a/website/content/ChapterFour/0959. Regions Cut By Slashes.md b/website/content/ChapterFour/0959.Regions-Cut-By-Slashes.md
similarity index 99%
rename from website/content/ChapterFour/0959. Regions Cut By Slashes.md
rename to website/content/ChapterFour/0959.Regions-Cut-By-Slashes.md
index 6649e66c..c560cc59 100755
--- a/website/content/ChapterFour/0959. Regions Cut By Slashes.md
+++ b/website/content/ChapterFour/0959.Regions-Cut-By-Slashes.md
@@ -1,7 +1,7 @@
# [959. Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes/)
-## 题目:
+## 题目
In a N x N `grid` composed of 1 x 1 squares, each 1 x 1 square consists of a `/`, `\`, or blank space. These characters divide the square into contiguous regions.
diff --git a/website/content/ChapterFour/0961. N-Repeated Element in Size 2N Array.md b/website/content/ChapterFour/0961.N-Repeated-Element-in-Size-2N-Array.md
similarity index 98%
rename from website/content/ChapterFour/0961. N-Repeated Element in Size 2N Array.md
rename to website/content/ChapterFour/0961.N-Repeated-Element-in-Size-2N-Array.md
index 6a42f6fd..a9e53e77 100755
--- a/website/content/ChapterFour/0961. N-Repeated Element in Size 2N Array.md
+++ b/website/content/ChapterFour/0961.N-Repeated-Element-in-Size-2N-Array.md
@@ -1,7 +1,7 @@
# [961. N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/)
-## 题目:
+## 题目
In a array `A` of size `2N`, there are `N+1` unique elements, and exactly one of these elements is repeated N times.
diff --git a/website/content/ChapterFour/0968. Binary Tree Cameras.md b/website/content/ChapterFour/0968.Binary-Tree-Cameras.md
similarity index 99%
rename from website/content/ChapterFour/0968. Binary Tree Cameras.md
rename to website/content/ChapterFour/0968.Binary-Tree-Cameras.md
index 99bdfb3c..d9873a5b 100755
--- a/website/content/ChapterFour/0968. Binary Tree Cameras.md
+++ b/website/content/ChapterFour/0968.Binary-Tree-Cameras.md
@@ -1,6 +1,6 @@
# [968. Binary Tree Cameras](https://leetcode.com/problems/binary-tree-cameras/)
-## 题目:
+## 题目
Given a binary tree, we install cameras on the nodes of the tree.
diff --git a/website/content/ChapterFour/0969. Pancake Sorting.md b/website/content/ChapterFour/0969.Pancake-Sorting.md
similarity index 100%
rename from website/content/ChapterFour/0969. Pancake Sorting.md
rename to website/content/ChapterFour/0969.Pancake-Sorting.md
diff --git a/website/content/ChapterFour/0970. Powerful Integers.md b/website/content/ChapterFour/0970.Powerful-Integers.md
similarity index 99%
rename from website/content/ChapterFour/0970. Powerful Integers.md
rename to website/content/ChapterFour/0970.Powerful-Integers.md
index 9bd12615..9de40954 100755
--- a/website/content/ChapterFour/0970. Powerful Integers.md
+++ b/website/content/ChapterFour/0970.Powerful-Integers.md
@@ -1,7 +1,7 @@
# [970. Powerful Integers](https://leetcode.com/problems/powerful-integers/)
-## 题目:
+## 题目
Given two positive integers `x` and `y`, an integer is *powerful* if it is equal to `x^i + y^j` for some integers `i >= 0` and `j >= 0`.
diff --git a/website/content/ChapterFour/0973. K Closest Points to Origin.md b/website/content/ChapterFour/0973.K-Closest-Points-to-Origin.md
similarity index 100%
rename from website/content/ChapterFour/0973. K Closest Points to Origin.md
rename to website/content/ChapterFour/0973.K-Closest-Points-to-Origin.md
diff --git a/website/content/ChapterFour/0976. Largest Perimeter Triangle.md b/website/content/ChapterFour/0976.Largest-Perimeter-Triangle.md
similarity index 100%
rename from website/content/ChapterFour/0976. Largest Perimeter Triangle.md
rename to website/content/ChapterFour/0976.Largest-Perimeter-Triangle.md
diff --git a/website/content/ChapterFour/0977. Squares of a Sorted Array.md b/website/content/ChapterFour/0977.Squares-of-a-Sorted-Array.md
similarity index 100%
rename from website/content/ChapterFour/0977. Squares of a Sorted Array.md
rename to website/content/ChapterFour/0977.Squares-of-a-Sorted-Array.md
diff --git a/website/content/ChapterFour/0978. Longest Turbulent Subarray.md b/website/content/ChapterFour/0978.Longest-Turbulent-Subarray.md
similarity index 99%
rename from website/content/ChapterFour/0978. Longest Turbulent Subarray.md
rename to website/content/ChapterFour/0978.Longest-Turbulent-Subarray.md
index 72da9101..e4b8bea7 100755
--- a/website/content/ChapterFour/0978. Longest Turbulent Subarray.md
+++ b/website/content/ChapterFour/0978.Longest-Turbulent-Subarray.md
@@ -1,6 +1,6 @@
# [978. Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray/)
-## 题目:
+## 题目
A subarray `A[i], A[i+1], ..., A[j]` of `A` is said to be *turbulent* if and only if:
diff --git a/website/content/ChapterFour/0979. Distribute Coins in Binary Tree.md b/website/content/ChapterFour/0979.Distribute-Coins-in-Binary-Tree.md
similarity index 99%
rename from website/content/ChapterFour/0979. Distribute Coins in Binary Tree.md
rename to website/content/ChapterFour/0979.Distribute-Coins-in-Binary-Tree.md
index 93580e7d..ac98a452 100755
--- a/website/content/ChapterFour/0979. Distribute Coins in Binary Tree.md
+++ b/website/content/ChapterFour/0979.Distribute-Coins-in-Binary-Tree.md
@@ -1,7 +1,7 @@
# [979. Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree/)
-## 题目:
+## 题目
Given the `root` of a binary tree with `N` nodes, each `node` in the tree has `node.val` coins, and there are `N` coins total.
diff --git a/website/content/ChapterFour/0980. Unique Paths III.md b/website/content/ChapterFour/0980.Unique-Paths-III.md
similarity index 100%
rename from website/content/ChapterFour/0980. Unique Paths III.md
rename to website/content/ChapterFour/0980.Unique-Paths-III.md
diff --git a/website/content/ChapterFour/0981. Time Based Key-Value Store.md b/website/content/ChapterFour/0981.Time-Based-Key-Value-Store.md
similarity index 99%
rename from website/content/ChapterFour/0981. Time Based Key-Value Store.md
rename to website/content/ChapterFour/0981.Time-Based-Key-Value-Store.md
index d6d1a018..a598ed75 100755
--- a/website/content/ChapterFour/0981. Time Based Key-Value Store.md
+++ b/website/content/ChapterFour/0981.Time-Based-Key-Value-Store.md
@@ -1,7 +1,7 @@
# [981. Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/)
-## 题目:
+## 题目
Create a timebased key-value store class `TimeMap`, that supports two operations.
diff --git a/website/content/ChapterFour/0984. String Without AAA or BBB.md b/website/content/ChapterFour/0984.String-Without-AAA-or-BBB.md
similarity index 99%
rename from website/content/ChapterFour/0984. String Without AAA or BBB.md
rename to website/content/ChapterFour/0984.String-Without-AAA-or-BBB.md
index e3074f7b..cccb67b2 100755
--- a/website/content/ChapterFour/0984. String Without AAA or BBB.md
+++ b/website/content/ChapterFour/0984.String-Without-AAA-or-BBB.md
@@ -1,7 +1,7 @@
# [984. String Without AAA or BBB](https://leetcode.com/problems/string-without-aaa-or-bbb/)
-## 题目:
+## 题目
Given two integers `A` and `B`, return **any** string `S` such that:
diff --git a/website/content/ChapterFour/0986. Interval List Intersections.md b/website/content/ChapterFour/0986.Interval-List-Intersections.md
similarity index 100%
rename from website/content/ChapterFour/0986. Interval List Intersections.md
rename to website/content/ChapterFour/0986.Interval-List-Intersections.md
diff --git a/website/content/ChapterFour/0990. Satisfiability of Equality Equations.md b/website/content/ChapterFour/0990.Satisfiability-of-Equality-Equations.md
similarity index 99%
rename from website/content/ChapterFour/0990. Satisfiability of Equality Equations.md
rename to website/content/ChapterFour/0990.Satisfiability-of-Equality-Equations.md
index 50d3538d..75f33db2 100755
--- a/website/content/ChapterFour/0990. Satisfiability of Equality Equations.md
+++ b/website/content/ChapterFour/0990.Satisfiability-of-Equality-Equations.md
@@ -1,7 +1,7 @@
# [990. Satisfiability of Equality Equations](https://leetcode.com/problems/satisfiability-of-equality-equations/)
-## 题目:
+## 题目
Given an array equations of strings that represent relationships between variables, each string `equations[i]` has length `4` and takes one of two different forms: `"a==b"` or `"a!=b"`. Here, `a` and `b` are lowercase letters (not necessarily different) that represent one-letter variable names.
diff --git a/website/content/ChapterFour/0992. Subarrays with K Different Integers.md b/website/content/ChapterFour/0992.Subarrays-with-K-Different-Integers.md
similarity index 100%
rename from website/content/ChapterFour/0992. Subarrays with K Different Integers.md
rename to website/content/ChapterFour/0992.Subarrays-with-K-Different-Integers.md
diff --git a/website/content/ChapterFour/0993. Cousins in Binary Tree.md b/website/content/ChapterFour/0993.Cousins-in-Binary-Tree.md
similarity index 100%
rename from website/content/ChapterFour/0993. Cousins in Binary Tree.md
rename to website/content/ChapterFour/0993.Cousins-in-Binary-Tree.md
diff --git a/website/content/ChapterFour/0995. Minimum Number of K Consecutive Bit Flips.md b/website/content/ChapterFour/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md
similarity index 99%
rename from website/content/ChapterFour/0995. Minimum Number of K Consecutive Bit Flips.md
rename to website/content/ChapterFour/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md
index a8403164..768d37be 100755
--- a/website/content/ChapterFour/0995. Minimum Number of K Consecutive Bit Flips.md
+++ b/website/content/ChapterFour/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md
@@ -1,7 +1,7 @@
# [995. Minimum Number of K Consecutive Bit Flips](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/)
-## 题目:
+## 题目
In an array `A` containing only 0s and 1s, a `K`-bit flip consists of choosing a (contiguous) subarray of length `K` and simultaneously changing every 0 in the subarray to 1, and every 1 in the subarray to 0.
diff --git a/website/content/ChapterFour/0996. Number of Squareful Arrays.md b/website/content/ChapterFour/0996.Number-of-Squareful-Arrays.md
similarity index 100%
rename from website/content/ChapterFour/0996. Number of Squareful Arrays.md
rename to website/content/ChapterFour/0996.Number-of-Squareful-Arrays.md
diff --git a/website/content/ChapterFour/1002. Find Common Characters.md b/website/content/ChapterFour/1002.Find-Common-Characters.md
similarity index 99%
rename from website/content/ChapterFour/1002. Find Common Characters.md
rename to website/content/ChapterFour/1002.Find-Common-Characters.md
index 9fe197c1..9b61e205 100755
--- a/website/content/ChapterFour/1002. Find Common Characters.md
+++ b/website/content/ChapterFour/1002.Find-Common-Characters.md
@@ -1,7 +1,7 @@
# [1002. Find Common Characters](https://leetcode.com/problems/find-common-characters/)
-## 题目:
+## 题目
Given an array `A` of strings made only from lowercase letters, return a list of all characters that show up in all strings within the list **(including duplicates)**. For example, if a character occurs 3 times in all strings but not 4 times, you need to include that character three times in the final answer.
diff --git a/website/content/ChapterFour/1003. Check If Word Is Valid After Substitutions.md b/website/content/ChapterFour/1003.Check-If-Word-Is-Valid-After-Substitutions.md
similarity index 100%
rename from website/content/ChapterFour/1003. Check If Word Is Valid After Substitutions.md
rename to website/content/ChapterFour/1003.Check-If-Word-Is-Valid-After-Substitutions.md
diff --git a/website/content/ChapterFour/1004. Max Consecutive Ones III.md b/website/content/ChapterFour/1004.Max-Consecutive-Ones-III.md
similarity index 100%
rename from website/content/ChapterFour/1004. Max Consecutive Ones III.md
rename to website/content/ChapterFour/1004.Max-Consecutive-Ones-III.md
diff --git a/website/content/ChapterFour/1005. Maximize Sum Of Array After K Negations.md b/website/content/ChapterFour/1005.Maximize-Sum-Of-Array-After-K-Negations.md
similarity index 100%
rename from website/content/ChapterFour/1005. Maximize Sum Of Array After K Negations.md
rename to website/content/ChapterFour/1005.Maximize-Sum-Of-Array-After-K-Negations.md
diff --git a/website/content/ChapterFour/1011. Capacity To Ship Packages Within D Days.md b/website/content/ChapterFour/1011.Capacity-To-Ship-Packages-Within-D-Days.md
similarity index 99%
rename from website/content/ChapterFour/1011. Capacity To Ship Packages Within D Days.md
rename to website/content/ChapterFour/1011.Capacity-To-Ship-Packages-Within-D-Days.md
index af9782db..774c53d1 100755
--- a/website/content/ChapterFour/1011. Capacity To Ship Packages Within D Days.md
+++ b/website/content/ChapterFour/1011.Capacity-To-Ship-Packages-Within-D-Days.md
@@ -1,7 +1,7 @@
# [1011. Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/)
-## 题目:
+## 题目
A conveyor belt has packages that must be shipped from one port to another within `D` days.
diff --git a/website/content/ChapterFour/1017. Convert to Base -2.md b/website/content/ChapterFour/1017.Convert-to-Base--2.md
similarity index 98%
rename from website/content/ChapterFour/1017. Convert to Base -2.md
rename to website/content/ChapterFour/1017.Convert-to-Base--2.md
index f9b8c708..77eec60f 100755
--- a/website/content/ChapterFour/1017. Convert to Base -2.md
+++ b/website/content/ChapterFour/1017.Convert-to-Base--2.md
@@ -1,7 +1,7 @@
# [1017. Convert to Base -2](https://leetcode.com/problems/convert-to-base-2/)
-## 题目:
+## 题目
Given a number `N`, return a string consisting of `"0"`s and `"1"`s that represents its value in base **`-2`** (negative two).
diff --git a/website/content/ChapterFour/1019. Next Greater Node In Linked List.md b/website/content/ChapterFour/1019.Next-Greater-Node-In-Linked-List.md
similarity index 100%
rename from website/content/ChapterFour/1019. Next Greater Node In Linked List.md
rename to website/content/ChapterFour/1019.Next-Greater-Node-In-Linked-List.md
diff --git a/website/content/ChapterFour/1020. Number of Enclaves.md b/website/content/ChapterFour/1020.Number-of-Enclaves.md
similarity index 96%
rename from website/content/ChapterFour/1020. Number of Enclaves.md
rename to website/content/ChapterFour/1020.Number-of-Enclaves.md
index 0c906756..34b72b3d 100644
--- a/website/content/ChapterFour/1020. Number of Enclaves.md
+++ b/website/content/ChapterFour/1020.Number-of-Enclaves.md
@@ -1,4 +1,5 @@
-# 1020. Number of Enclaves
+# [1020. Number of Enclaves](https://leetcode.com/problems/number-of-enclaves/)
+
## 题目
diff --git a/website/content/ChapterFour/1021. Remove Outermost Parentheses.md b/website/content/ChapterFour/1021.Remove-Outermost-Parentheses.md
similarity index 100%
rename from website/content/ChapterFour/1021. Remove Outermost Parentheses.md
rename to website/content/ChapterFour/1021.Remove-Outermost-Parentheses.md
diff --git a/website/content/ChapterFour/1025. Divisor Game.md b/website/content/ChapterFour/1025.Divisor-Game.md
similarity index 100%
rename from website/content/ChapterFour/1025. Divisor Game.md
rename to website/content/ChapterFour/1025.Divisor-Game.md
diff --git a/website/content/ChapterFour/1026. Maximum Difference Between Node and Ancestor.md b/website/content/ChapterFour/1026.Maximum-Difference-Between-Node-and-Ancestor.md
similarity index 94%
rename from website/content/ChapterFour/1026. Maximum Difference Between Node and Ancestor.md
rename to website/content/ChapterFour/1026.Maximum-Difference-Between-Node-and-Ancestor.md
index 5be95e44..b2c94617 100644
--- a/website/content/ChapterFour/1026. Maximum Difference Between Node and Ancestor.md
+++ b/website/content/ChapterFour/1026.Maximum-Difference-Between-Node-and-Ancestor.md
@@ -1,4 +1,5 @@
-# 1026. Maximum Difference Between Node and Ancestor
+# [1026. Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/)
+
## 题目
diff --git a/website/content/ChapterFour/1028. Recover a Tree From Preorder Traversal.md b/website/content/ChapterFour/1028.Recover-a-Tree-From-Preorder-Traversal.md
similarity index 99%
rename from website/content/ChapterFour/1028. Recover a Tree From Preorder Traversal.md
rename to website/content/ChapterFour/1028.Recover-a-Tree-From-Preorder-Traversal.md
index 002a0478..f9c25238 100755
--- a/website/content/ChapterFour/1028. Recover a Tree From Preorder Traversal.md
+++ b/website/content/ChapterFour/1028.Recover-a-Tree-From-Preorder-Traversal.md
@@ -1,7 +1,7 @@
# [1028. Recover a Tree From Preorder Traversal](https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/)
-## 题目:
+## 题目
We run a preorder depth first search on the `root` of a binary tree.
diff --git a/website/content/ChapterFour/1030. Matrix Cells in Distance Order.md b/website/content/ChapterFour/1030.Matrix-Cells-in-Distance-Order.md
similarity index 100%
rename from website/content/ChapterFour/1030. Matrix Cells in Distance Order.md
rename to website/content/ChapterFour/1030.Matrix-Cells-in-Distance-Order.md
diff --git a/website/content/ChapterFour/1040. Moving Stones Until Consecutive II.md b/website/content/ChapterFour/1040.Moving-Stones-Until-Consecutive-II.md
similarity index 99%
rename from website/content/ChapterFour/1040. Moving Stones Until Consecutive II.md
rename to website/content/ChapterFour/1040.Moving-Stones-Until-Consecutive-II.md
index 77be8c20..9c41121e 100755
--- a/website/content/ChapterFour/1040. Moving Stones Until Consecutive II.md
+++ b/website/content/ChapterFour/1040.Moving-Stones-Until-Consecutive-II.md
@@ -1,7 +1,7 @@
# [1040. Moving Stones Until Consecutive II](https://leetcode.com/problems/moving-stones-until-consecutive-ii/)
-## 题目:
+## 题目
On an **infinite** number line, the position of the i-th stone is given by `stones[i]`. Call a stone an *endpoint stone* if it has the smallest or largest position.
diff --git a/website/content/ChapterFour/1047. Remove All Adjacent Duplicates In String.md b/website/content/ChapterFour/1047.Remove-All-Adjacent-Duplicates-In-String.md
similarity index 100%
rename from website/content/ChapterFour/1047. Remove All Adjacent Duplicates In String.md
rename to website/content/ChapterFour/1047.Remove-All-Adjacent-Duplicates-In-String.md
diff --git a/website/content/ChapterFour/1049. Last Stone Weight II.md b/website/content/ChapterFour/1049.Last-Stone-Weight-II.md
similarity index 99%
rename from website/content/ChapterFour/1049. Last Stone Weight II.md
rename to website/content/ChapterFour/1049.Last-Stone-Weight-II.md
index b989dd0a..4159bb50 100755
--- a/website/content/ChapterFour/1049. Last Stone Weight II.md
+++ b/website/content/ChapterFour/1049.Last-Stone-Weight-II.md
@@ -1,6 +1,6 @@
# [1049. Last Stone Weight II](https://leetcode.com/problems/last-stone-weight-ii/)
-## 题目:
+## 题目
We have a collection of rocks, each rock has a positive integer weight.
diff --git a/website/content/ChapterFour/1052. Grumpy Bookstore Owner.md b/website/content/ChapterFour/1052.Grumpy-Bookstore-Owner.md
similarity index 99%
rename from website/content/ChapterFour/1052. Grumpy Bookstore Owner.md
rename to website/content/ChapterFour/1052.Grumpy-Bookstore-Owner.md
index 5612673b..b63f9479 100755
--- a/website/content/ChapterFour/1052. Grumpy Bookstore Owner.md
+++ b/website/content/ChapterFour/1052.Grumpy-Bookstore-Owner.md
@@ -1,7 +1,7 @@
# [1052. Grumpy Bookstore Owner](https://leetcode.com/problems/grumpy-bookstore-owner/)
-## 题目:
+## 题目
Today, the bookstore owner has a store open for `customers.length`minutes. Every minute, some number of customers (`customers[i]`) enter the store, and all those customers leave after the end of that minute.
diff --git a/website/content/ChapterFour/1054. Distant Barcodes.md b/website/content/ChapterFour/1054.Distant-Barcodes.md
similarity index 100%
rename from website/content/ChapterFour/1054. Distant Barcodes.md
rename to website/content/ChapterFour/1054.Distant-Barcodes.md
diff --git a/website/content/ChapterFour/1073. Adding Two Negabinary Numbers.md b/website/content/ChapterFour/1073.Adding-Two-Negabinary-Numbers.md
similarity index 99%
rename from website/content/ChapterFour/1073. Adding Two Negabinary Numbers.md
rename to website/content/ChapterFour/1073.Adding-Two-Negabinary-Numbers.md
index d3d8f45c..b8380b33 100755
--- a/website/content/ChapterFour/1073. Adding Two Negabinary Numbers.md
+++ b/website/content/ChapterFour/1073.Adding-Two-Negabinary-Numbers.md
@@ -1,7 +1,7 @@
# [1073. Adding Two Negabinary Numbers](https://leetcode.com/problems/adding-two-negabinary-numbers/)
-## 题目:
+## 题目
Given two numbers `arr1` and `arr2` in base **-2**, return the result of adding them together.
diff --git a/website/content/ChapterFour/1074. Number of Submatrices That Sum to Target.md b/website/content/ChapterFour/1074.Number-of-Submatrices-That-Sum-to-Target.md
similarity index 99%
rename from website/content/ChapterFour/1074. Number of Submatrices That Sum to Target.md
rename to website/content/ChapterFour/1074.Number-of-Submatrices-That-Sum-to-Target.md
index 7a6b3864..a9a66a85 100755
--- a/website/content/ChapterFour/1074. Number of Submatrices That Sum to Target.md
+++ b/website/content/ChapterFour/1074.Number-of-Submatrices-That-Sum-to-Target.md
@@ -1,7 +1,7 @@
# [1074. Number of Submatrices That Sum to Target](https://leetcode.com/problems/number-of-submatrices-that-sum-to-target/)
-## 题目:
+## 题目
Given a `matrix`, and a `target`, return the number of non-empty submatrices that sum to target.
diff --git a/website/content/ChapterFour/1078. Occurrences After Bigram.md b/website/content/ChapterFour/1078.Occurrences-After-Bigram.md
similarity index 99%
rename from website/content/ChapterFour/1078. Occurrences After Bigram.md
rename to website/content/ChapterFour/1078.Occurrences-After-Bigram.md
index 46efbeaa..6d1806e0 100755
--- a/website/content/ChapterFour/1078. Occurrences After Bigram.md
+++ b/website/content/ChapterFour/1078.Occurrences-After-Bigram.md
@@ -1,7 +1,7 @@
# [1078. Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/)
-## 题目:
+## 题目
Given words `first` and `second`, consider occurrences in some `text` of the form "`first second third`", where `second` comes immediately after `first`, and `third`comes immediately after `second`.
diff --git a/website/content/ChapterFour/1079. Letter Tile Possibilities.md b/website/content/ChapterFour/1079.Letter-Tile-Possibilities.md
similarity index 100%
rename from website/content/ChapterFour/1079. Letter Tile Possibilities.md
rename to website/content/ChapterFour/1079.Letter-Tile-Possibilities.md
diff --git a/website/content/ChapterFour/1093. Statistics from a Large Sample.md b/website/content/ChapterFour/1093.Statistics-from-a-Large-Sample.md
similarity index 100%
rename from website/content/ChapterFour/1093. Statistics from a Large Sample.md
rename to website/content/ChapterFour/1093.Statistics-from-a-Large-Sample.md
diff --git a/website/content/ChapterFour/1105. Filling Bookcase Shelves.md b/website/content/ChapterFour/1105.Filling-Bookcase-Shelves.md
similarity index 99%
rename from website/content/ChapterFour/1105. Filling Bookcase Shelves.md
rename to website/content/ChapterFour/1105.Filling-Bookcase-Shelves.md
index 73229a46..5c248f89 100755
--- a/website/content/ChapterFour/1105. Filling Bookcase Shelves.md
+++ b/website/content/ChapterFour/1105.Filling-Bookcase-Shelves.md
@@ -1,7 +1,7 @@
# [1105. Filling Bookcase Shelves](https://leetcode.com/problems/filling-bookcase-shelves/)
-## 题目:
+## 题目
We have a sequence of `books`: the `i`-th book has thickness `books[i][0]`and height `books[i][1]`.
diff --git a/website/content/ChapterFour/1108. Defanging an IP Address.md b/website/content/ChapterFour/1108.Defanging-an-IP-Address.md
similarity index 98%
rename from website/content/ChapterFour/1108. Defanging an IP Address.md
rename to website/content/ChapterFour/1108.Defanging-an-IP-Address.md
index 4c83396d..0eb4a7f9 100755
--- a/website/content/ChapterFour/1108. Defanging an IP Address.md
+++ b/website/content/ChapterFour/1108.Defanging-an-IP-Address.md
@@ -1,7 +1,7 @@
# [1108. Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/)
-## 题目:
+## 题目
Given a valid (IPv4) IP `address`, return a defanged version of that IP address.
diff --git a/website/content/ChapterFour/1110. Delete Nodes And Return Forest.md b/website/content/ChapterFour/1110.Delete-Nodes-And-Return-Forest.md
similarity index 95%
rename from website/content/ChapterFour/1110. Delete Nodes And Return Forest.md
rename to website/content/ChapterFour/1110.Delete-Nodes-And-Return-Forest.md
index 25c27b96..9d3c214c 100644
--- a/website/content/ChapterFour/1110. Delete Nodes And Return Forest.md
+++ b/website/content/ChapterFour/1110.Delete-Nodes-And-Return-Forest.md
@@ -1,4 +1,4 @@
-# 1110. Delete Nodes And Return Forest
+# [1110. Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest/)
## 题目
diff --git a/website/content/ChapterFour/1111. Maximum Nesting Depth of Two Valid Parentheses Strings.md b/website/content/ChapterFour/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md
similarity index 99%
rename from website/content/ChapterFour/1111. Maximum Nesting Depth of Two Valid Parentheses Strings.md
rename to website/content/ChapterFour/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md
index 99d692d2..8f4d8f59 100755
--- a/website/content/ChapterFour/1111. Maximum Nesting Depth of Two Valid Parentheses Strings.md
+++ b/website/content/ChapterFour/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md
@@ -1,7 +1,7 @@
# [1111. Maximum Nesting Depth of Two Valid Parentheses Strings](https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/)
-## 题目:
+## 题目
A string is a *valid parentheses string* (denoted VPS) if and only if it consists of `"("` and `")"` characters only, and:
diff --git a/website/content/ChapterFour/1122. Relative Sort Array.md b/website/content/ChapterFour/1122.Relative-Sort-Array.md
similarity index 99%
rename from website/content/ChapterFour/1122. Relative Sort Array.md
rename to website/content/ChapterFour/1122.Relative-Sort-Array.md
index 7692fc19..7a536881 100755
--- a/website/content/ChapterFour/1122. Relative Sort Array.md
+++ b/website/content/ChapterFour/1122.Relative-Sort-Array.md
@@ -1,7 +1,7 @@
# [1122. Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)
-## 题目:
+## 题目
Given two arrays `arr1` and `arr2`, the elements of `arr2` are distinct, and all elements in `arr2` are also in `arr1`.
diff --git a/website/content/ChapterFour/1123. Lowest Common Ancestor of Deepest Leaves.md b/website/content/ChapterFour/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md
similarity index 99%
rename from website/content/ChapterFour/1123. Lowest Common Ancestor of Deepest Leaves.md
rename to website/content/ChapterFour/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md
index 2519a410..f2838c9d 100755
--- a/website/content/ChapterFour/1123. Lowest Common Ancestor of Deepest Leaves.md
+++ b/website/content/ChapterFour/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md
@@ -1,7 +1,7 @@
# [1123. Lowest Common Ancestor of Deepest Leaves](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/)
-## 题目:
+## 题目
Given a rooted binary tree, return the lowest common ancestor of its deepest leaves.
diff --git a/website/content/ChapterFour/1128. Number of Equivalent Domino Pairs.md b/website/content/ChapterFour/1128.Number-of-Equivalent-Domino-Pairs.md
similarity index 99%
rename from website/content/ChapterFour/1128. Number of Equivalent Domino Pairs.md
rename to website/content/ChapterFour/1128.Number-of-Equivalent-Domino-Pairs.md
index 10a461ca..cc946659 100755
--- a/website/content/ChapterFour/1128. Number of Equivalent Domino Pairs.md
+++ b/website/content/ChapterFour/1128.Number-of-Equivalent-Domino-Pairs.md
@@ -1,7 +1,7 @@
# [1128. Number of Equivalent Domino Pairs](https://leetcode.com/problems/number-of-equivalent-domino-pairs/)
-## 题目:
+## 题目
Given a list of `dominoes`, `dominoes[i] = [a, b]` is *equivalent* to `dominoes[j] = [c, d]` if and only if either (`a==c` and `b==d`), or (`a==d` and `b==c`) - that is, one domino can be rotated to be equal to another domino.
diff --git a/website/content/ChapterFour/1137. N-th Tribonacci Number.md b/website/content/ChapterFour/1137.N-th-Tribonacci-Number.md
similarity index 98%
rename from website/content/ChapterFour/1137. N-th Tribonacci Number.md
rename to website/content/ChapterFour/1137.N-th-Tribonacci-Number.md
index 92d0866d..f897528d 100755
--- a/website/content/ChapterFour/1137. N-th Tribonacci Number.md
+++ b/website/content/ChapterFour/1137.N-th-Tribonacci-Number.md
@@ -1,7 +1,7 @@
# [1137. N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)
-## 题目:
+## 题目
The Tribonacci sequence Tn is defined as follows:
diff --git a/website/content/ChapterFour/1145. Binary Tree Coloring Game.md b/website/content/ChapterFour/1145.Binary-Tree-Coloring-Game.md
similarity index 98%
rename from website/content/ChapterFour/1145. Binary Tree Coloring Game.md
rename to website/content/ChapterFour/1145.Binary-Tree-Coloring-Game.md
index 0ba49fc4..02fbc682 100644
--- a/website/content/ChapterFour/1145. Binary Tree Coloring Game.md
+++ b/website/content/ChapterFour/1145.Binary-Tree-Coloring-Game.md
@@ -1,4 +1,5 @@
-# 1145. Binary Tree Coloring Game
+# [1145. Binary Tree Coloring Game](https://leetcode.com/problems/binary-tree-coloring-game/)
+
## 题目
diff --git a/website/content/ChapterFour/1154. Day of the Year.md b/website/content/ChapterFour/1154.Day-of-the-Year.md
similarity index 99%
rename from website/content/ChapterFour/1154. Day of the Year.md
rename to website/content/ChapterFour/1154.Day-of-the-Year.md
index a955df92..6b1bc846 100755
--- a/website/content/ChapterFour/1154. Day of the Year.md
+++ b/website/content/ChapterFour/1154.Day-of-the-Year.md
@@ -1,7 +1,7 @@
# [1154. Day of the Year](https://leetcode.com/problems/day-of-the-year/)
-## 题目:
+## 题目
Given a string `date` representing a [Gregorian calendar](https://en.wikipedia.org/wiki/Gregorian_calendar) date formatted as `YYYY-MM-DD`, return the day number of the year.
diff --git a/website/content/ChapterFour/1157. Online Majority Element In Subarray.md b/website/content/ChapterFour/1157.Online-Majority-Element-In-Subarray.md
similarity index 99%
rename from website/content/ChapterFour/1157. Online Majority Element In Subarray.md
rename to website/content/ChapterFour/1157.Online-Majority-Element-In-Subarray.md
index 97d32725..6d06c5ae 100755
--- a/website/content/ChapterFour/1157. Online Majority Element In Subarray.md
+++ b/website/content/ChapterFour/1157.Online-Majority-Element-In-Subarray.md
@@ -1,7 +1,7 @@
# [1157. Online Majority Element In Subarray](https://leetcode.com/problems/online-majority-element-in-subarray/)
-## 题目:
+## 题目
Implementing the class `MajorityChecker`, which has the following API:
diff --git a/website/content/ChapterFour/1160. Find Words That Can Be Formed by Characters.md b/website/content/ChapterFour/1160.Find-Words-That-Can-Be-Formed-by-Characters.md
similarity index 99%
rename from website/content/ChapterFour/1160. Find Words That Can Be Formed by Characters.md
rename to website/content/ChapterFour/1160.Find-Words-That-Can-Be-Formed-by-Characters.md
index f52904ba..5a73172d 100755
--- a/website/content/ChapterFour/1160. Find Words That Can Be Formed by Characters.md
+++ b/website/content/ChapterFour/1160.Find-Words-That-Can-Be-Formed-by-Characters.md
@@ -1,7 +1,7 @@
# [1160. Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)
-## 题目:
+## 题目
You are given an array of strings `words` and a string `chars`.
diff --git a/website/content/ChapterFour/1170. Compare Strings by Frequency of the Smallest Character.md b/website/content/ChapterFour/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md
similarity index 99%
rename from website/content/ChapterFour/1170. Compare Strings by Frequency of the Smallest Character.md
rename to website/content/ChapterFour/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md
index 895633f2..be6dfc0d 100755
--- a/website/content/ChapterFour/1170. Compare Strings by Frequency of the Smallest Character.md
+++ b/website/content/ChapterFour/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md
@@ -1,6 +1,6 @@
# [1170. Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/)
-## 题目:
+## 题目
Let's define a function `f(s)` over a non-empty string `s`, which calculates the frequency of the smallest character in `s`. For example, if `s = "dcce"` then `f(s) = 2` because the smallest character is `"c"` and its frequency is 2.
diff --git a/website/content/ChapterFour/1171. Remove Zero Sum Consecutive Nodes from Linked List.md b/website/content/ChapterFour/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md
similarity index 99%
rename from website/content/ChapterFour/1171. Remove Zero Sum Consecutive Nodes from Linked List.md
rename to website/content/ChapterFour/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md
index a1a69e50..b71ad63b 100755
--- a/website/content/ChapterFour/1171. Remove Zero Sum Consecutive Nodes from Linked List.md
+++ b/website/content/ChapterFour/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md
@@ -1,7 +1,7 @@
# [1171. Remove Zero Sum Consecutive Nodes from Linked List](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/)
-## 题目:
+## 题目
Given the `head` of a linked list, we repeatedly delete consecutive sequences of nodes that sum to `0` until there are no such sequences.
diff --git a/website/content/ChapterFour/1175. Prime Arrangements.md b/website/content/ChapterFour/1175.Prime-Arrangements.md
similarity index 99%
rename from website/content/ChapterFour/1175. Prime Arrangements.md
rename to website/content/ChapterFour/1175.Prime-Arrangements.md
index a3fe3cc2..e5550e67 100755
--- a/website/content/ChapterFour/1175. Prime Arrangements.md
+++ b/website/content/ChapterFour/1175.Prime-Arrangements.md
@@ -1,7 +1,7 @@
# [1175. Prime Arrangements](https://leetcode.com/problems/prime-arrangements/)
-## 题目:
+## 题目
Return the number of permutations of 1 to `n` so that prime numbers are at prime indices (1-indexed.)
diff --git a/website/content/ChapterFour/1184. Distance Between Bus Stops.md b/website/content/ChapterFour/1184.Distance-Between-Bus-Stops.md
similarity index 99%
rename from website/content/ChapterFour/1184. Distance Between Bus Stops.md
rename to website/content/ChapterFour/1184.Distance-Between-Bus-Stops.md
index 3a94310d..4f5f6c64 100755
--- a/website/content/ChapterFour/1184. Distance Between Bus Stops.md
+++ b/website/content/ChapterFour/1184.Distance-Between-Bus-Stops.md
@@ -1,6 +1,6 @@
# [1184. Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/)
-## 题目:
+## 题目
A bus has `n` stops numbered from `0` to `n - 1` that form a circle. We know the distance between all pairs of neighboring stops where `distance[i]` is the distance between the stops number `i` and `(i + 1) % n`.
diff --git a/website/content/ChapterFour/1185. Day of the Week.md b/website/content/ChapterFour/1185.Day-of-the-Week.md
similarity index 99%
rename from website/content/ChapterFour/1185. Day of the Week.md
rename to website/content/ChapterFour/1185.Day-of-the-Week.md
index 44e87fda..0eef0bcf 100755
--- a/website/content/ChapterFour/1185. Day of the Week.md
+++ b/website/content/ChapterFour/1185.Day-of-the-Week.md
@@ -1,7 +1,7 @@
# [1185. Day of the Week](https://leetcode.com/problems/day-of-the-week/)
-## 题目:
+## 题目
Given a date, return the corresponding day of the week for that date.
diff --git a/website/content/ChapterFour/1189. Maximum Number of Balloons.md b/website/content/ChapterFour/1189.Maximum-Number-of-Balloons.md
similarity index 99%
rename from website/content/ChapterFour/1189. Maximum Number of Balloons.md
rename to website/content/ChapterFour/1189.Maximum-Number-of-Balloons.md
index da2a55c6..9fdae875 100755
--- a/website/content/ChapterFour/1189. Maximum Number of Balloons.md
+++ b/website/content/ChapterFour/1189.Maximum-Number-of-Balloons.md
@@ -1,7 +1,7 @@
# [1189. Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/)
-## 题目:
+## 题目
Given a string `text`, you want to use the characters of `text` to form as many instances of the word **"balloon"** as possible.
diff --git a/website/content/ChapterFour/1200. Minimum Absolute Difference.md b/website/content/ChapterFour/1200.Minimum-Absolute-Difference.md
similarity index 99%
rename from website/content/ChapterFour/1200. Minimum Absolute Difference.md
rename to website/content/ChapterFour/1200.Minimum-Absolute-Difference.md
index c846fcf7..c52b7799 100755
--- a/website/content/ChapterFour/1200. Minimum Absolute Difference.md
+++ b/website/content/ChapterFour/1200.Minimum-Absolute-Difference.md
@@ -1,7 +1,7 @@
# [1200. Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/)
-## 题目:
+## 题目
Given an array of **distinct** integers `arr`, find all pairs of elements with the minimum absolute difference of any two elements.
diff --git a/website/content/ChapterFour/1201. Ugly Number III.md b/website/content/ChapterFour/1201.Ugly-Number-III.md
similarity index 99%
rename from website/content/ChapterFour/1201. Ugly Number III.md
rename to website/content/ChapterFour/1201.Ugly-Number-III.md
index 38fbd27c..171ebe8b 100755
--- a/website/content/ChapterFour/1201. Ugly Number III.md
+++ b/website/content/ChapterFour/1201.Ugly-Number-III.md
@@ -1,7 +1,7 @@
# [1201. Ugly Number III](https://leetcode.com/problems/ugly-number-iii/)
-## 题目:
+## 题目
Write a program to find the `n`-th ugly number.
diff --git a/website/content/ChapterFour/1202. Smallest String With Swaps.md b/website/content/ChapterFour/1202.Smallest-String-With-Swaps.md
similarity index 99%
rename from website/content/ChapterFour/1202. Smallest String With Swaps.md
rename to website/content/ChapterFour/1202.Smallest-String-With-Swaps.md
index bcca78c9..18527ba9 100755
--- a/website/content/ChapterFour/1202. Smallest String With Swaps.md
+++ b/website/content/ChapterFour/1202.Smallest-String-With-Swaps.md
@@ -1,7 +1,7 @@
# [1202. Smallest String With Swaps](https://leetcode.com/problems/smallest-string-with-swaps/)
-## 题目:
+## 题目
You are given a string `s`, and an array of pairs of indices in the string `pairs` where `pairs[i] = [a, b]` indicates 2 indices(0-indexed) of the string.
diff --git a/website/content/ChapterFour/1207. Unique Number of Occurrences.md b/website/content/ChapterFour/1207.Unique-Number-of-Occurrences.md
similarity index 99%
rename from website/content/ChapterFour/1207. Unique Number of Occurrences.md
rename to website/content/ChapterFour/1207.Unique-Number-of-Occurrences.md
index 711214dd..43e3c6f8 100755
--- a/website/content/ChapterFour/1207. Unique Number of Occurrences.md
+++ b/website/content/ChapterFour/1207.Unique-Number-of-Occurrences.md
@@ -1,7 +1,7 @@
# [1207. Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/)
-## 题目:
+## 题目
Given an array of integers `arr`, write a function that returns `true` if and only if the number of occurrences of each value in the array is unique.
diff --git a/website/content/ChapterFour/1208. Get Equal Substrings Within Budget.md b/website/content/ChapterFour/1208.Get-Equal-Substrings-Within-Budget.md
similarity index 99%
rename from website/content/ChapterFour/1208. Get Equal Substrings Within Budget.md
rename to website/content/ChapterFour/1208.Get-Equal-Substrings-Within-Budget.md
index 4019e9a9..5d0474f5 100755
--- a/website/content/ChapterFour/1208. Get Equal Substrings Within Budget.md
+++ b/website/content/ChapterFour/1208.Get-Equal-Substrings-Within-Budget.md
@@ -1,7 +1,7 @@
# [1208. Get Equal Substrings Within Budget](https://leetcode.com/problems/get-equal-substrings-within-budget/)
-## 题目:
+## 题目
You are given two strings `s` and `t` of the same length. You want to change `s` to `t`. Changing the `i`-th character of `s` to `i`-th character of `t` costs `|s[i] - t[i]|` that is, the absolute difference between the ASCII values of the characters.
diff --git a/website/content/ChapterFour/1217. Play with Chips.md b/website/content/ChapterFour/1217.Play-with-Chips.md
similarity index 99%
rename from website/content/ChapterFour/1217. Play with Chips.md
rename to website/content/ChapterFour/1217.Play-with-Chips.md
index c80b1f72..29eec710 100755
--- a/website/content/ChapterFour/1217. Play with Chips.md
+++ b/website/content/ChapterFour/1217.Play-with-Chips.md
@@ -1,7 +1,7 @@
# [1217. Play with Chips](https://leetcode.com/problems/play-with-chips/)
-## 题目:
+## 题目
There are some chips, and the i-th chip is at position `chips[i]`.
diff --git a/website/content/ChapterFour/1221. Split a String in Balanced Strings.md b/website/content/ChapterFour/1221.Split-a-String-in-Balanced-Strings.md
similarity index 99%
rename from website/content/ChapterFour/1221. Split a String in Balanced Strings.md
rename to website/content/ChapterFour/1221.Split-a-String-in-Balanced-Strings.md
index d1278c04..5a50681b 100755
--- a/website/content/ChapterFour/1221. Split a String in Balanced Strings.md
+++ b/website/content/ChapterFour/1221.Split-a-String-in-Balanced-Strings.md
@@ -1,7 +1,7 @@
# [1221. Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings/)
-## 题目:
+## 题目
Balanced strings are those who have equal quantity of 'L' and 'R' characters.
diff --git a/website/content/ChapterFour/1232. Check If It Is a Straight Line.md b/website/content/ChapterFour/1232.Check-If-It-Is-a-Straight-Line.md
similarity index 99%
rename from website/content/ChapterFour/1232. Check If It Is a Straight Line.md
rename to website/content/ChapterFour/1232.Check-If-It-Is-a-Straight-Line.md
index fda505c3..a6bdd744 100755
--- a/website/content/ChapterFour/1232. Check If It Is a Straight Line.md
+++ b/website/content/ChapterFour/1232.Check-If-It-Is-a-Straight-Line.md
@@ -1,7 +1,7 @@
# [1232. Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line/)
-## 题目:
+## 题目
You are given an array `coordinates`, `coordinates[i] = [x, y]`, where `[x, y]` represents the coordinate of a point. Check if these points make a straight line in the XY plane.
diff --git a/website/content/ChapterFour/1234. Replace the Substring for Balanced String.md b/website/content/ChapterFour/1234.Replace-the-Substring-for-Balanced-String.md
similarity index 99%
rename from website/content/ChapterFour/1234. Replace the Substring for Balanced String.md
rename to website/content/ChapterFour/1234.Replace-the-Substring-for-Balanced-String.md
index 34310cc0..f5584b74 100755
--- a/website/content/ChapterFour/1234. Replace the Substring for Balanced String.md
+++ b/website/content/ChapterFour/1234.Replace-the-Substring-for-Balanced-String.md
@@ -1,7 +1,7 @@
# [1234. Replace the Substring for Balanced String](https://leetcode.com/problems/replace-the-substring-for-balanced-string/)
-## 题目:
+## 题目
You are given a string containing only 4 kinds of characters `'Q',` `'W', 'E'` and `'R'`.
diff --git a/website/content/ChapterFour/1235. Maximum Profit in Job Scheduling.md b/website/content/ChapterFour/1235.Maximum-Profit-in-Job-Scheduling.md
similarity index 99%
rename from website/content/ChapterFour/1235. Maximum Profit in Job Scheduling.md
rename to website/content/ChapterFour/1235.Maximum-Profit-in-Job-Scheduling.md
index 8759de93..915b5433 100755
--- a/website/content/ChapterFour/1235. Maximum Profit in Job Scheduling.md
+++ b/website/content/ChapterFour/1235.Maximum-Profit-in-Job-Scheduling.md
@@ -1,7 +1,7 @@
# [1235. Maximum Profit in Job Scheduling](https://leetcode.com/problems/maximum-profit-in-job-scheduling/)
-## 题目:
+## 题目
We have `n` jobs, where every job is scheduled to be done from `startTime[i]` to `endTime[i]`, obtaining a profit of `profit[i]`.
diff --git a/website/content/ChapterFour/1252. Cells with Odd Values in a Matrix.md b/website/content/ChapterFour/1252.Cells-with-Odd-Values-in-a-Matrix.md
similarity index 99%
rename from website/content/ChapterFour/1252. Cells with Odd Values in a Matrix.md
rename to website/content/ChapterFour/1252.Cells-with-Odd-Values-in-a-Matrix.md
index e07bbadd..14db287a 100755
--- a/website/content/ChapterFour/1252. Cells with Odd Values in a Matrix.md
+++ b/website/content/ChapterFour/1252.Cells-with-Odd-Values-in-a-Matrix.md
@@ -1,7 +1,7 @@
# [1252. Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/)
-## 题目:
+## 题目
Given `n` and `m` which are the dimensions of a matrix initialized by zeros and given an array `indices` where `indices[i] = [ri, ci]`. For each pair of `[ri, ci]` you have to increment all cells in row `ri` and column `ci` by 1.
diff --git a/website/content/ChapterFour/1254. Number of Closed Islands.md b/website/content/ChapterFour/1254.Number-of-Closed-Islands.md
similarity index 99%
rename from website/content/ChapterFour/1254. Number of Closed Islands.md
rename to website/content/ChapterFour/1254.Number-of-Closed-Islands.md
index 7e3ee74c..3ff8da1a 100755
--- a/website/content/ChapterFour/1254. Number of Closed Islands.md
+++ b/website/content/ChapterFour/1254.Number-of-Closed-Islands.md
@@ -1,7 +1,7 @@
# [1254. Number of Closed Islands](https://leetcode.com/problems/number-of-closed-islands/)
-## 题目:
+## 题目
Given a 2D `grid` consists of `0s` (land) and `1s` (water). An *island* is a maximal 4-directionally connected group of `0s` and a *closed island* is an island **totally** (all left, top, right, bottom) surrounded by `1s.`
diff --git a/website/content/ChapterFour/1266. Minimum Time Visiting All Points.md b/website/content/ChapterFour/1266.Minimum-Time-Visiting-All-Points.md
similarity index 99%
rename from website/content/ChapterFour/1266. Minimum Time Visiting All Points.md
rename to website/content/ChapterFour/1266.Minimum-Time-Visiting-All-Points.md
index eb23a5c4..5fe48f07 100755
--- a/website/content/ChapterFour/1266. Minimum Time Visiting All Points.md
+++ b/website/content/ChapterFour/1266.Minimum-Time-Visiting-All-Points.md
@@ -1,7 +1,7 @@
# [1266. Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/)
-## 题目:
+## 题目
On a plane there are `n` points with integer coordinates `points[i] = [xi, yi]`. Your task is to find the minimum time in seconds to visit all points.
diff --git a/website/content/ChapterFour/1281. Subtract the Product and Sum of Digits of an Integer.md b/website/content/ChapterFour/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md
similarity index 86%
rename from website/content/ChapterFour/1281. Subtract the Product and Sum of Digits of an Integer.md
rename to website/content/ChapterFour/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md
index fd275aca..96cc347d 100644
--- a/website/content/ChapterFour/1281. Subtract the Product and Sum of Digits of an Integer.md
+++ b/website/content/ChapterFour/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md
@@ -1,4 +1,5 @@
-# 1281. Subtract the Product and Sum of Digits of an Integer
+# [1281. Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/)
+
## 题目
diff --git a/website/content/ChapterFour/1283. Find the Smallest Divisor Given a Threshold.md b/website/content/ChapterFour/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md
similarity index 94%
rename from website/content/ChapterFour/1283. Find the Smallest Divisor Given a Threshold.md
rename to website/content/ChapterFour/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md
index 4dd22d20..f0359723 100644
--- a/website/content/ChapterFour/1283. Find the Smallest Divisor Given a Threshold.md
+++ b/website/content/ChapterFour/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md
@@ -1,4 +1,5 @@
-# 1283. Find the Smallest Divisor Given a Threshold
+# [1283. Find the Smallest Divisor Given a Threshold](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/)
+
## 题目
diff --git a/website/content/ChapterFour/1287. Element Appearing More Than 25% In Sorted Array.md b/website/content/ChapterFour/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md
similarity index 87%
rename from website/content/ChapterFour/1287. Element Appearing More Than 25% In Sorted Array.md
rename to website/content/ChapterFour/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md
index 21b92fb5..f9714a4d 100644
--- a/website/content/ChapterFour/1287. Element Appearing More Than 25% In Sorted Array.md
+++ b/website/content/ChapterFour/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md
@@ -1,4 +1,5 @@
-# 1287. Element Appearing More Than 25% In Sorted Array
+# [1287. Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/)
+
## 题目
diff --git a/website/content/ChapterFour/1290. Convert Binary Number in a Linked List to Integer.md b/website/content/ChapterFour/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md
similarity index 91%
rename from website/content/ChapterFour/1290. Convert Binary Number in a Linked List to Integer.md
rename to website/content/ChapterFour/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md
index 915fb442..1c0f9be1 100644
--- a/website/content/ChapterFour/1290. Convert Binary Number in a Linked List to Integer.md
+++ b/website/content/ChapterFour/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md
@@ -1,4 +1,5 @@
-# 1290. Convert Binary Number in a Linked List to Integer
+# [1290. Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/)
+
## 题目
diff --git a/website/content/ChapterFour/1295. Find Numbers with Even Number of Digits.md b/website/content/ChapterFour/1295.Find-Numbers-with-Even-Number-of-Digits.md
similarity index 90%
rename from website/content/ChapterFour/1295. Find Numbers with Even Number of Digits.md
rename to website/content/ChapterFour/1295.Find-Numbers-with-Even-Number-of-Digits.md
index cfa43e9d..ccaa6c49 100644
--- a/website/content/ChapterFour/1295. Find Numbers with Even Number of Digits.md
+++ b/website/content/ChapterFour/1295.Find-Numbers-with-Even-Number-of-Digits.md
@@ -1,4 +1,5 @@
-# 1295. Find Numbers with Even Number of Digits
+# [1295. Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)
+
## 题目
diff --git a/website/content/ChapterFour/1299. Replace Elements with Greatest Element on Right Side.md b/website/content/ChapterFour/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md
similarity index 86%
rename from website/content/ChapterFour/1299. Replace Elements with Greatest Element on Right Side.md
rename to website/content/ChapterFour/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md
index c3634829..633c6576 100644
--- a/website/content/ChapterFour/1299. Replace Elements with Greatest Element on Right Side.md
+++ b/website/content/ChapterFour/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md
@@ -1,4 +1,5 @@
-# 1299. Replace Elements with Greatest Element on Right Side
+# [1299. Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/)
+
## 题目
diff --git a/website/content/ChapterFour/1300. Sum of Mutated Array Closest to Target.md b/website/content/ChapterFour/1300.Sum-of-Mutated-Array-Closest-to-Target.md
similarity index 95%
rename from website/content/ChapterFour/1300. Sum of Mutated Array Closest to Target.md
rename to website/content/ChapterFour/1300.Sum-of-Mutated-Array-Closest-to-Target.md
index 32dad76a..dcee2bcd 100644
--- a/website/content/ChapterFour/1300. Sum of Mutated Array Closest to Target.md
+++ b/website/content/ChapterFour/1300.Sum-of-Mutated-Array-Closest-to-Target.md
@@ -1,4 +1,5 @@
-# 1300. Sum of Mutated Array Closest to Target
+# [1300. Sum of Mutated Array Closest to Target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/)
+
## 题目
diff --git a/website/content/ChapterFour/1302. Deepest Leaves Sum.md b/website/content/ChapterFour/1302.Deepest-Leaves-Sum.md
similarity index 93%
rename from website/content/ChapterFour/1302. Deepest Leaves Sum.md
rename to website/content/ChapterFour/1302.Deepest-Leaves-Sum.md
index 81ee4659..70482634 100644
--- a/website/content/ChapterFour/1302. Deepest Leaves Sum.md
+++ b/website/content/ChapterFour/1302.Deepest-Leaves-Sum.md
@@ -1,4 +1,5 @@
-# 1302. Deepest Leaves Sum
+# [1302. Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/)
+
## 题目
diff --git a/website/content/ChapterFour/1304. Find N Unique Integers Sum up to Zero.md b/website/content/ChapterFour/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md
similarity index 88%
rename from website/content/ChapterFour/1304. Find N Unique Integers Sum up to Zero.md
rename to website/content/ChapterFour/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md
index b1a0bed0..1e15836e 100644
--- a/website/content/ChapterFour/1304. Find N Unique Integers Sum up to Zero.md
+++ b/website/content/ChapterFour/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md
@@ -1,4 +1,5 @@
-# 1304. Find N Unique Integers Sum up to Zero
+# [1304. Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/)
+
## 题目
diff --git a/website/content/ChapterFour/1305. All Elements in Two Binary Search Trees.md b/website/content/ChapterFour/1305.All-Elements-in-Two-Binary-Search-Trees.md
similarity index 95%
rename from website/content/ChapterFour/1305. All Elements in Two Binary Search Trees.md
rename to website/content/ChapterFour/1305.All-Elements-in-Two-Binary-Search-Trees.md
index d54117d3..247bbfbb 100644
--- a/website/content/ChapterFour/1305. All Elements in Two Binary Search Trees.md
+++ b/website/content/ChapterFour/1305.All-Elements-in-Two-Binary-Search-Trees.md
@@ -1,4 +1,5 @@
-# 1305. All Elements in Two Binary Search Trees
+# [1305. All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/)
+
## 题目
diff --git a/website/content/ChapterFour/1306. Jump Game III.md b/website/content/ChapterFour/1306.Jump-Game-III.md
similarity index 97%
rename from website/content/ChapterFour/1306. Jump Game III.md
rename to website/content/ChapterFour/1306.Jump-Game-III.md
index 98b3315b..63f26345 100644
--- a/website/content/ChapterFour/1306. Jump Game III.md
+++ b/website/content/ChapterFour/1306.Jump-Game-III.md
@@ -1,4 +1,4 @@
-# 1306. Jump Game III
+# [1306. Jump Game III](https://leetcode.com/problems/jump-game-iii/)
## 题目
diff --git a/website/content/ChapterFour/_index.md b/website/content/ChapterFour/_index.md
new file mode 100644
index 00000000..3daf13a7
--- /dev/null
+++ b/website/content/ChapterFour/_index.md
@@ -0,0 +1,17 @@
+---
+title: 第四章
+type: docs
+---
+
+# 第四章 Leetcode 题解
+
+
+
+
+
+
+这一章就是 LeetCode 的题解了。笔者目前只刷到 608 题，题解这里有 520 题，都已经 runtime beats 100% 了。相差的 88 题是还没有 beats 100% 的，笔者还需要继续优化~
+
+题解慢慢更新中，欢迎大家提出更好的解法。点击页面下方的 edit，会跳转到 github 对应的页面 markdown 中，可以提交你的最优解 PR。
+
+让我们在题解的太空遨游吧~
\ No newline at end of file
diff --git a/website/content/ChapterFour/pytool/GenerateIndex.py b/website/content/ChapterFour/pytool/GenerateIndex.py
index b35799b7..e4dd33f7 100644
--- a/website/content/ChapterFour/pytool/GenerateIndex.py
+++ b/website/content/ChapterFour/pytool/GenerateIndex.py
@@ -13,7 +13,7 @@ print(len(dir_names))
for file_name in dir_names:
# - [0001. Two Sum]({{< relref "/ChapterFour/withouttoc/0001. Two Sum.md" >}})
# content = '- [' + file_name[:-3] + ']' + '({{< relref "/ChapterFour/withouttoc/' + file_name + '" >}})'
- content.append('- [{}]({{{{< relref "/ChapterFour/withouttoc/{}" >}}}})'.format(file_name[:-3],file_name))
+ content.append('- [{}]({{{{< relref "/ChapterFour/{}" >}}}})'.format(file_name[:-3],file_name))
with open(indexFile, "w") as myfile:
myfile.write('\n'.join(content))
diff --git a/website/content/ChapterOne/_index.md b/website/content/ChapterOne/_index.md
index 5227df0a..a3b07a15 100644
--- a/website/content/ChapterOne/_index.md
+++ b/website/content/ChapterOne/_index.md
@@ -67,6 +67,12 @@ LeetCode 统计代码运行时长会有波动的，相同的代码提交 10 次
本书的算法全部用 Go 语言实现。
+## 使用说明
+
+- 本电子书的左上角有搜索栏，可以迅速帮你找到你想看的章节和题号。
+- 本电子书每页都接入了 Gitalk，每一页的最下方都有评论框可以评论，如果没有显示出来，请检查自己的网络。
+-
+
## 互动与勘误
如果书中文章有所遗漏，欢迎点击所在页面下边的 edit 按钮进行评论和互动，感谢您的支持与帮助。
diff --git a/website/content/ChapterThree/Segment_Tree.md b/website/content/ChapterThree/Segment_Tree.md
new file mode 100644
index 00000000..96160509
--- /dev/null
+++ b/website/content/ChapterThree/Segment_Tree.md
@@ -0,0 +1,275 @@
+---
+title: 线段树
+type: docs
+---
+
+# 线段树 Segment Tree
+
+```go
+package template
+
+// SegmentTree define
+type SegmentTree struct {
+ data, tree, lazy []int
+ left, right int
+ merge func(i, j int) int
+}
+
+// Init define
+func (st *SegmentTree) Init(nums []int, oper func(i, j int) int) {
+ st.merge = oper
+ data, tree, lazy := make([]int, len(nums)), make([]int, 4*len(nums)), make([]int, 4*len(nums))
+ for i := 0; i < len(nums); i++ {
+ data[i] = nums[i]
+ }
+ st.data, st.tree, st.lazy = data, tree, lazy
+ if len(nums) > 0 {
+ st.buildSegmentTree(0, 0, len(nums)-1)
+ }
+}
+
+// 在 treeIndex 的位置创建 [left....right] 区间的线段树
+func (st *SegmentTree) buildSegmentTree(treeIndex, left, right int) {
+ if left == right {
+ st.tree[treeIndex] = st.data[left]
+ return
+ }
+ midTreeIndex, leftTreeIndex, rightTreeIndex := left+(right-left)>>1, st.leftChild(treeIndex), st.rightChild(treeIndex)
+ st.buildSegmentTree(leftTreeIndex, left, midTreeIndex)
+ st.buildSegmentTree(rightTreeIndex, midTreeIndex+1, right)
+ st.tree[treeIndex] = st.merge(st.tree[leftTreeIndex], st.tree[rightTreeIndex])
+}
+
+func (st *SegmentTree) leftChild(index int) int {
+ return 2*index + 1
+}
+
+func (st *SegmentTree) rightChild(index int) int {
+ return 2*index + 2
+}
+
+// 查询 [left....right] 区间内的值
+
+// Query define
+func (st *SegmentTree) Query(left, right int) int {
+ if len(st.data) > 0 {
+ return st.queryInTree(0, 0, len(st.data)-1, left, right)
+ }
+ return 0
+}
+
+// 在以 treeIndex 为根的线段树中 [left...right] 的范围里，搜索区间 [queryLeft...queryRight] 的值
+func (st *SegmentTree) queryInTree(treeIndex, left, right, queryLeft, queryRight int) int {
+ if left == queryLeft && right == queryRight {
+ return st.tree[treeIndex]
+ }
+ midTreeIndex, leftTreeIndex, rightTreeIndex := left+(right-left)>>1, st.leftChild(treeIndex), st.rightChild(treeIndex)
+ if queryLeft > midTreeIndex {
+ return st.queryInTree(rightTreeIndex, midTreeIndex+1, right, queryLeft, queryRight)
+ } else if queryRight <= midTreeIndex {
+ return st.queryInTree(leftTreeIndex, left, midTreeIndex, queryLeft, queryRight)
+ }
+ return st.merge(st.queryInTree(leftTreeIndex, left, midTreeIndex, queryLeft, midTreeIndex),
+ st.queryInTree(rightTreeIndex, midTreeIndex+1, right, midTreeIndex+1, queryRight))
+}
+
+// 查询 [left....right] 区间内的值
+
+// QueryLazy define
+func (st *SegmentTree) QueryLazy(left, right int) int {
+ if len(st.data) > 0 {
+ return st.queryLazyInTree(0, 0, len(st.data)-1, left, right)
+ }
+ return 0
+}
+
+func (st *SegmentTree) queryLazyInTree(treeIndex, left, right, queryLeft, queryRight int) int {
+ midTreeIndex, leftTreeIndex, rightTreeIndex := left+(right-left)>>1, st.leftChild(treeIndex), st.rightChild(treeIndex)
+ if left > queryRight || right < queryLeft { // segment completely outside range
+ return 0 // represents a null node
+ }
+ if st.lazy[treeIndex] != 0 { // this node is lazy
+ for i := 0; i < right-left+1; i++ {
+ st.tree[treeIndex] = st.merge(st.tree[treeIndex], st.lazy[treeIndex])
+ // st.tree[treeIndex] += (right - left + 1) * st.lazy[treeIndex] // normalize current node by removing lazinesss
+ }
+ if left != right { // update lazy[] for children nodes
+ st.lazy[leftTreeIndex] = st.merge(st.lazy[leftTreeIndex], st.lazy[treeIndex])
+ st.lazy[rightTreeIndex] = st.merge(st.lazy[rightTreeIndex], st.lazy[treeIndex])
+ // st.lazy[leftTreeIndex] += st.lazy[treeIndex]
+ // st.lazy[rightTreeIndex] += st.lazy[treeIndex]
+ }
+ st.lazy[treeIndex] = 0 // current node processed. No longer lazy
+ }
+ if queryLeft <= left && queryRight >= right { // segment completely inside range
+ return st.tree[treeIndex]
+ }
+ if queryLeft > midTreeIndex {
+ return st.queryLazyInTree(rightTreeIndex, midTreeIndex+1, right, queryLeft, queryRight)
+ } else if queryRight <= midTreeIndex {
+ return st.queryLazyInTree(leftTreeIndex, left, midTreeIndex, queryLeft, queryRight)
+ }
+ // merge query results
+ return st.merge(st.queryLazyInTree(leftTreeIndex, left, midTreeIndex, queryLeft, midTreeIndex),
+ st.queryLazyInTree(rightTreeIndex, midTreeIndex+1, right, midTreeIndex+1, queryRight))
+}
+
+// 更新 index 位置的值
+
+// Update define
+func (st *SegmentTree) Update(index, val int) {
+ if len(st.data) > 0 {
+ st.updateInTree(0, 0, len(st.data)-1, index, val)
+ }
+}
+
+// 以 treeIndex 为根，更新 index 位置上的值为 val
+func (st *SegmentTree) updateInTree(treeIndex, left, right, index, val int) {
+ if left == right {
+ st.tree[treeIndex] = val
+ return
+ }
+ midTreeIndex, leftTreeIndex, rightTreeIndex := left+(right-left)>>1, st.leftChild(treeIndex), st.rightChild(treeIndex)
+ if index > midTreeIndex {
+ st.updateInTree(rightTreeIndex, midTreeIndex+1, right, index, val)
+ } else {
+ st.updateInTree(leftTreeIndex, left, midTreeIndex, index, val)
+ }
+ st.tree[treeIndex] = st.merge(st.tree[leftTreeIndex], st.tree[rightTreeIndex])
+}
+
+// 更新 [updateLeft....updateRight] 位置的值
+// 注意这里的更新值是在原来值的基础上增加或者减少，而不是把这个区间内的值都赋值为 x，区间更新和单点更新不同
+// 这里的区间更新关注的是变化，单点更新关注的是定值
+// 当然区间更新也可以都更新成定值，如果只区间更新成定值，那么 lazy 更新策略需要变化，merge 策略也需要变化，这里暂不详细讨论
+
+// UpdateLazy define
+func (st *SegmentTree) UpdateLazy(updateLeft, updateRight, val int) {
+ if len(st.data) > 0 {
+ st.updateLazyInTree(0, 0, len(st.data)-1, updateLeft, updateRight, val)
+ }
+}
+
+func (st *SegmentTree) updateLazyInTree(treeIndex, left, right, updateLeft, updateRight, val int) {
+ midTreeIndex, leftTreeIndex, rightTreeIndex := left+(right-left)>>1, st.leftChild(treeIndex), st.rightChild(treeIndex)
+ if st.lazy[treeIndex] != 0 { // this node is lazy
+ for i := 0; i < right-left+1; i++ {
+ st.tree[treeIndex] = st.merge(st.tree[treeIndex], st.lazy[treeIndex])
+ //st.tree[treeIndex] += (right - left + 1) * st.lazy[treeIndex] // normalize current node by removing laziness
+ }
+ if left != right { // update lazy[] for children nodes
+ st.lazy[leftTreeIndex] = st.merge(st.lazy[leftTreeIndex], st.lazy[treeIndex])
+ st.lazy[rightTreeIndex] = st.merge(st.lazy[rightTreeIndex], st.lazy[treeIndex])
+ // st.lazy[leftTreeIndex] += st.lazy[treeIndex]
+ // st.lazy[rightTreeIndex] += st.lazy[treeIndex]
+ }
+ st.lazy[treeIndex] = 0 // current node processed. No longer lazy
+ }
+
+ if left > right || left > updateRight || right < updateLeft {
+ return // out of range. escape.
+ }
+
+ if updateLeft <= left && right <= updateRight { // segment is fully within update range
+ for i := 0; i < right-left+1; i++ {
+ st.tree[treeIndex] = st.merge(st.tree[treeIndex], val)
+ //st.tree[treeIndex] += (right - left + 1) * val // update segment
+ }
+ if left != right { // update lazy[] for children
+ st.lazy[leftTreeIndex] = st.merge(st.lazy[leftTreeIndex], val)
+ st.lazy[rightTreeIndex] = st.merge(st.lazy[rightTreeIndex], val)
+ // st.lazy[leftTreeIndex] += val
+ // st.lazy[rightTreeIndex] += val
+ }
+ return
+ }
+ st.updateLazyInTree(leftTreeIndex, left, midTreeIndex, updateLeft, updateRight, val)
+ st.updateLazyInTree(rightTreeIndex, midTreeIndex+1, right, updateLeft, updateRight, val)
+ // merge updates
+ st.tree[treeIndex] = st.merge(st.tree[leftTreeIndex], st.tree[rightTreeIndex])
+}
+
+// SegmentCountTree define
+type SegmentCountTree struct {
+ data, tree []int
+ left, right int
+ merge func(i, j int) int
+}
+
+// Init define
+func (st *SegmentCountTree) Init(nums []int, oper func(i, j int) int) {
+ st.merge = oper
+
+ data, tree := make([]int, len(nums)), make([]int, 4*len(nums))
+ for i := 0; i < len(nums); i++ {
+ data[i] = nums[i]
+ }
+ st.data, st.tree = data, tree
+}
+
+// 在 treeIndex 的位置创建 [left....right] 区间的线段树
+func (st *SegmentCountTree) buildSegmentTree(treeIndex, left, right int) {
+ if left == right {
+ st.tree[treeIndex] = st.data[left]
+ return
+ }
+ midTreeIndex, leftTreeIndex, rightTreeIndex := left+(right-left)>>1, st.leftChild(treeIndex), st.rightChild(treeIndex)
+ st.buildSegmentTree(leftTreeIndex, left, midTreeIndex)
+ st.buildSegmentTree(rightTreeIndex, midTreeIndex+1, right)
+ st.tree[treeIndex] = st.merge(st.tree[leftTreeIndex], st.tree[rightTreeIndex])
+}
+
+func (st *SegmentCountTree) leftChild(index int) int {
+ return 2*index + 1
+}
+
+func (st *SegmentCountTree) rightChild(index int) int {
+ return 2*index + 2
+}
+
+// 查询 [left....right] 区间内的值
+
+// Query define
+func (st *SegmentCountTree) Query(left, right int) int {
+ if len(st.data) > 0 {
+ return st.queryInTree(0, 0, len(st.data)-1, left, right)
+ }
+ return 0
+}
+
+// 在以 treeIndex 为根的线段树中 [left...right] 的范围里，搜索区间 [queryLeft...queryRight] 的值，值是计数值
+func (st *SegmentCountTree) queryInTree(treeIndex, left, right, queryLeft, queryRight int) int {
+ if queryRight < st.data[left] || queryLeft > st.data[right] {
+ return 0
+ }
+ if queryLeft <= st.data[left] && queryRight >= st.data[right] || left == right {
+ return st.tree[treeIndex]
+ }
+ midTreeIndex, leftTreeIndex, rightTreeIndex := left+(right-left)>>1, st.leftChild(treeIndex), st.rightChild(treeIndex)
+ return st.queryInTree(rightTreeIndex, midTreeIndex+1, right, queryLeft, queryRight) +
+ st.queryInTree(leftTreeIndex, left, midTreeIndex, queryLeft, queryRight)
+}
+
+// 更新计数
+
+// UpdateCount define
+func (st *SegmentCountTree) UpdateCount(val int) {
+ if len(st.data) > 0 {
+ st.updateCountInTree(0, 0, len(st.data)-1, val)
+ }
+}
+
+// 以 treeIndex 为根，更新 [left...right] 区间内的计数
+func (st *SegmentCountTree) updateCountInTree(treeIndex, left, right, val int) {
+ if val >= st.data[left] && val <= st.data[right] {
+ st.tree[treeIndex]++
+ if left == right {
+ return
+ }
+ midTreeIndex, leftTreeIndex, rightTreeIndex := left+(right-left)>>1, st.leftChild(treeIndex), st.rightChild(treeIndex)
+ st.updateCountInTree(rightTreeIndex, midTreeIndex+1, right, val)
+ st.updateCountInTree(leftTreeIndex, left, midTreeIndex, val)
+ }
+}
+
+```
\ No newline at end of file
diff --git a/website/content/ChapterThree/UnionFind.md b/website/content/ChapterThree/UnionFind.md
new file mode 100644
index 00000000..e4910131
--- /dev/null
+++ b/website/content/ChapterThree/UnionFind.md
@@ -0,0 +1,144 @@
+---
+title: 并查集
+type: docs
+---
+
+# 并查集 UnionFind
+
+```go
+package template
+
+// UnionFind defind
+// 路径压缩 + 秩优化
+type UnionFind struct {
+ parent, rank []int
+ count int
+}
+
+// Init define
+func (uf *UnionFind) Init(n int) {
+ uf.count = n
+ uf.parent = make([]int, n)
+ uf.rank = make([]int, n)
+ for i := range uf.parent {
+ uf.parent[i] = i
+ }
+}
+
+// Find define
+func (uf *UnionFind) Find(p int) int {
+ root := p
+ for root != uf.parent[root] {
+ root = uf.parent[root]
+ }
+ // compress path
+ for p != uf.parent[p] {
+ tmp := uf.parent[p]
+ uf.parent[p] = root
+ p = tmp
+ }
+ return root
+}
+
+// Union define
+func (uf *UnionFind) Union(p, q int) {
+ proot := uf.Find(p)
+ qroot := uf.Find(q)
+ if proot == qroot {
+ return
+ }
+ if uf.rank[qroot] > uf.rank[proot] {
+ uf.parent[proot] = qroot
+ } else {
+ uf.parent[qroot] = proot
+ if uf.rank[proot] == uf.rank[qroot] {
+ uf.rank[proot]++
+ }
+ }
+ uf.count--
+}
+
+// TotalCount define
+func (uf *UnionFind) TotalCount() int {
+ return uf.count
+}
+
+// UnionFindCount define
+// 计算每个集合中元素的个数 + 最大集合元素个数
+type UnionFindCount struct {
+ parent, count []int
+ maxUnionCount int
+}
+
+// Init define
+func (uf *UnionFindCount) Init(n int) {
+ uf.parent = make([]int, n)
+ uf.count = make([]int, n)
+ for i := range uf.parent {
+ uf.parent[i] = i
+ uf.count[i] = 1
+ }
+}
+
+// Find define
+func (uf *UnionFindCount) Find(p int) int {
+ root := p
+ for root != uf.parent[root] {
+ root = uf.parent[root]
+ }
+ return root
+}
+
+// 不进行秩压缩，时间复杂度爆炸，太高了
+// func (uf *UnionFindCount) union(p, q int) {
+// proot := uf.find(p)
+// qroot := uf.find(q)
+// if proot == qroot {
+// return
+// }
+// if proot != qroot {
+// uf.parent[proot] = qroot
+// uf.count[qroot] += uf.count[proot]
+// }
+// }
+
+// Union define
+func (uf *UnionFindCount) Union(p, q int) {
+ proot := uf.Find(p)
+ qroot := uf.Find(q)
+ if proot == qroot {
+ return
+ }
+ if proot == len(uf.parent)-1 {
+ //proot is root
+ } else if qroot == len(uf.parent)-1 {
+ // qroot is root, always attach to root
+ proot, qroot = qroot, proot
+ } else if uf.count[qroot] > uf.count[proot] {
+ proot, qroot = qroot, proot
+ }
+
+ //set relation[0] as parent
+ uf.maxUnionCount = max(uf.maxUnionCount, (uf.count[proot] + uf.count[qroot]))
+ uf.parent[qroot] = proot
+ uf.count[proot] += uf.count[qroot]
+}
+
+// Count define
+func (uf *UnionFindCount) Count() []int {
+ return uf.count
+}
+
+// MaxUnionCount define
+func (uf *UnionFindCount) MaxUnionCount() int {
+ return uf.maxUnionCount
+}
+
+func max(a int, b int) int {
+ if a > b {
+ return a
+ }
+ return b
+}
+
+```
\ No newline at end of file
diff --git a/website/content/ChapterThree/_index.md b/website/content/ChapterThree/_index.md
new file mode 100644
index 00000000..30eec94a
--- /dev/null
+++ b/website/content/ChapterThree/_index.md
@@ -0,0 +1,13 @@
+---
+title: 第三章
+type: docs
+---
+
+# 第三章 一些模板
+
+
+
+
+
+
+这一章会罗列一些整理好的模板。一起来看看吧。
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Array.md b/website/content/ChapterTwo/Array.md
new file mode 100644
index 00000000..da5c58b5
--- /dev/null
+++ b/website/content/ChapterTwo/Array.md
@@ -0,0 +1,62 @@
+---
+title: Array
+type: docs
+---
+
+## Array
+
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
+|1. Two Sum| [Go]({{< relref "/ChapterFour/0001.Two-Sum.md" >}})| Easy | O(n)| O(n)||
+|11. Container With Most Water| [Go]({{< relref "/ChapterFour/0011.Container-With-Most-Water.md" >}})| Medium | O(n)| O(1)||
+|15. 3Sum | [Go]({{< relref "/ChapterFour/0015.3Sum.md" >}})| Medium | O(n^2)| O(n)|❤️|
+|16. 3Sum Closest | [Go]({{< relref "/ChapterFour/0016.3Sum-Closest.md" >}})| Medium | O(n^2)| O(1)|❤️|
+|18. 4Sum | [Go]({{< relref "/ChapterFour/0018.4Sum.md" >}})| Medium | O(n^3)| O(n^2)|❤️|
+|26. Remove Duplicates from Sorted Array | [Go]({{< relref "/ChapterFour/0026.Remove-Duplicates-from-Sorted-Array.md" >}})| Easy | O(n)| O(1)||
+|27. Remove Element | [Go]({{< relref "/ChapterFour/0027.Remove-Element.md" >}})| Easy | O(n)| O(1)||
+|39. Combination Sum | [Go]({{< relref "/ChapterFour/0039.Combination-Sum.md" >}})| Medium | O(n log n)| O(n)||
+|40. Combination Sum II | [Go]({{< relref "/ChapterFour/0040.Combination-Sum-II.md" >}})| Medium | O(n log n)| O(n)||
+|41. First Missing Positive | [Go]({{< relref "/ChapterFour/0041.First-Missing-Positive.md" >}})| Hard | O(n)| O(n)||
+|42. Trapping Rain Water | [Go]({{< relref "/ChapterFour/0042.Trapping-Rain-Water.md" >}})| Hard | O(n)| O(1)|❤️|
+|48. Rotate Image | [Go]({{< relref "/ChapterFour/0048.Rotate-Image.md" >}})| Medium | O(n)| O(1)||
+|53. Maximum Subarray| [Go]({{< relref "/ChapterFour/0053.Maximum-Subarray.md" >}})| Easy | O(n)| O(n)||
+|54. Spiral Matrix| [Go]({{< relref "/ChapterFour/0054.Spiral-Matrix.md" >}})| Medium | O(n)| O(n^2)||
+|56. Merge Intervals | [Go]({{< relref "/ChapterFour/0056.Merge-Intervals.md" >}})| Medium | O(n log n)| O(1)||
+|57. Insert Interval | [Go]({{< relref "/ChapterFour/0057.Insert-Interval.md" >}})| Hard | O(n)| O(1)||
+|59. Spiral Matrix II | [Go]({{< relref "/ChapterFour/0059.Spiral-Matrix-II.md" >}})| Medium | O(n)| O(n^2)||
+|62. Unique Paths | [Go]({{< relref "/ChapterFour/0062.Unique-Paths.md" >}})| Medium | O(n^2)| O(n^2)||
+|63. Unique Paths II | [Go]({{< relref "/ChapterFour/0063.Unique-Paths-II.md" >}})| Medium | O(n^2)| O(n^2)||
+|64. Minimum Path Sum | [Go]({{< relref "/ChapterFour/0064.Minimum-Path-Sum.md" >}})| Medium | O(n^2)| O(n^2)||
+|75. Sort Colors | [Go]({{< relref "/ChapterFour/0075.Sort-Colors.md" >}})| Medium| O(n)| O(1)|❤️|
+|78. Subsets| [Go]({{< relref "/ChapterFour/0078.Subsets.md" >}})| Medium | O(n^2)| O(n)|❤️|
+|79. Word Search | [Go]({{< relref "/ChapterFour/0079.Word-Search.md" >}})| Medium | O(n^2)| O(n^2)|❤️|
+|80. Remove Duplicates from Sorted Array II| [Go]({{< relref "/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md" >}})| Medium | O(n)| O(1||
+|84. Largest Rectangle in Histogram | [Go]({{< relref "/ChapterFour/0084.Largest-Rectangle-in-Histogram.md" >}})| Medium | O(n)| O(n)|❤️|
+|88. Merge Sorted Array | [Go]({{< relref "/ChapterFour/0088.Merge-Sorted-Array.md" >}})| Easy | O(n)| O(1)|❤️|
+|90. Subsets II | [Go]({{< relref "/ChapterFour/0090.Subsets-II.md" >}})| Medium | O(n^2)| O(n)|❤️|
+|120. Triangle | [Go]({{< relref "/ChapterFour/0120.Triangle.md" >}})| Medium | O(n^2)| O(n)||
+|121. Best Time to Buy and Sell Stock | [Go]({{< relref "/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})| Easy | O(n)| O(1)||
+|122. Best Time to Buy and Sell Stock II | [Go]({{< relref "/ChapterFour/0122.Best-Time-to-Buy-and-Sell-Stock-II.md" >}})| Easy | O(n)| O(1)||
+|126. Word Ladder II | [Go]({{< relref "/ChapterFour/0126.Word-Ladder-II.md" >}})| Hard | O(n)| O(n^2)|❤️|
+|152. Maximum Product Subarray | [Go]({{< relref "/ChapterFour/0152.Maximum-Product-Subarray.md" >}})| Medium | O(n)| O(1)||
+|167. Two Sum II - Input array is sorted | [Go]({{< relref "/ChapterFour/0167.Two-Sum-II---Input-array-is-sorted.md" >}})| Easy | O(n)| O(1)||
+|209. Minimum Size Subarray Sum | [Go]({{< relref "/ChapterFour/0209.Minimum-Size-Subarray-Sum.md" >}})| Medium | O(n)| O(1)||
+|216. Combination Sum III | [Go]({{< relref "/ChapterFour/0216.Combination-Sum-III.md" >}})| Medium | O(n)| O(1)|❤️|
+|217. Contains Duplicate | [Go]({{< relref "/ChapterFour/0217.Contains-Duplicate.md" >}})| Easy | O(n)| O(n)||
+|219. Contains Duplicate II | [Go]({{< relref "/ChapterFour/0219.Contains-Duplicate-II.md" >}})| Easy | O(n)| O(n)||
+|283. Move Zeroes | [Go]({{< relref "/ChapterFour/0283.Move-Zeroes.md" >}})| Easy | O(n)| O(1)||
+|287. Find the Duplicate Number | [Go]({{< relref "/ChapterFour/0287.Find-the-Duplicate-Number.md" >}})| Easy | O(n)| O(1)|❤️|
+|532. K-diff Pairs in an Array | [Go]({{< relref "/ChapterFour/0532.K-diff-Pairs-in-an-Array.md" >}})| Easy | O(n)| O(n)||
+|566. Reshape the Matrix | [Go]({{< relref "/ChapterFour/0566.Reshape-the-Matrix.md" >}})| Easy | O(n^2)| O(n^2)||
+|628. Maximum Product of Three Numbers | [Go]({{< relref "/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md" >}})| Easy | O(n)| O(1)||
+|713. Subarray Product Less Than K | [Go]({{< relref "/ChapterFour/0713.Subarray-Product-Less-Than-K.md" >}})| Medium | O(n)| O(1)||
+|714. Best Time to Buy and Sell Stock with Transaction Fee| [Go]({{< relref "/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})| Medium | O(n)| O(1)||
+|746. Min Cost Climbing Stairs | [Go]({{< relref "/ChapterFour/0746.Min-Cost-Climbing-Stairs.md" >}})| Easy | O(n)| O(1)||
+|766. Toeplitz Matrix | [Go]({{< relref "/ChapterFour/0766.Toeplitz-Matrix.md" >}})| Easy | O(n)| O(1)||
+|867. Transpose Matrix | [Go]({{< relref "/ChapterFour/0867.Transpose-Matrix.md" >}})| Easy | O(n)| O(1)||
+|891. Sum of Subsequence Widths | [Go]({{< relref "/ChapterFour/0891.Sum-of-Subsequence-Widths.md" >}})| Hard | O(n log n)| O(1)||
+|907. Sum of Subarray Minimums | [Go]({{< relref "/ChapterFour/0907.Sum-of-Subarray-Minimums.md" >}})| Medium | O(n)| O(n)|❤️|
+|922. Sort Array By Parity II | [Go]({{< relref "/ChapterFour/0922.Sort-Array-By-Parity-II.md" >}})| Medium | O(n)| O(1)||
+|969. Pancake Sorting | [Go]({{< relref "/ChapterFour/0969.Pancake-Sorting.md" >}})| Medium | O(n)| O(1)|❤️|
+|977. Squares of a Sorted Array | [Go]({{< relref "/ChapterFour/0977.Squares-of-a-Sorted-Array.md" >}})| Easy | O(n)| O(1)||
+|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Backtracking.md b/website/content/ChapterTwo/Backtracking.md
new file mode 100644
index 00000000..74f112a0
--- /dev/null
+++ b/website/content/ChapterTwo/Backtracking.md
@@ -0,0 +1,132 @@
+---
+title: Backtracking
+type: docs
+---
+
+# Backtracking
+
+
+
+- 排列问题 Permutations。第 46 题，第 47 题。第 60 题，第 526 题，第 996 题。
+- 组合问题 Combination。第 39 题，第 40 题，第 77 题，第 216 题。
+- 排列和组合杂交问题。第 1079 题。
+- N 皇后终极解法(二进制解法)。第 51 题，第 52 题。
+- 数独问题。第 37 题。
+- 四个方向搜索。第 79 题，第 212 题，第 980 题。
+- 子集合问题。第 78 题，第 90 题。
+- Trie。第 208 题，第 211 题。
+- BFS 优化。第 126 题，第 127 题。
+- DFS 模板。(只是一个例子，不对应任何题)
+
+```go
+func combinationSum2(candidates []int, target int) [][]int {
+ if len(candidates) == 0 {
+ return [][]int{}
+ }
+ c, res := []int{}, [][]int{}
+ sort.Ints(candidates)
+ findcombinationSum2(candidates, target, 0, c, &res)
+ return res
+}
+
+func findcombinationSum2(nums []int, target, index int, c []int, res *[][]int) {
+ if target == 0 {
+ b := make([]int, len(c))
+ copy(b, c)
+ *res = append(*res, b)
+ return
+ }
+ for i := index; i < len(nums); i++ {
+ if i > index && nums[i] == nums[i-1] { // 这里是去重的关键逻辑
+ continue
+ }
+ if target >= nums[i] {
+ c = append(c, nums[i])
+ findcombinationSum2(nums, target-nums[i], i+1, c, res)
+ c = c[:len(c)-1]
+ }
+ }
+}
+```
+- BFS 模板。(只是一个例子，不对应任何题)
+
+```go
+func updateMatrix_BFS(matrix [][]int) [][]int {
+ res := make([][]int, len(matrix))
+ if len(matrix) == 0 || len(matrix[0]) == 0 {
+ return res
+ }
+ queue := make([][]int, 0)
+ for i, _ := range matrix {
+ res[i] = make([]int, len(matrix[0]))
+ for j, _ := range res[i] {
+ if matrix[i][j] == 0 {
+ res[i][j] = -1
+ queue = append(queue, []int{i, j})
+ }
+ }
+ }
+ level := 1
+ for len(queue) > 0 {
+ size := len(queue)
+ for size > 0 {
+ size -= 1
+ node := queue[0]
+ queue = queue[1:]
+ i, j := node[0], node[1]
+ for _, direction := range [][]int{{-1, 0}, {1, 0}, {0, 1}, {0, -1}} {
+ x := i + direction[0]
+ y := j + direction[1]
+ if x < 0 || x >= len(matrix) || y < 0 || y >= len(matrix[0]) || res[x][y] < 0 || res[x][y] > 0 {
+ continue
+ }
+ res[x][y] = level
+ queue = append(queue, []int{x, y})
+ }
+ }
+ level++
+ }
+ for i, row := range res {
+ for j, cell := range row {
+ if cell == -1 {
+ res[i][j] = 0
+ }
+ }
+ }
+ return res
+}
+```
+
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
+|17. Letter Combinations of a Phone Number | [Go]({{< relref "/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md" >}})| Medium | O(log n)| O(1)||
+|22. Generate Parentheses| [Go]({{< relref "/ChapterFour/0022.Generate-Parentheses.md" >}})| Medium | O(log n)| O(1)||
+|37. Sudoku Solver | [Go]({{< relref "/ChapterFour/0037.Sudoku-Solver.md" >}})| Hard | O(n^2)| O(n^2)|❤️|
+|39. Combination Sum | [Go]({{< relref "/ChapterFour/0039.Combination-Sum.md" >}})| Medium | O(n log n)| O(n)||
+|40. Combination Sum II | [Go]({{< relref "/ChapterFour/0040.Combination-Sum-II.md" >}})| Medium | O(n log n)| O(n)||
+|46. Permutations | [Go]({{< relref "/ChapterFour/0046.Permutations.md" >}})| Medium | O(n)| O(n)|❤️|
+|47. Permutations II | [Go]({{< relref "/ChapterFour/0047.Permutations-II.md" >}})| Medium | O(n^2)| O(n)|❤️|
+|51. N-Queens | [Go]({{< relref "/ChapterFour/0051.N-Queens.md" >}})| Hard | O(n^2)| O(n)|❤️|
+|52. N-Queens II | [Go]({{< relref "/ChapterFour/0052.N-Queens-II.md" >}})| Hard | O(n^2)| O(n)|❤️|
+|60. Permutation Sequence | [Go]({{< relref "/ChapterFour/0060.Permutation-Sequence.md" >}})| Medium | O(n log n)| O(1)||
+|77. Combinations | [Go]({{< relref "/ChapterFour/0077.Combinations.md" >}})| Medium | O(n)| O(n)|❤️|
+|78. Subsets | [Go]({{< relref "/ChapterFour/0078.Subsets.md" >}})| Medium | O(n^2)| O(n)|❤️|
+|79. Word Search | [Go]({{< relref "/ChapterFour/0079.Word-Search.md" >}})| Medium | O(n^2)| O(n^2)|❤️|
+|89. Gray Codes | [Go]({{< relref "/ChapterFour/0089.Gray-Code.md" >}})| Medium | O(n)| O(1)||
+|90. Subsets II | [Go]({{< relref "/ChapterFour/0090.Subsets-II.md" >}})| Medium | O(n^2)| O(n)|❤️|
+|93. Restore IP Addresses | [Go]({{< relref "/ChapterFour/0093.Restore-IP-Addresses.md" >}})| Medium | O(n)| O(n)|❤️|
+|126. Word Ladder II | [Go]({{< relref "/ChapterFour/0126.Word-Ladder-II.md" >}})| Hard | O(n)| O(n^2)|❤️|
+|131. Palindrome Partitioning | [Go]({{< relref "/ChapterFour/0131.Palindrome-Partitioning.md" >}})| Medium | O(n)| O(n^2)|❤️|
+|211. Add and Search Word - Data structure design | [Go]({{< relref "/ChapterFour/0211.Add-and-Search-Word---Data-structure-design.md" >}})| Medium | O(n)| O(n)|❤️|
+|212. Word Search II | [Go]({{< relref "/ChapterFour/0212.Word-Search-II.md" >}})| Hard | O(n^2)| O(n^2)|❤️|
+|216. Combination Sum III | [Go]({{< relref "/ChapterFour/0216.Combination-Sum-III.md" >}})| Medium | O(n)| O(1)|❤️|
+|306. Additive Number | [Go]({{< relref "/ChapterFour/0306.Additive-Number.md" >}})| Medium | O(n^2)| O(1)|❤️|
+|357. Count Numbers with Unique Digits | [Go]({{< relref "/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md" >}})| Medium | O(1)| O(1)||
+|401. Binary Watch | [Go]({{< relref "/ChapterFour/0401.Binary-Watch.md" >}})| Easy | O(1)| O(1)||
+|526. Beautiful Arrangement | [Go]({{< relref "/ChapterFour/0526.Beautiful-Arrangement.md" >}})| Medium | O(n^2)| O(1)|❤️|
+|784. Letter Case Permutation | [Go]({{< relref "/ChapterFour/0784.Letter-Case-Permutation.md" >}})| Easy | O(n)| O(n)||
+|842. Split Array into Fibonacci Sequence | [Go]({{< relref "/ChapterFour/0842.Split-Array-into-Fibonacci-Sequence.md" >}})| Medium | O(n^2)| O(1)|❤️|
+|980. Unique Paths III | [Go]({{< relref "/ChapterFour/0980.Unique-Paths-III.md" >}})| Hard | O(n log n)| O(n)||
+|996. Number of Squareful Arrays | [Go]({{< relref "/ChapterFour/0996.Number-of-Squareful-Arrays.md" >}})| Hard | O(n log n)| O(n) ||
+|1079. Letter Tile Possibilities | [Go]({{< relref "/ChapterFour/1079.Letter-Tile-Possibilities.md" >}})| Medium | O(n^2)| O(1)|❤️|
+|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Binary_Indexed_Tree.md b/website/content/ChapterTwo/Binary_Indexed_Tree.md
new file mode 100644
index 00000000..7fbc2dfc
--- /dev/null
+++ b/website/content/ChapterTwo/Binary_Indexed_Tree.md
@@ -0,0 +1,8 @@
+---
+title: Binary Indexed Tree
+type: docs
+---
+
+# Binary Indexed Tree
+
+
diff --git a/website/content/ChapterTwo/Binary_Search.md b/website/content/ChapterTwo/Binary_Search.md
new file mode 100644
index 00000000..2c71c30d
--- /dev/null
+++ b/website/content/ChapterTwo/Binary_Search.md
@@ -0,0 +1,145 @@
+---
+title: Binary Search
+type: docs
+---
+
+# Binary Search
+
+- 二分搜索的经典写法。需要注意的三点：
+ 1. 循环退出条件，注意是 low <= high，而不是 low < high。
+ 2. mid 的取值，mid := low + (high-low)>>1
+ 3. low 和 high 的更新。low = mid + 1，high = mid - 1。
+
+```go
+func binarySearchMatrix(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + (high-low)>>1
+ if nums[mid] == target {
+ return mid
+ } else if nums[mid] > target {
+ high = mid - 1
+ } else {
+ low = mid + 1
+ }
+ }
+ return -1
+}
+```
+
+- 二分搜索的变种写法。有 4 个基本变种:
+ 1. 查找第一个与 target 相等的元素，时间复杂度 O(logn)
+ 2. 查找最后一个与 target 相等的元素，时间复杂度 O(logn)
+ 3. 查找第一个大于等于 target 的元素，时间复杂度 O(logn)
+ 4. 查找最后一个小于等于 target 的元素，时间复杂度 O(logn)
+
+```go
+// 二分查找第一个与 target 相等的元素，时间复杂度 O(logn)
+func searchFirstEqualElement(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + ((high - low) >> 1)
+ if nums[mid] > target {
+ high = mid - 1
+ } else if nums[mid] < target {
+ low = mid + 1
+ } else {
+ if (mid == 0) || (nums[mid-1] != target) { // 找到第一个与 target 相等的元素
+ return mid
+ }
+ high = mid - 1
+ }
+ }
+ return -1
+}
+
+// 二分查找最后一个与 target 相等的元素，时间复杂度 O(logn)
+func searchLastEqualElement(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + ((high - low) >> 1)
+ if nums[mid] > target {
+ high = mid - 1
+ } else if nums[mid] < target {
+ low = mid + 1
+ } else {
+ if (mid == len(nums)-1) || (nums[mid+1] != target) { // 找到最后一个与 target 相等的元素
+ return mid
+ }
+ low = mid + 1
+ }
+ }
+ return -1
+}
+
+// 二分查找第一个大于等于 target 的元素，时间复杂度 O(logn)
+func searchFirstGreaterElement(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + ((high - low) >> 1)
+ if nums[mid] >= target {
+ if (mid == 0) || (nums[mid-1] < target) { // 找到第一个大于等于 target 的元素
+ return mid
+ }
+ high = mid - 1
+ } else {
+ low = mid + 1
+ }
+ }
+ return -1
+}
+
+// 二分查找最后一个小于等于 target 的元素，时间复杂度 O(logn)
+func searchLastLessElement(nums []int, target int) int {
+ low, high := 0, len(nums)-1
+ for low <= high {
+ mid := low + ((high - low) >> 1)
+ if nums[mid] <= target {
+ if (mid == len(nums)-1) || (nums[mid+1] > target) { // 找到最后一个小于等于 target 的元素
+ return mid
+ }
+ low = mid + 1
+ } else {
+ high = mid - 1
+ }
+ }
+ return -1
+}
+```
+
+- 在基本有序的数组中用二分搜索。经典解法可以解，变种写法也可以写，常见的题型，在山峰数组中找山峰，在旋转有序数组中找分界点。第 33 题，第 81 题，第 153 题，第 154 题，第 162 题，第 852 题
+
+```go
+func peakIndexInMountainArray(A []int) int {
+ low, high := 0, len(A)-1
+ for low < high {
+ mid := low + (high-low)>>1
+ // 如果 mid 较大，则左侧存在峰值，high = m，如果 mid + 1 较大，则右侧存在峰值，low = mid + 1
+ if A[mid] > A[mid+1] {
+ high = mid
+ } else {
+ low = mid + 1
+ }
+ }
+ return low
+}
+```
+
+- max-min 最大值最小化问题。求在最小满足条件的情况下的最大值。第 410 题，第 875 题，第 1011 题，第 1283 题。
+
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
+|50. Pow(x, n) | [Go]({{< relref "/ChapterFour/0050.Powx-n.md" >}})| Medium | O(log n)| O(1)||
+|69. Sqrt(x) | [Go]({{< relref "/ChapterFour/0069.Sqrtx.md" >}})| Easy | O(log n)| O(1)||
+|167. Two Sum II - Input array is sorted | [Go]({{< relref "/ChapterFour/0167.Two-Sum-II---Input-array-is-sorted.md" >}})| Easy | O(n)| O(1)||
+|209. Minimum Size Subarray Sum | [Go]({{< relref "/ChapterFour/0209.Minimum-Size-Subarray-Sum.md" >}})| Medium | O(n)| O(1)||
+|222. Count Complete Tree Nodes | [Go]({{< relref "/ChapterFour/0222.Count-Complete-Tree-Nodes.md" >}})| Medium | O(n)| O(1)||
+|230. Kth Smallest Element in a BST | [Go]({{< relref "/ChapterFour/0230.Kth-Smallest-Element-in-a-BST.md" >}})| Medium | O(n)| O(1)||
+|287. Find the Duplicate Number | [Go]({{< relref "/ChapterFour/0287.Find-the-Duplicate-Number.md" >}})| Easy | O(n)| O(1)|❤️|
+|300. Longest Increasing Subsequence | [Go]({{< relref "/ChapterFour/0300.Longest-Increasing-Subsequence.md" >}})| Medium | O(n log n)| O(n)||
+|349. Intersection of Two Arrays | [Go]({{< relref "/ChapterFour/0349.Intersection-of-Two-Arrays.md" >}})| Easy | O(n)| O(n) ||
+|350. Intersection of Two Arrays II | [Go]({{< relref "/ChapterFour/0350.Intersection-of-Two-Arrays-II.md" >}})| Easy | O(n)| O(n) ||
+|392. Is Subsequence | [Go]({{< relref "/ChapterFour/0392.Is-Subsequence.md" >}})| Medium | O(n)| O(1)||
+|454. 4Sum II | [Go]({{< relref "/ChapterFour/0454.4Sum-II.md" >}})| Medium | O(n^2)| O(n) ||
+|710. Random Pick with Blacklist | [Go]({{< relref "/ChapterFour/0710.Random-Pick-with-Blacklist.md" >}})| Hard | O(n)| O(n) ||
+|-----------------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Bit_Manipulation.md b/website/content/ChapterTwo/Bit_Manipulation.md
new file mode 100644
index 00000000..4dbc8705
--- /dev/null
+++ b/website/content/ChapterTwo/Bit_Manipulation.md
@@ -0,0 +1,74 @@
+---
+title: Bit Manipulation
+type: docs
+---
+
+# Bit Manipulation
+
+
+
+- 异或的特性。第 136 题，第 268 题，第 389 题，第 421 题，
+
+```go
+x ^ 0 = x
+x ^ 11111……1111 = ~x
+x ^ (~x) = 11111……1111
+x ^ x = 0
+a ^ b = c => a ^ c = b => b ^ c = a (交换律)
+a ^ b ^ c = a ^ (b ^ c) = (a ^ b）^ c (结合律)
+```
+
+- 构造特殊 Mask，将特殊位置放 0 或 1。
+
+```go
+将 x 最右边的 n 位清零， x & ( ~0 << n )
+获取 x 的第 n 位值(0 或者 1)，(x >> n) & 1
+获取 x 的第 n 位的幂值，x & (1 << (n - 1))
+仅将第 n 位置为 1，x | (1 << n)
+仅将第 n 位置为 0，x & (~(1 << n))
+将 x 最高位至第 n 位(含)清零，x & ((1 << n) - 1)
+将第 n 位至第 0 位(含)清零，x & (~((1 << (n + 1)) - 1)）
+```
+
+- 有特殊意义的 & 位操作运算。第 260 题，第 201 题，第 318 题，第 371 题，第 397 题，第 461 题，第 693 题，
+
+```go
+X & 1 == 1 判断是否是奇数(偶数)
+X & = (X - 1) 将最低位(LSB)的 1 清零
+X & -X 得到最低位(LSB)的 1
+X & ~X = 0
+```
+
+
+| Title | Solution | Difficulty | Time | Space | 收藏 |
+| ----- | :--------: | :----------: | :----: | :-----: |:-----: |
+|78. Subsets | [Go]({{< relref "/ChapterFour/0078.Subsets.md" >}})| Medium | O(n^2)| O(n)|❤️|
+|136. Single Number | [Go]({{< relref "/ChapterFour/0136.Single-Number.md" >}})| Easy | O(n)| O(1)||
+|137. Single Number II | [Go]({{< relref "/ChapterFour/0137.Single-Number-II.md" >}})| Medium | O(n)| O(1)|❤️|
+|169. Majority Element | [Go]({{< relref "/ChapterFour/0169.Majority-Element.md" >}})| Easy | O(n)| O(1)|❤️|
+|187. Repeated DNA Sequences | [Go]({{< relref "/ChapterFour/0187.Repeated-DNA-Sequences.md" >}})| Medium | O(n)| O(1)||
+|190. Reverse Bits | [Go]({{< relref "/ChapterFour/0190.Reverse-Bits.md" >}})| Easy | O(n)| O(1)|❤️|
+|191. Number of 1 Bits | [Go]({{< relref "/ChapterFour/0191.Number-of-1-Bits.md" >}})| Easy | O(n)| O(1)||
+|201. Bitwise AND of Numbers Range | [Go]({{< relref "/ChapterFour/0201.Bitwise-AND-of-Numbers-Range.md" >}})| Medium | O(n)| O(1)|❤️|
+|231. Power of Two | [Go]({{< relref "/ChapterFour/0231.Power-of-Two.md" >}})| Easy | O(1)| O(1)||
+|260. Single Number III | [Go]({{< relref "/ChapterFour/0260.Single-Number-III.md" >}})| Medium | O(n)| O(1)|❤️|
+|268. Missing Number | [Go]({{< relref "/ChapterFour/0268.Missing-Number.md" >}})| Easy | O(n)| O(1)||
+|318. Maximum Product of Word Lengths | [Go]({{< relref "/ChapterFour/0318.Maximum-Product-of-Word-Lengths.md" >}})| Medium | O(n)| O(1)||
+|338. Counting Bits | [Go]({{< relref "/ChapterFour/0338.Counting-Bits.md" >}})| Medium | O(n)| O(n)||
+|342. Power of Four | [Go]({{< relref "/ChapterFour/0342.Power-of-Four.md" >}})| Easy | O(n)| O(1)||
+|371. Sum of Two Integers | [Go]({{< relref "/ChapterFour/0371.Sum-of-Two-Integers.md" >}})| Easy | O(n)| O(1)||
+|389. Find the Difference | [Go]({{< relref "/ChapterFour/0389.Find-the-Difference.md" >}})| Easy | O(n)| O(1)||
+|393. UTF-8 Validation | [Go]({{< relref "/ChapterFour/0393.UTF-8-Validation.md" >}})| Medium | O(n)| O(1)||
+|397. Integer Replacement | [Go]({{< relref "/ChapterFour/0397.Integer-Replacement.md" >}})| Medium | O(n)| O(1)||
+|401. Binary Watch | [Go]({{< relref "/ChapterFour/0401.Binary-Watch.md" >}})| Easy | O(1)| O(1)||
+|405. Convert a Number to Hexadecimal | [Go]({{< relref "/ChapterFour/0405.Convert-a-Number-to-Hexadecimal.md" >}})| Easy | O(n)| O(1)||
+|421. Maximum XOR of Two Numbers in an Array | [Go]({{< relref "/ChapterFour/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})| Medium | O(n)| O(1)|❤️|
+|461. Hamming Distance | [Go]({{< relref "/ChapterFour/0461.Hamming-Distance.md" >}})| Easy | O(n)| O(1)||
+|476. Number Complement | [Go]({{< relref "/ChapterFour/0476.Number-Complement.md" >}})| Easy | O(n)| O(1)||
+|477. Total Hamming Distance | [Go]({{< relref "/ChapterFour/0477.Total-Hamming-Distance.md" >}})| Medium | O(n)| O(1)||
+|693. Binary Number with Alternating Bits | [Go]({{< relref "/ChapterFour/0693.Binary-Number-with-Alternating-Bits.md" >}})| Easy | O(n)| O(1)|❤️|
+|756. Pyramid Transition Matrix | [Go]({{< relref "/ChapterFour/0756.Pyramid-Transition-Matrix.md" >}})| Medium | O(n log n)| O(n)||
+|762. Prime Number of Set Bits in Binary Representation | [Go]({{< relref "/ChapterFour/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md" >}})| Easy | O(n)| O(1)||
+|784. Letter Case Permutation | [Go]({{< relref "/ChapterFour/0784.Letter-Case-Permutation.md" >}})| Easy | O(n)| O(1)||
+|898. Bitwise ORs of Subarrays | [Go]({{< relref "/ChapterFour/0898.Bitwise-ORs-of-Subarrays.md" >}})| Medium | O(n)| O(1)||
+|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Breadth_First_Search.md b/website/content/ChapterTwo/Breadth_First_Search.md
new file mode 100644
index 00000000..f5ff7c73
--- /dev/null
+++ b/website/content/ChapterTwo/Breadth_First_Search.md
@@ -0,0 +1,24 @@
+---
+title: Breadth First Search
+type: docs
+---
+
+# Breadth First Search
+
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
+|101. Symmetric Tree | [Go]({{< relref "/ChapterFour/0101.Symmetric-Tree.md" >}})| Easy | O(n)| O(1)||
+|102. Binary Tree Level Order Traversal | [Go]({{< relref "/ChapterFour/0102.Binary-Tree-Level-Order-Traversal.md" >}})| Medium | O(n)| O(1)||
+|103. Binary Tree Zigzag Level Order Traversal | [Go]({{< relref "/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}})| Medium | O(n)| O(n)||
+|107. Binary Tree Level Order Traversal II | [Go]({{< relref "/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.md" >}})| Easy | O(n)| O(1)||
+|111. Minimum Depth of Binary Tree | [Go]({{< relref "/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md" >}})| Easy | O(n)| O(1)||
+|126. Word Ladder II | [Go]({{< relref "/ChapterFour/0126.Word-Ladder-II.md" >}})| Hard | O(n)| O(n^2)|❤️|
+|127. Word Ladder | [Go]({{< relref "/ChapterFour/0127.Word-Ladder.md" >}})| Medium | O(n)| O(n)||
+|199. Binary Tree Right Side View | [Go]({{< relref "/ChapterFour/0199.Binary-Tree-Right-Side-View.md" >}})| Medium | O(n)| O(1)||
+|200. Number of Islands | [Go]({{< relref "/ChapterFour/0200.Number-of-Islands.md" >}})| Medium | O(n^2)| O(n^2)||
+|207. Course Schedule | [Go]({{< relref "/ChapterFour/0207.Course-Schedule.md" >}})| Medium | O(n^2)| O(n^2)||
+|210. Course Schedule II | [Go]({{< relref "/ChapterFour/0210.Course-Schedule-II.md" >}})| Medium | O(n^2)| O(n^2)||
+|515. Find Largest Value in Each Tree Row | [Go]({{< relref "/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}})| Medium | O(n)| O(n)||
+|542. 01 Matrix | [Go]({{< relref "/ChapterFour/0542.01-Matrix.md" >}})| Medium | O(n)| O(1)||
+|993. Cousins in Binary Tree | [Go]({{< relref "/ChapterFour/0993.Cousins-in-Binary-Tree.md" >}})| Easy | O(n)| O(1)||
+|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Depth_First_Search.md b/website/content/ChapterTwo/Depth_First_Search.md
new file mode 100644
index 00000000..41d8ac37
--- /dev/null
+++ b/website/content/ChapterTwo/Depth_First_Search.md
@@ -0,0 +1,33 @@
+---
+title: Depth First Search
+type: docs
+---
+
+# Depth First Search
+
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
+|98. Validate Binary Search Tree | [Go]({{< relref "/ChapterFour/0098.Validate-Binary-Search-Tree.md" >}})| Medium | O(n)| O(1)||
+|99. Recover Binary Search Tree | [Go]({{< relref "/ChapterFour/0099.Recover-Binary-Search-Tree.md" >}})| Hard | O(n)| O(1)||
+|100. Same Tree | [Go]({{< relref "/ChapterFour/0100.Same-Tree.md" >}})| Easy | O(n)| O(1)||
+|101. Symmetric Tree | [Go]({{< relref "/ChapterFour/0101.Symmetric-Tree.md" >}})| Easy | O(n)| O(1)||
+|104. Maximum Depth of Binary Tree | [Go]({{< relref "/ChapterFour/0104.Maximum-Depth-of-Binary-Tree.md" >}})| Easy | O(n)| O(1)||
+|108. Convert Sorted Array to Binary Search Tree | [Go]({{< relref "/ChapterFour/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md" >}})| Easy | O(n)| O(1)||
+|109. Convert Sorted List to Binary Search Tree | [Go]({{< relref "/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}})| Medium | O(log n)| O(n)||
+|110. Balanced Binary Tree | [Go]({{< relref "/ChapterFour/0110.Balanced-Binary-Tree.md" >}})| Easy | O(n)| O(1)||
+|111. Minimum Depth of Binary Tree | [Go]({{< relref "/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md" >}})| Easy | O(n)| O(1)||
+|112. Path Sum | [Go]({{< relref "/ChapterFour/0112.Path-Sum.md" >}})| Easy | O(n)| O(1)||
+|113. Path Sum II | [Go]({{< relref "/ChapterFour/0113.Path-Sum-II.md" >}})| Medium | O(n)| O(1)||
+|114. Flatten Binary Tree to Linked List | [Go]({{< relref "/ChapterFour/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})| Medium | O(n)| O(1)||
+|124. Binary Tree Maximum Path Sum | [Go]({{< relref "/ChapterFour/0124.Binary-Tree-Maximum-Path-Sum.md" >}})| Hard | O(n)| O(1)||
+|129. Sum Root to Leaf Numbers | [Go]({{< relref "/ChapterFour/0129.Sum-Root-to-Leaf-Numbers.md" >}})| Medium | O(n)| O(1)||
+|199. Binary Tree Right Side View | [Go]({{< relref "/ChapterFour/0199.Binary-Tree-Right-Side-View.md" >}})| Medium | O(n)| O(1)||
+|200. Number of Islands | [Go]({{< relref "/ChapterFour/0200.Number-of-Islands.md" >}})| Medium | O(n^2)| O(n^2)||
+|207. Course Schedule | [Go]({{< relref "/ChapterFour/0207.Course-Schedule.md" >}})| Medium | O(n^2)| O(n^2)||
+|210. Course Schedule II | [Go]({{< relref "/ChapterFour/0210.Course-Schedule-II.md" >}})| Medium | O(n^2)| O(n^2)||
+|257. Binary Tree Paths | [Go]({{< relref "/ChapterFour/0257.Binary-Tree-Paths.md" >}})| Easy | O(n)| O(1)||
+|394. Decode String | [Go]({{< relref "/ChapterFour/0394.Decode-String.md" >}})| Medium | O(n)| O(n)||
+|515. Find Largest Value in Each Tree Row | [Go]({{< relref "/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}})| Medium | O(n)| O(n)||
+|542. 01 Matrix | [Go]({{< relref "/ChapterFour/0542.01-Matrix.md" >}})| Medium | O(n)| O(1)||
+|980. Unique Paths III | [Go]({{< relref "/ChapterFour/0980.Unique-Paths-III.md" >}})| Hard | O(n log n)| O(n)||
+|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Dynamic_Programming.md b/website/content/ChapterTwo/Dynamic_Programming.md
new file mode 100644
index 00000000..2baddaa9
--- /dev/null
+++ b/website/content/ChapterTwo/Dynamic_Programming.md
@@ -0,0 +1,36 @@
+---
+title: Dynamic Programming
+type: docs
+---
+
+# Dynamic Programming
+
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
+|53. Maximum Subarray| [Go]({{< relref "/ChapterFour/0053.Maximum-Subarray.md" >}})| Easy | O(n)| O(n)||
+|62. Unique Paths | [Go]({{< relref "/ChapterFour/0062.Unique-Paths.md" >}})| Medium | O(n^2)| O(n^2)||
+|63. Unique Paths II | [Go]({{< relref "/ChapterFour/0063.Unique-Paths-II.md" >}})| Medium | O(n^2)| O(n^2)||
+|64. Minimum Path Sum | [Go]({{< relref "/ChapterFour/0064.Minimum-Path-Sum.md" >}})| Medium | O(n^2)| O(n^2)||
+|70. Climbing Stairs | [Go]({{< relref "/ChapterFour/0070.Climbing-Stairs.md" >}})| Easy | O(n)| O(n)||
+|91. Decode Ways | [Go]({{< relref "/ChapterFour/0091.Decode-Ways.md" >}})| Medium | O(n)| O(n)||
+|96. Unique Binary Search Trees | [Go]({{< relref "/ChapterFour/0096.Unique-Binary-Search-Trees.md" >}})| Medium | O(n)| O(n)||
+|120. Triangle | [Go]({{< relref "/ChapterFour/0120.Triangle.md" >}})| Medium | O(n^2)| O(n)||
+|121. Best Time to Buy and Sell Stock | [Go]({{< relref "/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})| Easy | O(n)| O(1)||
+|152. Maximum Product Subarray | [Go]({{< relref "/ChapterFour/0152.Maximum-Product-Subarray.md" >}})| Medium | O(n)| O(1)||
+|198. House Robber | [Go]({{< relref "/ChapterFour/0198.House-Robber.md" >}})| Easy | O(n)| O(n)||
+|213. House Robber II | [Go]({{< relref "/ChapterFour/0213.House-Robber-II.md" >}})| Medium | O(n)| O(n)||
+|300. Longest Increasing Subsequence | [Go]({{< relref "/ChapterFour/0300.Longest-Increasing-Subsequence.md" >}})| Medium | O(n log n)| O(n)||
+|309. Best Time to Buy and Sell Stock with Cooldown | [Go]({{< relref "/ChapterFour/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md" >}})| Medium | O(n)| O(n)||
+|322. Coin Change | [Go]({{< relref "/ChapterFour/0322.Coin-Change.md" >}})| Medium | O(n)| O(n)||
+|338. Counting Bits | [Go]({{< relref "/ChapterFour/0338.Counting-Bits.md" >}})| Medium | O(n)| O(n)||
+|343. Integer Break | [Go]({{< relref "/ChapterFour/0343.Integer-Break.md" >}})| Medium | O(n^2)| O(n)||
+|357. Count Numbers with Unique Digits | [Go]({{< relref "/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md" >}})| Medium | O(1)| O(1)||
+|392. Is Subsequence | [Go]({{< relref "/ChapterFour/0392.Is-Subsequence.md" >}})| Medium | O(n)| O(1)||
+|416. Partition Equal Subset Sum | [Go]({{< relref "/ChapterFour/0416.Partition-Equal-Subset-Sum.md" >}})| Medium | O(n^2)| O(n)||
+|714. Best Time to Buy and Sell Stock with Transaction Fee | [Go]({{< relref "/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})| Medium | O(n)| O(1)||
+|746. Min Cost Climbing Stairs | [Go]({{< relref "/ChapterFour/0746.Min-Cost-Climbing-Stairs.md" >}})| Easy | O(n)| O(1)||
+|838. Push Dominoes | [Go]({{< relref "/ChapterFour/0838.Push-Dominoes.md" >}})| Medium | O(n)| O(n)||
+|1025. Divisor Game | [Go]({{< relref "/ChapterFour/1025.Divisor-Game.md" >}})| Easy | O(1)| O(1)||
+|891. Sum of Subsequence Widths | [Go]({{< relref "/ChapterFour/0891.Sum-of-Subsequence-Widths.md" >}})| Hard | O(n log n)| O(1)||
+|942. DI String Match | [Go]({{< relref "/ChapterFour/0942.DI-String-Match.md" >}})| Easy | O(n)| O(1)||
+|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Hash_Table.md b/website/content/ChapterTwo/Hash_Table.md
new file mode 100644
index 00000000..ae4d2386
--- /dev/null
+++ b/website/content/ChapterTwo/Hash_Table.md
@@ -0,0 +1,43 @@
+---
+title: Hash Table
+type: docs
+---
+
+# Hash Table
+
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
+|1. Two Sum | [Go]({{< relref "/ChapterFour/0001.Two-Sum.md" >}})| Easy | O(n)| O(n)||
+|3. Longest Substring Without Repeating Characters | [Go]({{< relref "/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md" >}})| Medium | O(n)| O(1)|❤️|
+|18. 4Sum | [Go]({{< relref "/ChapterFour/0018.4Sum.md" >}})| Medium | O(n^3)| O(n^2)|❤️|
+|30. Substring with Concatenation of All Words | [Go]({{< relref "/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md" >}})| Hard | O(n)| O(n)|❤️|
+|36. Valid Sudoku | [Go]({{< relref "/ChapterFour/0036.Valid-Sudoku.md" >}})| Medium | O(n^2)| O(n^2)||
+|37. Sudoku Solver | [Go]({{< relref "/ChapterFour/0037.Sudoku-Solver.md" >}})| Hard | O(n^2)| O(n^2)|❤️|
+|49. Group Anagrams | [Go]({{< relref "/ChapterFour/0049.Group-Anagrams.md" >}})| Medium | O(n log n)| O(n)||
+|76. Minimum Window Substring | [Go]({{< relref "/ChapterFour/0076.Minimum-Window-Substring.md" >}})| Hard | O(n)| O(n)|❤️|
+|94. Binary Tree Inorder Traversal | [Go]({{< relref "/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md" >}})| Medium | O(n)| O(1)||
+|138. Copy List with Random Pointer | [Go]()| Medium | O(n)| O(1)||
+|202. Happy Number | [Go]({{< relref "/ChapterFour/0202.Happy-Number.md" >}})| Easy | O(log n)| O(1)||
+|205. Isomorphic Strings | [Go]({{< relref "/ChapterFour/0205.Isomorphic-Strings.md" >}})| Easy | O(log n)| O(n)||
+|217. Contains Duplicate | [Go]({{< relref "/ChapterFour/0217.Contains-Duplicate.md" >}})| Easy | O(n)| O(n)||
+|219. Contains Duplicate II | [Go]({{< relref "/ChapterFour/0219.Contains-Duplicate-II.md" >}})| Easy | O(n)| O(n)||
+|242. Valid Anagram | [Go]({{< relref "/ChapterFour/0242.Valid-Anagram.md" >}})| Easy | O(n)| O(n) ||
+|274. H-Index | [Go]({{< relref "/ChapterFour/0274.H-Index.md" >}})| Medium | O(n)| O(n) ||
+|290. Word Pattern | [Go]({{< relref "/ChapterFour/0290.Word-Pattern.md" >}})| Easy | O(n)| O(n) ||
+|347. Top K Frequent Elements | [Go]({{< relref "/ChapterFour/0347.Top-K-Frequent-Elements.md" >}})| Medium | O(n)| O(n) ||
+|349. Intersection of Two Arrays | [Go]({{< relref "/ChapterFour/0349.Intersection-of-Two-Arrays.md" >}})| Easy | O(n)| O(n) ||
+|350. Intersection of Two Arrays II | [Go]({{< relref "/ChapterFour/0350.Intersection-of-Two-Arrays-II.md" >}})| Easy | O(n)| O(n) ||
+|438. Find All Anagrams in a String | [Go]({{< relref "/ChapterFour/0438.Find-All-Anagrams-in-a-String.md" >}})| Easy | O(n)| O(1) ||
+|447. Number of Boomerangs | [Go]({{< relref "/ChapterFour/0447.Number-of-Boomerangs.md" >}})| Easy | O(n)| O(1) ||
+|451. Sort Characters By Frequency | [Go]({{< relref "/ChapterFour/0451.Sort-Characters-By-Frequency.md" >}})| Medium | O(n log n)| O(1) ||
+|454. 4Sum II | [Go]({{< relref "/ChapterFour/0454.4Sum-II.md" >}})| Medium | O(n^2)| O(n) ||
+|648. Replace Words | [Go]({{< relref "/ChapterFour/0648.Replace-Words.md" >}})| Medium | O(n)| O(n) ||
+|676. Implement Magic Dictionary | [Go]({{< relref "/ChapterFour/0676.Implement-Magic-Dictionary.md" >}})| Medium | O(n)| O(n) ||
+|720. Longest Word in Dictionary | [Go]({{< relref "/ChapterFour/0720.Longest-Word-in-Dictionary.md" >}})| Easy | O(n)| O(n) ||
+|726. Number of Atoms | [Go]({{< relref "/ChapterFour/0726.Number-of-Atoms.md" >}})| Hard | O(n)| O(n) |❤️|
+|739. Daily Temperatures | [Go]({{< relref "/ChapterFour/0739.Daily-Temperatures.md" >}})| Medium | O(n)| O(n) ||
+|710. Random Pick with Blacklist | [Go]({{< relref "/ChapterFour/0710.Random-Pick-with-Blacklist.md" >}})| Hard | O(n)| O(n) ||
+|895. Maximum Frequency Stack | [Go]({{< relref "/ChapterFour/0895.Maximum-Frequency-Stack.md" >}})| Hard | O(n)| O(n) ||
+|930. Binary Subarrays With Sum | [Go]({{< relref "/ChapterFour/0930.Binary-Subarrays-With-Sum.md" >}})| Medium | O(n)| O(n) |❤️|
+|992. Subarrays with K Different Integers | [Go]({{< relref "/ChapterFour/0992.Subarrays-with-K-Different-Integers.md" >}})| Hard | O(n)| O(n) |❤️|
+|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Linked_List.md b/website/content/ChapterTwo/Linked_List.md
new file mode 100644
index 00000000..d786f466
--- /dev/null
+++ b/website/content/ChapterTwo/Linked_List.md
@@ -0,0 +1,53 @@
+---
+title: Linked List
+type: docs
+---
+
+# Linked List
+
+
+
+
+- 巧妙的构造虚拟头结点。可以使遍历处理逻辑更加统一。
+- 灵活使用递归。构造递归条件，使用递归可以巧妙的解题。不过需要注意有些题目不能使用递归，因为递归深度太深会导致超时和栈溢出。
+- 链表区间逆序。第 92 题。
+- 链表寻找中间节点。第 876 题。链表寻找倒数第 n 个节点。第 19 题。只需要一次遍历就可以得到答案。
+- 合并 K 个有序链表。第 21 题，第 23 题。
+- 链表归类。第 86 题，第 328 题。
+- 链表排序，时间复杂度要求 O(n * log n)，空间复杂度 O(1)。只有一种做法，归并排序，至顶向下归并。第 148 题。
+- 判断链表是否存在环，如果有环，输出环的交叉点的下标；判断 2 个链表是否有交叉点，如果有交叉点，输出交叉点。第 141 题，第 142 题，第 160 题。
+
+
+
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
+|2. Add Two Numbers | [Go]({{< relref "/ChapterFour/0002.Add-Two-Numbers.md" >}})| Medium | O(n)| O(1)||
+|19. Remove Nth Node From End of List | [Go]({{< relref "/ChapterFour/0019.Remove-Nth-Node-From-End-of-List.md" >}})| Medium | O(n)| O(1)||
+|21. Merge Two Sorted Lists | [Go]({{< relref "/ChapterFour/0021.Merge-Two-Sorted-Lists.md" >}})| Easy | O(log n)| O(1)||
+|23. Merge k Sorted Lists| [Go]({{< relref "/ChapterFour/0023.Merge-k-Sorted-Lists.md" >}})| Hard | O(log n)| O(1)|❤️|
+|24. Swap Nodes in Pairs | [Go]({{< relref "/ChapterFour/0024.Swap-Nodes-in-Pairs.md" >}})| Medium | O(n)| O(1)||
+|25. Reverse Nodes in k-Group | [Go]({{< relref "/ChapterFour/0025.Reverse-Nodes-in-k-Group.md" >}})| Hard | O(log n)| O(1)|❤️|
+|61. Rotate List | [Go]({{< relref "/ChapterFour/0061.Rotate-List.md" >}})| Medium | O(n)| O(1)||
+|82. Remove Duplicates from Sorted List II | [Go]({{< relref "/ChapterFour/0082.Remove-Duplicates-from-Sorted-List-II.md" >}})| Medium | O(n)| O(1)||
+|83. Remove Duplicates from Sorted List | [Go]({{< relref "/ChapterFour/0083.Remove-Duplicates-from-Sorted-List.md" >}})| Easy | O(n)| O(1)||
+|86. Partition List | [Go]({{< relref "/ChapterFour/0086.Partition-List.md" >}})| Medium | O(n)| O(1)|❤️|
+|92. Reverse Linked List II | [Go]({{< relref "/ChapterFour/0092.Reverse-Linked-List-II.md" >}})| Medium | O(n)| O(1)|❤️|
+|109. Convert Sorted List to Binary Search Tree | [Go]({{< relref "/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}})| Medium | O(log n)| O(n)||
+|141. Linked List Cycle | [Go]({{< relref "/ChapterFour/0141.Linked-List-Cycle.md" >}})| Easy | O(n)| O(1)|❤️|
+|142. Linked List Cycle II | [Go]({{< relref "/ChapterFour/0142.Linked-List-Cycle-II.md" >}})| Medium | O(n)| O(1)|❤️|
+|143. Reorder List | [Go]({{< relref "/ChapterFour/0143.Reorder-List.md" >}})| Medium | O(n)| O(1)|❤️|
+|147. Insertion Sort List | [Go]({{< relref "/ChapterFour/0147.Insertion-Sort-List.md" >}})| Medium | O(n)| O(1)|❤️|
+|148. Sort List | [Go]({{< relref "/ChapterFour/0148.Sort-List.md" >}})| Medium | O(n log n)| O(n)|❤️|
+|160. Intersection of Two Linked Lists | [Go]({{< relref "/ChapterFour/0160.Intersection-of-Two-Linked-Lists.md" >}})| Easy | O(n)| O(1)|❤️|
+|203. Remove Linked List Elements | [Go]({{< relref "/ChapterFour/0203.Remove-Linked-List-Elements.md" >}})| Easy | O(n)| O(1)||
+|206. Reverse Linked List | [Go]({{< relref "/ChapterFour/0206.Reverse-Linked-List.md" >}})| Easy | O(n)| O(1)||
+|234. Palindrome Linked List | [Go]({{< relref "/ChapterFour/0234.Palindrome-Linked-List.md" >}})| Easy | O(n)| O(1)||
+|237. Delete Node in a Linked List | [Go]({{< relref "/ChapterFour/0237.Delete-Node-in-a-Linked-List.md" >}})| Easy | O(n)| O(1)||
+|328. Odd Even Linked List | [Go]({{< relref "/ChapterFour/0328.Odd-Even-Linked-List.md" >}})| Medium | O(n)| O(1)||
+|445. Add Two Numbers II | [Go]({{< relref "/ChapterFour/0445.Add-Two-Numbers-II.md" >}})| Medium | O(n)| O(n)||
+|725. Split Linked List in Parts | [Go]({{< relref "/ChapterFour/0725.Split-Linked-List-in-Parts.md" >}})| Medium | O(n)| O(1)||
+|817. Linked List Components | [Go]({{< relref "/ChapterFour/0817.Linked-List-Components.md" >}})| Medium | O(n)| O(1)||
+|707. Design Linked List | [Go]({{< relref "/ChapterFour/0707.Design-Linked-List.md" >}})| Easy | O(n)| O(1)||
+|876. Middle of the Linked List | [Go]({{< relref "/ChapterFour/0876.Middle-of-the-Linked-List.md" >}})| Easy | O(n)| O(1)|❤️|
+|1019. Next Greater Node In Linked List | [Go]({{< relref "/ChapterFour/1019.Next-Greater-Node-In-Linked-List.md" >}})| Medium | O(n)| O(1)||
+|---------------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Math.md b/website/content/ChapterTwo/Math.md
new file mode 100644
index 00000000..b20da7a3
--- /dev/null
+++ b/website/content/ChapterTwo/Math.md
@@ -0,0 +1,28 @@
+---
+title: Math
+type: docs
+---
+
+# Math
+
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
+|2. Add Two Numbers | [Go]({{< relref "/ChapterFour/0002.Add-Two-Numbers.md" >}})| Medium | O(n)| O(1)||
+|50. Pow(x, n) | [Go]({{< relref "/ChapterFour/0050.Powx-n.md" >}})| Medium | O(log n)| O(1)||
+|60. Permutation Sequence | [Go]({{< relref "/ChapterFour/0060.Permutation-Sequence.md" >}})| Medium | O(n log n)| O(1)||
+|69. Sqrt(x) | [Go]({{< relref "/ChapterFour/0069.Sqrtx.md" >}})| Easy | O(log n)| O(1)||
+|202. Happy Number | [Go]({{< relref "/ChapterFour/0202.Happy-Number.md" >}})| Easy | O(log n)| O(1)||
+|224. Basic Calculator | [Go]({{< relref "/ChapterFour/0224.Basic-Calculator.md" >}})| Hard | O(n)| O(n)||
+|231. Power of Two | [Go]({{< relref "/ChapterFour/0231.Power-of-Two.md" >}})| Easy | O(1)| O(1)||
+|263. Ugly Number | [Go]({{< relref "/ChapterFour/0263.Ugly-Number.md" >}})| Easy | O(log n)| O(1)||
+|326. Power of Three | [Go]({{< relref "/ChapterFour/0326.Power-of-Three.md" >}})| Easy | O(1)| O(1)||
+|343. Integer Break | [Go]({{< relref "/ChapterFour/0343.Integer-Break.md" >}})| Medium | O(n^2)| O(n)||
+|357. Count Numbers with Unique Digits | [Go]({{< relref "/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md" >}})| Medium | O(1)| O(1)||
+|628. Maximum Product of Three Numbers | [Go]({{< relref "/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md" >}})| Easy | O(n)| O(1)||
+|885. Spiral Matrix III | [Go]({{< relref "/ChapterFour/0885.Spiral-Matrix-III.md" >}})| Medium | O(n^2)| O(1)||
+|891. Sum of Subsequence Widths | [Go]({{< relref "/ChapterFour/0891.Sum-of-Subsequence-Widths.md" >}})| Hard | O(n log n)| O(1)||
+|942. DI String Match | [Go]({{< relref "/ChapterFour/0942.DI-String-Match.md" >}})| Easy | O(n)| O(1)||
+|976. Largest Perimeter Triangle | [Go]({{< relref "/ChapterFour/0976.Largest-Perimeter-Triangle.md" >}})| Easy | O(n log n)| O(log n) ||
+|996. Number of Squareful Arrays | [Go]({{< relref "/ChapterFour/0996.Number-of-Squareful-Arrays.md" >}})| Hard | O(n log n)| O(n) ||
+|1025. Divisor Game | [Go]({{< relref "/ChapterFour/1025.Divisor-Game.md" >}})| Easy | O(1)| O(1)||
+|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Segment_Tree.md b/website/content/ChapterTwo/Segment_Tree.md
new file mode 100644
index 00000000..d083d921
--- /dev/null
+++ b/website/content/ChapterTwo/Segment_Tree.md
@@ -0,0 +1,48 @@
+---
+title: Segment Tree
+type: docs
+---
+
+# Segment Tree
+
+
+
+- 线段数的经典数组实现写法。将合并两个节点 pushUp 逻辑抽象出来了，可以实现任意操作(常见的操作有：加法，取 max，min 等等)。第 218 题，第 303 题，第 307 题，第 699 题。
+- 计数线段树的经典写法。第 315 题，第 327 题，第 493 题。
+- 线段树的树的实现写法。第 715 题，第 732 题。
+- 区间懒惰更新。第 218 题，第 699 题。
+- 离散化。离散化需要注意一个特殊情况：假如三个区间为 [1,10] [1,4] [6,10]，离散化后 x[1]=1,x[2]=4,x[3]=6,x[4]=10。第一个区间为 [1,4]，第二个区间为 [1,2]，第三个区间为 [3,4]，这样一来，区间一 = 区间二 + 区间三，这和离散前的模型不符，离散前，很明显，区间一 > 区间二 + 区间三。正确的做法是：在相差大于 1 的数间加一个数，例如在上面 1 4 6 10 中间加 5，即可 x[1]=1,x[2]=4,x[3]=5,x[4]=6,x[5]=10。这样处理之后，区间一是 1-5 ，区间二是 1-2 ，区间三是 4-5 。
+- 灵活构建线段树。线段树节点可以存储多条信息，合并两个节点的 pushUp 操作也可以是多样的。第 850 题，第 1157 题。
+
+
+线段树[题型](https://blog.csdn.net/xuechelingxiao/article/details/38313105)从简单到困难:
+
+1. 单点更新:
+ [HDU 1166 敌兵布阵](http://acm.hdu.edu.cn/showproblem.php?pid=1166) update:单点增减 query:区间求和
+ [HDU 1754 I Hate It](http://acm.hdu.edu.cn/showproblem.php?pid=1754) update:单点替换 query:区间最值
+ [HDU 1394 Minimum Inversion Number](http://acm.hdu.edu.cn/showproblem.php?pid=1394) update:单点增减 query:区间求和
+ [HDU 2795 Billboard](http://acm.hdu.edu.cn/showproblem.php?pid=2795) query:区间求最大值的位子(直接把update的操作在query里做了)
+2. 区间更新:
+ [HDU 1698 Just a Hook](http://acm.hdu.edu.cn/showproblem.php?pid=1698) update:成段替换 (由于只query一次总区间,所以可以直接输出 1 结点的信息)
+ [POJ 3468 A Simple Problem with Integers](http://poj.org/problem?id=3468) update:成段增减 query:区间求和
+ [POJ 2528 Mayor’s posters](http://poj.org/problem?id=2528) 离散化 + update:成段替换 query:简单hash
+ [POJ 3225 Help with Intervals](http://poj.org/problem?id=3225) update:成段替换,区间异或 query:简单hash
+3. 区间合并(这类题目会询问区间中满足条件的连续最长区间,所以PushUp的时候需要对左右儿子的区间进行合并):
+ [POJ 3667 Hotel](http://poj.org/problem?id=3667) update:区间替换 query:询问满足条件的最左端点
+4. 扫描线(这类题目需要将一些操作排序,然后从左到右用一根扫描线扫过去最典型的就是矩形面积并,周长并等题):
+ [HDU 1542 Atlantis](http://acm.hdu.edu.cn/showproblem.php?pid=1542) update:区间增减 query:直接取根节点的值
+ [HDU 1828 Picture](http://acm.hdu.edu.cn/showproblem.php?pid=1828) update:区间增减 query:直接取根节点的值
+
+| Title | Solution | Difficulty | Time | Space | 收藏 |
+| ----- | :--------: | :----------: | :----: | :-----: |:-----: |
+|218. The Skyline Problem | [Go]({{< relref "/ChapterFour/0218.The-Skyline-Problem.md" >}})| Hard | O(n log n)| O(n)|❤️|
+|307. Range Sum Query - Mutable | [Go]({{< relref "/ChapterFour/0307.Range-Sum-Query---Mutable.md" >}})| Hard | O(1)| O(n)||
+|315. Count of Smaller Numbers After Self | [Go]({{< relref "/ChapterFour/0315.Count-of-Smaller-Numbers-After-Self.md" >}})| Hard | O(n log n)| O(n)||
+|327. Count of Range Sum | [Go]({{< relref "/ChapterFour/0327.Count-of-Range-Sum.md" >}})| Hard | O(n log n)| O(n)|❤️|
+|493. Reverse Pairs | [Go]({{< relref "/ChapterFour/0493.Reverse-Pairs.md" >}})| Hard | O(n log n)| O(n)||
+|699. Falling Squares | [Go]({{< relref "/ChapterFour/0699.Falling-Squares.md" >}})| Hard | O(n log n)| O(n)|❤️|
+|715. Range Module | [Go]({{< relref "/ChapterFour/0715.Range-Module.md" >}})| Hard | O(log n)| O(n)|❤️|
+|732. My Calendar III | [Go]({{< relref "/ChapterFour/0732.My-Calendar-III.md" >}})| Hard | O(log n)| O(n)|❤️|
+|850. Rectangle Area II | [Go]({{< relref "/ChapterFour/0850.Rectangle-Area-II.md" >}})| Hard | O(n log n)| O(n)|❤️|
+|1157. Online Majority Element In Subarray | [Go]({{< relref "/ChapterFour/1157.Online-Majority-Element-In-Subarray.md" >}})| Hard | O(log n)| O(n)|❤️|
+|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Sliding_Window.md b/website/content/ChapterTwo/Sliding_Window.md
new file mode 100644
index 00000000..2ffd90d7
--- /dev/null
+++ b/website/content/ChapterTwo/Sliding_Window.md
@@ -0,0 +1,43 @@
+---
+title: Sliding Window
+type: docs
+---
+
+# Sliding Window
+
+
+
+- 双指针滑动窗口的经典写法。右指针不断往右移，移动到不能往右移动为止(具体条件根据题目而定)。当右指针到最右边以后，开始挪动左指针，释放窗口左边界。第 3 题，第 76 题，第 209 题，第 424 题，第 438 题，第 567 题，第 713 题，第 763 题，第 845 题，第 881 题，第 904 题，第 978 题，第 992 题，第 1004 题，第 1040 题，第 1052 题。
+
+```c
+ left, right := 0, -1
+
+ for left < len(s) {
+ if right+1 < len(s) && freq[s[right+1]-'a'] == 0 {
+ freq[s[right+1]-'a']++
+ right++
+ } else {
+ freq[s[left]-'a']--
+ left++
+ }
+ result = max(result, right-left+1)
+ }
+```
+- 滑动窗口经典题。第 239 题，第 480 题。
+
+| Title | Solution | Difficulty | Time | Space | 收藏 |
+| ----- | :--------: | :----------: | :----: | :-----: |:-----: |
+|3. Longest Substring Without Repeating Characters | [Go]({{< relref "/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md" >}})| Medium | O(n)| O(1)|❤️|
+|76. Minimum Window Substring | [Go]({{< relref "/ChapterFour/0076.Minimum-Window-Substring.md" >}})| Hard | O(n)| O(n)|❤️|
+|239. Sliding Window Maximum | [Go]({{< relref "/ChapterFour/0239.Sliding-Window-Maximum.md" >}})| Hard | O(n * k)| O(n)|❤️|
+|424. Longest Repeating Character Replacement | [Go]({{< relref "/ChapterFour/0424.Longest-Repeating-Character-Replacement.md" >}})| Medium | O(n)| O(1) ||
+|480. Sliding Window Median | [Go]({{< relref "/ChapterFour/0480.Sliding-Window-Median.md" >}})| Hard | O(n * log k)| O(k)|❤️|
+|567. Permutation in String | [Go]({{< relref "/ChapterFour/0567.Permutation-in-String.md" >}})| Medium | O(n)| O(1)|❤️|
+|978. Longest Turbulent Subarray | [Go]({{< relref "/ChapterFour/0978.Longest-Turbulent-Subarray.md" >}})| Medium | O(n)| O(1)|❤️|
+|992. Subarrays with K Different Integers | [Go]({{< relref "/ChapterFour/0992.Subarrays-with-K-Different-Integers.md" >}})| Hard | O(n)| O(n)|❤️|
+|995. Minimum Number of K Consecutive Bit Flips | [Go]({{< relref "/ChapterFour/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md" >}})| Hard | O(n)| O(1)|❤️|
+|1004. Max Consecutive Ones III | [Go]({{< relref "/ChapterFour/1004.Max-Consecutive-Ones-III.md" >}})| Medium | O(n)| O(1) ||
+|1040. Moving Stones Until Consecutive II | [Go]({{< relref "/ChapterFour/1040.Moving-Stones-Until-Consecutive-II.md" >}})| Medium | O(n log n)| O(1) |❤️|
+|1052. Grumpy Bookstore Owner | [Go]({{< relref "/ChapterFour/1052.Grumpy-Bookstore-Owner.md" >}})| Medium | O(n log n)| O(1) ||
+|1074. Number of Submatrices That Sum to Target | [Go]({{< relref "/ChapterFour/1074.Number-of-Submatrices-That-Sum-to-Target.md" >}})| Hard | O(n^3)| O(n) |❤️|
+|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Sort.md b/website/content/ChapterTwo/Sort.md
new file mode 100644
index 00000000..f759edf8
--- /dev/null
+++ b/website/content/ChapterTwo/Sort.md
@@ -0,0 +1,42 @@
+---
+title: Sort
+type: docs
+---
+
+# Sort
+
+
+
+- 深刻的理解多路快排。第 75 题。
+- 链表的排序，插入排序(第 147 题)和归并排序(第 148 题)
+- 桶排序和基数排序。第 164 题。
+- "摆动排序"。第 324 题。
+- 两两不相邻的排序。第 767 题，第 1054 题。
+- "饼子排序"。第 969 题。
+
+| Title | Solution | Difficulty | Time | Space | 收藏 |
+| ----- | :--------: | :----------: | :----: | :-----: |:-----: |
+|56. Merge Intervals | [Go]({{< relref "/ChapterFour/0056.Merge-Intervals.md" >}})| Medium | O(n log n)| O(log n)||
+|57. Insert Interval | [Go]({{< relref "/ChapterFour/0057.Insert-Interval.md" >}})| Hard | O(n)| O(1)||
+|75. Sort Colors | [Go]({{< relref "/ChapterFour/0075.Sort-Colors.md" >}})| Medium| O(n)| O(1)|❤️|
+|147. Insertion Sort List | [Go]({{< relref "/ChapterFour/0147.Insertion-Sort-List.md" >}})| Medium | O(n)| O(1) |❤️|
+|148. Sort List | [Go]({{< relref "/ChapterFour/0148.Sort-List.md" >}})| Medium |O(n log n)| O(log n)|❤️|
+|164. Maximum Gap | [Go]({{< relref "/ChapterFour/0164.Maximum-Gap.md" >}})| Hard | O(n log n)| O(log n) |❤️|
+|179. Largest Number | [Go]({{< relref "/ChapterFour/0179.Largest-Number.md" >}})| Medium | O(n log n)| O(log n) |❤️|
+|220. Contains Duplicate III | [Go]({{< relref "/ChapterFour/0220.Contains-Duplicate-III.md" >}})| Medium | O(n log n)| O(1) |❤️|
+|242. Valid Anagram | [Go]({{< relref "/ChapterFour/0242.Valid-Anagram.md" >}})| Easy | O(n)| O(n) ||
+|274. H-Index | [Go]({{< relref "/ChapterFour/0274.H-Index.md" >}})| Medium | O(n)| O(n) ||
+|324. Wiggle Sort II | [Go]({{< relref "/ChapterFour/0324.Wiggle-Sort-II.md" >}})| Medium| O(n)| O(n)|❤️|
+|349. Intersection of Two Arrays | [Go]({{< relref "/ChapterFour/0349.Intersection-of-Two-Arrays.md" >}})| Easy | O(n)| O(n) ||
+|350. Intersection of Two Arrays II | [Go]({{< relref "/ChapterFour/0350.Intersection-of-Two-Arrays-II.md" >}})| Easy | O(n)| O(n) ||
+|524. Longest Word in Dictionary through Deleting | [Go]({{< relref "/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})| Medium | O(n)| O(1) ||
+|767. Reorganize String | [Go]({{< relref "/ChapterFour/0767.Reorganize-String.md" >}})| Medium | O(n log n)| O(log n) |❤️|
+|853. Car Fleet | [Go]({{< relref "/ChapterFour/0853.Car-Fleet.md" >}})| Medium | O(n log n)| O(log n) ||
+|710. Random Pick with Blacklist | [Go]({{< relref "/ChapterFour/0710.Random-Pick-with-Blacklist.md" >}})| Hard | O(n)| O(n) ||
+|922. Sort Array By Parity II | [Go]({{< relref "/ChapterFour/0922.Sort-Array-By-Parity-II.md" >}})| Easy | O(n)| O(1) ||
+|969. Pancake Sorting | [Go]({{< relref "/ChapterFour/0969.Pancake-Sorting.md" >}})| Medium | O(n log n)| O(log n) |❤️|
+|973. K Closest Points to Origin | [Go]({{< relref "/ChapterFour/0973.K-Closest-Points-to-Origin.md" >}})| Medium | O(n log n)| O(log n) ||
+|976. Largest Perimeter Triangle | [Go]({{< relref "/ChapterFour/0976.Largest-Perimeter-Triangle.md" >}})| Easy | O(n log n)| O(log n) ||
+|1030. Matrix Cells in Distance Order | [Go]({{< relref "/ChapterFour/1030.Matrix-Cells-in-Distance-Order.md" >}})| Easy | O(n^2)| O(1) ||
+|1054. Distant Barcodes | [Go]({{< relref "/ChapterFour/1054.Distant-Barcodes.md" >}})| Medium | O(n log n)| O(log n) |❤️|
+|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Stack.md b/website/content/ChapterTwo/Stack.md
new file mode 100644
index 00000000..cae1b29c
--- /dev/null
+++ b/website/content/ChapterTwo/Stack.md
@@ -0,0 +1,54 @@
+---
+title: Stack
+type: docs
+---
+
+# Stack
+
+
+
+- 括号匹配问题及类似问题。第 20 题，第 921 题，第 1021 题。
+- 栈的基本 pop 和 push 操作。第 71 题，第 150 题，第 155 题，第 224 题，第 225 题，第 232 题，第 946 题，第 1047 题。
+- 利用栈进行编码问题。第 394 题，第 682 题，第 856 题，第 880 题。
+- **单调栈**。**利用栈维护一个单调递增或者递减的下标数组**。第 84 题，第 456 题，第 496 题，第 503 题，第 739 题，第 901 题，第 907 题，第 1019 题。
+
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
+|20. Valid Parentheses | [Go]({{< relref "/ChapterFour/0020.Valid-Parentheses.md" >}})| Easy | O(log n)| O(1)||
+|42. Trapping Rain Water | [Go]({{< relref "/ChapterFour/0042.Trapping-Rain-Water.md" >}})| Hard | O(n)| O(1)|❤️|
+|71. Simplify Path | [Go]({{< relref "/ChapterFour/0071.Simplify-Path.md" >}})| Medium | O(n)| O(n)|❤️|
+|84. Largest Rectangle in Histogram | [Go]({{< relref "/ChapterFour/0084.Largest-Rectangle-in-Histogram.md" >}})| Medium | O(n)| O(n)|❤️|
+|94. Binary Tree Inorder Traversal | [Go]({{< relref "/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md" >}})| Medium | O(n)| O(1)||
+|103. Binary Tree Zigzag Level Order Traversal | [Go]({{< relref "/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}})| Medium | O(n)| O(n)||
+|144. Binary Tree Preorder Traversal | [Go]({{< relref "/ChapterFour/0144.Binary-Tree-Preorder-Traversal.md" >}})| Medium | O(n)| O(1)||
+|145. Binary Tree Postorder Traversal | [Go]({{< relref "/ChapterFour/0145.Binary-Tree-Postorder-Traversal.md" >}})| Hard | O(n)| O(1)||
+|150. Evaluate Reverse Polish Notation | [Go]({{< relref "/ChapterFour/0150.Evaluate-Reverse-Polish-Notation.md" >}})| Medium | O(n)| O(1)||
+|155. Min Stack | [Go]({{< relref "/ChapterFour/0155.Min-Stack.md" >}})| Easy | O(n)| O(n)||
+|173. Binary Search Tree Iterator | [Go]({{< relref "/ChapterFour/0173.Binary-Search-Tree-Iterator.md" >}})| Medium | O(n)| O(1)||
+|224. Basic Calculator | [Go]({{< relref "/ChapterFour/0224.Basic-Calculator.md" >}})| Hard | O(n)| O(n)||
+|225. Implement Stack using Queues | [Go]({{< relref "/ChapterFour/0225.Implement-Stack-using-Queues.md" >}})| Easy | O(n)| O(n)||
+|232. Implement Queue using Stacks | [Go]({{< relref "/ChapterFour/0232.Implement-Queue-using-Stacks.md" >}})| Easy | O(n)| O(n)||
+|331. Verify Preorder Serialization of a Binary Tree | [Go]({{< relref "/ChapterFour/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})| Medium | O(n)| O(1)||
+|394. Decode String | [Go]({{< relref "/ChapterFour/0394.Decode-String.md" >}})| Medium | O(n)| O(n)||
+|402. Remove K Digits | [Go]({{< relref "/ChapterFour/0402.Remove-K-Digits.md" >}})| Medium | O(n)| O(1)||
+|456. 132 Pattern | [Go]({{< relref "/ChapterFour/0456.132-Pattern.md" >}})| Medium | O(n)| O(n)||
+|496. Next Greater Element I | [Go]({{< relref "/ChapterFour/0496.Next-Greater-Element-I.md" >}})| Easy | O(n)| O(n)||
+|503. Next Greater Element II | [Go]({{< relref "/ChapterFour/0503.Next-Greater-Element-II.md" >}})| Medium | O(n)| O(n)||
+|636. Exclusive Time of Functions | [Go]({{< relref "/ChapterFour/0636.Exclusive-Time-of-Functions.md" >}})| Medium | O(n)| O(n)||
+|682. Baseball Game | [Go]({{< relref "/ChapterFour/0682.Baseball-Game.md" >}})| Easy | O(n)| O(n)||
+|726. Number of Atoms | [Go]({{< relref "/ChapterFour/0726.Number-of-Atoms.md" >}})| Hard | O(n)| O(n) |❤️|
+|735. Asteroid Collision | [Go]({{< relref "/ChapterFour/0735.Asteroid-Collision.md" >}})| Medium | O(n)| O(n) ||
+|739. Daily Temperatures | [Go]({{< relref "/ChapterFour/0739.Daily-Temperatures.md" >}})| Medium | O(n)| O(n) ||
+|844. Backspace String Compare | [Go]({{< relref "/ChapterFour/0844.Backspace-String-Compare.md" >}})| Easy | O(n)| O(n) ||
+|856. Score of Parentheses | [Go]({{< relref "/ChapterFour/0856.Score-of-Parentheses.md" >}})| Medium | O(n)| O(n)||
+|880. Decoded String at Index | [Go]({{< relref "/ChapterFour/0880.Decoded-String-at-Index.md" >}})| Medium | O(n)| O(n)||
+|895. Maximum Frequency Stack | [Go]({{< relref "/ChapterFour/0895.Maximum-Frequency-Stack.md" >}})| Hard | O(n)| O(n) ||
+|901. Online Stock Span | [Go]({{< relref "/ChapterFour/0901.Online-Stock-Span.md" >}})| Medium | O(n)| O(n) ||
+|907. Sum of Subarray Minimums | [Go]({{< relref "/ChapterFour/0907.Sum-of-Subarray-Minimums.md" >}})| Medium | O(n)| O(n)|❤️|
+|921. Minimum Add to Make Parentheses Valid | [Go]({{< relref "/ChapterFour/0921.Minimum-Add-to-Make-Parentheses-Valid.md" >}})| Medium | O(n)| O(n)||
+|946. Validate Stack Sequences | [Go]({{< relref "/ChapterFour/0946.Validate-Stack-Sequences.md" >}})| Medium | O(n)| O(n)||
+|1003. Check If Word Is Valid After Substitutions | [Go]({{< relref "/ChapterFour/1003.Check-If-Word-Is-Valid-After-Substitutions.md" >}})| Medium | O(n)| O(1)||
+|1019. Next Greater Node In Linked List | [Go]({{< relref "/ChapterFour/1019.Next-Greater-Node-In-Linked-List.md" >}})| Medium | O(n)| O(1)||
+|1021. Remove Outermost Parentheses | [Go]({{< relref "/ChapterFour/1021.Remove-Outermost-Parentheses.md" >}})| Medium | O(n)| O(1)||
+|1047. Remove All Adjacent Duplicates In String | [Go]({{< relref "/ChapterFour/1047.Remove-All-Adjacent-Duplicates-In-String.md" >}})| Medium | O(n)| O(1)||
+|---------------------------------------|-----------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/String.md b/website/content/ChapterTwo/String.md
new file mode 100644
index 00000000..1ea29de5
--- /dev/null
+++ b/website/content/ChapterTwo/String.md
@@ -0,0 +1,30 @@
+---
+title: String
+type: docs
+---
+
+# String
+
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
+|3. Longest Substring Without Repeating Characters | [Go]({{< relref "/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md" >}})| Medium | O(n)| O(1)|❤️|
+|17. Letter Combinations of a Phone Number | [Go]({{< relref "/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md" >}})| Medium | O(log n)| O(1)||
+|20. Valid Parentheses | [Go]({{< relref "/ChapterFour/0020.Valid-Parentheses.md" >}})| Easy | O(log n)| O(1)||
+|22. Generate Parentheses | [Go]({{< relref "/ChapterFour/0022.Generate-Parentheses.md" >}})| Medium | O(log n)| O(1)||
+|28. Implement strStr() | [Go]({{< relref "/ChapterFour/0028.Implement-strStr.md" >}})| Easy | O(n)| O(1)||
+|30. Substring with Concatenation of All Words | [Go]({{< relref "/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md" >}})| Hard | O(n)| O(n)|❤️|
+|49. Group Anagrams | [Go]({{< relref "/ChapterFour/0049.Group-Anagrams.md" >}})| Medium | O(n log n)| O(n)||
+|71. Simplify Path | [Go]({{< relref "/ChapterFour/0071.Simplify-Path.md" >}})| Medium | O(n)| O(n)||
+|76. Minimum Window Substring | [Go]({{< relref "/ChapterFour/0076.Minimum-Window-Substring.md" >}})| Hard | O(n)| O(n)|❤️|
+|91. Decode Ways | [Go]({{< relref "/ChapterFour/0091.Decode-Ways.md" >}})| Medium | O(n)| O(n)||
+|93. Restore IP Addresses | [Go]({{< relref "/ChapterFour/0093.Restore-IP-Addresses.md" >}})| Medium | O(n)| O(n)|❤️|
+|125. Valid Palindrome | [Go]({{< relref "/ChapterFour/0125.Valid-Palindrome.md" >}})| Easy | O(n)| O(1)||
+|126. Word Ladder II | [Go]({{< relref "/ChapterFour/0126.Word-Ladder-II.md" >}})| Hard | O(n)| O(n^2)|❤️|
+|344. Reverse String | [Go]({{< relref "/ChapterFour/0344.Reverse-String.md" >}})| Easy | O(n)| O(1)||
+|345. Reverse Vowels of a String | [Go]({{< relref "/ChapterFour/0345.Reverse-Vowels-of-a-String.md" >}})| Easy | O(n)| O(1)||
+|767. Reorganize String | [Go]({{< relref "/ChapterFour/0767.Reorganize-String.md" >}})| Medium | O(n log n)| O(log n) |❤️|
+|842. Split Array into Fibonacci Sequence | [Go]({{< relref "/ChapterFour/0842.Split-Array-into-Fibonacci-Sequence.md" >}})| Medium | O(n^2)| O(1)|❤️|
+|856. Score of Parentheses | [Go]({{< relref "/ChapterFour/0856.Score-of-Parentheses.md" >}})| Medium | O(n)| O(n)||
+|925. Long Pressed Name | [Go]({{< relref "/ChapterFour/0925.Long-Pressed-Name.md" >}})| Easy | O(n)| O(1)||
+|1003. Check If Word Is Valid After Substitutions | [Go]({{< relref "/ChapterFour/1003.Check-If-Word-Is-Valid-After-Substitutions.md" >}})| Medium | O(n)| O(1)||
+|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Tree.md b/website/content/ChapterTwo/Tree.md
new file mode 100644
index 00000000..d8a1267e
--- /dev/null
+++ b/website/content/ChapterTwo/Tree.md
@@ -0,0 +1,43 @@
+---
+title: Tree
+type: docs
+---
+
+# Tree
+
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
+|94. Binary Tree Inorder Traversal | [Go]({{< relref "/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md" >}})| Medium | O(n)| O(1)||
+|96. Unique Binary Search Trees | [Go]({{< relref "/ChapterFour/0096.Unique-Binary-Search-Trees.md" >}})| Medium | O(n^2)| O(n)||
+|98. Validate Binary Search Tree | [Go]({{< relref "/ChapterFour/0098.Validate-Binary-Search-Tree.md" >}})| Medium | O(n)| O(1)||
+|99. Recover Binary Search Tree | [Go]({{< relref "/ChapterFour/0099.Recover-Binary-Search-Tree.md" >}})| Hard | O(n)| O(1)||
+|100. Same Tree | [Go]({{< relref "/ChapterFour/0100.Same-Tree.md" >}})| Easy | O(n)| O(1)||
+|101. Symmetric Tree | [Go]({{< relref "/ChapterFour/0101.Symmetric-Tree.md" >}})| Easy | O(n)| O(1)||
+|102. Binary Tree Level Order Traversal | [Go]({{< relref "/ChapterFour/0102.Binary-Tree-Level-Order-Traversal.md" >}})| Medium | O(n)| O(1)||
+|103. Binary Tree Zigzag Level Order Traversal | [Go]({{< relref "/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}})| Medium | O(n)| O(n)||
+|104. Maximum Depth of Binary Tree | [Go]({{< relref "/ChapterFour/0104.Maximum-Depth-of-Binary-Tree.md" >}})| Easy | O(n)| O(1)||
+|107. Binary Tree Level Order Traversal II | [Go]({{< relref "/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.md" >}})| Easy | O(n)| O(1)||
+|108. Convert Sorted Array to Binary Search Tree | [Go]({{< relref "/ChapterFour/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md" >}})| Easy | O(n)| O(1)||
+|110. Balanced Binary Tree | [Go]({{< relref "/ChapterFour/0110.Balanced-Binary-Tree.md" >}})| Easy | O(n)| O(1)||
+|111. Minimum Depth of Binary Tree | [Go]({{< relref "/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md" >}})| Easy | O(n)| O(1)||
+|112. Path Sum | [Go]({{< relref "/ChapterFour/0112.Path-Sum.md" >}})| Easy | O(n)| O(1)||
+|113. Path Sum II | [Go]({{< relref "/ChapterFour/0113.Path-Sum-II.md" >}})| Medium | O(n)| O(1)||
+|114. Flatten Binary Tree to Linked List | [Go]({{< relref "/ChapterFour/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})| Medium | O(n)| O(1)||
+|124. Binary Tree Maximum Path Sum | [Go]({{< relref "/ChapterFour/0124.Binary-Tree-Maximum-Path-Sum.md" >}})| Hard | O(n)| O(1)||
+|129. Sum Root to Leaf Numbers | [Go]({{< relref "/ChapterFour/0129.Sum-Root-to-Leaf-Numbers.md" >}})| Medium | O(n)| O(1)||
+|144. Binary Tree Preorder Traversal | [Go]({{< relref "/ChapterFour/0144.Binary-Tree-Preorder-Traversal.md" >}})| Medium | O(n)| O(1)||
+|145. Binary Tree Postorder Traversal | [Go]({{< relref "/ChapterFour/0145.Binary-Tree-Postorder-Traversal.md" >}})| Hard | O(n)| O(1)||
+|173. Binary Search Tree Iterator | [Go]({{< relref "/ChapterFour/0173.Binary-Search-Tree-Iterator.md" >}})| Medium | O(n)| O(1)||
+|199. Binary Tree Right Side View | [Go]({{< relref "/ChapterFour/0199.Binary-Tree-Right-Side-View.md" >}})| Medium | O(n)| O(1)||
+|222. Count Complete Tree Nodes | [Go]({{< relref "/ChapterFour/0222.Count-Complete-Tree-Nodes.md" >}})| Medium | O(n)| O(1)||
+|226. Invert Binary Tree | [Go]({{< relref "/ChapterFour/0226.Invert-Binary-Tree.md" >}})| Easy | O(n)| O(1)||
+|230. Kth Smallest Element in a BST | [Go]({{< relref "/ChapterFour/0230.Kth-Smallest-Element-in-a-BST.md" >}})| Medium | O(n)| O(1)||
+|235. Lowest Common Ancestor of a Binary Search Tree | [Go]({{< relref "/ChapterFour/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md" >}})| Easy | O(n)| O(1)||
+|236. Lowest Common Ancestor of a Binary Tree | [Go]({{< relref "/ChapterFour/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md" >}})| Medium | O(n)| O(1)||
+|257. Binary Tree Paths | [Go]({{< relref "/ChapterFour/0257.Binary-Tree-Paths.md" >}})| Easy | O(n)| O(1)||
+|404. Sum of Left Leaves | [Go]({{< relref "/ChapterFour/0404.Sum-of-Left-Leaves.md" >}})| Easy | O(n)| O(1)||
+|437. Path Sum III | [Go]({{< relref "/ChapterFour/0437.Path-Sum-III.md" >}})| Easy | O(n)| O(1)||
+|515. Find Largest Value in Each Tree Row | [Go]({{< relref "/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}})| Medium | O(n)| O(n)||
+|637. Average of Levels in Binary Tree | [Go]({{< relref "/ChapterFour/0637.Average-of-Levels-in-Binary-Tree.md" >}})| Easy | O(n)| O(n)||
+|993. Cousins in Binary Tree | [Go]({{< relref "/ChapterFour/0993.Cousins-in-Binary-Tree.md" >}})| Easy | O(n)| O(1)||
+|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Two_Pointers.md b/website/content/ChapterTwo/Two_Pointers.md
new file mode 100644
index 00000000..ece49e88
--- /dev/null
+++ b/website/content/ChapterTwo/Two_Pointers.md
@@ -0,0 +1,83 @@
+---
+title: Two Pointers
+type: docs
+---
+
+# Two Pointers
+
+
+
+- 双指针滑动窗口的经典写法。右指针不断往右移，移动到不能往右移动为止(具体条件根据题目而定)。当右指针到最右边以后，开始挪动左指针，释放窗口左边界。第 3 题，第 76 题，第 209 题，第 424 题，第 438 题，第 567 题，第 713 题，第 763 题，第 845 题，第 881 题，第 904 题，第 978 题，第 992 题，第 1004 题，第 1040 题，第 1052 题。
+
+```c
+ left, right := 0, -1
+
+ for left < len(s) {
+ if right+1 < len(s) && freq[s[right+1]-'a'] == 0 {
+ freq[s[right+1]-'a']++
+ right++
+ } else {
+ freq[s[left]-'a']--
+ left++
+ }
+ result = max(result, right-left+1)
+ }
+```
+
+- 快慢指针可以查找重复数字，时间复杂度 O(n)，第 287 题。
+- 替换字母以后，相同字母能出现连续最长的长度。第 424 题。
+- SUM 问题集。第 1 题，第 15 题，第 16 题，第 18 题，第 167 题，第 923 题，第 1074 题。
+
+| Title | Solution | Difficulty | Time | Space |收藏|
+| ----- | :--------: | :----------: | :----: | :-----: | :-----: |
+|3. Longest Substring Without Repeating Characters | [Go]({{< relref "/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md" >}})| Medium | O(n)| O(1)|❤️|
+|11. Container With Most Water | [Go]({{< relref "/ChapterFour/0011.Container-With-Most-Water.md" >}})| Medium | O(n)| O(1)||
+|15. 3Sum | [Go]({{< relref "/ChapterFour/0015.3Sum.md" >}})| Medium | O(n^2)| O(n)|❤️|
+|16. 3Sum Closest | [Go]({{< relref "/ChapterFour/0016.3Sum-Closest.md" >}})| Medium | O(n^2)| O(1)|❤️|
+|18. 4Sum | [Go]({{< relref "/ChapterFour/0018.4Sum.md" >}})| Medium | O(n^3)| O(n^2)|❤️|
+|19. Remove Nth Node From End of List | [Go]({{< relref "/ChapterFour/0019.Remove-Nth-Node-From-End-of-List.md" >}})| Medium | O(n)| O(1)||
+|26. Remove Duplicates from Sorted Array | [Go]({{< relref "/ChapterFour/0026.Remove-Duplicates-from-Sorted-Array.md" >}})| Easy | O(n)| O(1)||
+|27. Remove Element | [Go]({{< relref "/ChapterFour/0027.Remove-Element.md" >}})| Easy | O(n)| O(1)||
+|28. Implement strStr() | [Go]({{< relref "/ChapterFour/0028.Implement-strStr.md" >}})| Easy | O(n)| O(1)||
+|30. Substring with Concatenation of All Words | [Go]({{< relref "/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md" >}})| Hard | O(n)| O(n)|❤️|
+|42. Trapping Rain Water | [Go]({{< relref "/ChapterFour/0042.Trapping-Rain-Water.md" >}})| Hard | O(n)| O(1)|❤️|
+|61. Rotate List | [Go]({{< relref "/ChapterFour/0061.Rotate-List.md" >}})| Medium | O(n)| O(1)||
+|75. Sort Colors | [Go]({{< relref "/ChapterFour/0075.Sort-Colors.md" >}})| Medium| O(n)| O(1)|❤️|
+|76. Minimum Window Substring | [Go]({{< relref "/ChapterFour/0076.Minimum-Window-Substring.md" >}})| Hard | O(n)| O(n)|❤️|
+|80. Remove Duplicates from Sorted Array II | [Go]({{< relref "/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md" >}})| Medium | O(n)| O(1||
+|86. Partition List | [Go]({{< relref "/ChapterFour/0086.Partition-List.md" >}})| Medium | O(n)| O(1)|❤️|
+|88. Merge Sorted Array | [Go]({{< relref "/ChapterFour/0088.Merge-Sorted-Array.md" >}})| Easy | O(n)| O(1)|❤️|
+|125. Valid Palindrome | [Go]({{< relref "/ChapterFour/0125.Valid-Palindrome.md" >}})| Easy | O(n)| O(1)||
+|141. Linked List Cycle | [Go]({{< relref "/ChapterFour/0141.Linked-List-Cycle.md" >}})| Easy | O(n)| O(1)|❤️|
+|142. Linked List Cycle II | [Go]({{< relref "/ChapterFour/0142.Linked-List-Cycle-II.md" >}})| Medium | O(n)| O(1)|❤️|
+|167. Two Sum II - Input array is sorted | [Go]({{< relref "/ChapterFour/0167.Two-Sum-II---Input-array-is-sorted.md" >}})| Easy | O(n)| O(1)||
+|209. Minimum Size Subarray Sum | [Go]({{< relref "/ChapterFour/0209.Minimum-Size-Subarray-Sum.md" >}})| Medium | O(n)| O(1)||
+|234. Palindrome Linked List | [Go]({{< relref "/ChapterFour/0234.Palindrome-Linked-List.md" >}})| Easy | O(n)| O(1)||
+|283. Move Zeroes | [Go]({{< relref "/ChapterFour/0283.Move-Zeroes.md" >}})| Easy | O(n)| O(1)||
+|287. Find the Duplicate Number | [Go]({{< relref "/ChapterFour/0287.Find-the-Duplicate-Number.md" >}})| Easy | O(n)| O(1)|❤️|
+|344. Reverse String | [Go]({{< relref "/ChapterFour/0344.Reverse-String.md" >}})| Easy | O(n)| O(1)||
+|345. Reverse Vowels of a String | [Go]({{< relref "/ChapterFour/0345.Reverse-Vowels-of-a-String.md" >}})| Easy | O(n)| O(1)||
+|349. Intersection of Two Arrays | [Go]({{< relref "/ChapterFour/0349.Intersection-of-Two-Arrays.md" >}})| Easy | O(n)| O(n) ||
+|350. Intersection of Two Arrays II | [Go]({{< relref "/ChapterFour/0350.Intersection-of-Two-Arrays-II.md" >}})| Easy | O(n)| O(n) ||
+|424. Longest Repeating Character Replacement | [Go]({{< relref "/ChapterFour/0424.Longest-Repeating-Character-Replacement.md" >}})| Medium | O(n)| O(1) ||
+|524. Longest Word in Dictionary through Deleting | [Go]({{< relref "/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})| Medium | O(n)| O(1) ||
+|532. K-diff Pairs in an Array | [Go]({{< relref "/ChapterFour/0532.K-diff-Pairs-in-an-Array.md" >}})| Easy | O(n)| O(n)||
+|567. Permutation in String | [Go]({{< relref "/ChapterFour/0567.Permutation-in-String.md" >}})| Medium | O(n)| O(1)|❤️|
+|713. Subarray Product Less Than K | [Go]({{< relref "/ChapterFour/0713.Subarray-Product-Less-Than-K.md" >}})| Medium | O(n)| O(1)||
+|763. Partition Labels | [Go]({{< relref "/ChapterFour/0763.Partition-Labels.md" >}})| Medium | O(n)| O(1)|❤️|
+|826. Most Profit Assigning Work | [Go]({{< relref "/ChapterFour/0826.Most-Profit-Assigning-Work.md" >}})| Medium | O(n log n)| O(n)||
+|828. Unique Letter String | [Go]({{< relref "/ChapterFour/0828.COPYRIGHT-PROBLEM-XXX.md" >}})| Hard | O(n)| O(1)|❤️|
+|838. Push Dominoes | [Go]({{< relref "/ChapterFour/0838.Push-Dominoes.md" >}})| Medium | O(n)| O(n)||
+|844. Backspace String Compare | [Go]({{< relref "/ChapterFour/0844.Backspace-String-Compare.md" >}})| Easy | O(n)| O(n) ||
+|845. Longest Mountain in Array | [Go]({{< relref "/ChapterFour/0845.Longest-Mountain-in-Array.md" >}})| Medium | O(n)| O(1) ||
+|881. Boats to Save People | [Go]({{< relref "/ChapterFour/0881.Boats-to-Save-People.md" >}})| Medium | O(n log n)| O(1) ||
+|904. Fruit Into Baskets | [Go]({{< relref "/ChapterFour/0904.Fruit-Into-Baskets.md" >}})| Medium | O(n log n)| O(1) ||
+|923. 3Sum With Multiplicity | [Go]({{< relref "/ChapterFour/0923.3Sum-With-Multiplicity.md" >}})| Medium | O(n^2)| O(n) ||
+|925. Long Pressed Name | [Go]({{< relref "/ChapterFour/0925.Long-Pressed-Name.md" >}})| Easy | O(n)| O(1)||
+|930. Binary Subarrays With Sum | [Go]({{< relref "/ChapterFour/0930.Binary-Subarrays-With-Sum.md" >}})| Medium | O(n)| O(n) |❤️|
+|977. Squares of a Sorted Array | [Go]({{< relref "/ChapterFour/0977.Squares-of-a-Sorted-Array.md" >}})| Easy | O(n)| O(1)||
+|986. Interval List Intersections | [Go]({{< relref "/ChapterFour/0986.Interval-List-Intersections.md" >}})| Medium | O(n)| O(1)||
+|992. Subarrays with K Different Integers | [Go]({{< relref "/ChapterFour/0992.Subarrays-with-K-Different-Integers.md" >}})| Hard | O(n)| O(n)|❤️|
+|1004. Max Consecutive Ones III | [Go]({{< relref "/ChapterFour/1004.Max-Consecutive-Ones-III.md" >}})| Medium | O(n)| O(1) ||
+|1093. Statistics from a Large Sample | [Go]({{< relref "/ChapterFour/1093.Statistics-from-a-Large-Sample.md" >}})| Medium | O(n)| O(1) ||
+|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/Union_Find.md b/website/content/ChapterTwo/Union_Find.md
new file mode 100644
index 00000000..79b693d5
--- /dev/null
+++ b/website/content/ChapterTwo/Union_Find.md
@@ -0,0 +1,38 @@
+---
+title: Union Find
+type: docs
+---
+
+# Union Find
+
+
+
+- 灵活使用并查集的思想，熟练掌握并查集的[模板]({{< relref "/ChapterThree/UnionFind.md" >}})，模板中有两种并查集的实现方式，一种是路径压缩 + 秩优化的版本，另外一种是计算每个集合中元素的个数 + 最大集合元素个数的版本，这两种版本都有各自使用的地方。能使用第一类并查集模板的题目有：第 128 题，第 130 题，第 547 题，第 684 题，第 721 题，第 765 题，第 778 题，第 839 题，第 924 题，第 928 题，第 947 题，第 952 题，第 959 题，第 990 题。能使用第二类并查集模板的题目有：第 803 题，第 952 题。第 803 题秩优化和统计集合个数这些地方会卡时间，如果不优化，会 TLE。
+- 并查集是一种思想，有些题需要灵活使用这种思想，而不是死套模板，如第 399 题，这一题是 stringUnionFind，利用并查集思想实现的。这里每个节点是基于字符串和 map 的，而不是单纯的用 int 节点编号实现的。
+- 有些题死套模板反而做不出来，比如第 685 题，这一题不能路径压缩和秩优化，因为题目中涉及到有向图，需要知道节点的前驱节点，如果路径压缩了，这一题就没法做了。这一题不需要路径压缩和秩优化。
+- 灵活的抽象题目给的信息，将给定的信息合理的编号，使用并查集解题，并用 map 降低时间复杂度，如第 721 题，第 959 题。
+- 关于地图，砖块，网格的题目，可以新建一个特殊节点，将四周边缘的砖块或者网格都 union() 到这个特殊节点上。第 130 题，第 803 题。
+- 能用并查集的题目，一般也可以用 DFS 和 BFS 解答，只不过时间复杂度会高一点。
+
+
+| Title | Solution | Difficulty | Time | Space | 收藏 |
+| ----- | :--------: | :----------: | :----: | :-----: |:-----: |
+|128. Longest Consecutive Sequence | [Go]({{< relref "/ChapterFour/0128.Longest-Consecutive-Sequence.md" >}})| Hard | O(n)| O(n)|❤️|
+|130. Surrounded Regions | [Go]({{< relref "/ChapterFour/0130.Surrounded-Regions.md" >}})| Medium | O(m\*n)| O(m\*n)||
+|200. Number of Islands | [Go]({{< relref "/ChapterFour/0200.Number-of-Islands.md" >}})| Medium | O(m\*n)| O(m\*n)||
+|399. Evaluate Division | [Go]({{< relref "/ChapterFour/0399.Evaluate-Division.md" >}})| Medium | O(n)| O(n)||
+|547. Friend Circles | [Go]({{< relref "/ChapterFour/0547.Friend-Circles.md" >}})| Medium | O(n^2)| O(n)||
+|684. Redundant Connection | [Go]({{< relref "/ChapterFour/0684.Redundant-Connection.md" >}})| Medium | O(n)| O(n)||
+|685. Redundant Connection II | [Go]({{< relref "/ChapterFour/0685.Redundant-Connection-II.md" >}})| Hard | O(n)| O(n)||
+|721. Accounts Merge | [Go]({{< relref "/ChapterFour/0721.Accounts-Merge.md" >}})| Medium | O(n)| O(n)|❤️|
+|765. Couples Holding Hands | [Go]({{< relref "/ChapterFour/0765.Couples-Holding-Hands.md" >}})| Hard | O(n)| O(n)|❤️|
+|778. Swim in Rising Water | [Go]({{< relref "/ChapterFour/0778.Swim-in-Rising-Water.md" >}})| Hard | O(n^2)| O(n)|❤️|
+|803. Bricks Falling When Hit | [Go]({{< relref "/ChapterFour/0803.Bricks-Falling-When-Hit.md" >}})| Hard | O(n^2)| O(n)|❤️|
+|839. Similar String Groups | [Go]({{< relref "/ChapterFour/0839.Similar-String-Groups.md" >}})| Hard | O(n^2)| O(n)||
+|924. Minimize Malware Spread | [Go]({{< relref "/ChapterFour/0924.Minimize-Malware-Spread.md" >}})| Hard | O(m\*n)| O(n)||
+|928. Minimize Malware Spread II | [Go]({{< relref "/ChapterFour/0928.Minimize-Malware-Spread-II.md" >}})| Hard | O(m\*n)| O(n)|❤️|
+|947. Most Stones Removed with Same Row or Column | [Go]({{< relref "/ChapterFour/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})| Medium | O(n)| O(n)||
+|952. Largest Component Size by Common Factor | [Go]({{< relref "/ChapterFour/0952.Largest-Component-Size-by-Common-Factor.md" >}})| Hard | O(n)| O(n)|❤️|
+|959. Regions Cut By Slashes | [Go]({{< relref "/ChapterFour/0959.Regions-Cut-By-Slashes.md" >}})| Medium | O(n^2)| O(n^2)|❤️|
+|990. Satisfiability of Equality Equations | [Go]({{< relref "/ChapterFour/0990.Satisfiability-of-Equality-Equations.md" >}})| Medium | O(n)| O(n)||
+|---------------------------------------|---------------------------------|--------------------------|-----------------------|-----------|--------|
\ No newline at end of file
diff --git a/website/content/ChapterTwo/_index.md b/website/content/ChapterTwo/_index.md
index 7ead9b42..c28b73c5 100644
--- a/website/content/ChapterTwo/_index.md
+++ b/website/content/ChapterTwo/_index.md
@@ -3,7 +3,14 @@ title: 第二章
type: docs
---
-# 第二章
+# 第二章 算法专题
+
+
+
+
+
+
+
本来天真的认为，把 LeetCode 所有题都完整刷一遍，就可以完整这本书了。经过事实证明，确实是天真了。因为 LeetCode 每天都会增加新题，有时候工作忙了，刷题进度就完全追不上题目更新的速度了。而且以我当前的刷题速度，一年才完成 500+，一年 LeetCode 也会更新 400+ 多题，要起码 5~10 年才能把所有的题目刷完。时间太长了。所以先给自己定了一个小目标，500 题就先把书写出来，总结这个阶段的刷题心得，和大家一起交流。要想把 LeetCode 所有题目都刷完，看来这本书要迭代 5 ~ 10 个版本了(一年迭代一版)。
diff --git a/website/content/_index.md b/website/content/_index.md
index c713f535..d265c7eb 100644
--- a/website/content/_index.md
+++ b/website/content/_index.md
@@ -66,6 +66,10 @@ LeetCode 统计代码运行时长会有波动的，相同的代码提交 10 次
本书的算法全部用 Go 语言实现。
+## 使用说明
+
+- 本电子书的左上角有搜索栏，可以迅速帮你找到你想看的章节和题号。
+- 本电子书每页都接入了 Gitalk，每一页的最下方都有评论框可以评论，如果没有显示出来，请检查自己的网络。
## 互动与勘误
diff --git a/website/content/menu/index.md b/website/content/menu/index.md
index 7fb7dd6b..12a60f64 100644
--- a/website/content/menu/index.md
+++ b/website/content/menu/index.md
@@ -6,474 +6,503 @@ headless: true
- [第一章 序章]({{< relref "/ChapterOne/_index.md" >}})
- [1.1 关于作者]({{< relref "/ChapterOne/#关于作者" >}})
- - [1.2 预备知识]({{< relref "" >}})
+ - 1.2 预备知识
- [第二章 算法专题]({{< relref "/ChapterTwo/_index.md" >}})
- - [2.1 Array]({{< relref "/docs/example/table-of-contents/with-toc" >}})
- - [2.2 String]({{< relref "/docs/example/table-of-contents/with-toc" >}})
- - [2.3 Two Pointers]({{< relref "/docs/example/table-of-contents/with-toc" >}})
- - [2.4 Linked List]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [2.5 Stack]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [2.6 Tree]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [2.7 Dynamic programming]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [2.8 Backtracking]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [2.9 Depth-first search]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [2.10 Breadth-first Search]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [2.11 Binary Search]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [2.12 Math]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [2.13 Hash Table]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [2.14 Sort]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [2.15 Bit Manipulation]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [2.16 Union Find]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [2.17 Sliding Window]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [2.18 Segment Tree]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [2.19 Binary Indexed Tree]({{< relref "/docs/example/table-of-contents/without-toc" >}})
-- [第三章 一些模板]({{< relref "/docs/example" >}})
- - [3.1 Segment Tree]({{< relref "/docs/example/table-of-contents/without-toc" >}})
- - [3.2 UnionFind]({{< relref "/docs/example/table-of-contents/without-toc" >}})
-- [第四章 Leetcode 题解]({{< relref "/docs/example" >}})
- - [0001. Two Sum]({{< relref "/ChapterFour/0001. Two Sum.md" >}})
- - [0002. Add Two Numbers]({{< relref "/ChapterFour/0002. Add Two Numbers.md" >}})
- - [0003. Longest Substring Without Repeating Characters]({{< relref "/ChapterFour/0003. Longest Substring Without Repeating Characters.md" >}})
- - [0004. Median of Two Sorted Arrays]({{< relref "/ChapterFour/0004. Median of Two Sorted Arrays.md" >}})
- - [0007. Reverse Integer]({{< relref "/ChapterFour/0007. Reverse Integer.md" >}})
- - [0011. Container With Most Water]({{< relref "/ChapterFour/0011. Container With Most Water.md" >}})
- - [0015. 3Sum]({{< relref "/ChapterFour/0015. 3Sum.md" >}})
- - [0016. 3Sum Closest]({{< relref "/ChapterFour/0016. 3Sum Closest.md" >}})
- - [0017. Letter Combinations of a Phone Number]({{< relref "/ChapterFour/0017. Letter Combinations of a Phone Number.md" >}})
- - [0018. 4Sum]({{< relref "/ChapterFour/0018. 4Sum.md" >}})
- - [0019. Remove Nth Node From End of List]({{< relref "/ChapterFour/0019. Remove Nth Node From End of List.md" >}})
- - [0020. Valid-Parentheses]({{< relref "/ChapterFour/0020. Valid-Parentheses.md" >}})
- - [0021. Merge Two Sorted Lists]({{< relref "/ChapterFour/0021. Merge Two Sorted Lists.md" >}})
- - [0022. Generate Parentheses]({{< relref "/ChapterFour/0022. Generate Parentheses.md" >}})
- - [0023. Merge k Sorted Lists]({{< relref "/ChapterFour/0023. Merge k Sorted Lists.md" >}})
- - [0024. Swap Nodes in Pairs]({{< relref "/ChapterFour/0024. Swap Nodes in Pairs.md" >}})
- - [0025. Reverse Nodes in k Group]({{< relref "/ChapterFour/0025. Reverse Nodes in k Group.md" >}})
- - [0026. Remove Duplicates from Sorted Array]({{< relref "/ChapterFour/0026. Remove Duplicates from Sorted Array.md" >}})
- - [0027. Remove Element]({{< relref "/ChapterFour/0027. Remove Element.md" >}})
- - [0028. Implement strStr()]({{< relref "/ChapterFour/0028. Implement strStr().md" >}})
- - [0029. Divide Two Integers]({{< relref "/ChapterFour/0029. Divide Two Integers.md" >}})
- - [0030. Substring with Concatenation of All Words]({{< relref "/ChapterFour/0030. Substring with Concatenation of All Words.md" >}})
- - [0033. Search in Rotated Sorted Array]({{< relref "/ChapterFour/0033. Search in Rotated Sorted Array.md" >}})
- - [0034. Find First and Last Position of Element in Sorted Array]({{< relref "/ChapterFour/0034. Find First and Last Position of Element in Sorted Array.md" >}})
- - [0035. Search Insert Position]({{< relref "/ChapterFour/0035. Search Insert Position.md" >}})
- - [0036. Valid Sudoku]({{< relref "/ChapterFour/0036. Valid Sudoku.md" >}})
- - [0037. Sudoku Solver]({{< relref "/ChapterFour/0037. Sudoku Solver.md" >}})
- - [0039. Combination Sum]({{< relref "/ChapterFour/0039. Combination Sum.md" >}})
- - [0040. Combination Sum II]({{< relref "/ChapterFour/0040. Combination Sum II.md" >}})
- - [0041. First-Missing-Positive]({{< relref "/ChapterFour/0041. First-Missing-Positive.md" >}})
- - [0042. Trapping Rain Water]({{< relref "/ChapterFour/0042. Trapping Rain Water.md" >}})
- - [0046. Permutations]({{< relref "/ChapterFour/0046. Permutations.md" >}})
- - [0047. Permutations II]({{< relref "/ChapterFour/0047. Permutations II.md" >}})
- - [0048. Rotate Image]({{< relref "/ChapterFour/0048. Rotate Image.md" >}})
- - [0049. Group Anagrams]({{< relref "/ChapterFour/0049. Group Anagrams.md" >}})
- - [0050. Pow(x, n)]({{< relref "/ChapterFour/0050. Pow(x, n).md" >}})
- - [0051. N-Queens]({{< relref "/ChapterFour/0051. N-Queens.md" >}})
- - [0052. N-Queens II]({{< relref "/ChapterFour/0052. N-Queens II.md" >}})
- - [0053. Maximum Subarray]({{< relref "/ChapterFour/0053. Maximum Subarray.md" >}})
- - [0054. Spiral Matrix]({{< relref "/ChapterFour/0054. Spiral Matrix.md" >}})
- - [0056. Merge Intervals]({{< relref "/ChapterFour/0056. Merge Intervals.md" >}})
- - [0057. Insert Interval]({{< relref "/ChapterFour/0057. Insert Interval.md" >}})
- - [0059. Spiral Matrix II]({{< relref "/ChapterFour/0059. Spiral Matrix II.md" >}})
- - [0060. Permutation Sequence]({{< relref "/ChapterFour/0060. Permutation Sequence.md" >}})
- - [0061. Rotate List]({{< relref "/ChapterFour/0061. Rotate List.md" >}})
- - [0062. Unique Paths]({{< relref "/ChapterFour/0062. Unique Paths.md" >}})
- - [0063. Unique Paths II]({{< relref "/ChapterFour/0063. Unique Paths II.md" >}})
- - [0064. Minimum Path Sum]({{< relref "/ChapterFour/0064. Minimum Path Sum.md" >}})
- - [0066. Plus One]({{< relref "/ChapterFour/0066. Plus One.md" >}})
- - [0069. Sqrt(x)]({{< relref "/ChapterFour/0069. Sqrt(x).md" >}})
- - [0070. Climbing Stairs]({{< relref "/ChapterFour/0070. Climbing Stairs.md" >}})
- - [0071. Simplify Path]({{< relref "/ChapterFour/0071. Simplify Path.md" >}})
- - [0074. Search a 2D Matrix]({{< relref "/ChapterFour/0074. Search a 2D Matrix.md" >}})
- - [0075. Sort Colors]({{< relref "/ChapterFour/0075. Sort Colors.md" >}})
- - [0076. Minimum Window Substring]({{< relref "/ChapterFour/0076. Minimum Window Substring.md" >}})
- - [0077. Combinations]({{< relref "/ChapterFour/0077. Combinations.md" >}})
- - [0078. Subsets]({{< relref "/ChapterFour/0078. Subsets.md" >}})
- - [0079. Word Search]({{< relref "/ChapterFour/0079. Word Search.md" >}})
- - [0080. Remove Duplicates from Sorted Array II]({{< relref "/ChapterFour/0080. Remove Duplicates from Sorted Array II.md" >}})
- - [0081. Search in Rotated Sorted Array II]({{< relref "/ChapterFour/0081. Search in Rotated Sorted Array II.md" >}})
- - [0082. Remove Duplicates from Sorted List II]({{< relref "/ChapterFour/0082. Remove Duplicates from Sorted List II.md" >}})
- - [0083. Remove Duplicates from Sorted List]({{< relref "/ChapterFour/0083. Remove Duplicates from Sorted List.md" >}})
- - [0084. Largest Rectangle in Histogram]({{< relref "/ChapterFour/0084. Largest Rectangle in Histogram.md" >}})
- - [0086. Partition List]({{< relref "/ChapterFour/0086. Partition List.md" >}})
- - [0088. Merge Sorted Array]({{< relref "/ChapterFour/0088. Merge Sorted Array.md" >}})
- - [0089. Gray Code]({{< relref "/ChapterFour/0089. Gray Code.md" >}})
- - [0090. Subsets II]({{< relref "/ChapterFour/0090. Subsets II.md" >}})
- - [0091. Decode Ways]({{< relref "/ChapterFour/0091. Decode Ways.md" >}})
- - [0092. Reverse Linked List II]({{< relref "/ChapterFour/0092. Reverse Linked List II.md" >}})
- - [0093. Restore IP Addresses]({{< relref "/ChapterFour/0093. Restore IP Addresses.md" >}})
- - [0094. Binary Tree Inorder Traversal]({{< relref "/ChapterFour/0094. Binary Tree Inorder Traversal.md" >}})
- - [0095. Unique Binary Search Trees II]({{< relref "/ChapterFour/0095. Unique Binary Search Trees II.md" >}})
- - [0096. Unique Binary Search Trees]({{< relref "/ChapterFour/0096. Unique Binary Search Trees.md" >}})
- - [0098. Validate Binary Search Tree]({{< relref "/ChapterFour/0098. Validate Binary Search Tree.md" >}})
- - [0099. Recover Binary Search Tree]({{< relref "/ChapterFour/0099. Recover Binary Search Tree.md" >}})
- - [0100. Same Tree]({{< relref "/ChapterFour/0100. Same Tree.md" >}})
- - [0101. Symmetric Tree]({{< relref "/ChapterFour/0101. Symmetric Tree.md" >}})
- - [0102. Binary Tree Level Order Traversal]({{< relref "/ChapterFour/0102. Binary Tree Level Order Traversal.md" >}})
- - [0103. Binary Tree Zigzag Level Order Traversal]({{< relref "/ChapterFour/0103. Binary Tree Zigzag Level Order Traversal.md" >}})
- - [0104. Maximum Depth of Binary Tree]({{< relref "/ChapterFour/0104. Maximum Depth of Binary Tree.md" >}})
- - [0105. Construct Binary Tree from Preorder and Inorder Traversal]({{< relref "/ChapterFour/0105. Construct Binary Tree from Preorder and Inorder Traversal.md" >}})
- - [0106. Construct Binary Tree from Inorder and Postorder Traversal]({{< relref "/ChapterFour/0106. Construct Binary Tree from Inorder and Postorder Traversal.md" >}})
- - [0107. Binary Tree Level Order Traversal II]({{< relref "/ChapterFour/0107. Binary Tree Level Order Traversal II.md" >}})
- - [0108. Convert Sorted Array to Binary Search Tree]({{< relref "/ChapterFour/0108. Convert Sorted Array to Binary Search Tree.md" >}})
- - [0109. Convert Sorted List to Binary Search Tree]({{< relref "/ChapterFour/0109. Convert Sorted List to Binary Search Tree.md" >}})
- - [0110. Balanced Binary Tree]({{< relref "/ChapterFour/0110. Balanced Binary Tree.md" >}})
- - [0111. Minimum Depth of Binary Tree]({{< relref "/ChapterFour/0111. Minimum Depth of Binary Tree.md" >}})
- - [0112. Path Sum]({{< relref "/ChapterFour/0112. Path Sum.md" >}})
- - [0113. Path Sum II]({{< relref "/ChapterFour/0113. Path Sum II.md" >}})
- - [0114. Flatten Binary Tree to Linked List]({{< relref "/ChapterFour/0114. Flatten Binary Tree to Linked List.md" >}})
- - [0120. Triangle]({{< relref "/ChapterFour/0120. Triangle.md" >}})
- - [0121. Best Time to Buy and Sell Stock]({{< relref "/ChapterFour/0121. Best Time to Buy and Sell Stock.md" >}})
- - [0122. Best Time to Buy and Sell Stock II]({{< relref "/ChapterFour/0122. Best Time to Buy and Sell Stock II.md" >}})
- - [0124. Binary Tree Maximum Path Sum]({{< relref "/ChapterFour/0124. Binary Tree Maximum Path Sum.md" >}})
- - [0125. Valid-Palindrome]({{< relref "/ChapterFour/0125. Valid-Palindrome.md" >}})
- - [0126. Word Ladder II]({{< relref "/ChapterFour/0126. Word Ladder II.md" >}})
- - [0127. Word Ladder]({{< relref "/ChapterFour/0127. Word Ladder.md" >}})
- - [0128. Longest Consecutive Sequence]({{< relref "/ChapterFour/0128. Longest Consecutive Sequence.md" >}})
- - [0129. Sum Root to Leaf Numbers]({{< relref "/ChapterFour/0129. Sum Root to Leaf Numbers.md" >}})
- - [0130. Surrounded Regions]({{< relref "/ChapterFour/0130. Surrounded Regions.md" >}})
- - [0131. Palindrome Partitioning]({{< relref "/ChapterFour/0131. Palindrome Partitioning.md" >}})
- - [0136. Single Number]({{< relref "/ChapterFour/0136. Single Number.md" >}})
- - [0137. Single Number II]({{< relref "/ChapterFour/0137. Single Number II.md" >}})
- - [0141. Linked List Cycle]({{< relref "/ChapterFour/0141. Linked List Cycle.md" >}})
- - [0142. Linked List Cycle II]({{< relref "/ChapterFour/0142. Linked List Cycle II.md" >}})
- - [0143. Reorder List]({{< relref "/ChapterFour/0143. Reorder List.md" >}})
- - [0144. Binary Tree Preorder Traversal]({{< relref "/ChapterFour/0144. Binary Tree Preorder Traversal.md" >}})
- - [0145. Binary Tree Postorder Traversal]({{< relref "/ChapterFour/0145. Binary Tree Postorder Traversal.md" >}})
- - [0147. Insertion Sort List]({{< relref "/ChapterFour/0147. Insertion Sort List.md" >}})
- - [0148. Sort List]({{< relref "/ChapterFour/0148. Sort List.md" >}})
- - [0150. Evaluate Reverse Polish Notation]({{< relref "/ChapterFour/0150. Evaluate Reverse Polish Notation.md" >}})
- - [0151. Reverse Words in a String]({{< relref "/ChapterFour/0151. Reverse Words in a String.md" >}})
- - [0152. Maximum Product Subarray]({{< relref "/ChapterFour/0152. Maximum Product Subarray.md" >}})
- - [0153. Find Minimum in Rotated Sorted Array]({{< relref "/ChapterFour/0153. Find Minimum in Rotated Sorted Array.md" >}})
- - [0154. Find Minimum in Rotated Sorted Array II]({{< relref "/ChapterFour/0154. Find Minimum in Rotated Sorted Array II.md" >}})
- - [0155. Min Stack]({{< relref "/ChapterFour/0155. Min Stack.md" >}})
- - [0160. Intersection of Two Linked Lists]({{< relref "/ChapterFour/0160. Intersection of Two Linked Lists.md" >}})
- - [0162. Find Peak Element]({{< relref "/ChapterFour/0162. Find Peak Element.md" >}})
- - [0164. Maximum Gap]({{< relref "/ChapterFour/0164. Maximum Gap.md" >}})
- - [0167. Two Sum II - Input array is sorted]({{< relref "/ChapterFour/0167. Two Sum II - Input array is sorted.md" >}})
- - [0169. Majority Element]({{< relref "/ChapterFour/0169. Majority Element.md" >}})
- - [0172. Factorial Trailing Zeroes]({{< relref "/ChapterFour/0172. Factorial Trailing Zeroes.md" >}})
- - [0173. Binary Search Tree Iterator]({{< relref "/ChapterFour/0173. Binary Search Tree Iterator.md" >}})
- - [0174. Dungeon Game]({{< relref "/ChapterFour/0174. Dungeon Game.md" >}})
- - [0179. Largest Number]({{< relref "/ChapterFour/0179. Largest Number.md" >}})
- - [0187. Repeated DNA Sequences]({{< relref "/ChapterFour/0187. Repeated DNA Sequences.md" >}})
- - [0190. Reverse Bits]({{< relref "/ChapterFour/0190. Reverse Bits.md" >}})
- - [0191. Number of 1 Bits]({{< relref "/ChapterFour/0191. Number of 1 Bits.md" >}})
- - [0198. House Robber]({{< relref "/ChapterFour/0198. House Robber.md" >}})
- - [0199. Binary Tree Right Side View]({{< relref "/ChapterFour/0199. Binary Tree Right Side View.md" >}})
- - [0200. Number of Islands]({{< relref "/ChapterFour/0200. Number of Islands.md" >}})
- - [0201. Bitwise AND of Numbers Range]({{< relref "/ChapterFour/0201. Bitwise AND of Numbers Range.md" >}})
- - [0202. Happy Number]({{< relref "/ChapterFour/0202. Happy Number.md" >}})
- - [0203. Remove Linked List Elements]({{< relref "/ChapterFour/0203. Remove Linked List Elements.md" >}})
- - [0204. Count Primes]({{< relref "/ChapterFour/0204. Count Primes.md" >}})
- - [0205. Isomorphic Strings]({{< relref "/ChapterFour/0205. Isomorphic Strings.md" >}})
- - [0206. Reverse-Linked-List]({{< relref "/ChapterFour/0206. Reverse-Linked-List.md" >}})
- - [0207. Course Schedule]({{< relref "/ChapterFour/0207. Course Schedule.md" >}})
- - [0208. Implement Trie (Prefix Tree)]({{< relref "/ChapterFour/0208. Implement Trie (Prefix Tree).md" >}})
- - [0209. Minimum Size Subarray Sum]({{< relref "/ChapterFour/0209. Minimum Size Subarray Sum.md" >}})
- - [0210. Course Schedule II]({{< relref "/ChapterFour/0210. Course Schedule II.md" >}})
- - [0211. Add and Search Word - Data structure design]({{< relref "/ChapterFour/0211. Add and Search Word - Data structure design.md" >}})
- - [0212. Word Search II]({{< relref "/ChapterFour/0212. Word Search II.md" >}})
- - [0213. House Robber II]({{< relref "/ChapterFour/0213. House Robber II.md" >}})
- - [0215. Kth Largest Element in an Array]({{< relref "/ChapterFour/0215. Kth Largest Element in an Array.md" >}})
- - [0216. Combination Sum III]({{< relref "/ChapterFour/0216. Combination Sum III.md" >}})
- - [0217. Contains Duplicate]({{< relref "/ChapterFour/0217. Contains Duplicate.md" >}})
- - [0218. The Skyline Problem]({{< relref "/ChapterFour/0218. The Skyline Problem.md" >}})
- - [0219. Contains Duplicate II]({{< relref "/ChapterFour/0219. Contains Duplicate II.md" >}})
- - [0220. Contains Duplicate III]({{< relref "/ChapterFour/0220. Contains Duplicate III.md" >}})
- - [0222. Count Complete Tree Nodes]({{< relref "/ChapterFour/0222. Count Complete Tree Nodes.md" >}})
- - [0223. Rectangle Area]({{< relref "/ChapterFour/0223. Rectangle Area.md" >}})
- - [0224. Basic Calculator]({{< relref "/ChapterFour/0224. Basic Calculator.md" >}})
- - [0225. Implement Stack using Queues]({{< relref "/ChapterFour/0225. Implement Stack using Queues.md" >}})
- - [0226. Invert Binary Tree]({{< relref "/ChapterFour/0226. Invert Binary Tree.md" >}})
- - [0229. Majority Element II]({{< relref "/ChapterFour/0229. Majority Element II.md" >}})
- - [0230. Kth Smallest Element in a BST]({{< relref "/ChapterFour/0230. Kth Smallest Element in a BST.md" >}})
- - [0231. Power of Two]({{< relref "/ChapterFour/0231. Power of Two.md" >}})
- - [0232. Implement Queue using Stacks]({{< relref "/ChapterFour/0232. Implement Queue using Stacks.md" >}})
- - [0234. Palindrome Linked List]({{< relref "/ChapterFour/0234. Palindrome Linked List.md" >}})
- - [0235. Lowest Common Ancestor of a Binary Search Tree]({{< relref "/ChapterFour/0235. Lowest Common Ancestor of a Binary Search Tree.md" >}})
- - [0236. Lowest Common Ancestor of a Binary Tree]({{< relref "/ChapterFour/0236. Lowest Common Ancestor of a Binary Tree.md" >}})
- - [0237. Delete Node in a Linked List]({{< relref "/ChapterFour/0237. Delete Node in a Linked List.md" >}})
- - [0239. Sliding Window Maximum]({{< relref "/ChapterFour/0239. Sliding Window Maximum.md" >}})
- - [0240. Search a 2D Matrix II]({{< relref "/ChapterFour/0240. Search a 2D Matrix II.md" >}})
- - [0242. Valid Anagram]({{< relref "/ChapterFour/0242. Valid Anagram.md" >}})
- - [0257. Binary Tree Paths]({{< relref "/ChapterFour/0257. Binary Tree Paths.md" >}})
- - [0260. Single Number III]({{< relref "/ChapterFour/0260. Single Number III.md" >}})
- - [0263. Ugly Number]({{< relref "/ChapterFour/0263. Ugly Number.md" >}})
- - [0268. Missing Number]({{< relref "/ChapterFour/0268. Missing Number.md" >}})
- - [0274. H-Index]({{< relref "/ChapterFour/0274. H-Index.md" >}})
- - [0275. H-Index II]({{< relref "/ChapterFour/0275. H-Index II.md" >}})
- - [0283. Move Zeroes]({{< relref "/ChapterFour/0283. Move Zeroes.md" >}})
- - [0287. Find the Duplicate Number]({{< relref "/ChapterFour/0287. Find the Duplicate Number.md" >}})
- - [0290. Word Pattern]({{< relref "/ChapterFour/0290. Word Pattern.md" >}})
- - [0300. Longest Increasing Subsequence]({{< relref "/ChapterFour/0300. Longest Increasing Subsequence.md" >}})
- - [0303. Range Sum Query - Immutable]({{< relref "/ChapterFour/0303. Range Sum Query - Immutable.md" >}})
- - [0306. Additive Number]({{< relref "/ChapterFour/0306. Additive Number.md" >}})
- - [0307. Range Sum Query - Mutable]({{< relref "/ChapterFour/0307. Range Sum Query - Mutable.md" >}})
- - [0309. Best Time to Buy and Sell Stock with Cooldown]({{< relref "/ChapterFour/0309. Best Time to Buy and Sell Stock with Cooldown.md" >}})
- - [0315. Count of Smaller Numbers After Self]({{< relref "/ChapterFour/0315. Count of Smaller Numbers After Self.md" >}})
- - [0318. Maximum Product of Word Lengths]({{< relref "/ChapterFour/0318. Maximum Product of Word Lengths.md" >}})
- - [0322. Coin Change]({{< relref "/ChapterFour/0322. Coin Change.md" >}})
- - [0324. Wiggle Sort II]({{< relref "/ChapterFour/0324. Wiggle Sort II.md" >}})
- - [0326. Power of Three]({{< relref "/ChapterFour/0326. Power of Three.md" >}})
- - [0327. Count of Range Sum]({{< relref "/ChapterFour/0327. Count of Range Sum.md" >}})
- - [0328. Odd Even Linked List]({{< relref "/ChapterFour/0328. Odd Even Linked List.md" >}})
- - [0329. Longest Increasing Path in a Matrix]({{< relref "/ChapterFour/0329. Longest Increasing Path in a Matrix.md" >}})
- - [0331. Verify Preorder Serialization of a Binary Tree]({{< relref "/ChapterFour/0331. Verify Preorder Serialization of a Binary Tree.md" >}})
- - [0338. Counting Bits]({{< relref "/ChapterFour/0338. Counting Bits.md" >}})
- - [0342. Power of Four]({{< relref "/ChapterFour/0342. Power of Four.md" >}})
- - [0343. Integer Break]({{< relref "/ChapterFour/0343. Integer Break.md" >}})
- - [0344. Reverse String]({{< relref "/ChapterFour/0344. Reverse String.md" >}})
- - [0345. Reverse Vowels of a String]({{< relref "/ChapterFour/0345. Reverse Vowels of a String.md" >}})
- - [0347. Top K Frequent Elements]({{< relref "/ChapterFour/0347. Top K Frequent Elements.md" >}})
- - [0349. Intersection of Two Arrays]({{< relref "/ChapterFour/0349. Intersection of Two Arrays.md" >}})
- - [0350. Intersection of Two Arrays II]({{< relref "/ChapterFour/0350. Intersection of Two Arrays II.md" >}})
- - [0354. Russian Doll Envelopes]({{< relref "/ChapterFour/0354. Russian Doll Envelopes.md" >}})
- - [0357. Count Numbers with Unique Digits]({{< relref "/ChapterFour/0357. Count Numbers with Unique Digits.md" >}})
- - [0367. Valid Perfect Square]({{< relref "/ChapterFour/0367. Valid Perfect Square.md" >}})
- - [0371. Sum of Two Integers]({{< relref "/ChapterFour/0371. Sum of Two Integers.md" >}})
- - [0372. Super Pow]({{< relref "/ChapterFour/0372. Super Pow.md" >}})
- - [0373. Find K Pairs with Smallest Sums]({{< relref "/ChapterFour/0373. Find K Pairs with Smallest Sums.md" >}})
- - [0378. Kth Smallest Element in a Sorted Matrix]({{< relref "/ChapterFour/0378. Kth Smallest Element in a Sorted Matrix.md" >}})
- - [0385. Mini Parser]({{< relref "/ChapterFour/0385. Mini Parser.md" >}})
- - [0386. Lexicographical Numbers]({{< relref "/ChapterFour/0386. Lexicographical Numbers.md" >}})
- - [0387. First Unique Character in a String]({{< relref "/ChapterFour/0387. First Unique Character in a String.md" >}})
- - [0389. Find the Difference]({{< relref "/ChapterFour/0389. Find the Difference.md" >}})
- - [0392. Is Subsequence]({{< relref "/ChapterFour/0392. Is Subsequence.md" >}})
- - [0393. UTF-8 Validation]({{< relref "/ChapterFour/0393. UTF-8 Validation.md" >}})
- - [0394. Decode String]({{< relref "/ChapterFour/0394. Decode String.md" >}})
- - [0397. Integer Replacement]({{< relref "/ChapterFour/0397. Integer Replacement.md" >}})
- - [0399. Evaluate Division]({{< relref "/ChapterFour/0399. Evaluate Division.md" >}})
- - [0401. Binary Watch]({{< relref "/ChapterFour/0401. Binary Watch.md" >}})
- - [0402. Remove K Digits]({{< relref "/ChapterFour/0402. Remove K Digits.md" >}})
- - [0404. Sum of Left Leaves]({{< relref "/ChapterFour/0404. Sum of Left Leaves.md" >}})
- - [0405. Convert a Number to Hexadecimal]({{< relref "/ChapterFour/0405. Convert a Number to Hexadecimal.md" >}})
- - [0409. Longest Palindrome]({{< relref "/ChapterFour/0409. Longest Palindrome.md" >}})
- - [0410. Split Array Largest Sum]({{< relref "/ChapterFour/0410. Split Array Largest Sum.md" >}})
- - [0412. Fizz Buzz]({{< relref "/ChapterFour/0412. Fizz Buzz.md" >}})
- - [0414. Third Maximum Number]({{< relref "/ChapterFour/0414. Third Maximum Number.md" >}})
- - [0416. Partition Equal Subset Sum]({{< relref "/ChapterFour/0416. Partition Equal Subset Sum.md" >}})
- - [0421. Maximum XOR of Two Numbers in an Array]({{< relref "/ChapterFour/0421. Maximum XOR of Two Numbers in an Array.md" >}})
- - [0424. Longest Repeating Character Replacement]({{< relref "/ChapterFour/0424. Longest Repeating Character Replacement.md" >}})
- - [0433. Minimum Genetic Mutation]({{< relref "/ChapterFour/0433. Minimum Genetic Mutation.md" >}})
- - [0435. Non-overlapping Intervals]({{< relref "/ChapterFour/0435. Non-overlapping Intervals.md" >}})
- - [0436. Find Right Interval]({{< relref "/ChapterFour/0436. Find Right Interval.md" >}})
- - [0437. Path Sum III]({{< relref "/ChapterFour/0437. Path Sum III.md" >}})
- - [0438. Find All Anagrams in a String]({{< relref "/ChapterFour/0438. Find All Anagrams in a String.md" >}})
- - [0441. Arranging Coins]({{< relref "/ChapterFour/0441. Arranging Coins.md" >}})
- - [0445. Add Two Numbers II]({{< relref "/ChapterFour/0445. Add Two Numbers II.md" >}})
- - [0447. Number of Boomerangs]({{< relref "/ChapterFour/0447. Number of Boomerangs.md" >}})
- - [0451. Sort Characters By Frequency]({{< relref "/ChapterFour/0451. Sort Characters By Frequency.md" >}})
- - [0454. 4Sum II]({{< relref "/ChapterFour/0454. 4Sum II.md" >}})
- - [0455. Assign Cookies]({{< relref "/ChapterFour/0455. Assign Cookies.md" >}})
- - [0456. 132 Pattern]({{< relref "/ChapterFour/0456. 132 Pattern.md" >}})
- - [0457. Circular Array Loop]({{< relref "/ChapterFour/0457. Circular Array Loop.md" >}})
- - [0461. Hamming Distance]({{< relref "/ChapterFour/0461. Hamming Distance.md" >}})
- - [0463. Island Perimeter]({{< relref "/ChapterFour/0463. Island Perimeter.md" >}})
- - [0470. Implement Rand10() Using Rand7()]({{< relref "/ChapterFour/0470. Implement Rand10() Using Rand7().md" >}})
- - [0474. Ones and Zeroes]({{< relref "/ChapterFour/0474. Ones and Zeroes.md" >}})
- - [0475. Heaters]({{< relref "/ChapterFour/0475. Heaters.md" >}})
- - [0476. Number Complement]({{< relref "/ChapterFour/0476. Number Complement.md" >}})
- - [0477. Total Hamming Distance]({{< relref "/ChapterFour/0477. Total Hamming Distance.md" >}})
- - [0480. Sliding Window Median]({{< relref "/ChapterFour/0480. Sliding Window Median.md" >}})
- - [0483. Smallest Good Base]({{< relref "/ChapterFour/0483. Smallest Good Base.md" >}})
- - [0491. Increasing Subsequences]({{< relref "/ChapterFour/0491. Increasing Subsequences.md" >}})
- - [0493. Reverse Pairs]({{< relref "/ChapterFour/0493. Reverse Pairs.md" >}})
- - [0496. Next Greater Element I]({{< relref "/ChapterFour/0496. Next Greater Element I.md" >}})
- - [0497. Random Point in Non-overlapping Rectangles]({{< relref "/ChapterFour/0497. Random Point in Non-overlapping Rectangles.md" >}})
- - [0498. Diagonal Traverse]({{< relref "/ChapterFour/0498. Diagonal Traverse.md" >}})
- - [0500. Keyboard Row]({{< relref "/ChapterFour/0500. Keyboard Row.md" >}})
- - [0503. Next Greater Element II]({{< relref "/ChapterFour/0503. Next Greater Element II.md" >}})
- - [0508. Most Frequent Subtree Sum]({{< relref "/ChapterFour/0508. Most Frequent Subtree Sum.md" >}})
- - [0509. Fibonacci Number]({{< relref "/ChapterFour/0509. Fibonacci Number.md" >}})
- - [0513. Find Bottom Left Tree Value]({{< relref "/ChapterFour/0513. Find Bottom Left Tree Value.md" >}})
- - [0515. Find Largest Value in Each Tree Row]({{< relref "/ChapterFour/0515. Find Largest Value in Each Tree Row.md" >}})
- - [0524. Longest Word in Dictionary through Deleting]({{< relref "/ChapterFour/0524. Longest Word in Dictionary through Deleting.md" >}})
- - [0526. Beautiful Arrangement]({{< relref "/ChapterFour/0526. Beautiful Arrangement.md" >}})
- - [0528. Random Pick with Weight]({{< relref "/ChapterFour/0528. Random Pick with Weight.md" >}})
- - [0532. K-diff Pairs in an Array]({{< relref "/ChapterFour/0532. K-diff Pairs in an Array.md" >}})
- - [0541. Reverse String II]({{< relref "/ChapterFour/0541. Reverse String II.md" >}})
- - [0542. 01 Matrix]({{< relref "/ChapterFour/0542. 01 Matrix.md" >}})
- - [0547. Friend Circles]({{< relref "/ChapterFour/0547. Friend Circles.md" >}})
- - [0557. Reverse Words in a String III]({{< relref "/ChapterFour/0557. Reverse Words in a String III.md" >}})
- - [0563. Binary Tree Tilt]({{< relref "/ChapterFour/0563. Binary Tree Tilt.md" >}})
- - [0566. Reshape the Matrix]({{< relref "/ChapterFour/0566. Reshape the Matrix.md" >}})
- - [0567. Permutation in String]({{< relref "/ChapterFour/0567. Permutation in String.md" >}})
- - [0572. Subtree of Another Tree]({{< relref "/ChapterFour/0572. Subtree of Another Tree.md" >}})
- - [0575. Distribute Candies]({{< relref "/ChapterFour/0575. Distribute Candies.md" >}})
- - [0594. Longest Harmonious Subsequence]({{< relref "/ChapterFour/0594. Longest Harmonious Subsequence.md" >}})
- - [0599. Minimum Index Sum of Two Lists]({{< relref "/ChapterFour/0599. Minimum Index Sum of Two Lists.md" >}})
- - [0628. Maximum Product of Three Numbers]({{< relref "/ChapterFour/0628. Maximum Product of Three Numbers.md" >}})
- - [0632. Smallest Range Covering Elements from K Lists]({{< relref "/ChapterFour/0632. Smallest Range Covering Elements from K Lists.md" >}})
- - [0633. Sum of Square Numbers]({{< relref "/ChapterFour/0633. Sum of Square Numbers.md" >}})
- - [0636. Exclusive Time of Functions]({{< relref "/ChapterFour/0636. Exclusive Time of Functions.md" >}})
- - [0637. Average of Levels in Binary Tree]({{< relref "/ChapterFour/0637. Average of Levels in Binary Tree.md" >}})
- - [0645. Set Mismatch]({{< relref "/ChapterFour/0645. Set Mismatch.md" >}})
- - [0648. Replace Words]({{< relref "/ChapterFour/0648. Replace Words.md" >}})
- - [0653. Two Sum IV - Input is a BST]({{< relref "/ChapterFour/0653. Two Sum IV - Input is a BST.md" >}})
- - [0658. Find K Closest Elements]({{< relref "/ChapterFour/0658. Find K Closest Elements.md" >}})
- - [0662. Maximum Width of Binary Tree]({{< relref "/ChapterFour/0662. Maximum Width of Binary Tree.md" >}})
- - [0668. Kth Smallest Number in Multiplication Table]({{< relref "/ChapterFour/0668. Kth Smallest Number in Multiplication Table.md" >}})
- - [0676. Implement Magic Dictionary]({{< relref "/ChapterFour/0676. Implement Magic Dictionary.md" >}})
- - [0682. Baseball Game]({{< relref "/ChapterFour/0682. Baseball Game.md" >}})
- - [0684. Redundant Connection]({{< relref "/ChapterFour/0684. Redundant Connection.md" >}})
- - [0685. Redundant Connection II]({{< relref "/ChapterFour/0685. Redundant Connection II.md" >}})
- - [0693. Binary Number with Alternating Bits]({{< relref "/ChapterFour/0693. Binary Number with Alternating Bits.md" >}})
- - [0699. Falling Squares]({{< relref "/ChapterFour/0699. Falling Squares.md" >}})
- - [0704. Binary Search]({{< relref "/ChapterFour/0704. Binary Search.md" >}})
- - [0705. Design HashSet]({{< relref "/ChapterFour/0705. Design HashSet.md" >}})
- - [0706. Design HashMap]({{< relref "/ChapterFour/0706. Design HashMap.md" >}})
- - [0707. Design Linked List]({{< relref "/ChapterFour/0707. Design Linked List.md" >}})
- - [0710. Random Pick with Blacklist]({{< relref "/ChapterFour/0710. Random Pick with Blacklist.md" >}})
- - [0713. Subarray Product Less Than K]({{< relref "/ChapterFour/0713. Subarray Product Less Than K.md" >}})
- - [0714. Best Time to Buy and Sell Stock with Transaction Fee]({{< relref "/ChapterFour/0714. Best Time to Buy and Sell Stock with Transaction Fee.md" >}})
- - [0715. Range Module]({{< relref "/ChapterFour/0715. Range Module.md" >}})
- - [0717. 1-bit and 2-bit Characters]({{< relref "/ChapterFour/0717. 1-bit and 2-bit Characters.md" >}})
- - [0718. Maximum Length of Repeated Subarray]({{< relref "/ChapterFour/0718. Maximum Length of Repeated Subarray.md" >}})
- - [0719. Find K-th Smallest Pair Distance]({{< relref "/ChapterFour/0719. Find K-th Smallest Pair Distance.md" >}})
- - [0720. Longest Word in Dictionary]({{< relref "/ChapterFour/0720. Longest Word in Dictionary.md" >}})
- - [0721. Accounts Merge]({{< relref "/ChapterFour/0721. Accounts Merge.md" >}})
- - [0725. Split Linked List in Parts]({{< relref "/ChapterFour/0725. Split Linked List in Parts.md" >}})
- - [0726. Number of Atoms]({{< relref "/ChapterFour/0726. Number of Atoms.md" >}})
- - [0729. My Calendar I]({{< relref "/ChapterFour/0729. My Calendar I.md" >}})
- - [0732. My Calendar III]({{< relref "/ChapterFour/0732. My Calendar III.md" >}})
- - [0733. Flood Fill]({{< relref "/ChapterFour/0733. Flood Fill.md" >}})
- - [0735. Asteroid Collision]({{< relref "/ChapterFour/0735. Asteroid Collision.md" >}})
- - [0739. Daily Temperatures]({{< relref "/ChapterFour/0739. Daily Temperatures.md" >}})
- - [0744. Find Smallest Letter Greater Than Target]({{< relref "/ChapterFour/0744. Find Smallest Letter Greater Than Target.md" >}})
- - [0745. Prefix and Suffix Search]({{< relref "/ChapterFour/0745. Prefix and Suffix Search.md" >}})
- - [0746. Min Cost Climbing Stairs]({{< relref "/ChapterFour/0746. Min Cost Climbing Stairs.md" >}})
- - [0748. Shortest Completing Word]({{< relref "/ChapterFour/0748. Shortest Completing Word.md" >}})
- - [0756. Pyramid Transition Matrix]({{< relref "/ChapterFour/0756. Pyramid Transition Matrix.md" >}})
- - [0762. Prime Number of Set Bits in Binary Representation]({{< relref "/ChapterFour/0762. Prime Number of Set Bits in Binary Representation.md" >}})
- - [0763. Partition Labels]({{< relref "/ChapterFour/0763. Partition Labels.md" >}})
- - [0765. Couples Holding Hands]({{< relref "/ChapterFour/0765. Couples Holding Hands.md" >}})
- - [0766. Toeplitz Matrix]({{< relref "/ChapterFour/0766. Toeplitz Matrix.md" >}})
- - [0767. Reorganize String]({{< relref "/ChapterFour/0767. Reorganize String.md" >}})
- - [0771. Jewels and Stones]({{< relref "/ChapterFour/0771. Jewels and Stones.md" >}})
- - [0778. Swim in Rising Water]({{< relref "/ChapterFour/0778. Swim in Rising Water.md" >}})
- - [0781. Rabbits in Forest]({{< relref "/ChapterFour/0781. Rabbits in Forest.md" >}})
- - [0784. Letter Case Permutation]({{< relref "/ChapterFour/0784. Letter Case Permutation.md" >}})
- - [0786. K-th Smallest Prime Fraction]({{< relref "/ChapterFour/0786. K-th Smallest Prime Fraction.md" >}})
- - [0793. Preimage Size of Factorial Zeroes Function]({{< relref "/ChapterFour/0793. Preimage Size of Factorial Zeroes Function.md" >}})
- - [0803. Bricks Falling When Hit]({{< relref "/ChapterFour/0803. Bricks Falling When Hit.md" >}})
- - [0811. Subdomain Visit Count]({{< relref "/ChapterFour/0811. Subdomain Visit Count.md" >}})
- - [0815. Bus Routes]({{< relref "/ChapterFour/0815. Bus Routes.md" >}})
- - [0817. Linked List Components]({{< relref "/ChapterFour/0817. Linked List Components.md" >}})
- - [0819. Most Common Word]({{< relref "/ChapterFour/0819. Most Common Word.md" >}})
- - [0826. Most Profit Assigning Work]({{< relref "/ChapterFour/0826. Most Profit Assigning Work.md" >}})
- - [0828. COPYRIGHT PROBLEM XXX]({{< relref "/ChapterFour/0828. COPYRIGHT PROBLEM XXX.md" >}})
- - [0834. Sum of Distances in Tree]({{< relref "/ChapterFour/0834. Sum of Distances in Tree.md" >}})
- - [0836. Rectangle Overlap]({{< relref "/ChapterFour/0836. Rectangle Overlap.md" >}})
- - [0838. Push Dominoes]({{< relref "/ChapterFour/0838. Push Dominoes.md" >}})
- - [0839. Similar String Groups]({{< relref "/ChapterFour/0839. Similar String Groups.md" >}})
- - [0842. Split Array into Fibonacci Sequence]({{< relref "/ChapterFour/0842. Split Array into Fibonacci Sequence.md" >}})
- - [0844. Backspace String Compare]({{< relref "/ChapterFour/0844. Backspace String Compare.md" >}})
- - [0845. Longest Mountain in Array]({{< relref "/ChapterFour/0845. Longest Mountain in Array.md" >}})
- - [0850. Rectangle Area II]({{< relref "/ChapterFour/0850. Rectangle Area II.md" >}})
- - [0852. Peak Index in a Mountain Array]({{< relref "/ChapterFour/0852. Peak Index in a Mountain Array.md" >}})
- - [0853. Car Fleet]({{< relref "/ChapterFour/0853. Car Fleet.md" >}})
- - [0856. Score of Parentheses]({{< relref "/ChapterFour/0856. Score of Parentheses.md" >}})
- - [0864. Shortest Path to Get All Keys]({{< relref "/ChapterFour/0864. Shortest Path to Get All Keys.md" >}})
- - [0867. Transpose Matrix]({{< relref "/ChapterFour/0867. Transpose Matrix.md" >}})
- - [0875. Koko Eating Bananas]({{< relref "/ChapterFour/0875. Koko Eating Bananas.md" >}})
- - [0876. Middle of the Linked List]({{< relref "/ChapterFour/0876. Middle of the Linked List.md" >}})
- - [0878. Nth Magical Number]({{< relref "/ChapterFour/0878. Nth Magical Number.md" >}})
- - [0880. Decoded String at Index]({{< relref "/ChapterFour/0880. Decoded String at Index.md" >}})
- - [0881. Boats to Save People]({{< relref "/ChapterFour/0881. Boats to Save People.md" >}})
- - [0884. Uncommon Words from Two Sentences]({{< relref "/ChapterFour/0884. Uncommon Words from Two Sentences.md" >}})
- - [0885. Spiral Matrix III]({{< relref "/ChapterFour/0885. Spiral Matrix III.md" >}})
- - [0887. Super Egg Drop]({{< relref "/ChapterFour/0887. Super Egg Drop.md" >}})
- - [0891. Sum of Subsequence Widths]({{< relref "/ChapterFour/0891. Sum of Subsequence Widths.md" >}})
- - [0895. Maximum Frequency Stack]({{< relref "/ChapterFour/0895. Maximum Frequency Stack.md" >}})
- - [0897. Increasing Order Search Tree]({{< relref "/ChapterFour/0897. Increasing Order Search Tree.md" >}})
- - [0898. Bitwise ORs of Subarrays]({{< relref "/ChapterFour/0898. Bitwise ORs of Subarrays.md" >}})
- - [0901. Online Stock Span]({{< relref "/ChapterFour/0901. Online Stock Span.md" >}})
- - [0904. Fruit Into Baskets]({{< relref "/ChapterFour/0904. Fruit Into Baskets.md" >}})
- - [0907. Sum of Subarray Minimums]({{< relref "/ChapterFour/0907. Sum of Subarray Minimums.md" >}})
- - [0911. Online Election]({{< relref "/ChapterFour/0911. Online Election.md" >}})
- - [0918. Maximum Sum Circular Subarray]({{< relref "/ChapterFour/0918. Maximum Sum Circular Subarray.md" >}})
- - [0920. Number of Music Playlists]({{< relref "/ChapterFour/0920. Number of Music Playlists.md" >}})
- - [0921. Minimum Add to Make Parentheses Valid]({{< relref "/ChapterFour/0921. Minimum Add to Make Parentheses Valid.md" >}})
- - [0922. Sort Array By Parity II]({{< relref "/ChapterFour/0922. Sort Array By Parity II.md" >}})
- - [0923. 3Sum With Multiplicity]({{< relref "/ChapterFour/0923. 3Sum With Multiplicity.md" >}})
- - [0924. Minimize Malware Spread]({{< relref "/ChapterFour/0924. Minimize Malware Spread.md" >}})
- - [0925. Long Pressed Name]({{< relref "/ChapterFour/0925. Long Pressed Name.md" >}})
- - [0927. Three Equal Parts]({{< relref "/ChapterFour/0927. Three Equal Parts.md" >}})
- - [0928. Minimize Malware Spread II]({{< relref "/ChapterFour/0928. Minimize Malware Spread II.md" >}})
- - [0930. Binary Subarrays With Sum]({{< relref "/ChapterFour/0930. Binary Subarrays With Sum.md" >}})
- - [0942. DI String Match]({{< relref "/ChapterFour/0942. DI String Match.md" >}})
- - [0946. Validate Stack Sequences]({{< relref "/ChapterFour/0946. Validate Stack Sequences.md" >}})
- - [0947. Most Stones Removed with Same Row or Column]({{< relref "/ChapterFour/0947. Most Stones Removed with Same Row or Column.md" >}})
- - [0952. Largest Component Size by Common Factor]({{< relref "/ChapterFour/0952. Largest Component Size by Common Factor.md" >}})
- - [0953. Verifying an Alien Dictionary]({{< relref "/ChapterFour/0953. Verifying an Alien Dictionary.md" >}})
- - [0959. Regions Cut By Slashes]({{< relref "/ChapterFour/0959. Regions Cut By Slashes.md" >}})
- - [0961. N-Repeated Element in Size 2N Array]({{< relref "/ChapterFour/0961. N-Repeated Element in Size 2N Array.md" >}})
- - [0968. Binary Tree Cameras]({{< relref "/ChapterFour/0968. Binary Tree Cameras.md" >}})
- - [0969. Pancake Sorting]({{< relref "/ChapterFour/0969. Pancake Sorting.md" >}})
- - [0970. Powerful Integers]({{< relref "/ChapterFour/0970. Powerful Integers.md" >}})
- - [0973. K Closest Points to Origin]({{< relref "/ChapterFour/0973. K Closest Points to Origin.md" >}})
- - [0976. Largest Perimeter Triangle]({{< relref "/ChapterFour/0976. Largest Perimeter Triangle.md" >}})
- - [0977. Squares of a Sorted Array]({{< relref "/ChapterFour/0977. Squares of a Sorted Array.md" >}})
- - [0978. Longest Turbulent Subarray]({{< relref "/ChapterFour/0978. Longest Turbulent Subarray.md" >}})
- - [0979. Distribute Coins in Binary Tree]({{< relref "/ChapterFour/0979. Distribute Coins in Binary Tree.md" >}})
- - [0980. Unique Paths III]({{< relref "/ChapterFour/0980. Unique Paths III.md" >}})
- - [0981. Time Based Key-Value Store]({{< relref "/ChapterFour/0981. Time Based Key-Value Store.md" >}})
- - [0984. String Without AAA or BBB]({{< relref "/ChapterFour/0984. String Without AAA or BBB.md" >}})
- - [0986. Interval List Intersections]({{< relref "/ChapterFour/0986. Interval List Intersections.md" >}})
- - [0990. Satisfiability of Equality Equations]({{< relref "/ChapterFour/0990. Satisfiability of Equality Equations.md" >}})
- - [0992. Subarrays with K Different Integers]({{< relref "/ChapterFour/0992. Subarrays with K Different Integers.md" >}})
- - [0993. Cousins in Binary Tree]({{< relref "/ChapterFour/0993. Cousins in Binary Tree.md" >}})
- - [0995. Minimum Number of K Consecutive Bit Flips]({{< relref "/ChapterFour/0995. Minimum Number of K Consecutive Bit Flips.md" >}})
- - [0996. Number of Squareful Arrays]({{< relref "/ChapterFour/0996. Number of Squareful Arrays.md" >}})
- - [1002. Find Common Characters]({{< relref "/ChapterFour/1002. Find Common Characters.md" >}})
- - [1003. Check If Word Is Valid After Substitutions]({{< relref "/ChapterFour/1003. Check If Word Is Valid After Substitutions.md" >}})
- - [1004. Max Consecutive Ones III]({{< relref "/ChapterFour/1004. Max Consecutive Ones III.md" >}})
- - [1005. Maximize Sum Of Array After K Negations]({{< relref "/ChapterFour/1005. Maximize Sum Of Array After K Negations.md" >}})
- - [1011. Capacity To Ship Packages Within D Days]({{< relref "/ChapterFour/1011. Capacity To Ship Packages Within D Days.md" >}})
- - [1017. Convert to Base -2]({{< relref "/ChapterFour/1017. Convert to Base -2.md" >}})
- - [1019. Next Greater Node In Linked List]({{< relref "/ChapterFour/1019. Next Greater Node In Linked List.md" >}})
- - [1021. Remove Outermost Parentheses]({{< relref "/ChapterFour/1021. Remove Outermost Parentheses.md" >}})
- - [1025. Divisor Game]({{< relref "/ChapterFour/1025. Divisor Game.md" >}})
- - [1028. Recover a Tree From Preorder Traversal]({{< relref "/ChapterFour/1028. Recover a Tree From Preorder Traversal.md" >}})
- - [1030. Matrix Cells in Distance Order]({{< relref "/ChapterFour/1030. Matrix Cells in Distance Order.md" >}})
- - [1040. Moving Stones Until Consecutive II]({{< relref "/ChapterFour/1040. Moving Stones Until Consecutive II.md" >}})
- - [1047. Remove All Adjacent Duplicates In String]({{< relref "/ChapterFour/1047. Remove All Adjacent Duplicates In String.md" >}})
- - [1049. Last Stone Weight II]({{< relref "/ChapterFour/1049. Last Stone Weight II.md" >}})
- - [1052. Grumpy Bookstore Owner]({{< relref "/ChapterFour/1052. Grumpy Bookstore Owner.md" >}})
- - [1054. Distant Barcodes]({{< relref "/ChapterFour/1054. Distant Barcodes.md" >}})
- - [1073. Adding Two Negabinary Numbers]({{< relref "/ChapterFour/1073. Adding Two Negabinary Numbers.md" >}})
- - [1074. Number of Submatrices That Sum to Target]({{< relref "/ChapterFour/1074. Number of Submatrices That Sum to Target.md" >}})
- - [1078. Occurrences After Bigram]({{< relref "/ChapterFour/1078. Occurrences After Bigram.md" >}})
- - [1079. Letter Tile Possibilities]({{< relref "/ChapterFour/1079. Letter Tile Possibilities.md" >}})
- - [1093. Statistics from a Large Sample]({{< relref "/ChapterFour/1093. Statistics from a Large Sample.md" >}})
- - [1105. Filling Bookcase Shelves]({{< relref "/ChapterFour/1105. Filling Bookcase Shelves.md" >}})
- - [1108. Defanging an IP Address]({{< relref "/ChapterFour/1108. Defanging an IP Address.md" >}})
- - [1111. Maximum Nesting Depth of Two Valid Parentheses Strings]({{< relref "/ChapterFour/1111. Maximum Nesting Depth of Two Valid Parentheses Strings.md" >}})
- - [1122. Relative Sort Array]({{< relref "/ChapterFour/1122. Relative Sort Array.md" >}})
- - [1123. Lowest Common Ancestor of Deepest Leaves]({{< relref "/ChapterFour/1123. Lowest Common Ancestor of Deepest Leaves.md" >}})
- - [1128. Number of Equivalent Domino Pairs]({{< relref "/ChapterFour/1128. Number of Equivalent Domino Pairs.md" >}})
- - [1137. N-th Tribonacci Number]({{< relref "/ChapterFour/1137. N-th Tribonacci Number.md" >}})
- - [1154. Day of the Year]({{< relref "/ChapterFour/1154. Day of the Year.md" >}})
- - [1157. Online Majority Element In Subarray]({{< relref "/ChapterFour/1157. Online Majority Element In Subarray.md" >}})
- - [1160. Find Words That Can Be Formed by Characters]({{< relref "/ChapterFour/1160. Find Words That Can Be Formed by Characters.md" >}})
- - [1170. Compare Strings by Frequency of the Smallest Character]({{< relref "/ChapterFour/1170. Compare Strings by Frequency of the Smallest Character.md" >}})
- - [1171. Remove Zero Sum Consecutive Nodes from Linked List]({{< relref "/ChapterFour/1171. Remove Zero Sum Consecutive Nodes from Linked List.md" >}})
- - [1175. Prime Arrangements]({{< relref "/ChapterFour/1175. Prime Arrangements.md" >}})
- - [1184. Distance Between Bus Stops]({{< relref "/ChapterFour/1184. Distance Between Bus Stops.md" >}})
- - [1185. Day of the Week]({{< relref "/ChapterFour/1185. Day of the Week.md" >}})
- - [1189. Maximum Number of Balloons]({{< relref "/ChapterFour/1189. Maximum Number of Balloons.md" >}})
- - [1200. Minimum Absolute Difference]({{< relref "/ChapterFour/1200. Minimum Absolute Difference.md" >}})
- - [1201. Ugly Number III]({{< relref "/ChapterFour/1201. Ugly Number III.md" >}})
- - [1202. Smallest String With Swaps]({{< relref "/ChapterFour/1202. Smallest String With Swaps.md" >}})
- - [1207. Unique Number of Occurrences]({{< relref "/ChapterFour/1207. Unique Number of Occurrences.md" >}})
- - [1208. Get Equal Substrings Within Budget]({{< relref "/ChapterFour/1208. Get Equal Substrings Within Budget.md" >}})
- - [1217. Play with Chips]({{< relref "/ChapterFour/1217. Play with Chips.md" >}})
- - [1221. Split a String in Balanced Strings]({{< relref "/ChapterFour/1221. Split a String in Balanced Strings.md" >}})
- - [1232. Check If It Is a Straight Line]({{< relref "/ChapterFour/1232. Check If It Is a Straight Line.md" >}})
- - [1234. Replace the Substring for Balanced String]({{< relref "/ChapterFour/1234. Replace the Substring for Balanced String.md" >}})
- - [1235. Maximum Profit in Job Scheduling]({{< relref "/ChapterFour/1235. Maximum Profit in Job Scheduling.md" >}})
- - [1252. Cells with Odd Values in a Matrix]({{< relref "/ChapterFour/1252. Cells with Odd Values in a Matrix.md" >}})
- - [1254. Number of Closed Islands]({{< relref "/ChapterFour/1254. Number of Closed Islands.md" >}})
- - [1266. Minimum Time Visiting All Points]({{< relref "/ChapterFour/1266. Minimum Time Visiting All Points.md" >}})
+ - [2.1 Array]({{< relref "/ChapterTwo/Array.md" >}})
+ - [2.2 String]({{< relref "/ChapterTwo/String.md" >}})
+ - [2.3 Two Pointers ✅]({{< relref "/ChapterTwo/Two_Pointers.md" >}})
+ - [2.4 Linked List ✅]({{< relref "/ChapterTwo/Linked_List.md" >}})
+ - [2.5 Stack ✅]({{< relref "/ChapterTwo/Stack.md" >}})
+ - [2.6 Tree]({{< relref "/ChapterTwo/Tree.md" >}})
+ - [2.7 Dynamic Programming]({{< relref "/ChapterTwo/Dynamic_Programming.md" >}})
+ - [2.8 Backtracking ✅]({{< relref "/ChapterTwo/Backtracking.md" >}})
+ - [2.9 Depth First Search]({{< relref "/ChapterTwo/Depth_First_Search.md" >}})
+ - [2.10 Breadth First Search]({{< relref "/ChapterTwo/Breadth_First_Search.md" >}})
+ - [2.11 Binary Search]({{< relref "/ChapterTwo/Binary_Search.md" >}})
+ - [2.12 Math]({{< relref "/ChapterTwo/Math.md" >}})
+ - [2.13 Hash Table]({{< relref "/ChapterTwo/Hash_Table.md" >}})
+ - [2.14 Sort ✅]({{< relref "/ChapterTwo/Sort.md" >}})
+ - [2.15 Bit Manipulation ✅]({{< relref "/ChapterTwo/Bit_Manipulation.md" >}})
+ - [2.16 Union Find ✅]({{< relref "/ChapterTwo/Union_Find.md" >}})
+ - [2.17 Sliding Window ✅]({{< relref "/ChapterTwo/Sliding_Window.md" >}})
+ - [2.18 Segment Tree ✅]({{< relref "/ChapterTwo/Segment_Tree.md" >}})
+ - [2.19 Binary Indexed Tree ✅]({{< relref "/ChapterTwo/Binary_Indexed_Tree.md" >}})
+- [第三章 一些模板]({{< relref "/ChapterThree/_index.md" >}})
+ - [3.1 Segment Tree]({{< relref "/ChapterThree/Segment_Tree.md" >}})
+ - [3.2 UnionFind]({{< relref "/ChapterThree/UnionFind.md" >}})
+- [第四章 Leetcode 题解]({{< relref "/ChapterFour/_index.md" >}})
+ - [0001.Two-Sum]({{< relref "/ChapterFour/0001.Two-Sum.md" >}})
+ - [0002.Add-Two-Numbers]({{< relref "/ChapterFour/0002.Add-Two-Numbers.md" >}})
+ - [0003.Longest-Substring-Without-Repeating-Characters]({{< relref "/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md" >}})
+ - [0004.Median-of-Two-Sorted-Arrays]({{< relref "/ChapterFour/0004.Median-of-Two-Sorted-Arrays.md" >}})
+ - [0007.Reverse-Integer]({{< relref "/ChapterFour/0007.Reverse-Integer.md" >}})
+ - [0011.Container-With-Most-Water]({{< relref "/ChapterFour/0011.Container-With-Most-Water.md" >}})
+ - [0015.3Sum]({{< relref "/ChapterFour/0015.3Sum.md" >}})
+ - [0016.3Sum-Closest]({{< relref "/ChapterFour/0016.3Sum-Closest.md" >}})
+ - [0017.Letter-Combinations-of-a-Phone-Number]({{< relref "/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md" >}})
+ - [0018.4Sum]({{< relref "/ChapterFour/0018.4Sum.md" >}})
+ - [0019.Remove-Nth-Node-From-End-of-List]({{< relref "/ChapterFour/0019.Remove-Nth-Node-From-End-of-List.md" >}})
+ - [0020.Valid-Parentheses]({{< relref "/ChapterFour/0020.Valid-Parentheses.md" >}})
+ - [0021.Merge-Two-Sorted-Lists]({{< relref "/ChapterFour/0021.Merge-Two-Sorted-Lists.md" >}})
+ - [0022.Generate-Parentheses]({{< relref "/ChapterFour/0022.Generate-Parentheses.md" >}})
+ - [0023.Merge-k-Sorted-Lists]({{< relref "/ChapterFour/0023.Merge-k-Sorted-Lists.md" >}})
+ - [0024.Swap-Nodes-in-Pairs]({{< relref "/ChapterFour/0024.Swap-Nodes-in-Pairs.md" >}})
+ - [0025.Reverse-Nodes-in-k-Group]({{< relref "/ChapterFour/0025.Reverse-Nodes-in-k-Group.md" >}})
+ - [0026.Remove-Duplicates-from-Sorted-Array]({{< relref "/ChapterFour/0026.Remove-Duplicates-from-Sorted-Array.md" >}})
+ - [0027.Remove-Element]({{< relref "/ChapterFour/0027.Remove-Element.md" >}})
+ - [0028.Implement-strStr]({{< relref "/ChapterFour/0028.Implement-strStr.md" >}})
+ - [0029.Divide-Two-Integers]({{< relref "/ChapterFour/0029.Divide-Two-Integers.md" >}})
+ - [0030.Substring-with-Concatenation-of-All-Words]({{< relref "/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md" >}})
+ - [0033.Search-in-Rotated-Sorted-Array]({{< relref "/ChapterFour/0033.Search-in-Rotated-Sorted-Array.md" >}})
+ - [0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array]({{< relref "/ChapterFour/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md" >}})
+ - [0035.Search-Insert-Position]({{< relref "/ChapterFour/0035.Search-Insert-Position.md" >}})
+ - [0036.Valid-Sudoku]({{< relref "/ChapterFour/0036.Valid-Sudoku.md" >}})
+ - [0037.Sudoku-Solver]({{< relref "/ChapterFour/0037.Sudoku-Solver.md" >}})
+ - [0039.Combination-Sum]({{< relref "/ChapterFour/0039.Combination-Sum.md" >}})
+ - [0040.Combination-Sum-II]({{< relref "/ChapterFour/0040.Combination-Sum-II.md" >}})
+ - [0041.First-Missing-Positive]({{< relref "/ChapterFour/0041.First-Missing-Positive.md" >}})
+ - [0042.Trapping-Rain-Water]({{< relref "/ChapterFour/0042.Trapping-Rain-Water.md" >}})
+ - [0046.Permutations]({{< relref "/ChapterFour/0046.Permutations.md" >}})
+ - [0047.Permutations-II]({{< relref "/ChapterFour/0047.Permutations-II.md" >}})
+ - [0048.Rotate-Image]({{< relref "/ChapterFour/0048.Rotate-Image.md" >}})
+ - [0049.Group-Anagrams]({{< relref "/ChapterFour/0049.Group-Anagrams.md" >}})
+ - [0050.Powx-n]({{< relref "/ChapterFour/0050.Powx-n.md" >}})
+ - [0051.N-Queens]({{< relref "/ChapterFour/0051.N-Queens.md" >}})
+ - [0052.N-Queens-II]({{< relref "/ChapterFour/0052.N-Queens-II.md" >}})
+ - [0053.Maximum-Subarray]({{< relref "/ChapterFour/0053.Maximum-Subarray.md" >}})
+ - [0054.Spiral-Matrix]({{< relref "/ChapterFour/0054.Spiral-Matrix.md" >}})
+ - [0055.Jump-Game]({{< relref "/ChapterFour/0055.Jump-Game.md" >}})
+ - [0056.Merge-Intervals]({{< relref "/ChapterFour/0056.Merge-Intervals.md" >}})
+ - [0057.Insert-Interval]({{< relref "/ChapterFour/0057.Insert-Interval.md" >}})
+ - [0059.Spiral-Matrix-II]({{< relref "/ChapterFour/0059.Spiral-Matrix-II.md" >}})
+ - [0060.Permutation-Sequence]({{< relref "/ChapterFour/0060.Permutation-Sequence.md" >}})
+ - [0061.Rotate-List]({{< relref "/ChapterFour/0061.Rotate-List.md" >}})
+ - [0062.Unique-Paths]({{< relref "/ChapterFour/0062.Unique-Paths.md" >}})
+ - [0063.Unique-Paths-II]({{< relref "/ChapterFour/0063.Unique-Paths-II.md" >}})
+ - [0064.Minimum-Path-Sum]({{< relref "/ChapterFour/0064.Minimum-Path-Sum.md" >}})
+ - [0066.Plus-One]({{< relref "/ChapterFour/0066.Plus-One.md" >}})
+ - [0069.Sqrtx]({{< relref "/ChapterFour/0069.Sqrtx.md" >}})
+ - [0070.Climbing-Stairs]({{< relref "/ChapterFour/0070.Climbing-Stairs.md" >}})
+ - [0071.Simplify-Path]({{< relref "/ChapterFour/0071.Simplify-Path.md" >}})
+ - [0074.Search-a-2D-Matrix]({{< relref "/ChapterFour/0074.Search-a-2D-Matrix.md" >}})
+ - [0075.Sort-Colors]({{< relref "/ChapterFour/0075.Sort-Colors.md" >}})
+ - [0076.Minimum-Window-Substring]({{< relref "/ChapterFour/0076.Minimum-Window-Substring.md" >}})
+ - [0077.Combinations]({{< relref "/ChapterFour/0077.Combinations.md" >}})
+ - [0078.Subsets]({{< relref "/ChapterFour/0078.Subsets.md" >}})
+ - [0079.Word-Search]({{< relref "/ChapterFour/0079.Word-Search.md" >}})
+ - [0080.Remove-Duplicates-from-Sorted-Array-II]({{< relref "/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md" >}})
+ - [0081.Search-in-Rotated-Sorted-Array-II]({{< relref "/ChapterFour/0081.Search-in-Rotated-Sorted-Array-II.md" >}})
+ - [0082.Remove-Duplicates-from-Sorted-List-II]({{< relref "/ChapterFour/0082.Remove-Duplicates-from-Sorted-List-II.md" >}})
+ - [0083.Remove-Duplicates-from-Sorted-List]({{< relref "/ChapterFour/0083.Remove-Duplicates-from-Sorted-List.md" >}})
+ - [0084.Largest-Rectangle-in-Histogram]({{< relref "/ChapterFour/0084.Largest-Rectangle-in-Histogram.md" >}})
+ - [0086.Partition-List]({{< relref "/ChapterFour/0086.Partition-List.md" >}})
+ - [0088.Merge-Sorted-Array]({{< relref "/ChapterFour/0088.Merge-Sorted-Array.md" >}})
+ - [0089.Gray-Code]({{< relref "/ChapterFour/0089.Gray-Code.md" >}})
+ - [0090.Subsets-II]({{< relref "/ChapterFour/0090.Subsets-II.md" >}})
+ - [0091.Decode-Ways]({{< relref "/ChapterFour/0091.Decode-Ways.md" >}})
+ - [0092.Reverse-Linked-List-II]({{< relref "/ChapterFour/0092.Reverse-Linked-List-II.md" >}})
+ - [0093.Restore-IP-Addresses]({{< relref "/ChapterFour/0093.Restore-IP-Addresses.md" >}})
+ - [0094.Binary-Tree-Inorder-Traversal]({{< relref "/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md" >}})
+ - [0095.Unique-Binary-Search-Trees-II]({{< relref "/ChapterFour/0095.Unique-Binary-Search-Trees-II.md" >}})
+ - [0096.Unique-Binary-Search-Trees]({{< relref "/ChapterFour/0096.Unique-Binary-Search-Trees.md" >}})
+ - [0098.Validate-Binary-Search-Tree]({{< relref "/ChapterFour/0098.Validate-Binary-Search-Tree.md" >}})
+ - [0099.Recover-Binary-Search-Tree]({{< relref "/ChapterFour/0099.Recover-Binary-Search-Tree.md" >}})
+ - [0100.Same-Tree]({{< relref "/ChapterFour/0100.Same-Tree.md" >}})
+ - [0101.Symmetric-Tree]({{< relref "/ChapterFour/0101.Symmetric-Tree.md" >}})
+ - [0102.Binary-Tree-Level-Order-Traversal]({{< relref "/ChapterFour/0102.Binary-Tree-Level-Order-Traversal.md" >}})
+ - [0103.Binary-Tree-Zigzag-Level-Order-Traversal]({{< relref "/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}})
+ - [0104.Maximum-Depth-of-Binary-Tree]({{< relref "/ChapterFour/0104.Maximum-Depth-of-Binary-Tree.md" >}})
+ - [0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal]({{< relref "/ChapterFour/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md" >}})
+ - [0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal]({{< relref "/ChapterFour/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md" >}})
+ - [0107.Binary-Tree-Level-Order-Traversal-II]({{< relref "/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.md" >}})
+ - [0108.Convert-Sorted-Array-to-Binary-Search-Tree]({{< relref "/ChapterFour/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md" >}})
+ - [0109.Convert-Sorted-List-to-Binary-Search-Tree]({{< relref "/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}})
+ - [0110.Balanced-Binary-Tree]({{< relref "/ChapterFour/0110.Balanced-Binary-Tree.md" >}})
+ - [0111.Minimum-Depth-of-Binary-Tree]({{< relref "/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md" >}})
+ - [0112.Path-Sum]({{< relref "/ChapterFour/0112.Path-Sum.md" >}})
+ - [0113.Path-Sum-II]({{< relref "/ChapterFour/0113.Path-Sum-II.md" >}})
+ - [0114.Flatten-Binary-Tree-to-Linked-List]({{< relref "/ChapterFour/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})
+ - [0120.Triangle]({{< relref "/ChapterFour/0120.Triangle.md" >}})
+ - [0121.Best-Time-to-Buy-and-Sell-Stock]({{< relref "/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})
+ - [0122.Best-Time-to-Buy-and-Sell-Stock-II]({{< relref "/ChapterFour/0122.Best-Time-to-Buy-and-Sell-Stock-II.md" >}})
+ - [0124.Binary-Tree-Maximum-Path-Sum]({{< relref "/ChapterFour/0124.Binary-Tree-Maximum-Path-Sum.md" >}})
+ - [0125.Valid-Palindrome]({{< relref "/ChapterFour/0125.Valid-Palindrome.md" >}})
+ - [0126.Word-Ladder-II]({{< relref "/ChapterFour/0126.Word-Ladder-II.md" >}})
+ - [0127.Word-Ladder]({{< relref "/ChapterFour/0127.Word-Ladder.md" >}})
+ - [0128.Longest-Consecutive-Sequence]({{< relref "/ChapterFour/0128.Longest-Consecutive-Sequence.md" >}})
+ - [0129.Sum-Root-to-Leaf-Numbers]({{< relref "/ChapterFour/0129.Sum-Root-to-Leaf-Numbers.md" >}})
+ - [0130.Surrounded-Regions]({{< relref "/ChapterFour/0130.Surrounded-Regions.md" >}})
+ - [0131.Palindrome-Partitioning]({{< relref "/ChapterFour/0131.Palindrome-Partitioning.md" >}})
+ - [0136.Single-Number]({{< relref "/ChapterFour/0136.Single-Number.md" >}})
+ - [0137.Single-Number-II]({{< relref "/ChapterFour/0137.Single-Number-II.md" >}})
+ - [0141.Linked-List-Cycle]({{< relref "/ChapterFour/0141.Linked-List-Cycle.md" >}})
+ - [0142.Linked-List-Cycle-II]({{< relref "/ChapterFour/0142.Linked-List-Cycle-II.md" >}})
+ - [0143.Reorder-List]({{< relref "/ChapterFour/0143.Reorder-List.md" >}})
+ - [0144.Binary-Tree-Preorder-Traversal]({{< relref "/ChapterFour/0144.Binary-Tree-Preorder-Traversal.md" >}})
+ - [0145.Binary-Tree-Postorder-Traversal]({{< relref "/ChapterFour/0145.Binary-Tree-Postorder-Traversal.md" >}})
+ - [0147.Insertion-Sort-List]({{< relref "/ChapterFour/0147.Insertion-Sort-List.md" >}})
+ - [0148.Sort-List]({{< relref "/ChapterFour/0148.Sort-List.md" >}})
+ - [0150.Evaluate-Reverse-Polish-Notation]({{< relref "/ChapterFour/0150.Evaluate-Reverse-Polish-Notation.md" >}})
+ - [0151.Reverse-Words-in-a-String]({{< relref "/ChapterFour/0151.Reverse-Words-in-a-String.md" >}})
+ - [0152.Maximum-Product-Subarray]({{< relref "/ChapterFour/0152.Maximum-Product-Subarray.md" >}})
+ - [0153.Find-Minimum-in-Rotated-Sorted-Array]({{< relref "/ChapterFour/0153.Find-Minimum-in-Rotated-Sorted-Array.md" >}})
+ - [0154.Find-Minimum-in-Rotated-Sorted-Array-II]({{< relref "/ChapterFour/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md" >}})
+ - [0155.Min-Stack]({{< relref "/ChapterFour/0155.Min-Stack.md" >}})
+ - [0160.Intersection-of-Two-Linked-Lists]({{< relref "/ChapterFour/0160.Intersection-of-Two-Linked-Lists.md" >}})
+ - [0162.Find-Peak-Element]({{< relref "/ChapterFour/0162.Find-Peak-Element.md" >}})
+ - [0164.Maximum-Gap]({{< relref "/ChapterFour/0164.Maximum-Gap.md" >}})
+ - [0167.Two-Sum-II---Input-array-is-sorted]({{< relref "/ChapterFour/0167.Two-Sum-II---Input-array-is-sorted.md" >}})
+ - [0169.Majority-Element]({{< relref "/ChapterFour/0169.Majority-Element.md" >}})
+ - [0172.Factorial-Trailing-Zeroes]({{< relref "/ChapterFour/0172.Factorial-Trailing-Zeroes.md" >}})
+ - [0173.Binary-Search-Tree-Iterator]({{< relref "/ChapterFour/0173.Binary-Search-Tree-Iterator.md" >}})
+ - [0174.Dungeon-Game]({{< relref "/ChapterFour/0174.Dungeon-Game.md" >}})
+ - [0179.Largest-Number]({{< relref "/ChapterFour/0179.Largest-Number.md" >}})
+ - [0187.Repeated-DNA-Sequences]({{< relref "/ChapterFour/0187.Repeated-DNA-Sequences.md" >}})
+ - [0190.Reverse-Bits]({{< relref "/ChapterFour/0190.Reverse-Bits.md" >}})
+ - [0191.Number-of-1-Bits]({{< relref "/ChapterFour/0191.Number-of-1-Bits.md" >}})
+ - [0198.House-Robber]({{< relref "/ChapterFour/0198.House-Robber.md" >}})
+ - [0199.Binary-Tree-Right-Side-View]({{< relref "/ChapterFour/0199.Binary-Tree-Right-Side-View.md" >}})
+ - [0200.Number-of-Islands]({{< relref "/ChapterFour/0200.Number-of-Islands.md" >}})
+ - [0201.Bitwise-AND-of-Numbers-Range]({{< relref "/ChapterFour/0201.Bitwise-AND-of-Numbers-Range.md" >}})
+ - [0202.Happy-Number]({{< relref "/ChapterFour/0202.Happy-Number.md" >}})
+ - [0203.Remove-Linked-List-Elements]({{< relref "/ChapterFour/0203.Remove-Linked-List-Elements.md" >}})
+ - [0204.Count-Primes]({{< relref "/ChapterFour/0204.Count-Primes.md" >}})
+ - [0205.Isomorphic-Strings]({{< relref "/ChapterFour/0205.Isomorphic-Strings.md" >}})
+ - [0206.Reverse-Linked-List]({{< relref "/ChapterFour/0206.Reverse-Linked-List.md" >}})
+ - [0207.Course-Schedule]({{< relref "/ChapterFour/0207.Course-Schedule.md" >}})
+ - [0208.Implement-Trie-Prefix-Tree]({{< relref "/ChapterFour/0208.Implement-Trie-Prefix-Tree.md" >}})
+ - [0209.Minimum-Size-Subarray-Sum]({{< relref "/ChapterFour/0209.Minimum-Size-Subarray-Sum.md" >}})
+ - [0210.Course-Schedule-II]({{< relref "/ChapterFour/0210.Course-Schedule-II.md" >}})
+ - [0211.Add-and-Search-Word---Data-structure-design]({{< relref "/ChapterFour/0211.Add-and-Search-Word---Data-structure-design.md" >}})
+ - [0212.Word-Search-II]({{< relref "/ChapterFour/0212.Word-Search-II.md" >}})
+ - [0213.House-Robber-II]({{< relref "/ChapterFour/0213.House-Robber-II.md" >}})
+ - [0215.Kth-Largest-Element-in-an-Array]({{< relref "/ChapterFour/0215.Kth-Largest-Element-in-an-Array.md" >}})
+ - [0216.Combination-Sum-III]({{< relref "/ChapterFour/0216.Combination-Sum-III.md" >}})
+ - [0217.Contains-Duplicate]({{< relref "/ChapterFour/0217.Contains-Duplicate.md" >}})
+ - [0218.The-Skyline-Problem]({{< relref "/ChapterFour/0218.The-Skyline-Problem.md" >}})
+ - [0219.Contains-Duplicate-II]({{< relref "/ChapterFour/0219.Contains-Duplicate-II.md" >}})
+ - [0220.Contains-Duplicate-III]({{< relref "/ChapterFour/0220.Contains-Duplicate-III.md" >}})
+ - [0222.Count-Complete-Tree-Nodes]({{< relref "/ChapterFour/0222.Count-Complete-Tree-Nodes.md" >}})
+ - [0223.Rectangle-Area]({{< relref "/ChapterFour/0223.Rectangle-Area.md" >}})
+ - [0224.Basic-Calculator]({{< relref "/ChapterFour/0224.Basic-Calculator.md" >}})
+ - [0225.Implement-Stack-using-Queues]({{< relref "/ChapterFour/0225.Implement-Stack-using-Queues.md" >}})
+ - [0226.Invert-Binary-Tree]({{< relref "/ChapterFour/0226.Invert-Binary-Tree.md" >}})
+ - [0229.Majority-Element-II]({{< relref "/ChapterFour/0229.Majority-Element-II.md" >}})
+ - [0230.Kth-Smallest-Element-in-a-BST]({{< relref "/ChapterFour/0230.Kth-Smallest-Element-in-a-BST.md" >}})
+ - [0231.Power-of-Two]({{< relref "/ChapterFour/0231.Power-of-Two.md" >}})
+ - [0232.Implement-Queue-using-Stacks]({{< relref "/ChapterFour/0232.Implement-Queue-using-Stacks.md" >}})
+ - [0234.Palindrome-Linked-List]({{< relref "/ChapterFour/0234.Palindrome-Linked-List.md" >}})
+ - [0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree]({{< relref "/ChapterFour/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md" >}})
+ - [0236.Lowest-Common-Ancestor-of-a-Binary-Tree]({{< relref "/ChapterFour/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md" >}})
+ - [0237.Delete-Node-in-a-Linked-List]({{< relref "/ChapterFour/0237.Delete-Node-in-a-Linked-List.md" >}})
+ - [0239.Sliding-Window-Maximum]({{< relref "/ChapterFour/0239.Sliding-Window-Maximum.md" >}})
+ - [0240.Search-a-2D-Matrix-II]({{< relref "/ChapterFour/0240.Search-a-2D-Matrix-II.md" >}})
+ - [0242.Valid-Anagram]({{< relref "/ChapterFour/0242.Valid-Anagram.md" >}})
+ - [0257.Binary-Tree-Paths]({{< relref "/ChapterFour/0257.Binary-Tree-Paths.md" >}})
+ - [0260.Single-Number-III]({{< relref "/ChapterFour/0260.Single-Number-III.md" >}})
+ - [0263.Ugly-Number]({{< relref "/ChapterFour/0263.Ugly-Number.md" >}})
+ - [0268.Missing-Number]({{< relref "/ChapterFour/0268.Missing-Number.md" >}})
+ - [0274.H-Index]({{< relref "/ChapterFour/0274.H-Index.md" >}})
+ - [0275.H-Index-II]({{< relref "/ChapterFour/0275.H-Index-II.md" >}})
+ - [0283.Move-Zeroes]({{< relref "/ChapterFour/0283.Move-Zeroes.md" >}})
+ - [0287.Find-the-Duplicate-Number]({{< relref "/ChapterFour/0287.Find-the-Duplicate-Number.md" >}})
+ - [0290.Word-Pattern]({{< relref "/ChapterFour/0290.Word-Pattern.md" >}})
+ - [0300.Longest-Increasing-Subsequence]({{< relref "/ChapterFour/0300.Longest-Increasing-Subsequence.md" >}})
+ - [0303.Range-Sum-Query---Immutable]({{< relref "/ChapterFour/0303.Range-Sum-Query---Immutable.md" >}})
+ - [0306.Additive-Number]({{< relref "/ChapterFour/0306.Additive-Number.md" >}})
+ - [0307.Range-Sum-Query---Mutable]({{< relref "/ChapterFour/0307.Range-Sum-Query---Mutable.md" >}})
+ - [0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown]({{< relref "/ChapterFour/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md" >}})
+ - [0315.Count-of-Smaller-Numbers-After-Self]({{< relref "/ChapterFour/0315.Count-of-Smaller-Numbers-After-Self.md" >}})
+ - [0318.Maximum-Product-of-Word-Lengths]({{< relref "/ChapterFour/0318.Maximum-Product-of-Word-Lengths.md" >}})
+ - [0322.Coin-Change]({{< relref "/ChapterFour/0322.Coin-Change.md" >}})
+ - [0324.Wiggle-Sort-II]({{< relref "/ChapterFour/0324.Wiggle-Sort-II.md" >}})
+ - [0326.Power-of-Three]({{< relref "/ChapterFour/0326.Power-of-Three.md" >}})
+ - [0327.Count-of-Range-Sum]({{< relref "/ChapterFour/0327.Count-of-Range-Sum.md" >}})
+ - [0328.Odd-Even-Linked-List]({{< relref "/ChapterFour/0328.Odd-Even-Linked-List.md" >}})
+ - [0329.Longest-Increasing-Path-in-a-Matrix]({{< relref "/ChapterFour/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})
+ - [0331.Verify-Preorder-Serialization-of-a-Binary-Tree]({{< relref "/ChapterFour/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})
+ - [0337.House-Robber-III]({{< relref "/ChapterFour/0337.House-Robber-III.md" >}})
+ - [0338.Counting-Bits]({{< relref "/ChapterFour/0338.Counting-Bits.md" >}})
+ - [0342.Power-of-Four]({{< relref "/ChapterFour/0342.Power-of-Four.md" >}})
+ - [0343.Integer-Break]({{< relref "/ChapterFour/0343.Integer-Break.md" >}})
+ - [0344.Reverse-String]({{< relref "/ChapterFour/0344.Reverse-String.md" >}})
+ - [0345.Reverse-Vowels-of-a-String]({{< relref "/ChapterFour/0345.Reverse-Vowels-of-a-String.md" >}})
+ - [0347.Top-K-Frequent-Elements]({{< relref "/ChapterFour/0347.Top-K-Frequent-Elements.md" >}})
+ - [0349.Intersection-of-Two-Arrays]({{< relref "/ChapterFour/0349.Intersection-of-Two-Arrays.md" >}})
+ - [0350.Intersection-of-Two-Arrays-II]({{< relref "/ChapterFour/0350.Intersection-of-Two-Arrays-II.md" >}})
+ - [0354.Russian-Doll-Envelopes]({{< relref "/ChapterFour/0354.Russian-Doll-Envelopes.md" >}})
+ - [0357.Count-Numbers-with-Unique-Digits]({{< relref "/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md" >}})
+ - [0367.Valid-Perfect-Square]({{< relref "/ChapterFour/0367.Valid-Perfect-Square.md" >}})
+ - [0371.Sum-of-Two-Integers]({{< relref "/ChapterFour/0371.Sum-of-Two-Integers.md" >}})
+ - [0372.Super-Pow]({{< relref "/ChapterFour/0372.Super-Pow.md" >}})
+ - [0373.Find-K-Pairs-with-Smallest-Sums]({{< relref "/ChapterFour/0373.Find-K-Pairs-with-Smallest-Sums.md" >}})
+ - [0378.Kth-Smallest-Element-in-a-Sorted-Matrix]({{< relref "/ChapterFour/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md" >}})
+ - [0385.Mini-Parser]({{< relref "/ChapterFour/0385.Mini-Parser.md" >}})
+ - [0386.Lexicographical-Numbers]({{< relref "/ChapterFour/0386.Lexicographical-Numbers.md" >}})
+ - [0387.First-Unique-Character-in-a-String]({{< relref "/ChapterFour/0387.First-Unique-Character-in-a-String.md" >}})
+ - [0389.Find-the-Difference]({{< relref "/ChapterFour/0389.Find-the-Difference.md" >}})
+ - [0392.Is-Subsequence]({{< relref "/ChapterFour/0392.Is-Subsequence.md" >}})
+ - [0393.UTF-8-Validation]({{< relref "/ChapterFour/0393.UTF-8-Validation.md" >}})
+ - [0394.Decode-String]({{< relref "/ChapterFour/0394.Decode-String.md" >}})
+ - [0397.Integer-Replacement]({{< relref "/ChapterFour/0397.Integer-Replacement.md" >}})
+ - [0399.Evaluate-Division]({{< relref "/ChapterFour/0399.Evaluate-Division.md" >}})
+ - [0401.Binary-Watch]({{< relref "/ChapterFour/0401.Binary-Watch.md" >}})
+ - [0402.Remove-K-Digits]({{< relref "/ChapterFour/0402.Remove-K-Digits.md" >}})
+ - [0404.Sum-of-Left-Leaves]({{< relref "/ChapterFour/0404.Sum-of-Left-Leaves.md" >}})
+ - [0405.Convert-a-Number-to-Hexadecimal]({{< relref "/ChapterFour/0405.Convert-a-Number-to-Hexadecimal.md" >}})
+ - [0409.Longest-Palindrome]({{< relref "/ChapterFour/0409.Longest-Palindrome.md" >}})
+ - [0410.Split-Array-Largest-Sum]({{< relref "/ChapterFour/0410.Split-Array-Largest-Sum.md" >}})
+ - [0412.Fizz-Buzz]({{< relref "/ChapterFour/0412.Fizz-Buzz.md" >}})
+ - [0414.Third-Maximum-Number]({{< relref "/ChapterFour/0414.Third-Maximum-Number.md" >}})
+ - [0416.Partition-Equal-Subset-Sum]({{< relref "/ChapterFour/0416.Partition-Equal-Subset-Sum.md" >}})
+ - [0421.Maximum-XOR-of-Two-Numbers-in-an-Array]({{< relref "/ChapterFour/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})
+ - [0424.Longest-Repeating-Character-Replacement]({{< relref "/ChapterFour/0424.Longest-Repeating-Character-Replacement.md" >}})
+ - [0433.Minimum-Genetic-Mutation]({{< relref "/ChapterFour/0433.Minimum-Genetic-Mutation.md" >}})
+ - [0435.Non-overlapping-Intervals]({{< relref "/ChapterFour/0435.Non-overlapping-Intervals.md" >}})
+ - [0436.Find-Right-Interval]({{< relref "/ChapterFour/0436.Find-Right-Interval.md" >}})
+ - [0437.Path-Sum-III]({{< relref "/ChapterFour/0437.Path-Sum-III.md" >}})
+ - [0438.Find-All-Anagrams-in-a-String]({{< relref "/ChapterFour/0438.Find-All-Anagrams-in-a-String.md" >}})
+ - [0441.Arranging-Coins]({{< relref "/ChapterFour/0441.Arranging-Coins.md" >}})
+ - [0445.Add-Two-Numbers-II]({{< relref "/ChapterFour/0445.Add-Two-Numbers-II.md" >}})
+ - [0447.Number-of-Boomerangs]({{< relref "/ChapterFour/0447.Number-of-Boomerangs.md" >}})
+ - [0451.Sort-Characters-By-Frequency]({{< relref "/ChapterFour/0451.Sort-Characters-By-Frequency.md" >}})
+ - [0454.4Sum-II]({{< relref "/ChapterFour/0454.4Sum-II.md" >}})
+ - [0455.Assign-Cookies]({{< relref "/ChapterFour/0455.Assign-Cookies.md" >}})
+ - [0456.132-Pattern]({{< relref "/ChapterFour/0456.132-Pattern.md" >}})
+ - [0457.Circular-Array-Loop]({{< relref "/ChapterFour/0457.Circular-Array-Loop.md" >}})
+ - [0461.Hamming-Distance]({{< relref "/ChapterFour/0461.Hamming-Distance.md" >}})
+ - [0463.Island-Perimeter]({{< relref "/ChapterFour/0463.Island-Perimeter.md" >}})
+ - [0470.Implement-Rand10-Using-Rand7]({{< relref "/ChapterFour/0470.Implement-Rand10-Using-Rand7.md" >}})
+ - [0474.Ones-and-Zeroes]({{< relref "/ChapterFour/0474.Ones-and-Zeroes.md" >}})
+ - [0475.Heaters]({{< relref "/ChapterFour/0475.Heaters.md" >}})
+ - [0476.Number-Complement]({{< relref "/ChapterFour/0476.Number-Complement.md" >}})
+ - [0477.Total-Hamming-Distance]({{< relref "/ChapterFour/0477.Total-Hamming-Distance.md" >}})
+ - [0480.Sliding-Window-Median]({{< relref "/ChapterFour/0480.Sliding-Window-Median.md" >}})
+ - [0483.Smallest-Good-Base]({{< relref "/ChapterFour/0483.Smallest-Good-Base.md" >}})
+ - [0491.Increasing-Subsequences]({{< relref "/ChapterFour/0491.Increasing-Subsequences.md" >}})
+ - [0493.Reverse-Pairs]({{< relref "/ChapterFour/0493.Reverse-Pairs.md" >}})
+ - [0494.Target-Sum]({{< relref "/ChapterFour/0494.Target-Sum.md" >}})
+ - [0496.Next-Greater-Element-I]({{< relref "/ChapterFour/0496.Next-Greater-Element-I.md" >}})
+ - [0497.Random-Point-in-Non-overlapping-Rectangles]({{< relref "/ChapterFour/0497.Random-Point-in-Non-overlapping-Rectangles.md" >}})
+ - [0498.Diagonal-Traverse]({{< relref "/ChapterFour/0498.Diagonal-Traverse.md" >}})
+ - [0500.Keyboard-Row]({{< relref "/ChapterFour/0500.Keyboard-Row.md" >}})
+ - [0503.Next-Greater-Element-II]({{< relref "/ChapterFour/0503.Next-Greater-Element-II.md" >}})
+ - [0508.Most-Frequent-Subtree-Sum]({{< relref "/ChapterFour/0508.Most-Frequent-Subtree-Sum.md" >}})
+ - [0509.Fibonacci-Number]({{< relref "/ChapterFour/0509.Fibonacci-Number.md" >}})
+ - [0513.Find-Bottom-Left-Tree-Value]({{< relref "/ChapterFour/0513.Find-Bottom-Left-Tree-Value.md" >}})
+ - [0515.Find-Largest-Value-in-Each-Tree-Row]({{< relref "/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}})
+ - [0524.Longest-Word-in-Dictionary-through-Deleting]({{< relref "/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})
+ - [0526.Beautiful-Arrangement]({{< relref "/ChapterFour/0526.Beautiful-Arrangement.md" >}})
+ - [0528.Random-Pick-with-Weight]({{< relref "/ChapterFour/0528.Random-Pick-with-Weight.md" >}})
+ - [0529.Minesweeper]({{< relref "/ChapterFour/0529.Minesweeper.md" >}})
+ - [0532.K-diff-Pairs-in-an-Array]({{< relref "/ChapterFour/0532.K-diff-Pairs-in-an-Array.md" >}})
+ - [0541.Reverse-String-II]({{< relref "/ChapterFour/0541.Reverse-String-II.md" >}})
+ - [0542.01-Matrix]({{< relref "/ChapterFour/0542.01-Matrix.md" >}})
+ - [0547.Friend-Circles]({{< relref "/ChapterFour/0547.Friend-Circles.md" >}})
+ - [0557.Reverse-Words-in-a-String-III]({{< relref "/ChapterFour/0557.Reverse-Words-in-a-String-III.md" >}})
+ - [0563.Binary-Tree-Tilt]({{< relref "/ChapterFour/0563.Binary-Tree-Tilt.md" >}})
+ - [0566.Reshape-the-Matrix]({{< relref "/ChapterFour/0566.Reshape-the-Matrix.md" >}})
+ - [0567.Permutation-in-String]({{< relref "/ChapterFour/0567.Permutation-in-String.md" >}})
+ - [0572.Subtree-of-Another-Tree]({{< relref "/ChapterFour/0572.Subtree-of-Another-Tree.md" >}})
+ - [0575.Distribute-Candies]({{< relref "/ChapterFour/0575.Distribute-Candies.md" >}})
+ - [0594.Longest-Harmonious-Subsequence]({{< relref "/ChapterFour/0594.Longest-Harmonious-Subsequence.md" >}})
+ - [0599.Minimum-Index-Sum-of-Two-Lists]({{< relref "/ChapterFour/0599.Minimum-Index-Sum-of-Two-Lists.md" >}})
+ - [0628.Maximum-Product-of-Three-Numbers]({{< relref "/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md" >}})
+ - [0632.Smallest-Range-Covering-Elements-from-K-Lists]({{< relref "/ChapterFour/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})
+ - [0633.Sum-of-Square-Numbers]({{< relref "/ChapterFour/0633.Sum-of-Square-Numbers.md" >}})
+ - [0636.Exclusive-Time-of-Functions]({{< relref "/ChapterFour/0636.Exclusive-Time-of-Functions.md" >}})
+ - [0637.Average-of-Levels-in-Binary-Tree]({{< relref "/ChapterFour/0637.Average-of-Levels-in-Binary-Tree.md" >}})
+ - [0638.Shopping-Offers]({{< relref "/ChapterFour/0638.Shopping-Offers.md" >}})
+ - [0645.Set-Mismatch]({{< relref "/ChapterFour/0645.Set-Mismatch.md" >}})
+ - [0648.Replace-Words]({{< relref "/ChapterFour/0648.Replace-Words.md" >}})
+ - [0653.Two-Sum-IV---Input-is-a-BST]({{< relref "/ChapterFour/0653.Two-Sum-IV---Input-is-a-BST.md" >}})
+ - [0658.Find-K-Closest-Elements]({{< relref "/ChapterFour/0658.Find-K-Closest-Elements.md" >}})
+ - [0662.Maximum-Width-of-Binary-Tree]({{< relref "/ChapterFour/0662.Maximum-Width-of-Binary-Tree.md" >}})
+ - [0668.Kth-Smallest-Number-in-Multiplication-Table]({{< relref "/ChapterFour/0668.Kth-Smallest-Number-in-Multiplication-Table.md" >}})
+ - [0676.Implement-Magic-Dictionary]({{< relref "/ChapterFour/0676.Implement-Magic-Dictionary.md" >}})
+ - [0682.Baseball-Game]({{< relref "/ChapterFour/0682.Baseball-Game.md" >}})
+ - [0684.Redundant-Connection]({{< relref "/ChapterFour/0684.Redundant-Connection.md" >}})
+ - [0685.Redundant-Connection-II]({{< relref "/ChapterFour/0685.Redundant-Connection-II.md" >}})
+ - [0693.Binary-Number-with-Alternating-Bits]({{< relref "/ChapterFour/0693.Binary-Number-with-Alternating-Bits.md" >}})
+ - [0695.Max-Area-of-Island]({{< relref "/ChapterFour/0695.Max-Area-of-Island.md" >}})
+ - [0699.Falling-Squares]({{< relref "/ChapterFour/0699.Falling-Squares.md" >}})
+ - [0704.Binary-Search]({{< relref "/ChapterFour/0704.Binary-Search.md" >}})
+ - [0705.Design-HashSet]({{< relref "/ChapterFour/0705.Design-HashSet.md" >}})
+ - [0706.Design-HashMap]({{< relref "/ChapterFour/0706.Design-HashMap.md" >}})
+ - [0707.Design-Linked-List]({{< relref "/ChapterFour/0707.Design-Linked-List.md" >}})
+ - [0710.Random-Pick-with-Blacklist]({{< relref "/ChapterFour/0710.Random-Pick-with-Blacklist.md" >}})
+ - [0713.Subarray-Product-Less-Than-K]({{< relref "/ChapterFour/0713.Subarray-Product-Less-Than-K.md" >}})
+ - [0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee]({{< relref "/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})
+ - [0715.Range-Module]({{< relref "/ChapterFour/0715.Range-Module.md" >}})
+ - [0717.1-bit-and-2-bit-Characters]({{< relref "/ChapterFour/0717.1-bit-and-2-bit-Characters.md" >}})
+ - [0718.Maximum-Length-of-Repeated-Subarray]({{< relref "/ChapterFour/0718.Maximum-Length-of-Repeated-Subarray.md" >}})
+ - [0719.Find-K-th-Smallest-Pair-Distance]({{< relref "/ChapterFour/0719.Find-K-th-Smallest-Pair-Distance.md" >}})
+ - [0720.Longest-Word-in-Dictionary]({{< relref "/ChapterFour/0720.Longest-Word-in-Dictionary.md" >}})
+ - [0721.Accounts-Merge]({{< relref "/ChapterFour/0721.Accounts-Merge.md" >}})
+ - [0725.Split-Linked-List-in-Parts]({{< relref "/ChapterFour/0725.Split-Linked-List-in-Parts.md" >}})
+ - [0726.Number-of-Atoms]({{< relref "/ChapterFour/0726.Number-of-Atoms.md" >}})
+ - [0729.My-Calendar-I]({{< relref "/ChapterFour/0729.My-Calendar-I.md" >}})
+ - [0732.My-Calendar-III]({{< relref "/ChapterFour/0732.My-Calendar-III.md" >}})
+ - [0733.Flood-Fill]({{< relref "/ChapterFour/0733.Flood-Fill.md" >}})
+ - [0735.Asteroid-Collision]({{< relref "/ChapterFour/0735.Asteroid-Collision.md" >}})
+ - [0739.Daily-Temperatures]({{< relref "/ChapterFour/0739.Daily-Temperatures.md" >}})
+ - [0744.Find-Smallest-Letter-Greater-Than-Target]({{< relref "/ChapterFour/0744.Find-Smallest-Letter-Greater-Than-Target.md" >}})
+ - [0745.Prefix-and-Suffix-Search]({{< relref "/ChapterFour/0745.Prefix-and-Suffix-Search.md" >}})
+ - [0746.Min-Cost-Climbing-Stairs]({{< relref "/ChapterFour/0746.Min-Cost-Climbing-Stairs.md" >}})
+ - [0748.Shortest-Completing-Word]({{< relref "/ChapterFour/0748.Shortest-Completing-Word.md" >}})
+ - [0753.Cracking-the-Safe]({{< relref "/ChapterFour/0753.Cracking-the-Safe.md" >}})
+ - [0756.Pyramid-Transition-Matrix]({{< relref "/ChapterFour/0756.Pyramid-Transition-Matrix.md" >}})
+ - [0762.Prime-Number-of-Set-Bits-in-Binary-Representation]({{< relref "/ChapterFour/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md" >}})
+ - [0763.Partition-Labels]({{< relref "/ChapterFour/0763.Partition-Labels.md" >}})
+ - [0765.Couples-Holding-Hands]({{< relref "/ChapterFour/0765.Couples-Holding-Hands.md" >}})
+ - [0766.Toeplitz-Matrix]({{< relref "/ChapterFour/0766.Toeplitz-Matrix.md" >}})
+ - [0767.Reorganize-String]({{< relref "/ChapterFour/0767.Reorganize-String.md" >}})
+ - [0771.Jewels-and-Stones]({{< relref "/ChapterFour/0771.Jewels-and-Stones.md" >}})
+ - [0778.Swim-in-Rising-Water]({{< relref "/ChapterFour/0778.Swim-in-Rising-Water.md" >}})
+ - [0781.Rabbits-in-Forest]({{< relref "/ChapterFour/0781.Rabbits-in-Forest.md" >}})
+ - [0784.Letter-Case-Permutation]({{< relref "/ChapterFour/0784.Letter-Case-Permutation.md" >}})
+ - [0786.K-th-Smallest-Prime-Fraction]({{< relref "/ChapterFour/0786.K-th-Smallest-Prime-Fraction.md" >}})
+ - [0793.Preimage-Size-of-Factorial-Zeroes-Function]({{< relref "/ChapterFour/0793.Preimage-Size-of-Factorial-Zeroes-Function.md" >}})
+ - [0802.Find-Eventual-Safe-States]({{< relref "/ChapterFour/0802.Find-Eventual-Safe-States.md" >}})
+ - [0803.Bricks-Falling-When-Hit]({{< relref "/ChapterFour/0803.Bricks-Falling-When-Hit.md" >}})
+ - [0811.Subdomain-Visit-Count]({{< relref "/ChapterFour/0811.Subdomain-Visit-Count.md" >}})
+ - [0815.Bus-Routes]({{< relref "/ChapterFour/0815.Bus-Routes.md" >}})
+ - [0817.Linked-List-Components]({{< relref "/ChapterFour/0817.Linked-List-Components.md" >}})
+ - [0819.Most-Common-Word]({{< relref "/ChapterFour/0819.Most-Common-Word.md" >}})
+ - [0826.Most-Profit-Assigning-Work]({{< relref "/ChapterFour/0826.Most-Profit-Assigning-Work.md" >}})
+ - [0828.COPYRIGHT-PROBLEM-XXX]({{< relref "/ChapterFour/0828.COPYRIGHT-PROBLEM-XXX.md" >}})
+ - [0834.Sum-of-Distances-in-Tree]({{< relref "/ChapterFour/0834.Sum-of-Distances-in-Tree.md" >}})
+ - [0836.Rectangle-Overlap]({{< relref "/ChapterFour/0836.Rectangle-Overlap.md" >}})
+ - [0838.Push-Dominoes]({{< relref "/ChapterFour/0838.Push-Dominoes.md" >}})
+ - [0839.Similar-String-Groups]({{< relref "/ChapterFour/0839.Similar-String-Groups.md" >}})
+ - [0841.Keys-and-Rooms]({{< relref "/ChapterFour/0841.Keys-and-Rooms.md" >}})
+ - [0842.Split-Array-into-Fibonacci-Sequence]({{< relref "/ChapterFour/0842.Split-Array-into-Fibonacci-Sequence.md" >}})
+ - [0844.Backspace-String-Compare]({{< relref "/ChapterFour/0844.Backspace-String-Compare.md" >}})
+ - [0845.Longest-Mountain-in-Array]({{< relref "/ChapterFour/0845.Longest-Mountain-in-Array.md" >}})
+ - [0850.Rectangle-Area-II]({{< relref "/ChapterFour/0850.Rectangle-Area-II.md" >}})
+ - [0851.Loud-and-Rich]({{< relref "/ChapterFour/0851.Loud-and-Rich.md" >}})
+ - [0852.Peak-Index-in-a-Mountain-Array]({{< relref "/ChapterFour/0852.Peak-Index-in-a-Mountain-Array.md" >}})
+ - [0853.Car-Fleet]({{< relref "/ChapterFour/0853.Car-Fleet.md" >}})
+ - [0856.Score-of-Parentheses]({{< relref "/ChapterFour/0856.Score-of-Parentheses.md" >}})
+ - [0862.Shortest-Subarray-with-Sum-at-Least-K]({{< relref "/ChapterFour/0862.Shortest-Subarray-with-Sum-at-Least-K.md" >}})
+ - [0863.All-Nodes-Distance-K-in-Binary-Tree]({{< relref "/ChapterFour/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})
+ - [0864.Shortest-Path-to-Get-All-Keys]({{< relref "/ChapterFour/0864.Shortest-Path-to-Get-All-Keys.md" >}})
+ - [0867.Transpose-Matrix]({{< relref "/ChapterFour/0867.Transpose-Matrix.md" >}})
+ - [0872.Leaf-Similar-Trees]({{< relref "/ChapterFour/0872.Leaf-Similar-Trees.md" >}})
+ - [0875.Koko-Eating-Bananas]({{< relref "/ChapterFour/0875.Koko-Eating-Bananas.md" >}})
+ - [0876.Middle-of-the-Linked-List]({{< relref "/ChapterFour/0876.Middle-of-the-Linked-List.md" >}})
+ - [0878.Nth-Magical-Number]({{< relref "/ChapterFour/0878.Nth-Magical-Number.md" >}})
+ - [0880.Decoded-String-at-Index]({{< relref "/ChapterFour/0880.Decoded-String-at-Index.md" >}})
+ - [0881.Boats-to-Save-People]({{< relref "/ChapterFour/0881.Boats-to-Save-People.md" >}})
+ - [0884.Uncommon-Words-from-Two-Sentences]({{< relref "/ChapterFour/0884.Uncommon-Words-from-Two-Sentences.md" >}})
+ - [0885.Spiral-Matrix-III]({{< relref "/ChapterFour/0885.Spiral-Matrix-III.md" >}})
+ - [0887.Super-Egg-Drop]({{< relref "/ChapterFour/0887.Super-Egg-Drop.md" >}})
+ - [0891.Sum-of-Subsequence-Widths]({{< relref "/ChapterFour/0891.Sum-of-Subsequence-Widths.md" >}})
+ - [0895.Maximum-Frequency-Stack]({{< relref "/ChapterFour/0895.Maximum-Frequency-Stack.md" >}})
+ - [0897.Increasing-Order-Search-Tree]({{< relref "/ChapterFour/0897.Increasing-Order-Search-Tree.md" >}})
+ - [0898.Bitwise-ORs-of-Subarrays]({{< relref "/ChapterFour/0898.Bitwise-ORs-of-Subarrays.md" >}})
+ - [0901.Online-Stock-Span]({{< relref "/ChapterFour/0901.Online-Stock-Span.md" >}})
+ - [0904.Fruit-Into-Baskets]({{< relref "/ChapterFour/0904.Fruit-Into-Baskets.md" >}})
+ - [0907.Sum-of-Subarray-Minimums]({{< relref "/ChapterFour/0907.Sum-of-Subarray-Minimums.md" >}})
+ - [0911.Online-Election]({{< relref "/ChapterFour/0911.Online-Election.md" >}})
+ - [0918.Maximum-Sum-Circular-Subarray]({{< relref "/ChapterFour/0918.Maximum-Sum-Circular-Subarray.md" >}})
+ - [0920.Number-of-Music-Playlists]({{< relref "/ChapterFour/0920.Number-of-Music-Playlists.md" >}})
+ - [0921.Minimum-Add-to-Make-Parentheses-Valid]({{< relref "/ChapterFour/0921.Minimum-Add-to-Make-Parentheses-Valid.md" >}})
+ - [0922.Sort-Array-By-Parity-II]({{< relref "/ChapterFour/0922.Sort-Array-By-Parity-II.md" >}})
+ - [0923.3Sum-With-Multiplicity]({{< relref "/ChapterFour/0923.3Sum-With-Multiplicity.md" >}})
+ - [0924.Minimize-Malware-Spread]({{< relref "/ChapterFour/0924.Minimize-Malware-Spread.md" >}})
+ - [0925.Long-Pressed-Name]({{< relref "/ChapterFour/0925.Long-Pressed-Name.md" >}})
+ - [0927.Three-Equal-Parts]({{< relref "/ChapterFour/0927.Three-Equal-Parts.md" >}})
+ - [0928.Minimize-Malware-Spread-II]({{< relref "/ChapterFour/0928.Minimize-Malware-Spread-II.md" >}})
+ - [0930.Binary-Subarrays-With-Sum]({{< relref "/ChapterFour/0930.Binary-Subarrays-With-Sum.md" >}})
+ - [0933.Number-of-Recent-Calls]({{< relref "/ChapterFour/0933.Number-of-Recent-Calls.md" >}})
+ - [0942.DI-String-Match]({{< relref "/ChapterFour/0942.DI-String-Match.md" >}})
+ - [0946.Validate-Stack-Sequences]({{< relref "/ChapterFour/0946.Validate-Stack-Sequences.md" >}})
+ - [0947.Most-Stones-Removed-with-Same-Row-or-Column]({{< relref "/ChapterFour/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})
+ - [0952.Largest-Component-Size-by-Common-Factor]({{< relref "/ChapterFour/0952.Largest-Component-Size-by-Common-Factor.md" >}})
+ - [0953.Verifying-an-Alien-Dictionary]({{< relref "/ChapterFour/0953.Verifying-an-Alien-Dictionary.md" >}})
+ - [0959.Regions-Cut-By-Slashes]({{< relref "/ChapterFour/0959.Regions-Cut-By-Slashes.md" >}})
+ - [0961.N-Repeated-Element-in-Size-2N-Array]({{< relref "/ChapterFour/0961.N-Repeated-Element-in-Size-2N-Array.md" >}})
+ - [0968.Binary-Tree-Cameras]({{< relref "/ChapterFour/0968.Binary-Tree-Cameras.md" >}})
+ - [0969.Pancake-Sorting]({{< relref "/ChapterFour/0969.Pancake-Sorting.md" >}})
+ - [0970.Powerful-Integers]({{< relref "/ChapterFour/0970.Powerful-Integers.md" >}})
+ - [0973.K-Closest-Points-to-Origin]({{< relref "/ChapterFour/0973.K-Closest-Points-to-Origin.md" >}})
+ - [0976.Largest-Perimeter-Triangle]({{< relref "/ChapterFour/0976.Largest-Perimeter-Triangle.md" >}})
+ - [0977.Squares-of-a-Sorted-Array]({{< relref "/ChapterFour/0977.Squares-of-a-Sorted-Array.md" >}})
+ - [0978.Longest-Turbulent-Subarray]({{< relref "/ChapterFour/0978.Longest-Turbulent-Subarray.md" >}})
+ - [0979.Distribute-Coins-in-Binary-Tree]({{< relref "/ChapterFour/0979.Distribute-Coins-in-Binary-Tree.md" >}})
+ - [0980.Unique-Paths-III]({{< relref "/ChapterFour/0980.Unique-Paths-III.md" >}})
+ - [0981.Time-Based-Key-Value-Store]({{< relref "/ChapterFour/0981.Time-Based-Key-Value-Store.md" >}})
+ - [0984.String-Without-AAA-or-BBB]({{< relref "/ChapterFour/0984.String-Without-AAA-or-BBB.md" >}})
+ - [0986.Interval-List-Intersections]({{< relref "/ChapterFour/0986.Interval-List-Intersections.md" >}})
+ - [0990.Satisfiability-of-Equality-Equations]({{< relref "/ChapterFour/0990.Satisfiability-of-Equality-Equations.md" >}})
+ - [0992.Subarrays-with-K-Different-Integers]({{< relref "/ChapterFour/0992.Subarrays-with-K-Different-Integers.md" >}})
+ - [0993.Cousins-in-Binary-Tree]({{< relref "/ChapterFour/0993.Cousins-in-Binary-Tree.md" >}})
+ - [0995.Minimum-Number-of-K-Consecutive-Bit-Flips]({{< relref "/ChapterFour/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md" >}})
+ - [0996.Number-of-Squareful-Arrays]({{< relref "/ChapterFour/0996.Number-of-Squareful-Arrays.md" >}})
+ - [1002.Find-Common-Characters]({{< relref "/ChapterFour/1002.Find-Common-Characters.md" >}})
+ - [1003.Check-If-Word-Is-Valid-After-Substitutions]({{< relref "/ChapterFour/1003.Check-If-Word-Is-Valid-After-Substitutions.md" >}})
+ - [1004.Max-Consecutive-Ones-III]({{< relref "/ChapterFour/1004.Max-Consecutive-Ones-III.md" >}})
+ - [1005.Maximize-Sum-Of-Array-After-K-Negations]({{< relref "/ChapterFour/1005.Maximize-Sum-Of-Array-After-K-Negations.md" >}})
+ - [1011.Capacity-To-Ship-Packages-Within-D-Days]({{< relref "/ChapterFour/1011.Capacity-To-Ship-Packages-Within-D-Days.md" >}})
+ - [1017.Convert-to-Base--2]({{< relref "/ChapterFour/1017.Convert-to-Base--2.md" >}})
+ - [1019.Next-Greater-Node-In-Linked-List]({{< relref "/ChapterFour/1019.Next-Greater-Node-In-Linked-List.md" >}})
+ - [1020.Number-of-Enclaves]({{< relref "/ChapterFour/1020.Number-of-Enclaves.md" >}})
+ - [1021.Remove-Outermost-Parentheses]({{< relref "/ChapterFour/1021.Remove-Outermost-Parentheses.md" >}})
+ - [1025.Divisor-Game]({{< relref "/ChapterFour/1025.Divisor-Game.md" >}})
+ - [1026.Maximum-Difference-Between-Node-and-Ancestor]({{< relref "/ChapterFour/1026.Maximum-Difference-Between-Node-and-Ancestor.md" >}})
+ - [1028.Recover-a-Tree-From-Preorder-Traversal]({{< relref "/ChapterFour/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})
+ - [1030.Matrix-Cells-in-Distance-Order]({{< relref "/ChapterFour/1030.Matrix-Cells-in-Distance-Order.md" >}})
+ - [1040.Moving-Stones-Until-Consecutive-II]({{< relref "/ChapterFour/1040.Moving-Stones-Until-Consecutive-II.md" >}})
+ - [1047.Remove-All-Adjacent-Duplicates-In-String]({{< relref "/ChapterFour/1047.Remove-All-Adjacent-Duplicates-In-String.md" >}})
+ - [1049.Last-Stone-Weight-II]({{< relref "/ChapterFour/1049.Last-Stone-Weight-II.md" >}})
+ - [1052.Grumpy-Bookstore-Owner]({{< relref "/ChapterFour/1052.Grumpy-Bookstore-Owner.md" >}})
+ - [1054.Distant-Barcodes]({{< relref "/ChapterFour/1054.Distant-Barcodes.md" >}})
+ - [1073.Adding-Two-Negabinary-Numbers]({{< relref "/ChapterFour/1073.Adding-Two-Negabinary-Numbers.md" >}})
+ - [1074.Number-of-Submatrices-That-Sum-to-Target]({{< relref "/ChapterFour/1074.Number-of-Submatrices-That-Sum-to-Target.md" >}})
+ - [1078.Occurrences-After-Bigram]({{< relref "/ChapterFour/1078.Occurrences-After-Bigram.md" >}})
+ - [1079.Letter-Tile-Possibilities]({{< relref "/ChapterFour/1079.Letter-Tile-Possibilities.md" >}})
+ - [1093.Statistics-from-a-Large-Sample]({{< relref "/ChapterFour/1093.Statistics-from-a-Large-Sample.md" >}})
+ - [1105.Filling-Bookcase-Shelves]({{< relref "/ChapterFour/1105.Filling-Bookcase-Shelves.md" >}})
+ - [1108.Defanging-an-IP-Address]({{< relref "/ChapterFour/1108.Defanging-an-IP-Address.md" >}})
+ - [1110.Delete-Nodes-And-Return-Forest]({{< relref "/ChapterFour/1110.Delete-Nodes-And-Return-Forest.md" >}})
+ - [1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings]({{< relref "/ChapterFour/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md" >}})
+ - [1122.Relative-Sort-Array]({{< relref "/ChapterFour/1122.Relative-Sort-Array.md" >}})
+ - [1123.Lowest-Common-Ancestor-of-Deepest-Leaves]({{< relref "/ChapterFour/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})
+ - [1128.Number-of-Equivalent-Domino-Pairs]({{< relref "/ChapterFour/1128.Number-of-Equivalent-Domino-Pairs.md" >}})
+ - [1137.N-th-Tribonacci-Number]({{< relref "/ChapterFour/1137.N-th-Tribonacci-Number.md" >}})
+ - [1145.Binary-Tree-Coloring-Game]({{< relref "/ChapterFour/1145.Binary-Tree-Coloring-Game.md" >}})
+ - [1154.Day-of-the-Year]({{< relref "/ChapterFour/1154.Day-of-the-Year.md" >}})
+ - [1157.Online-Majority-Element-In-Subarray]({{< relref "/ChapterFour/1157.Online-Majority-Element-In-Subarray.md" >}})
+ - [1160.Find-Words-That-Can-Be-Formed-by-Characters]({{< relref "/ChapterFour/1160.Find-Words-That-Can-Be-Formed-by-Characters.md" >}})
+ - [1170.Compare-Strings-by-Frequency-of-the-Smallest-Character]({{< relref "/ChapterFour/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})
+ - [1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List]({{< relref "/ChapterFour/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md" >}})
+ - [1175.Prime-Arrangements]({{< relref "/ChapterFour/1175.Prime-Arrangements.md" >}})
+ - [1184.Distance-Between-Bus-Stops]({{< relref "/ChapterFour/1184.Distance-Between-Bus-Stops.md" >}})
+ - [1185.Day-of-the-Week]({{< relref "/ChapterFour/1185.Day-of-the-Week.md" >}})
+ - [1189.Maximum-Number-of-Balloons]({{< relref "/ChapterFour/1189.Maximum-Number-of-Balloons.md" >}})
+ - [1200.Minimum-Absolute-Difference]({{< relref "/ChapterFour/1200.Minimum-Absolute-Difference.md" >}})
+ - [1201.Ugly-Number-III]({{< relref "/ChapterFour/1201.Ugly-Number-III.md" >}})
+ - [1202.Smallest-String-With-Swaps]({{< relref "/ChapterFour/1202.Smallest-String-With-Swaps.md" >}})
+ - [1207.Unique-Number-of-Occurrences]({{< relref "/ChapterFour/1207.Unique-Number-of-Occurrences.md" >}})
+ - [1208.Get-Equal-Substrings-Within-Budget]({{< relref "/ChapterFour/1208.Get-Equal-Substrings-Within-Budget.md" >}})
+ - [1217.Play-with-Chips]({{< relref "/ChapterFour/1217.Play-with-Chips.md" >}})
+ - [1221.Split-a-String-in-Balanced-Strings]({{< relref "/ChapterFour/1221.Split-a-String-in-Balanced-Strings.md" >}})
+ - [1232.Check-If-It-Is-a-Straight-Line]({{< relref "/ChapterFour/1232.Check-If-It-Is-a-Straight-Line.md" >}})
+ - [1234.Replace-the-Substring-for-Balanced-String]({{< relref "/ChapterFour/1234.Replace-the-Substring-for-Balanced-String.md" >}})
+ - [1235.Maximum-Profit-in-Job-Scheduling]({{< relref "/ChapterFour/1235.Maximum-Profit-in-Job-Scheduling.md" >}})
+ - [1252.Cells-with-Odd-Values-in-a-Matrix]({{< relref "/ChapterFour/1252.Cells-with-Odd-Values-in-a-Matrix.md" >}})
+ - [1254.Number-of-Closed-Islands]({{< relref "/ChapterFour/1254.Number-of-Closed-Islands.md" >}})
+ - [1266.Minimum-Time-Visiting-All-Points]({{< relref "/ChapterFour/1266.Minimum-Time-Visiting-All-Points.md" >}})
+ - [1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer]({{< relref "/ChapterFour/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md" >}})
+ - [1283.Find-the-Smallest-Divisor-Given-a-Threshold]({{< relref "/ChapterFour/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md" >}})
+ - [1287.Element-Appearing-More-Than-25%-In-Sorted-Array]({{< relref "/ChapterFour/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md" >}})
+ - [1290.Convert-Binary-Number-in-a-Linked-List-to-Integer]({{< relref "/ChapterFour/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md" >}})
+ - [1295.Find-Numbers-with-Even-Number-of-Digits]({{< relref "/ChapterFour/1295.Find-Numbers-with-Even-Number-of-Digits.md" >}})
+ - [1299.Replace-Elements-with-Greatest-Element-on-Right-Side]({{< relref "/ChapterFour/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md" >}})
+ - [1300.Sum-of-Mutated-Array-Closest-to-Target]({{< relref "/ChapterFour/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})
+ - [1302.Deepest-Leaves-Sum]({{< relref "/ChapterFour/1302.Deepest-Leaves-Sum.md" >}})
+ - [1304.Find-N-Unique-Integers-Sum-up-to-Zero]({{< relref "/ChapterFour/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md" >}})
+ - [1305.All-Elements-in-Two-Binary-Search-Trees]({{< relref "/ChapterFour/1305.All-Elements-in-Two-Binary-Search-Trees.md" >}})
+ - [1306.Jump-Game-III]({{< relref "/ChapterFour/1306.Jump-Game-III.md" >}})