Update: Hints

Author: openset

problems/house-robber-ii/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/word-search-ii "Word Search II")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-palindrome "Shortest Palindrome")
+
 ## 213. House Robber II (Medium)
 
 <p>You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are <strong>arranged in a circle.</strong> That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have security system connected and&nbsp;<b>it will automatically contact the police if two adjacent houses were broken into on the same night</b>.</p>
@@ -40,4 +44,7 @@
   1. [Coin Path](https://github.com/openset/leetcode/tree/master/problems/coin-path) (Hard)
 
 ### Hints
-  1. Since House[1] and House[n] are adjacent, they cannot be robbed together. Therefore, the problem becomes to rob either House[1]-House[n-1] or House[2]-House[n], depending on which choice offers more money. Now the problem has degenerated to the <a href ="https://leetcode.com/problems/house-robber/description/">House Robber</a>, which is already been solved.
+<details>
+<summary>Hint 1</summary>
+Since House[1] and House[n] are adjacent, they cannot be robbed together. Therefore, the problem becomes to rob either House[1]-House[n-1] or House[2]-House[n], depending on which choice offers more money. Now the problem has degenerated to the <a href ="https://leetcode.com/problems/house-robber/description/">House Robber</a>, which is already been solved.
+</details>

problems/investments-in-2016/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-customer-referee "Find Customer Referee")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/customer-placing-the-largest-number-of-orders "Customer Placing the Largest Number of Orders")
+
 ## 585. Investments in 2016 (Medium)
 
 <p>Write a query to print the sum of all total investment values in 2016 (<b>TIV_2016</b>), to a scale of 2 decimal places, for all policy holders who meet the following criteria:</p>
@@ -60,4 +64,7 @@ And its location is the same with the third record, which makes the third record
 So, the result is the sum of <b>TIV_2016</b> of the first and last record, which is 45.</pre>
 
 ### Hints
-  1. Make the (LAT, LON) a pair to represent the location information
+<details>
+<summary>Hint 1</summary>
+Make the (LAT, LON) a pair to represent the location information
+</details>

problems/max-chunks-to-make-sorted-ii/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/reorganize-string "Reorganize String")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted "Max Chunks To Make Sorted")
+
 ## 768. Max Chunks To Make Sorted II (Hard)
 
 <p><em>This question is the same as &quot;Max Chunks to Make Sorted&quot; except the integers of the given array are not necessarily distinct, the input array could be up to length <code>2000</code>, and the elements could be up to <code>10**8</code>.</em></p>
@@ -51,4 +55,7 @@ However, splitting into [2, 1], [3], [4], [4] is the highest number of chunks po
   1. [Max Chunks To Make Sorted](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted) (Medium)
 
 ### Hints
-  1. Each k for which some permutation of arr[:k] is equal to sorted(arr)[:k] is where we should cut each chunk.
+<details>
+<summary>Hint 1</summary>
+Each k for which some permutation of arr[:k] is equal to sorted(arr)[:k] is where we should cut each chunk.
+</details>

problems/max-chunks-to-make-sorted/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted-ii "Max Chunks To Make Sorted II")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iv "Basic Calculator IV")
+
 ## 769. Max Chunks To Make Sorted (Medium)
 
 <p>Given an array <code>arr</code> that is a permutation of <code>[0, 1, ..., arr.length - 1]</code>, we split the array into some number of &quot;chunks&quot; (partitions), and individually sort each chunk.&nbsp; After concatenating them,&nbsp;the result equals the sorted array.</p>
@@ -47,4 +51,7 @@ However, splitting into [1, 0], [2], [3], [4] is the highest number of chunks po
   1. [Max Chunks To Make Sorted II](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted-ii) (Hard)
 
 ### Hints
-  1. The first chunk can be found as the smallest k for which A[:k+1] == [0, 1, 2, ...k]; then we repeat this process.
+<details>
+<summary>Hint 1</summary>
+The first chunk can be found as the smallest k for which A[:k+1] == [0, 1, 2, ...k]; then we repeat this process.
+</details>

problems/min-cost-climbing-stairs/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/prefix-and-suffix-search "Prefix and Suffix Search")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-number-at-least-twice-of-others "Largest Number At Least Twice of Others")
+
 ## 746. Min Cost Climbing Stairs (Easy)
 
 <p>
