2022-05-19 - LeetHub

Author: github-actions[bot]

README.md

@@ -2,7 +2,7 @@
 
 ## LeetCode
 
-**Problem Solved: 145** (<span style="color:green">Easy: 28</span>, <span style="color:orange">Medium: 101</span>, <span style="color:red">Hard: 16</span>)
+**Problem Solved: 147** (<span style="color:green">Easy: 28</span>, <span style="color:orange">Medium: 103</span>, <span style="color:red">Hard: 16</span>)
 
 | # | Title | Solutions | Difficulty |
 | - | - | - | - |
@@ -19,7 +19,7 @@
 | 23 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | <a href="leetcode/00023_merge-k-sorted-lists/merge-k-sorted-lists.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Hard |
 | 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | <a href="leetcode/00024_swap-nodes-in-pairs/24-swap-nodes-in-pairs.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
 | 28 | [Implement strStr()](https://leetcode.com/problems/implement-strstr/) | <a href="leetcode/00028_implement-strstr/implement-strstr.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Easy |
-| 31 | [Next Permutation](https://leetcode.com/problems/next-permutation/) | <a href="leetcode/00031_next-permutation/next-permutation.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
+| 31 | [Next Permutation](https://leetcode.com/problems/next-permutation/) | <a href="leetcode/00031_next-permutation/31-next-permutation.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
 | 32 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | <a href="leetcode/00032_longest-valid-parentheses/longest-valid-parentheses.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Hard |
 | 33 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | <a href="leetcode/00033_search-in-rotated-sorted-array/search-in-rotated-sorted-array.java"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/java/java-original.svg" width="20" height="20"></a> | Medium |
 | 34 | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/) | <a href="leetcode/00034_find-first-and-last-position-of-element-in-sorted-array/34-find-first-and-last-position-of-element-in-sorted-array.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
@@ -73,9 +73,9 @@
 | 236 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | <a href="leetcode/00236_lowest-common-ancestor-of-a-binary-tree/236-lowest-common-ancestor-of-a-binary-tree.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
 | 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | <a href="leetcode/00238_product-of-array-except-self/product-of-array-except-self.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
 | 247 | [Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii/) | <a href="leetcode/00247_strobogrammatic-number-ii/247-strobogrammatic-number-ii.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
-| 249 | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings/) |  | Medium |
+| 249 | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings/) | <a href="leetcode/00249_group-shifted-strings/249-group-shifted-strings.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
 | 252 | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms/) | <a href="leetcode/00252_meeting-rooms/meeting-rooms.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Easy |
-| 253 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | <a href="leetcode/00253_meeting-rooms-ii/253-meeting-rooms-ii.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a><a href="leetcode/00253_meeting-rooms-ii/253-meeting-rooms-ii.java"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/java/java-original.svg" width="20" height="20"></a> | Medium |
+| 253 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | <a href="leetcode/00253_meeting-rooms-ii/253-meeting-rooms-ii.java"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/java/java-original.svg" width="20" height="20"></a><a href="leetcode/00253_meeting-rooms-ii/253-meeting-rooms-ii.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
 | 259 | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller/) | <a href="leetcode/00259_3sum-smaller/259-3sum-smaller.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
 | 263 | [Ugly Number](https://leetcode.com/problems/ugly-number/) | <a href="leetcode/00263_ugly-number/ugly-number.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a><a href="leetcode/00263_ugly-number/ugly-number.cpp"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/cplusplus/cplusplus-original.svg" width="20" height="20"></a> | Easy |
 | 286 | [Walls and Gates](https://leetcode.com/problems/walls-and-gates/) | <a href="leetcode/00286_walls-and-gates/286-walls-and-gates.cpp"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/cplusplus/cplusplus-original.svg" width="20" height="20"></a><a href="leetcode/00286_walls-and-gates/286-walls-and-gates.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
@@ -107,8 +107,9 @@
 | 657 | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin/) | <a href="leetcode/00657_robot-return-to-origin/robot-return-to-origin.cpp"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/cplusplus/cplusplus-original.svg" width="20" height="20"></a> | Easy |
 | 660 | [Remove 9](https://leetcode.com/problems/remove-9/) | <a href="leetcode/00660_remove-9/660-remove-9.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Hard |
 | 692 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | <a href="leetcode/00692_top-k-frequent-words/692-top-k-frequent-words.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
+| 694 | [Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands/) | <a href="leetcode/00694_number-of-distinct-islands/694-number-of-distinct-islands.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
 | 695 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island/) | <a href="leetcode/00695_max-area-of-island/695-max-area-of-island.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
-| 701 | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/) | <a href="leetcode/00701_insert-into-a-binary-search-tree/701-insert-into-a-binary-search-tree.java"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/java/java-original.svg" width="20" height="20"></a><a href="leetcode/00701_insert-into-a-binary-search-tree/701-insert-into-a-binary-search-tree.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a><a href="leetcode/00701_insert-into-a-binary-search-tree/701-insert-into-a-binary-search-tree.go"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/go/go-original.svg" width="20" height="20"></a> | Medium |
+| 701 | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/) | <a href="leetcode/00701_insert-into-a-binary-search-tree/701-insert-into-a-binary-search-tree.go"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/go/go-original.svg" width="20" height="20"></a><a href="leetcode/00701_insert-into-a-binary-search-tree/701-insert-into-a-binary-search-tree.java"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/java/java-original.svg" width="20" height="20"></a><a href="leetcode/00701_insert-into-a-binary-search-tree/701-insert-into-a-binary-search-tree.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
 | 706 | [Design HashMap](https://leetcode.com/problems/design-hashmap/) | <a href="leetcode/00706_design-hashmap/706-design-hashmap.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Easy |
 | 728 | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/) | <a href="leetcode/00728_self-dividing-numbers/self-dividing-numbers.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Easy |
 | 735 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision/) | <a href="leetcode/00735_asteroid-collision/735-asteroid-collision.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
