Add: v1.4.2

internal/version/version.go

@@ -7,7 +7,7 @@ import (
 	"github.com/openset/leetcode/internal/base"
 )
 
-const version = "1.4.1"
+const version = "1.4.2"
 
 var CmdVersion = &base.Command{
 	Run:       runVersion,

problems/all-paths-from-source-lead-to-destination/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/missing-element-in-sorted-array "Missing Element in Sorted Array")
 
-## 1059. All Paths from Source Lead to Destination (Hard)
+## 1059. All Paths from Source Lead to Destination (Medium)
 
 <p>Given the <code>edges</code> of a directed graph, and two nodes <code>source</code> and <code>destination</code> of this graph, determine whether or not all paths starting from <code>source</code> eventually end at <code>destination</code>, that is:</p>
 

problems/campus-bikes/README.md

@@ -63,7 +63,9 @@ Worker 0 grabs Bike 0 at first. Worker 1 and Worker 2 share the same distance to
 ### Hints
 <details>
 <summary>Hint 1</summary>
-Sort the elements by distance then in case of tie, sort them by the index of the worker, and if there still ties sort then by the index of the bike.Follow up: Can you do this in less than O(nlogn) time, where n is the total number of pairs between workers and bikes?.
+<p>Sort the elements by distance. In case of a tie, sort them by the index of the worker. After that, if there are still ties, sort them by the index of the bike.</p>
+
+<p>Can you do this in less than O(nlogn) time, where n is the total number of pairs between workers and bikes?</p>
 </details>
 
 <details>

problems/confusing-number/README.md

@@ -75,6 +75,7 @@ We get an invalid number after rotating <code>25</code>.
 
 ### Similar Questions
   1. [Strobogrammatic Number](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number) (Easy)
+  1. [Confusing Number II](https://github.com/openset/leetcode/tree/master/problems/confusing-number-ii) (Hard)
 
 ### Hints
 <details>