Reworded.

gazeldx · gazeldx · commit b43e11040c0c · 2025-02-15T19:32:30.000+08:00
diff --git a/README.md b/README.md
@@ -118,6 +118,7 @@ You can skip the more difficult problems and do them later.
 - [743. Network Delay Time](en/1-1000/743-network-delay-time.md) was solved in _Python_ and 2 ways.
 - [787. Cheapest Flights Within K Stops](en/1-1000/787-cheapest-flights-within-k-stops.md) was solved in _Python_.
 - [1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance](en/1001-2000/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.md) was solved in _Python_.
+- [752. Open the Lock](en/1-1000/752-open-the-lock.md) was solved in _Python_ and 2 ways.
 
 # Others
 - [433. Minimum Genetic Mutation](en/1-1000/433-minimum-genetic-mutation.md) was solved in _Python_.
diff --git a/en/1-1000/127-word-ladder.md b/en/1-1000/127-word-ladder.md
@@ -45,10 +45,10 @@ The **word transformation sequence** problem can be abstracted into a **graph th
 ### Breadth-First Search
 ![](../../images/binary_tree_BFS_1.gif)
 
-* As shown in the figure above, **breadth-first search** can be thought of as visiting vertices in rounds and rounds. Actually, whenever you see a question is about
-getting `shortest` or `least` of something of a graph, `breadth-first search` would probably help.
+* As shown in the figure above, **Breadth-First Search** can be thought of as visiting vertices in rounds and rounds. Actually, whenever you see a question is about
+  getting `minimum number` of something of a graph, `Breadth-First Search` would probably help.
 
-* `breadth-first search` emphasizes first-in-first-out, so a **queue** is needed.
+* `Breadth-First Search` emphasizes first-in-first-out, so a **queue** is needed.
 
 ## Approach
 1. `Breadth-First Search` a graph means traversing **from near to far**, from `circle 1` to `circle N`. Each `circle` is a round of iteration, but we can simplify it by using just 1 round.
diff --git a/en/1-1000/200-number-of-islands-3.md b/en/1-1000/200-number-of-islands-3.md
@@ -65,9 +65,9 @@ Please click [Depth-First Search by Iteration Solution](200-number-of-islands-2.
 ## Solution 3: Breadth-First Search
 ![](../../images/binary_tree_BFS_1.gif)
 
-As shown in the figure above, **breadth-first search** can be thought of as visiting vertices in rounds and rounds.
+As shown in the figure above, **Breadth-First Search** can be thought of as visiting vertices in rounds and rounds.
 
-It emphasizes first-in-first-out, so a **queue** is needed.
+`Breadth-First Search` emphasizes first-in-first-out, so a **queue** is needed.
 
 ## Complexity
 * Time: `O(n * m)`.
diff --git a/en/3001-4000/unorganized.md b/en/3001-4000/unorganized.md
@@ -65,6 +65,8 @@ The improved way with a queue is commonly more efficient. Relaxing **All Edges**
 |Dijkstra's algorithm|Vertices||
 |Bellman-Ford algorithm|Edges(Vertices+Edges for SPFA)||
 
+Add a table to show the differences between A-Start and breadth-first search
+
 ## Others
 * Find all the prime numbers within 1000000.
 
@@ -174,6 +176,8 @@ The improved way with a queue is commonly more efficient. Relaxing **All Edges**
 - 417 https://leetcode.com/problems/pacific-atlantic-water-flow/
 - 399 https://leetcode.com/problems/evaluate-division/ union-find
 - 1976 https://leetcode.com/problems/number-of-ways-to-arrive-at-destination/ both use Dijkstra or Bellman-Ford can solve it.
+- 1263 https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location/ A-star
+
 
 ### Failed in 2 rounds
 - 222 https://leetcode.cn/problems/count-complete-tree-nodes/
@@ -192,4 +196,6 @@ The improved way with a queue is commonly more efficient. Relaxing **All Edges**
 - 1514-path-with-maximum-probability.md
 - 1334 https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
 
-2005-02-09 day 2
+## other finished problems
+- https://leetcode.com/problems/k-closest-points-to-origin/
+- 
