GitBook: [master] 2 pages modified

Author: just4once

SUMMARY.md

@@ -3,50 +3,50 @@
 * [README](README.md)
 * [leetcode](leetcode/README.md)
   * [hash-table](leetcode/hash-table/README.md)
-    * [340-longest-substring-with-at-most-k-distinct-characters](leetcode/hash-table/340-longest-substring-with-at-most-k-distinct-characters.md)
-    * [311-sparse-matrix-multiplication](leetcode/hash-table/311-sparse-matrix-multiplication.md)
-    * [381-insert-delete-getrandom-o1-duplicates-allowed](leetcode/hash-table/381-insert-delete-getrandom-o1-duplicates-allowed.md)
-    * [356-line-reflection](leetcode/hash-table/356-line-reflection.md)
-    * [387-first-unique-character-in-a-string](leetcode/hash-table/387-first-unique-character-in-a-string.md)
-    * [336-palindrome-pairs](leetcode/hash-table/336-palindrome-pairs.md)
-    * [030-substring-with-concatenation-of-all-words](leetcode/hash-table/030-substring-with-concatenation-of-all-words.md)
-    * [159-longest-substring-with-at-most-two-distinct-characters](leetcode/hash-table/159-longest-substring-with-at-most-two-distinct-characters.md)
-    * [447-number-of-boomerangs](leetcode/hash-table/447-number-of-boomerangs.md)
-    * [347-top-k-frequent-elements](leetcode/hash-table/347-top-k-frequent-elements.md)
-    * [246-strobogrammatic-number](leetcode/hash-table/246-strobogrammatic-number.md)
-    * [359-logger-rate-limiter](leetcode/hash-table/359-logger-rate-limiter.md)
-    * [217-contains-duplicate](leetcode/hash-table/217-contains-duplicate.md)
-    * [166-fraction-to-recurring-decimal](leetcode/hash-table/166-fraction-to-recurring-decimal.md)
-    * [290-word-pattern](leetcode/hash-table/290-word-pattern.md)
-    * [242-valid-anagram](leetcode/hash-table/242-valid-anagram.md)
-    * [219-contains-duplicate-ii](leetcode/hash-table/219-contains-duplicate-ii.md)
-    * [076-minimum-window-substring](leetcode/hash-table/076-minimum-window-substring.md)
-    * [244-shortest-word-distance-ii](leetcode/hash-table/244-shortest-word-distance-ii.md)
-    * [288-unique-word-abbreviation](leetcode/hash-table/288-unique-word-abbreviation.md)
-    * [202-happy-number](leetcode/hash-table/202-happy-number.md)
     * [003-longest-substring-without-repeating-characters](leetcode/hash-table/003-longest-substring-without-repeating-characters.md)
+    * [030-substring-with-concatenation-of-all-words](leetcode/hash-table/030-substring-with-concatenation-of-all-words.md)
+    * [036-valid-sudoku](leetcode/hash-table/036-valid-sudoku.md)
+    * [037-sudoku-solver](leetcode/hash-table/037-sudoku-solver.md)
     * [049-group-anagrams](leetcode/hash-table/049-group-anagrams.md)
-    * [266-palindrome-permutation](leetcode/hash-table/266-palindrome-permutation.md)
-    * [409-longest-palindrome](leetcode/hash-table/409-longest-palindrome.md)
-    * [325-maximum-size-subarray-sum-equals-k](leetcode/hash-table/325-maximum-size-subarray-sum-equals-k.md)
+    * [076-minimum-window-substring](leetcode/hash-table/076-minimum-window-substring.md)
     * [094-binary-tree-inorder-traversal](leetcode/hash-table/094-binary-tree-inorder-traversal.md)
     * [136-single-number](leetcode/hash-table/136-single-number.md)
