Update: problems

Author: Openset

problems/1-bit-and-2-bit-characters/README.md

@@ -37,4 +37,4 @@ The only way to decode it is two-bit character and two-bit character. So the las
 </p>
 
 ### Similar Questions
-  1. [Gray Code](https://github.com/openset/leetcode/tree/master/solution/gray-code) (Medium)
+  1. [Gray Code](https://github.com/openset/leetcode/tree/master/problems/gray-code) (Medium)

problems/2-keys-keyboard/README.md

@@ -39,4 +39,4 @@ In step 3, we use <b>Paste</b> operation to get 'AAA'.
 </p>
 
 ### Similar Questions
-  1. [4 Keys Keyboard](https://github.com/openset/leetcode/tree/master/solution/4-keys-keyboard) (Medium)
+  1. [4 Keys Keyboard](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard) (Medium)

problems/3sum-closest/README.md

@@ -19,5 +19,5 @@ The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
 
 
 ### Similar Questions
-  1. [3Sum](https://github.com/openset/leetcode/tree/master/solution/3sum) (Medium)
-  1. [3Sum Smaller](https://github.com/openset/leetcode/tree/master/solution/3sum-smaller) (Medium)
+  1. [3Sum](https://github.com/openset/leetcode/tree/master/problems/3sum) (Medium)
+  1. [3Sum Smaller](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) (Medium)

problems/3sum/README.md

@@ -27,7 +27,7 @@ A solution set is:
 
 
 ### Similar Questions
-  1. [Two Sum](https://github.com/openset/leetcode/tree/master/solution/two-sum) (Easy)
-  1. [3Sum Closest](https://github.com/openset/leetcode/tree/master/solution/3sum-closest) (Medium)
-  1. [4Sum](https://github.com/openset/leetcode/tree/master/solution/4sum) (Medium)
-  1. [3Sum Smaller](https://github.com/openset/leetcode/tree/master/solution/3sum-smaller) (Medium)
+  1. [Two Sum](https://github.com/openset/leetcode/tree/master/problems/two-sum) (Easy)
+  1. [3Sum Closest](https://github.com/openset/leetcode/tree/master/problems/3sum-closest) (Medium)
+  1. [4Sum](https://github.com/openset/leetcode/tree/master/problems/4sum) (Medium)
+  1. [3Sum Smaller](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) (Medium)

problems/4sum-ii/README.md

@@ -30,4 +30,4 @@ The two tuples are:
 </p>
 
 ### Similar Questions
-  1. [4Sum](https://github.com/openset/leetcode/tree/master/solution/4sum) (Medium)
+  1. [4Sum](https://github.com/openset/leetcode/tree/master/problems/4sum) (Medium)

problems/4sum/README.md

@@ -28,6 +28,6 @@ A solution set is:
 
 
 ### Similar Questions
-  1. [Two Sum](https://github.com/openset/leetcode/tree/master/solution/two-sum) (Easy)
-  1. [3Sum](https://github.com/openset/leetcode/tree/master/solution/3sum) (Medium)
-  1. [4Sum II](https://github.com/openset/leetcode/tree/master/solution/4sum-ii) (Medium)
+  1. [Two Sum](https://github.com/openset/leetcode/tree/master/problems/two-sum) (Easy)
+  1. [3Sum](https://github.com/openset/leetcode/tree/master/problems/3sum) (Medium)
+  1. [4Sum II](https://github.com/openset/leetcode/tree/master/problems/4sum-ii) (Medium)

problems/accounts-merge/README.md

@@ -33,6 +33,6 @@ We could return these lists in any order, for example the answer [['Mary', 'mary
 </p>
 
 ### Similar Questions
-  1. [Redundant Connection](https://github.com/openset/leetcode/tree/master/solution/redundant-connection) (Medium)
-  1. [Sentence Similarity](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity) (Easy)
-  1. [Sentence Similarity II](https://github.com/openset/leetcode/tree/master/solution/sentence-similarity-ii) (Medium)
+  1. [Redundant Connection](https://github.com/openset/leetcode/tree/master/problems/redundant-connection) (Medium)
+  1. [Sentence Similarity](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity) (Easy)
+  1. [Sentence Similarity II](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii) (Medium)

problems/add-and-search-word-data-structure-design/README.md

@@ -33,5 +33,5 @@ You may assume that all words are consist of lowercase letters <code>a-z</code>.
 
 
 ### Similar Questions
-  1. [Implement Trie (Prefix Tree)](https://github.com/openset/leetcode/tree/master/solution/implement-trie-prefix-tree) (Medium)
-  1. [Prefix and Suffix Search](https://github.com/openset/leetcode/tree/master/solution/prefix-and-suffix-search) (Hard)
+  1. [Implement Trie (Prefix Tree)](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree) (Medium)
+  1. [Prefix and Suffix Search](https://github.com/openset/leetcode/tree/master/problems/prefix-and-suffix-search) (Hard)

problems/add-binary/README.md

@@ -25,6 +25,6 @@
 
 
 ### Similar Questions
-  1. [Add Two Numbers](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers) (Medium)
-  1. [Multiply Strings](https://github.com/openset/leetcode/tree/master/solution/multiply-strings) (Medium)
-  1. [Plus One](https://github.com/openset/leetcode/tree/master/solution/plus-one) (Easy)
+  1. [Add Two Numbers](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers) (Medium)
+  1. [Multiply Strings](https://github.com/openset/leetcode/tree/master/problems/multiply-strings) (Medium)
+  1. [Plus One](https://github.com/openset/leetcode/tree/master/problems/plus-one) (Easy)

problems/add-digits/README.md

@@ -22,4 +22,4 @@
 Could you do it without any loop/recursion in O(1) runtime?</p>
 
 ### Similar Questions
-  1. [Happy Number](https://github.com/openset/leetcode/tree/master/solution/happy-number) (Easy)
+  1. [Happy Number](https://github.com/openset/leetcode/tree/master/problems/happy-number) (Easy)