Update: FrontendQuestionId

Author: openset

problems/binary-search-tree-to-greater-sum-tree/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-score-triangulation-of-polygon "Minimum Score Triangulation of Polygon")
 
-## 5050. Binary Search Tree to Greater Sum Tree (Medium)
+## 1038. Binary Search Tree to Greater Sum Tree (Medium)
 
 <p>Given the root of a binary <strong>search</strong> tree with distinct values, modify it so that every <code>node</code>&nbsp;has a new value equal to the sum of the values of the original tree that are greater than or equal to <code>node.val</code>.</p>
 
@@ -49,3 +49,12 @@
 <div>&nbsp;</div>
 </div>
 </div>
+
+### Related Topics
+  [[Binary Search Tree](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+What traversal method organizes all nodes in sorted order?
+</details>

problems/minimum-score-triangulation-of-polygon/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/moving-stones-until-consecutive-ii "Moving Stones Until Consecutive II")
 
-## 5047. Minimum Score Triangulation of Polygon (Medium)
+## 1039. Minimum Score Triangulation of Polygon (Medium)
 
 <p>Given <code>N</code>, consider a convex <code>N</code>-sided polygon with vertices labelled <code>A[0], A[i], ..., A[N-1]</code>&nbsp;in clockwise order.</p>
 
@@ -62,3 +62,12 @@
 </div>
 </div>
 </div>
+
+### Related Topics
+  [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+Without loss of generality, there is a triangle that uses adjacent vertices A[0] and A[N-1] (where N = A.length).  Depending on your choice K of it, this breaks down the triangulation into two subproblems A[1:K] and A[K+1:N-1].
+</details>

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

@@ -9,7 +9,7 @@
 
 Next >
 
-## 5049. Moving Stones Until Consecutive II (Medium)
+## 1040. Moving Stones Until Consecutive II (Medium)
 
 <p>On an <strong>infinite</strong> number line, the position of the i-th stone is given by&nbsp;<code>stones[i]</code>.&nbsp; Call a stone an <em>endpoint stone</em> if it has the smallest or largest position.</p>
 
@@ -68,3 +68,14 @@ Notice we cannot move 10 -&gt; 2 to finish the game, because that would be an il
 <div>&nbsp;</div>
 </div>
 </div>
+
+### Related Topics
+  [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
+  [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)]
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+For the minimum, how many cows are already in place?
+For the maximum, we have to lose either the gap A[1] - A[0] or A[N-1] - A[N-2]  (where N = A.length), but every other space can be occupied.
+</details>

problems/valid-boomerang/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-to-greater-sum-tree "Binary Search Tree to Greater Sum Tree")
 
-## 5051. Valid Boomerang (Easy)
+## 1037. Valid Boomerang (Easy)
 
 <p>A <em>boomerang</em> is a set of 3 points that are all distinct and <strong>not</strong> in a straight line.</p>
 
@@ -45,3 +45,12 @@
 <div>
 <div>&nbsp;</div>
 </div>
+
+### Related Topics
+  [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+3 points form a boomerang if and only if the triangle formed from them has non-zero area.
+</details>