+    * [138-copy-list-with-random-pointer](leetcode/hash-table/138-copy-list-with-random-pointer.md)
+    * [149-max-points-on-a-line](leetcode/hash-table/149-max-points-on-a-line.md)
+    * [159-longest-substring-with-at-most-two-distinct-characters](leetcode/hash-table/159-longest-substring-with-at-most-two-distinct-characters.md)
+    * [166-fraction-to-recurring-decimal](leetcode/hash-table/166-fraction-to-recurring-decimal.md)
+    * [170-two-sum-iii-data-structure-design](leetcode/hash-table/170-two-sum-iii-data-structure-design.md)
+    * [187-repeated-dna-sequences](leetcode/hash-table/187-repeated-dna-sequences.md)
+    * [202-happy-number](leetcode/hash-table/202-happy-number.md)
     * [204-count-primes](leetcode/hash-table/204-count-primes.md)
     * [205-isomorphic-strings](leetcode/hash-table/205-isomorphic-strings.md)
-    * [389-find-the-difference](leetcode/hash-table/389-find-the-difference.md)
-    * [299-bulls-and-cows](leetcode/hash-table/299-bulls-and-cows.md)
-    * [187-repeated-dna-sequences](leetcode/hash-table/187-repeated-dna-sequences.md)
-    * [380-insert-delete-getrandom-o1](leetcode/hash-table/380-insert-delete-getrandom-o1.md)
+    * [217-contains-duplicate](leetcode/hash-table/217-contains-duplicate.md)
+    * [219-contains-duplicate-ii](leetcode/hash-table/219-contains-duplicate-ii.md)
+    * [242-valid-anagram](leetcode/hash-table/242-valid-anagram.md)
+    * [244-shortest-word-distance-ii](leetcode/hash-table/244-shortest-word-distance-ii.md)
+    * [246-strobogrammatic-number](leetcode/hash-table/246-strobogrammatic-number.md)
     * [249-group-shifted-strings](leetcode/hash-table/249-group-shifted-strings.md)
-    * [170-two-sum-iii-data-structure-design](leetcode/hash-table/170-two-sum-iii-data-structure-design.md)
-    * [149-max-points-on-a-line](leetcode/hash-table/149-max-points-on-a-line.md)
-    * [037-sudoku-solver](leetcode/hash-table/037-sudoku-solver.md)
+    * [266-palindrome-permutation](leetcode/hash-table/266-palindrome-permutation.md)
     * [274-h-index](leetcode/hash-table/274-h-index.md)
-    * [358-rearrange-string-k-distance-apart](leetcode/hash-table/358-rearrange-string-k-distance-apart.md)
-    * [036-valid-sudoku](leetcode/hash-table/036-valid-sudoku.md)
+    * [288-unique-word-abbreviation](leetcode/hash-table/288-unique-word-abbreviation.md)
+    * [290-word-pattern](leetcode/hash-table/290-word-pattern.md)
+    * [299-bulls-and-cows](leetcode/hash-table/299-bulls-and-cows.md)
+    * [311-sparse-matrix-multiplication](leetcode/hash-table/311-sparse-matrix-multiplication.md)
     * [314-binary-tree-vertical-order-traversal](leetcode/hash-table/314-binary-tree-vertical-order-traversal.md)
