From 715f7a439271878271464121e795a963c3faa210 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=BC=A0=E5=B8=B8=E4=B9=90?= <changle0331@gmail.com>
Date: Sat, 28 Sep 2019 03:19:48 +0800
Subject: [PATCH 1/5] Update README.md

---
 README.md | 14 +++++++++++---
 1 file changed, 11 insertions(+), 3 deletions(-)

diff --git a/README.md b/README.md
index 5d12215..5d1d59d 100644
--- a/README.md
+++ b/README.md
@@ -1,5 +1,13 @@
-- [x] 学习数据结构
 ---
-- [ ] 学习算法中
 
-会解决少量相关 LeetCode 问题
+**分支已切换到 `amazing` **
+
+DODING:
+  * - [x] 学习算法中
+
+---
+
+FINISHED:
+  * - [x] 学习数据结构
+---
+

From 7d18890c24d8bca0df02596fdb549656a416c709 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=BC=A0=E5=B8=B8=E4=B9=90?= <changle0331@gmail.com>
Date: Sat, 28 Sep 2019 03:21:32 +0800
Subject: [PATCH 2/5] Update README.md

---
 README.md | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/README.md b/README.md
index 5d1d59d..fe7fdde 100644
--- a/README.md
+++ b/README.md
@@ -1,9 +1,10 @@
----
-
 **分支已切换到 `amazing` **
 
+---
+
 DODING:
-  * - [x] 学习算法中
+  * - [ ] 学习算法中
+  * - [ ] LeetCode
 
 ---
 

From c5fd8d52e9a63d71eced6ddf494484cdd9cebcc8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=BC=A0=E5=B8=B8=E4=B9=90?= <changle0331@gmail.com>
Date: Sat, 28 Sep 2019 03:21:56 +0800
Subject: [PATCH 3/5] Update README.md

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index fe7fdde..6f0c319 100644
--- a/README.md
+++ b/README.md
@@ -1,4 +1,4 @@
-**分支已切换到 `amazing` **
+**分支已切换到 `amazing`**
 
 ---
 

From 4dc9464b6953785f47eff527fc5626bd8fb0cd4b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=BC=A0=E5=B8=B8=E4=B9=90?= <changle0331@gmail.com>
Date: Mon, 30 Sep 2019 17:21:40 +0800
Subject: [PATCH 4/5] 0066 V1.0

---
 LeetCode/0066. Plus One/src/Solution.java | 24 +++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 LeetCode/0066. Plus One/src/Solution.java

diff --git a/LeetCode/0066. Plus One/src/Solution.java b/LeetCode/0066. Plus One/src/Solution.java
new file mode 100644
index 0000000..51f20b2
--- /dev/null
+++ b/LeetCode/0066. Plus One/src/Solution.java	
@@ -0,0 +1,24 @@
+import java.util.Arrays;
+
+/**
+ * @author Changle
+ * @date 2019/9/30 15:48
+ * source: https://leetcode.com/problems/plus-one/
+ */
+
+public class Solution {
+
+    public static int[] plusOne(int[] digits) {
+        for (int i = digits.length - 1; i >= 0; i--) {
+            digits[i]++;
+            digits[i] %= 10;
+            if (digits[i] != 0) {
+                return digits;
+            }
+        }
+        //如果 digits 第 1 位为 0，那么后面的所有位都为 0，只需要将进位赋值到新数组的第 1 位即可
+        digits = new int[digits.length + 1];
+        digits[0] = 1;
+        return digits;
+    }
+}

From a1f4eddc568ca052918fa1a1f2610f144c92fcb9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=BC=A0=E5=B8=B8=E4=B9=90?= <changle0331@gmail.com>
Date: Sat, 23 Nov 2019 14:19:11 +0800
Subject: [PATCH 5/5] Update README.md

---
 README.md | 91 ++++++++++++++++++++++++++++++++++++++++++++++++-------
 1 file changed, 80 insertions(+), 11 deletions(-)

diff --git a/README.md b/README.md
index 6f0c319..281f6b4 100644
--- a/README.md
+++ b/README.md
@@ -1,14 +1,83 @@
 **分支已切换到 `amazing`**
 
----
-
-DODING:
-  * - [ ] 学习算法中
-  * - [ ] LeetCode
-
----
-
-FINISHED:
-  * - [x] 学习数据结构
----
+# LeetCode
 
