Update: problems

Author: Openset

Diff for: 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)

Diff for: 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)

Diff for: 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)

Diff for: 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)

Diff for: 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)

Diff for: 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)

Diff for: 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)

Diff for: 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)

Diff for: 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)

Diff for: 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)

Diff for: problems/add-strings/README.md

@@ -19,5 +19,5 @@
 </p>
 
 ### 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. [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)

Diff for: problems/add-two-numbers-ii/README.md

@@ -24,4 +24,4 @@ What if you cannot modify the input lists? In other words, reversing the lists i
 </p>
 
 ### Similar Questions
-  1. [Add Two Numbers](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers) (Medium)
+  1. [Add Two Numbers](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers) (Medium)

Diff for: problems/add-two-numbers/README.md

@@ -21,8 +21,8 @@
 
 
 ### Similar Questions
-  1. [Multiply Strings](https://github.com/openset/leetcode/tree/master/solution/multiply-strings) (Medium)
-  1. [Add Binary](https://github.com/openset/leetcode/tree/master/solution/add-binary) (Easy)
-  1. [Sum of Two Integers](https://github.com/openset/leetcode/tree/master/solution/sum-of-two-integers) (Easy)
-  1. [Add Strings](https://github.com/openset/leetcode/tree/master/solution/add-strings) (Easy)
-  1. [Add Two Numbers II](https://github.com/openset/leetcode/tree/master/solution/add-two-numbers-ii) (Medium)
+  1. [Multiply Strings](https://github.com/openset/leetcode/tree/master/problems/multiply-strings) (Medium)
+  1. [Add Binary](https://github.com/openset/leetcode/tree/master/problems/add-binary) (Easy)
+  1. [Sum of Two Integers](https://github.com/openset/leetcode/tree/master/problems/sum-of-two-integers) (Easy)
+  1. [Add Strings](https://github.com/openset/leetcode/tree/master/problems/add-strings) (Easy)
+  1. [Add Two Numbers II](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers-ii) (Medium)

Diff for: problems/additive-number/README.md

@@ -36,4 +36,4 @@
 How would you handle overflow for very large input integers?</p>
 
 ### Similar Questions
-  1. [Split Array into Fibonacci Sequence](https://github.com/openset/leetcode/tree/master/solution/split-array-into-fibonacci-sequence) (Medium)
+  1. [Split Array into Fibonacci Sequence](https://github.com/openset/leetcode/tree/master/problems/split-array-into-fibonacci-sequence) (Medium)

Diff for: problems/arithmetic-slices-ii-subsequence/README.md

@@ -45,4 +45,4 @@ All arithmetic subsequence slices are:
 </p>
 
 ### Similar Questions
-  1. [Arithmetic Slices](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices) (Medium)
+  1. [Arithmetic Slices](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices) (Medium)

Diff for: problems/arithmetic-slices/README.md

@@ -33,4 +33,4 @@ return: 3, for 3 arithmetic slices in A: [1, 2, 3], [2, 3, 4] and [1, 2, 3, 4] i
 </pre>
 
 ### Similar Questions
-  1. [Arithmetic Slices II - Subsequence](https://github.com/openset/leetcode/tree/master/solution/arithmetic-slices-ii-subsequence) (Hard)
+  1. [Arithmetic Slices II - Subsequence](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices-ii-subsequence) (Hard)

Diff for: problems/array-nesting/README.md

@@ -32,6 +32,6 @@ S[0] = {A[0], A[5], A[6], A[2]} = {5, 6, 2, 0}
 </p>
 
 ### Similar Questions
-  1. [Nested List Weight Sum](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum) (Easy)
-  1. [Flatten Nested List Iterator](https://github.com/openset/leetcode/tree/master/solution/flatten-nested-list-iterator) (Medium)
-  1. [Nested List Weight Sum II](https://github.com/openset/leetcode/tree/master/solution/nested-list-weight-sum-ii) (Medium)
+  1. [Nested List Weight Sum](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum) (Easy)
+  1. [Flatten Nested List Iterator](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator) (Medium)
+  1. [Nested List Weight Sum II](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum-ii) (Medium)

Diff for: problems/asteroid-collision/README.md

@@ -62,4 +62,4 @@ Asteroids moving the same direction never meet, so no asteroids will meet each o
 </p>
 
 ### Similar Questions
-  1. [Can Place Flowers](https://github.com/openset/leetcode/tree/master/solution/can-place-flowers) (Easy)
+  1. [Can Place Flowers](https://github.com/openset/leetcode/tree/master/problems/can-place-flowers) (Easy)

Diff for: problems/average-of-levels-in-binary-tree/README.md

@@ -30,5 +30,5 @@ The average value of nodes on level 0 is 3,  on level 1 is 14.5, and on level 2
 </p>
 
 ### Similar Questions
-  1. [Binary Tree Level Order Traversal](https://github.com/openset/leetcode/tree/master/solution/binary-tree-level-order-traversal) (Medium)
-  1. [Binary Tree Level Order Traversal II](https://github.com/openset/leetcode/tree/master/solution/binary-tree-level-order-traversal-ii) (Easy)
+  1. [Binary Tree Level Order Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal) (Medium)
+  1. [Binary Tree Level Order Traversal II](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal-ii) (Easy)

Diff for: problems/balanced-binary-tree/README.md

@@ -46,4 +46,4 @@
 
 
 ### Similar Questions
-  1. [Maximum Depth of Binary Tree](https://github.com/openset/leetcode/tree/master/solution/maximum-depth-of-binary-tree) (Easy)
+  1. [Maximum Depth of Binary Tree](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-binary-tree) (Easy)

Diff for: problems/basic-calculator-ii/README.md

@@ -39,6 +39,6 @@
 </ul>
 
 ### Similar Questions
-  1. [Basic Calculator](https://github.com/openset/leetcode/tree/master/solution/basic-calculator) (Hard)
-  1. [Expression Add Operators](https://github.com/openset/leetcode/tree/master/solution/expression-add-operators) (Hard)
-  1. [Basic Calculator III](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iii) (Hard)
+  1. [Basic Calculator](https://github.com/openset/leetcode/tree/master/problems/basic-calculator) (Hard)
+  1. [Expression Add Operators](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators) (Hard)
+  1. [Basic Calculator III](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) (Hard)

Diff for: problems/basic-calculator-iv/README.md

@@ -60,5 +60,5 @@ evalvars = [], evalints = []
 
 
 ### Similar Questions
-  1. [Parse Lisp Expression](https://github.com/openset/leetcode/tree/master/solution/parse-lisp-expression) (Hard)
-  1. [Basic Calculator III](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iii) (Hard)
+  1. [Parse Lisp Expression](https://github.com/openset/leetcode/tree/master/problems/parse-lisp-expression) (Hard)
+  1. [Basic Calculator III](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) (Hard)

Diff for: problems/basic-calculator/README.md

@@ -38,8 +38,8 @@
 
 
 ### Similar Questions
-  1. [Evaluate Reverse Polish Notation](https://github.com/openset/leetcode/tree/master/solution/evaluate-reverse-polish-notation) (Medium)
-  1. [Basic Calculator II](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-ii) (Medium)
-  1. [Different Ways to Add Parentheses](https://github.com/openset/leetcode/tree/master/solution/different-ways-to-add-parentheses) (Medium)
-  1. [Expression Add Operators](https://github.com/openset/leetcode/tree/master/solution/expression-add-operators) (Hard)
-  1. [Basic Calculator III](https://github.com/openset/leetcode/tree/master/solution/basic-calculator-iii) (Hard)
+  1. [Evaluate Reverse Polish Notation](https://github.com/openset/leetcode/tree/master/problems/evaluate-reverse-polish-notation) (Medium)
+  1. [Basic Calculator II](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-ii) (Medium)
+  1. [Different Ways to Add Parentheses](https://github.com/openset/leetcode/tree/master/problems/different-ways-to-add-parentheses) (Medium)
+  1. [Expression Add Operators](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators) (Hard)
+  1. [Basic Calculator III](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) (Hard)

Diff for: problems/beautiful-arrangement-ii/README.md

@@ -40,4 +40,4 @@ If there are multiple answers, print any of them.
 </p>
 
 ### Similar Questions
-  1. [Beautiful Arrangement](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement) (Medium)
+  1. [Beautiful Arrangement](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement) (Medium)

Diff for: problems/beautiful-arrangement/README.md

@@ -40,4 +40,4 @@ Now given N, how many beautiful arrangements can you construct?
 </p>
 
 ### Similar Questions
-  1. [Beautiful Arrangement II](https://github.com/openset/leetcode/tree/master/solution/beautiful-arrangement-ii) (Medium)
+  1. [Beautiful Arrangement II](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement-ii) (Medium)

Diff for: problems/best-time-to-buy-and-sell-stock-ii/README.md

@@ -41,8 +41,8 @@
 
 
 ### Similar Questions
-  1. [Best Time to Buy and Sell Stock](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock) (Easy)
-  1. [Best Time to Buy and Sell Stock III](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iii) (Hard)
-  1. [Best Time to Buy and Sell Stock IV](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iv) (Hard)
-  1. [Best Time to Buy and Sell Stock with Cooldown](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-cooldown) (Medium)
-  1. [Best Time to Buy and Sell Stock with Transaction Fee](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-transaction-fee) (Medium)
+  1. [Best Time to Buy and Sell Stock](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) (Easy)
+  1. [Best Time to Buy and Sell Stock III](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii) (Hard)
+  1. [Best Time to Buy and Sell Stock IV](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv) (Hard)
+  1. [Best Time to Buy and Sell Stock with Cooldown](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown) (Medium)
+  1. [Best Time to Buy and Sell Stock with Transaction Fee](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) (Medium)

Diff for: problems/best-time-to-buy-and-sell-stock-iii/README.md

@@ -40,7 +40,7 @@
 
 
 ### Similar Questions
-  1. [Best Time to Buy and Sell Stock](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock) (Easy)
-  1. [Best Time to Buy and Sell Stock II](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-ii) (Easy)
-  1. [Best Time to Buy and Sell Stock IV](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iv) (Hard)
-  1. [Maximum Sum of 3 Non-Overlapping Subarrays](https://github.com/openset/leetcode/tree/master/solution/maximum-sum-of-3-non-overlapping-subarrays) (Hard)
+  1. [Best Time to Buy and Sell Stock](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) (Easy)
+  1. [Best Time to Buy and Sell Stock II](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) (Easy)
+  1. [Best Time to Buy and Sell Stock IV](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv) (Hard)
+  1. [Maximum Sum of 3 Non-Overlapping Subarrays](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-3-non-overlapping-subarrays) (Hard)

Diff for: problems/best-time-to-buy-and-sell-stock-iv/README.md

@@ -32,6 +32,6 @@ You may not engage in multiple transactions at the same time (ie, you must sell
 </pre>
 
 ### Similar Questions
-  1. [Best Time to Buy and Sell Stock](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock) (Easy)
-  1. [Best Time to Buy and Sell Stock II](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-ii) (Easy)
-  1. [Best Time to Buy and Sell Stock III](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iii) (Hard)
+  1. [Best Time to Buy and Sell Stock](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) (Easy)
+  1. [Best Time to Buy and Sell Stock II](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) (Easy)
+  1. [Best Time to Buy and Sell Stock III](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii) (Hard)

Diff for: problems/best-time-to-buy-and-sell-stock-with-cooldown/README.md

@@ -25,5 +25,5 @@
 </pre>
 
 ### Similar Questions
-  1. [Best Time to Buy and Sell Stock](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock) (Easy)
-  1. [Best Time to Buy and Sell Stock II](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-ii) (Easy)
+  1. [Best Time to Buy and Sell Stock](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) (Easy)
+  1. [Best Time to Buy and Sell Stock II](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) (Easy)

Diff for: problems/best-time-to-buy-and-sell-stock-with-transaction-fee/README.md

@@ -27,4 +27,4 @@
 </p>
 
 ### Similar Questions
-  1. [Best Time to Buy and Sell Stock II](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-ii) (Easy)
+  1. [Best Time to Buy and Sell Stock II](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) (Easy)

Diff for: problems/best-time-to-buy-and-sell-stock/README.md

@@ -32,8 +32,8 @@
 
 
 ### Similar Questions
-  1. [Maximum Subarray](https://github.com/openset/leetcode/tree/master/solution/maximum-subarray) (Easy)
-  1. [Best Time to Buy and Sell Stock II](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-ii) (Easy)
-  1. [Best Time to Buy and Sell Stock III](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iii) (Hard)
-  1. [Best Time to Buy and Sell Stock IV](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-iv) (Hard)
-  1. [Best Time to Buy and Sell Stock with Cooldown](https://github.com/openset/leetcode/tree/master/solution/best-time-to-buy-and-sell-stock-with-cooldown) (Medium)
+  1. [Maximum Subarray](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray) (Easy)
+  1. [Best Time to Buy and Sell Stock II](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) (Easy)
+  1. [Best Time to Buy and Sell Stock III](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii) (Hard)
+  1. [Best Time to Buy and Sell Stock IV](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv) (Hard)
+  1. [Best Time to Buy and Sell Stock with Cooldown](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown) (Medium)

Diff for: problems/binary-number-with-alternating-bits/README.md

@@ -46,4 +46,4 @@ The binary representation of 10 is: 1010.
 </p>
 
 ### Similar Questions
-  1. [Number of 1 Bits](https://github.com/openset/leetcode/tree/master/solution/number-of-1-bits) (Easy)
+  1. [Number of 1 Bits](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits) (Easy)