-    * [138-copy-list-with-random-pointer](leetcode/hash-table/138-copy-list-with-random-pointer.md)
+    * [325-maximum-size-subarray-sum-equals-k](leetcode/hash-table/325-maximum-size-subarray-sum-equals-k.md)
+    * [336-palindrome-pairs](leetcode/hash-table/336-palindrome-pairs.md)
+    * [340-longest-substring-with-at-most-k-distinct-characters](leetcode/hash-table/340-longest-substring-with-at-most-k-distinct-characters.md)
+    * [347-top-k-frequent-elements](leetcode/hash-table/347-top-k-frequent-elements.md)
+    * [356-line-reflection](leetcode/hash-table/356-line-reflection.md)
+    * [358-rearrange-string-k-distance-apart](leetcode/hash-table/358-rearrange-string-k-distance-apart.md)
+    * [359-logger-rate-limiter](leetcode/hash-table/359-logger-rate-limiter.md)
+    * [380-insert-delete-getrandom-o1](leetcode/hash-table/380-insert-delete-getrandom-o1.md)
+    * [381-insert-delete-getrandom-o1-duplicates-allowed](leetcode/hash-table/381-insert-delete-getrandom-o1-duplicates-allowed.md)
+    * [387-first-unique-character-in-a-string](leetcode/hash-table/387-first-unique-character-in-a-string.md)
+    * [389-find-the-difference](leetcode/hash-table/389-find-the-difference.md)
+    * [409-longest-palindrome](leetcode/hash-table/409-longest-palindrome.md)
     * [438-find-all-anagrams-in-a-string](leetcode/hash-table/438-find-all-anagrams-in-a-string.md)
+    * [447-number-of-boomerangs](leetcode/hash-table/447-number-of-boomerangs.md)
   * [math](leetcode/math/README.md)
     * [065-valid-number](leetcode/math/065-valid-number.md)
     * [013-roman-to-integer](leetcode/math/013-roman-to-integer.md)
@@ -177,6 +177,7 @@
     * [475-heaters](leetcode/binary-search/475-heaters.md)
     * [270-closest-binary-search-tree-value](leetcode/binary-search/270-closest-binary-search-tree-value.md)
     * [483-smallest-good-base](leetcode/binary-search/483-smallest-good-base.md)
+    * [778-swim-in-rising-water](leetcode/binary-search/778-swim-in-rising-water.md)
   * [two-pointers](leetcode/two-pointers/README.md)
     * [632-smallest-range](leetcode/two-pointers/632-smallest-range.md)
     * [350-intersection-of-two-arrays-ii](leetcode/two-pointers/350-intersection-of-two-arrays-ii.md)

leetcode/binary-search/778-swim-in-rising-water.md

@@ -0,0 +1,58 @@
+# 778-swim-in-rising-water
+
+## Question {#question}
+
+[https://leetcode.com/problems/swim-in-rising-water/description/](https://leetcode.com/problems/swim-in-rising-water/description/)
+
+On an N x N grid, each square grid\[i\]\[j\] represents the elevation at that point \(i,j\).
+
+Now rain starts to fall. At time t, the depth of the water everywhere is t. You can swim from a square to another 4-directionally adjacent square if and only if the elevation of both squares individually are at most t. You can swim infinite distance in zero time. Of course, you must stay within the boundaries of the grid during your swim.
+
+You start at the top left square \(0, 0\). What is the least time until you can reach the bottom right square \(N-1, N-1\)?
+
+**Example 1:**
+
+```text
+Input: [[0,2],[1,3]]
+Output: 3
+Explanation:
+At time 0, you are in grid location (0, 0).
+You cannot go anywhere else because 4-directionally adjacent neighbors have a higher elevation than t = 0.
+
+You cannot reach point (1, 1) until time 3.
+When the depth of water is 3, we can swim anywhere inside the grid.
+```
+
+**Example 2:**
+
+```text
+Input: [[0,1,2,3,4],[24,23,22,21,5],[12,13,14,15,16],[11,17,18,19,20],[10,9,8,7,6]]
+Output: 16
+Explanation:
+ 0  1  2  3  4
+24 23 22 21  5
+12 13 14 15 16
+11 17 18 19 20
+10  9  8  7  6
+
+The final route is marked in bold.
+We need to wait until time 16 so that (0, 0) and (4, 4) are connected.
+```
+
+**Note:**
+
+1. 2 <= N <= 50.
+2. grid\[i\]\[j\] is a permutation of \[0, ..., N\*N - 1\].
+
+## Thought Process {#thought-process}
+
+1. asd
+
+## Solution
+
+```java
+
+```
+
+## Additional {#additional}
+