+| ID   | Problem                                                      | Solution                                                     | Difficulty | Remark        |
+| ---- | ------------------------------------------------------------ | ------------------------------------------------------------ | ---------- | ------------- |
+| 0001 | [Two Sum](https://leetcode.com/problems/two-sum/)            | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0001.%20Two%20Sum/src/Solution.java) | Easy       |               |
+| 0002 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0002.%20Add%20Two%20Numbers/src/Solution.java) | Medium     |               |
+| 0003 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0003.%20Longest%20Substring%20Without%20Repeating%20Characters/src/Solution.java) | Medium     |               |
+| 0004 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0004.%20Median%20of%20Two%20Sorted%20Arrays/src/Solution.java) | Hard       |               |
+| 0005 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0005.%20Longest%20Palindromic%20Substring/src/Solution.java) | Medium     | To Optimize   |
+| 0007 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0007.%20Reverse%20Integer/src/Solution.java) | Easy  |     |
+| 0009 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0009.%20Palindrome%20Number/src/Solution.java) | Easy       |               |
+| 0011 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0011.%20Container%20With%20Most%20Water/src/Solution.java) | Medium |               |
+| 0013 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0013.%20Roman%20to%20Integer/src/Solution.java) | Easy | Not Recommend |
+| 0014 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0014.%20Longest%20Common%20Prefix/src/Solution.java) | Easy |               |
+| 0015 | [3Sum](https://leetcode.com/problems/3sum/)                  | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0015.%203Sum/src/Solution.java) | Medium |               |
+| 0016 | [3Sum Closest](https://leetcode.com/problems/3sum-closest/)  | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0016.%203Sum%20Closest/src/Solution.java) | Medium |               |
+| 0017 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0017.%20Letter%20Combinations%20of%20a%20Phone%20Number/src/Solution.java) | Medium |               |
+| 0018 | [4Sum](https://leetcode.com/problems/4sum/)                  | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0018.%204Sum/src/Solution.java) | Medium |               |
+| 0020 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0020.%20Valid%20Parentheses/src/Solution.java) | Easy |               |
+| 0021 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0021.%20Merge%20Two%20Sorted%20Lists/src/Solution.java) | Easy |               |
+| 0026 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0026.%20Remove%20Duplicates%20from%20Sorted%20Array/src/Solution.java) | Easy |               |
+| 0027 | [Remove Element](https://leetcode.com/problems/remove-element/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0027.%20Remove%20Element/src/Solution.java) | Easy |               |
+| 0035 | [ Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0035.%20Search%20Insert%20Position/src/Solution.java) | Easy |               |
+| 0046 | [Permutations](https://leetcode.com/problems/permutations/)  | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0046.%20Permutations/src/Solution.java) | Medium |               |
+| 0049 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0049.%20Group%20Anagrams/src/Solution.java) | Medium |               |
+| 0062 | [Unique Paths](https://leetcode.com/problems/unique-paths/)  | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0062.%20Unique%20Paths/src/Solution.java) | Medium |               |
+| 0063 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0063.%20Unique%20Paths%20II/src/Solution.java) | Medium |               |
+| 0064 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0064.%20Minimum%20Path%20Sum/src/Solution.java) | Medium ||
+| 0066 | [Plus One](https://leetcode.com/problems/plus-one/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0066.%20Plus%20One/src/Solution.java) | Easy |   |
+| 0070 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0070.%20Climbing%20Stairs/src/Solution.java) | Easy |               |
+| 0075 | [Sort Colors](https://leetcode.com/problems/sort-colors/)    | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0075.%20Sort%20Colors/src/Solution.java) | Medium |               |
+| 0076 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0076.%20Minimum%20Window%20Substring/src/Solution.java) | Hard |               |
+| 0080 | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0080.%20Remove%20Duplicates%20from%20Sorted%20Array%20II/src/Solution.java) | Medium |               |
+| 0088 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0088.%20Merge%20Sorted%20Array/src/Solution.java) | Easy |               |
+| 0091 | [Decode Ways](https://leetcode.com/problems/decode-ways/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0091.%20Decode%20Ways/src/Solution.java) | Medium |               |
+| 0093 | [Restore IP Addresses](https://leetcode.com/problems/merge-sorted-array/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0093.%20Restore%20IP%20Addresses/src/Solution2.java) | Medium |               |
+| 0096 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0096.%20Unique%20Binary%20Search%20Trees/src/Solution.java) |Medium |               |
+| 0120 | [Triangle](https://leetcode.com/problems/triangle/)          | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0120.%20Triangle/src/Solution.java) | Medium |               |
+| 0125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0125.%20Valid%20Palindrome/src/Solution.java) | Medium |               |
+| 0131 | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0131.%20Palindrome%20Partitioning/src/Solution.java) | Medium |               |
+| 0149 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0149.%20Max%20Points%20on%20a%20Line/src/Solution.java) | Hard |               |
+| 0167 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0167.%20Two%20Sum%20II%20-%20Input%20array%20is%20sorted/src/Solution.java) | Easy |               |
+| 0198 | [House Robber](https://leetcode.com/problems/house-robber/)  | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0198.%20House%20Robber/src/Solution2.java) | Easy |               |
+| 0202 | [Happy Number](https://leetcode.com/problems/house-robber/)  | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0202.%20Happy%20Number/src/Solution.java) | Easy |               |
+| 0203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0203.%20Remove%20Linked%20List%20Elements/src/Solution.java) | Easy |               |
+| 0205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0205.%20Isomorphic%20Strings/src/Solution.java) | Easy |               |
+| 0208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0208.%20Implement%20Trie%20(Prefix%20Tree)/src/Trie.java) | Medium |               |
+| 0209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0209.%20Minimum%20Size%20Subarray%20Sum/src/Solution.java) | Medium |               |
+| 0211 | [ Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0211.%20Add%20and%20Search%20Word%20-%20Data%20structure%20design/src/WordDictionary.java) | Medium |               |
+| 0213 | [House Robber II](https://leetcode.com/problems/house-robber-ii/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0213.%20House%20Robber%20II/src/Solution.java) | Medium |               |
+| 0215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0215.%20Kth%20Largest%20Element%20in%20an%20Array/src/Solution.java) | Medium |               |
+| 0217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0217.%20Contains%20Duplicate/src/Solution.java) | Easy |               |
+| 0219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0219.%20Contains%20Duplicate%20II/src/Solution.java) | Easy |               |
+| 0220 | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0220.%20Contains%20Duplicate%20III/src/Solution.java) | Medium |               |
+| 0242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0242.%20Valid%20Anagram/src/Solution.java) | Easy |               |
+| 0279 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0279.%20Perfect%20Squares/src/Solution.java) | Medium |               |
+| 0283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/)    | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0283.%20Move%20Zeros/src/Solution.java) | Easy |               |
+| 0290 | [Word Pattern](https://leetcode.com/problems/word-pattern/)  | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0290.%20Word%20Pattern/src/Solution.java) | Easy |               |
+| 0300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0300.%20Longest%20Increasing%20Subsequence/src/Solution.java) | Medium |               |
+| 0303 | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0303.%20Range%20Sum%20Query%20-%20Immutable/src/NumArray1.java) | Easy |               |
+| 0307 | [Range Sum Query - Mutable](https://leetcode.com/problems/longest-increasing-subsequence/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0307.%20Range%20Sum%20Query%20-%20Mutable/src/NumArray.java) | Medium |               |
+| 0338 | [Counting Bits](https://leetcode.com/problems/counting-bits/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0338.%20Counting%20Bits/src/Solution2.java) | Medium |               |
+| 0343 | [Integer Break](https://leetcode.com/problems/integer-break/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0343.%20Integer%20Break/src/Solution.java) | Medium |               |
+| 0344 | [Reverse String](https://leetcode.com/problems/reverse-string/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0344.%20Reverse%20String/src/Solution.java) | Easy |               |
+| 0345 | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0345.%20Reverse%20Vowels%20of%20a%20String/src/Solution.java) | Easy |               |
+| 0347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0347.%20Top%20K%20Frequent%20Elements/src/Solution.java)| Medium | |
+| 0349 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0349.%20Intersection%20of%20Two%20Arrays/src/Solution.java) | Easy |               |
+| 0350 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0350.%20Intersection%20of%20Two%20Arrays%20II/src/Solution.java) | Easy |               |
+| 0376 | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0376.%20Wiggle%20Subsequence/src/Solution.java) | Medium |               |
+| 0438 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0438.%20Find%20All%20Anagrams%20in%20a%20String/src/Solution.java) | Medium |               |
+| 0447 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0447.%20Number%20of%20Boomerangs/src/Solution.java) | Easy |               |
+| 0454 | [4Sum II](https://leetcode.com/problems/number-of-boomerangs/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0454.%204Sum%20II/src/Solution.java) | Medium |               |
+| 0530 | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0530.%20Minimum%20Absolute%20Difference%20in%20BST/src/Solution.java) | Easy |               |
+| 0606 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0606.%20Construct%20String%20from%20Binary%20Tree/src/Solution.java) | Easy |               |
+| 0677 | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0677.%20Map%20Sum%20Pairs/src/MapSum.java) | Medium |               |
+| 0700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0700.%20Search%20in%20a%20Binary%20Search%20Tree/src/Solution.java) | Easy |               |
+| 0783 | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0783.%20Minimum%20Distance%20Between%20BST%20Nodes/src/Solution.java) | Easy |               |
+| 0804 | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0804.%20Unique%20Morse%20Code%20Words/src/Solution.java) | Easy |               |
+| 0877 | [Stone Game](https://leetcode.com/problems/stone-game/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0877.%20Stone%20Game/src/Solution.java) | Medium |               |
+| 0938 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/) | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/0938.%20Range%20Sum%20of%20BST/src/Solution.java) | Easy |               |
+| 1025 | [Divisor Game](https://leetcode.com/problems/divisor-game/)  | [Solution](https://github.com/ChangleAmazing/DataStructure-Algorithm/blob/amazing/LeetCode/1025.%20Divisor%20Game/src/Solution.java) | Easy |               |