@@ -135,6 +136,7 @@
 | 1029 | [Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/) | <a href="leetcode/01029_two-city-scheduling/1029-two-city-scheduling.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
 | 1041 | [Robot Bounded In Circle](https://leetcode.com/problems/robot-bounded-in-circle/) | <a href="leetcode/01041_robot-bounded-in-circle/1041-robot-bounded-in-circle.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
 | 1044 | [Longest Duplicate Substring](https://leetcode.com/problems/longest-duplicate-substring/) | <a href="leetcode/01044_longest-duplicate-substring/longest-duplicate-substring.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Hard |
+| 1091 | [Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/) | <a href="leetcode/01091_shortest-path-in-binary-matrix/1091-shortest-path-in-binary-matrix.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
 | 1094 | [Car Pooling](https://leetcode.com/problems/car-pooling/) | <a href="leetcode/01094_car-pooling/1094-car-pooling.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
 | 1100 | [Find K-Length Substrings With No Repeated Characters](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/) | <a href="leetcode/01100_find-k-length-substrings-with-no-repeated-characters/1100-find-k-length-substrings-with-no-repeated-characters.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |
 | 1143 | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | <a href="leetcode/01143_longest-common-subsequence/1143-longest-common-subsequence.py"><img src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg" width="20" height="20"></a> | Medium |

leetcode/00249_group-shifted-strings/249-group-shifted-strings.py

@@ -0,0 +1,20 @@
+from collections import defaultdict
+
+
+class Solution:
+    def groupStrings(self, strings: List[str]) -> List[List[str]]:
+        memo = defaultdict(list)
+        for string in strings:
+            if len(string) == 1:
+                memo[tuple()].append(string)
+                continue
+
+            keys = []
+            for idx, char in enumerate(string[:-1]):
+                diff = ord(string[idx+1]) - ord(char)
+                if diff < 0:
+                    diff += 26
+                keys.append(diff)
+
+            memo[tuple(keys)].append(string)
+        return list(memo.values())

leetcode/00694_number-of-distinct-islands/694-number-of-distinct-islands.py

@@ -0,0 +1,41 @@
+class Solution:
+    def numDistinctIslands(self, grid: List[List[int]]) -> int:
+        R, C = len(grid), len(grid[0])
+
+        unique_encoded = set()
+
+        offsets = (
+            (0, 1),
+            (0, -1),
+            (1, 0),
+            (-1, 0),
+        )
+
+        def bfs(start_r, start_c):
+            nodes = deque([(start_r, start_c)])
+            encoded = list()
+
+            while nodes:
+                r, c = nodes.popleft()
+                if not (0 <= r < R) or \
+                        not (0 <= c < C) or \
+                        grid[r][c] == 0:
+                    continue
+
+                encoded.append((r - start_r, c - start_c))
+                grid[r][c] = 0
+
+                for dr, dc in offsets:
+                    nodes.append((r + dr, c + dc))
+
+            return ','.join(str(e) for e in encoded)
+
+        for r in range(R):
+            for c in range(C):
+                if grid[r][c] == 0:
+                    continue
+
+                encoded = bfs(r, c)
+                unique_encoded.add(encoded)
+
+        return len(unique_encoded)

leetcode/00694_number-of-distinct-islands/README.md

@@ -0,0 +1,29 @@
+<h2><a href="https://leetcode.com/problems/number-of-distinct-islands/">694. Number of Distinct Islands</a></h2><h3>Medium</h3><hr><div><p>You are given an <code>m x n</code> binary matrix <code>grid</code>. An island is a group of <code>1</code>'s (representing land) connected <strong>4-directionally</strong> (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.</p>
+
+<p>An island is considered to be the same as another if and only if one island can be translated (and not rotated or reflected) to equal the other.</p>
+
+<p>Return <em>the number of <b>distinct</b> islands</em>.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/05/01/distinctisland1-1-grid.jpg" style="width: 413px; height: 334px;">
+<pre><strong>Input:</strong> grid = [[1,1,0,0,0],[1,1,0,0,0],[0,0,0,1,1],[0,0,0,1,1]]
+<strong>Output:</strong> 1
+</pre>
+
+<p><strong>Example 2:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/05/01/distinctisland1-2-grid.jpg" style="width: 413px; height: 334px;">
+<pre><strong>Input:</strong> grid = [[1,1,0,1,1],[1,0,0,0,0],[0,0,0,0,1],[1,1,0,1,1]]
+<strong>Output:</strong> 3
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>m == grid.length</code></li>
+	<li><code>n == grid[i].length</code></li>
+	<li><code>1 &lt;= m, n &lt;= 50</code></li>
+	<li><code>grid[i][j]</code> is either <code>0</code> or <code>1</code>.</li>
+</ul>
+</div>

leetcode/01091_shortest-path-in-binary-matrix/1091-shortest-path-in-binary-matrix.py

@@ -0,0 +1,45 @@
+class Solution:
+    def shortestPathBinaryMatrix(self, grid: List[List[int]]) -> int:
+        if grid[0][0] == 1:
+            return -1
+
+        R, C = len(grid), len(grid[0])
+
+        if grid[R - 1][C - 1] == 1:
+            return -1
+
+        offsets = (
+            (1, -1),
+            (1, 0),
+            (1, 1),
+            (0, 1),
+            (0, -1),
+            (-1, -1),
+            (-1, 0),
+            (-1, 1),
+        )
+
+        visited = [[sys.maxsize] * C for _ in range(R)]
+
+        nodes = deque([(0, 0, 1)])
+        while nodes:
+            r, c, steps = nodes.popleft()
+
+            if not (0 <= r < R) or \
+                    not (0 <= c < C):
+                continue
+
+            if grid[r][c] == 1:
+                continue
+
+            if steps >= visited[r][c]:
+                continue
+
+            visited[r][c] = steps
+
+            for dr, dc in offsets:
+                nodes.append((r + dr, c + dc, steps + 1))
+
+        if visited[R - 1][C - 1] == sys.maxsize:
+            return -1
+        return visited[R - 1][C - 1]

leetcode/01091_shortest-path-in-binary-matrix/README.md

@@ -0,0 +1,40 @@
+<h2><a href="https://leetcode.com/problems/shortest-path-in-binary-matrix/">1091. Shortest Path in Binary Matrix</a></h2><h3>Medium</h3><hr><div><p>Given an <code>n x n</code> binary matrix <code>grid</code>, return <em>the length of the shortest <strong>clear path</strong> in the matrix</em>. If there is no clear path, return <code>-1</code>.</p>
+
+<p>A <strong>clear path</strong> in a binary matrix is a path from the <strong>top-left</strong> cell (i.e., <code>(0, 0)</code>) to the <strong>bottom-right</strong> cell (i.e., <code>(n - 1, n - 1)</code>) such that:</p>
+
+<ul>
+	<li>All the visited cells of the path are <code>0</code>.</li>
+	<li>All the adjacent cells of the path are <strong>8-directionally</strong> connected (i.e., they are different and they share an edge or a corner).</li>
+</ul>
+
+<p>The <strong>length of a clear path</strong> is the number of visited cells of this path.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/example1_1.png" style="width: 500px; height: 234px;">
+<pre><strong>Input:</strong> grid = [[0,1],[1,0]]
+<strong>Output:</strong> 2
+</pre>
+
+<p><strong>Example 2:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/example2_1.png" style="height: 216px; width: 500px;">
+<pre><strong>Input:</strong> grid = [[0,0,0],[1,1,0],[1,1,0]]
+<strong>Output:</strong> 4
+</pre>
+
+<p><strong>Example 3:</strong></p>
+
+<pre><strong>Input:</strong> grid = [[1,0,0],[1,1,0],[1,1,0]]
+<strong>Output:</strong> -1
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>n == grid.length</code></li>
+	<li><code>n == grid[i].length</code></li>
+	<li><code>1 &lt;= n &lt;= 100</code></li>
+	<li><code>grid[i][j] is 0 or 1</code></li>
+</ul>
+</div>