@@ -44,4 +48,7 @@ Once you pay the cost, you can either climb one or two steps. You need to find m
   1. [Climbing Stairs](https://github.com/openset/leetcode/tree/master/problems/climbing-stairs) (Easy)
 
 ### Hints
-  1. Say f[i] is the final cost to climb to the top from step i.  Then f[i] = cost[i] + min(f[i+1], f[i+2]).
+<details>
+<summary>Hint 1</summary>
+Say f[i] is the final cost to climb to the top from step i.  Then f[i] = cost[i] + min(f[i+1], f[i+2]).
+</details>

problems/minimum-ascii-delete-sum-for-two-strings/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii "Number of Distinct Islands II")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k "Subarray Product Less Than K")
+
 ## 712. Minimum ASCII Delete Sum for Two Strings (Medium)
 
 <p>Given two strings <code>s1, s2</code>, find the lowest ASCII sum of deleted characters to make two strings equal.</p>
@@ -44,4 +48,7 @@ If instead we turned both strings into "lee" or "eet", we would get answers of 4
   1. [Delete Operation for Two Strings](https://github.com/openset/leetcode/tree/master/problems/delete-operation-for-two-strings) (Medium)
 
 ### Hints
-  1. Let dp(i, j) be the answer for inputs s1[i:] and s2[j:].
+<details>
+<summary>Hint 1</summary>
+Let dp(i, j) be the answer for inputs s1[i:] and s2[j:].
+</details>

problems/monotone-increasing-digits/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii "Sentence Similarity II")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/daily-temperatures "Daily Temperatures")
+
 ## 738. Monotone Increasing Digits (Medium)
 
 <p>
@@ -45,4 +49,7 @@ Given a non-negative integer <code>N</code>, find the largest number that is les
   1. [Remove K Digits](https://github.com/openset/leetcode/tree/master/problems/remove-k-digits) (Medium)
 
 ### Hints
-  1. Build the answer digit by digit, adding the largest possible one that would make the number still less than or equal to N.
+<details>
+<summary>Hint 1</summary>
+Build the answer digit by digit, adding the largest possible one that would make the number still less than or equal to N.
+</details>

problems/my-calendar-i/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/self-dividing-numbers "Self Dividing Numbers")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/count-different-palindromic-subsequences "Count Different Palindromic Subsequences")
+
 ## 729. My Calendar I (Medium)
 
 <p>
@@ -46,4 +50,7 @@ The third event can be booked, as the first event takes every time less than 20,
   1. [My Calendar III](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii) (Hard)
 
 ### Hints
-  1. Store the events as a sorted list of intervals.  If none of the events conflict, then the new event can be added.
+<details>
+<summary>Hint 1</summary>
+Store the events as a sorted list of intervals.  If none of the events conflict, then the new event can be added.
+</details>

problems/my-calendar-ii/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-different-palindromic-subsequences "Count Different Palindromic Subsequences")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii "My Calendar III")
+
 ## 731. My Calendar II (Medium)
 
 <p>
@@ -53,4 +57,7 @@ the time [40, 50) will be single booked, and the time [50, 55) will be double bo
   1. [My Calendar III](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii) (Hard)
 
 ### Hints
-  1. Store two sorted lists of intervals: one list will be all times that are at least single booked, and another list will be all times that are definitely double booked.  If none of the double bookings conflict, then the booking will succeed, and you should update your single and double bookings accordingly.
+<details>
+<summary>Hint 1</summary>
+Store two sorted lists of intervals: one list will be all times that are at least single booked, and another list will be all times that are definitely double booked.  If none of the double bookings conflict, then the booking will succeed, and you should update your single and double bookings accordingly.
+</details>

problems/my-calendar-iii/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii "My Calendar II")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/flood-fill "Flood Fill")
+
 ## 732. My Calendar III (Hard)
 
 <p>Implement a <code>MyCalendarThree</code> class to store your events. A new event can <b>always</b> be added.</p>
@@ -54,4 +58,7 @@ eg. [10, 20), [10, 40), and [5, 15) are still triple booked.
   1. [My Calendar II](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii) (Medium)
 
 ### Hints
-  1. Treat each interval [start, end) as two events "start" and "end", and process them in sorted order.
+<details>
+<summary>Hint 1</summary>
+Treat each interval [start, end) as two events "start" and "end", and process them in sorted order.
+</details>