Update: questions

Author: openset

problems/coloring-a-border/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/uncrossed-lines "Uncrossed Lines")
 
-## 5040. Coloring A Border (Medium)
+## 1034. Coloring A Border (Medium)
 
 <p>Given a 2-dimensional&nbsp;<code>grid</code> of integers, each value in the grid represents the color of the grid square at that location.</p>
 
@@ -57,3 +57,15 @@
 	<li><code>0 &lt;= c0 &lt; grid[0].length</code></li>
 	<li><code>1 &lt;= color &lt;= 1000</code></li>
 </ol>
+
+### Related Topics
+  [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]
+
+### Similar Questions
+  1. [Island Perimeter](https://github.com/openset/leetcode/tree/master/problems/island-perimeter) (Easy)
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+Use a DFS to find every square in the component.  Then for each square, color it if it has a neighbor that is outside the grid or a different color.
+</details>

problems/edit-distance/README.md

@@ -53,3 +53,4 @@ exection -> execution (insert 'u')
   1. [One Edit Distance](https://github.com/openset/leetcode/tree/master/problems/one-edit-distance) (Medium)
   1. [Delete Operation for Two Strings](https://github.com/openset/leetcode/tree/master/problems/delete-operation-for-two-strings) (Medium)
   1. [Minimum ASCII Delete Sum for Two Strings](https://github.com/openset/leetcode/tree/master/problems/minimum-ascii-delete-sum-for-two-strings) (Medium)
+  1. [Uncrossed Lines](https://github.com/openset/leetcode/tree/master/problems/uncrossed-lines) (Medium)

problems/escape-a-large-maze/README.md

@@ -9,7 +9,7 @@
 
 Next >
 
-## 5042. Escape a Large Maze (Hard)
+## 1036. Escape a Large Maze (Hard)
 
 <p>In a 1 million by 1 million grid, the coordinates of each grid square are <code>(x, y)</code> with <code>0 &lt;= x, y &lt; 10^6</code>.</p>
 
@@ -49,3 +49,16 @@ Because there are no blocked cells, it&#39;s possible to reach the target square
 	<li><code>0 &lt;= source[i][j], target[i][j] &lt; 10^6</code></li>
 	<li><code>source != target</code></li>
 </ol>
+
+### Related Topics
+  [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+If we become stuck, there's either a loop around the source or around the target.
+</details>
+<details>
+<summary>Hint 2</summary>
+If there is a loop around say, the source, what is the maximum number of squares it can have?
+</details>

problems/island-perimeter/README.md

@@ -41,3 +41,4 @@
 ### Similar Questions
   1. [Max Area of Island](https://github.com/openset/leetcode/tree/master/problems/max-area-of-island) (Medium)
   1. [Flood Fill](https://github.com/openset/leetcode/tree/master/problems/flood-fill) (Easy)
+  1. [Coloring A Border](https://github.com/openset/leetcode/tree/master/problems/coloring-a-border) (Medium)

problems/moving-stones-until-consecutive/README.md

@@ -9,11 +9,11 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/coloring-a-border "Coloring A Border")
 
-## 5039. Moving Stones Until Consecutive (Easy)
+## 1033. Moving Stones Until Consecutive (Easy)
 
 <p>Three stones are on a number line at positions <code>a</code>, <code>b</code>, and <code>c</code>.</p>
 
-<p>Each turn, let&#39;s say the stones are currently at positions <code>x, y, z</code> with <code>x &lt; y &lt; z</code>.&nbsp; You pick up the stone at either position <code>x</code> or position <code>z</code>, and move that stone to an integer position <code>k</code>, with <code>x &lt; k &lt; z</code> and <code>k != y</code>.</p>
+<p>Each turn, you pick up a stone at an endpoint (ie., either the lowest or highest position stone), and move it to an unoccupied position between those&nbsp;endpoints.&nbsp; Formally, let&#39;s say the stones are currently at positions <code>x, y, z</code> with <code>x &lt; y &lt; z</code>.&nbsp; You pick up the stone at either position <code>x</code> or position <code>z</code>, and move that stone to an integer position <code>k</code>, with <code>x &lt; k &lt; z</code> and <code>k != y</code>.</p>
 
 <p>The game ends when you cannot make any more moves, ie. the stones are in consecutive positions.</p>
 
@@ -25,21 +25,31 @@
 
 <pre>
 <strong>Input: </strong>a = <span id="example-input-1-1">1</span>, b = <span id="example-input-1-2">2</span>, c = <span id="example-input-1-3">5</span>
-<strong>Output: </strong><span id="example-output-1">[1, 2]
-<strong>Explanation: </strong>Move stone from 5 to 4 then to 3, or we can move it directly to 3.</span>
+<strong>Output: </strong><span id="example-output-1">[1,2]</span>
+<strong>Explanation: </strong>Move the stone from 5 to 3, or move the stone from 5 to 4 to 3.
 </pre>
 
 <div>
 <p><strong>Example 2:</strong></p>
 
 <pre>
 <strong>Input: </strong>a = <span id="example-input-2-1">4</span>, b = <span id="example-input-2-2">3</span>, c = <span id="example-input-2-3">2</span>
-<strong>Output: </strong><span id="example-output-2">[0, 0]
-</span><span id="example-output-1"><strong>Explanation: </strong>We cannot make any moves.</span>
+<strong>Output: </strong><span id="example-output-2">[0,0]</span>
+<strong>Explanation: </strong>We cannot make any moves.
+</pre>
+
+<div>
+<p><strong>Example 3:</strong></p>
+
+<pre>
+<strong>Input: </strong>a = <span id="example-input-3-1">3</span>, b = <span id="example-input-3-2">5</span>, c = <span id="example-input-3-3">1</span>
+<strong>Output: </strong><span id="example-output-3">[1,2]</span>
+<strong>Explanation: </strong>Move the stone from 1 to 4; or move the stone from 1 to 2 to 4.
 </pre>
 
 <p>&nbsp;</p>
 </div>
+</div>
 
 <p><strong>Note:</strong></p>
 
@@ -49,3 +59,22 @@
 	<li><code>1 &lt;= c &lt;= 100</code></li>
 	<li><code>a != b, b != c, c != a</code></li>
 </ol>
+
+<div>
+<p>&nbsp;</p>
+
+<div>
+<div>&nbsp;</div>
+</div>
+</div>
+
+### Related Topics
+  [[Brainteaser](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md)]
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+For the minimum:  We can always do it in at most 2 moves, by moving one stone next to another, then the third stone next to the other two.  When can we do it in 1 move?  0 moves?
+
+For the maximum:  Every move, the maximum position minus the minimum position must decrease by at least 1.
+</details>

problems/uncrossed-lines/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/escape-a-large-maze "Escape a Large Maze")
 
-## 5041. Uncrossed Lines (Medium)
+## 1035. Uncrossed Lines (Medium)
 
 <p>We write the integers of <code>A</code> and <code>B</code>&nbsp;(in the order they are given) on two separate horizontal lines.</p>
 
@@ -52,5 +52,17 @@ We cannot draw 3 uncrossed lines, because the line from A[1]=4 to B[2]=4 will in
 <ol>
 	<li><code>1 &lt;= A.length &lt;= 500</code></li>
 	<li><code>1 &lt;= B.length &lt;= 500</code></li>
-	<li><font face="monospace">1 &lt;= A[i], B[i] &lt;= 2000</font></li>
+	<li><code><font face="monospace">1 &lt;= A[i], B[i] &lt;= 2000</font></code></li>
 </ol>
+
+### Related Topics
+  [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
+
+### Similar Questions
+  1. [Edit Distance](https://github.com/openset/leetcode/tree/master/problems/edit-distance) (Hard)
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+Think dynamic programming.  Given an oracle dp(i,j) that tells us how many lines A[i:], B[j:]  [the sequence A[i], A[i+1], ... and B[j], B[j+1], ...] are uncrossed, can we write this as a recursion?
+</details>