Problem done

Author: Kyrylo-Ktl

Python/Island Perimeter.py

@@ -0,0 +1,52 @@
+from typing import List
+
+
+class Solution:
+    """
+    Time:   O(n*m)
+    Memory: O(1)
+    """
+
+    LAND = 1
+    WATER = 0
+
+    def islandPerimeter(self, grid: List[List[int]]) -> int:
+        n, m = len(grid), len(grid[0])
+        perimeter = 0
+
+        for r in range(n):
+            for c in range(m):
+                if grid[r][c] != self.LAND:
+                    continue
+                if r == 0     or grid[r - 1][c] == self.WATER:
+                    perimeter += 1
+                if r == n - 1 or grid[r + 1][c] == self.WATER:
+                    perimeter += 1
+                if c == 0     or grid[r][c - 1] == self.WATER:
+                    perimeter += 1
+                if c + 1 == m or grid[r][c + 1] == self.WATER:
+                    perimeter += 1
+
+        return perimeter
+
+
+class Solution:
+    """
+    Time:   O(n*m)
+    Memory: O(1)
+    """
+
+    LAND = 1
+    WATER = 0
+
+    def islandPerimeter(self, grid: List[List[int]]) -> int:
+        n, m = len(grid), len(grid[0])
+        return sum(
+            sum([
+                r == 0     or grid[r - 1][c] == self.WATER,
+                r == n - 1 or grid[r + 1][c] == self.WATER,
+                c == 0     or grid[r][c - 1] == self.WATER,
+                c + 1 == m or grid[r][c + 1] == self.WATER
+            ]) for r in range(n)
+            for c in range(m) if grid[r][c] == self.LAND
+        )

Python/Range Sum Query 2D - Immutable.py

@@ -0,0 +1,23 @@
+from typing import List
+
+
+class NumMatrix:
+    """
+    Time:
+        creation - O(n*m)
+        query    - O(1)
+    Memory:
+        creation - O(n*m)
+        query    - O(1)
+    """
+
+    def __init__(self, matrix: List[List[int]]):
+        n, m = len(matrix), len(matrix[0])
+        self.dp = [[0] * (m + 1) for _ in range(n + 1)]
+        for i in range(1, n + 1):
+            for j in range(1, m + 1):
+                self.dp[i][j] = self.dp[i][j - 1] + self.dp[i - 1][j] + matrix[i - 1][j - 1] - self.dp[i - 1][j - 1]
+
+    def sumRegion(self, start_row: int, start_col: int, end_row: int, end_col: int) -> int:
+        return self.dp[end_row + 1][end_col + 1] + self.dp[start_row][start_col] - \
+               self.dp[start_row][end_col + 1] - self.dp[end_row + 1][start_col]

infrastructure/src/db/models.py

@@ -58,7 +58,7 @@ def slug(self):
 
     @staticmethod
     def to_slug(title: str) -> str:
-        return '-'.join(re.sub(r'[^\w\- ]', '', title).lower().split())
+        return '-'.join(re.sub(r'[^\w\- ]', '', title.replace(' - ', ' ')).lower().split())
 
     @property
     def solutions(self) -> Generator: