problem: 0228. Summary Ranges

Author: flynnpark

solutions/solution_0228/README copy.md

@@ -0,0 +1,32 @@
+# 0200. [Number of Islands](https://leetcode.com/problems/number-of-islands/)
+
+Given an `m x n` 2D binary grid `grid` which represents a map of `'1'`s (land) and `'0'`s (water), return _the number of islands_.
+
+An **island** is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.
+
+#### Example 1:
+
+<pre><code><strong>Input:</strong> grid = [
+  ["1","1","1","1","0"],
+  ["1","1","0","1","0"],
+  ["1","1","0","0","0"],
+  ["0","0","0","0","0"]
+]
+<strong>Output:</strong> 1</code></pre>
+
+#### Example 2:
+
+<pre><code><strong>Input:</strong> grid = [
+  ["1","1","0","0","0"],
+  ["1","1","0","0","0"],
+  ["0","0","1","0","0"],
+  ["0","0","0","1","1"]
+]
+<strong>Output:</strong> 3</code></pre>
+
+#### Constraints:
+
+- `m == grid.length`
+- `n == grid[i].length`
+- `1 <= m, n <= 300`
+- `grid[i][j]` is `'0'` or `'1'`.

solutions/solution_0228/README.md

@@ -0,0 +1,31 @@
+# 0228. [Number of Islands](https://leetcode.com/problems/number-of-islands/)
+
+Given an `m x n` 2D binary grid `grid` which represents a map of `'1'`s (land) and `'0'`s (water), return _the number of islands_.
+
+An **island** is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.
+
+#### Example 1:
+
+<pre><code><strong>Input:</strong> nums = [0,1,2,4,5,7]
+<strong>Output:</strong> ["0->2","4->5","7"]
+<strong>Explanation:</strong>The ranges are:
+[0,2] --> "0->2"
+[4,5] --> "4->5"
+[7,7] --> "7"</code></pre>
+
+#### Example 2:
+
+<pre><code><strong>Input:</strong> nums = [0,2,3,4,6,8,9]
+<strong>Output:</strong> ["0","2->4","6","8->9"]
+<strong>Explanation:</strong> The ranges are:
+[0,0] --> "0"
+[2,4] --> "2->4"
+[6,6] --> "6"
+[8,9] --> "8->9"</code></pre>
+
+#### Constraints:
+
+- `0 <= nums.length <= 20`
+- `-2<sup>31</sup> <= nums[i] <= 2<sup>31</sup> - 1`
+- All the values of `nums` are **unique**.
+- `nums` is sorted in ascending order.

solutions/solution_0228/__init__.py

@@ -0,0 +1,3 @@
+class Solution:
+    def summaryRanges(self, nums: list[int]) -> list[str]:
+        pass

solutions/solution_0228/test_solution.py

@@ -0,0 +1,29 @@
+from typing import TypedDict
+
+from . import Solution
+
+
+class CaseInput(TypedDict):
+    nums: list[int]
+
+
+class CaseDict(TypedDict):
+    input: CaseInput
+    expected: list[str]
+
+
+test_cases: list[CaseDict] = [
+    {
+        'input': {'nums': [0, 1, 2, 4, 5, 7]},
+        'expected': ['0->2', '4->5', '7'],
+    },
+    {
+        'input': {'nums': [0, 2, 3, 4, 6, 8, 9]},
+        'expected': ['0', '2->4', '6', '8->9'],
+    },
+]
+
+
+def test_solution():
+    for test_case in test_cases:
+        assert Solution().summaryRanges(**test_case['input']) == test_case['expected']