Jan 28

Author: siddydutta

2025-01-January-LeetCoding-Challenge/Maximum Number of Fish in a Grid.py

@@ -0,0 +1,42 @@
+from itertools import product
+from typing import List
+
+
+class Solution:
+    DIRS = ((0, 1), (1, 0), (0, -1), (-1, 0))
+
+    def findMaxFish(self, grid: List[List[int]]) -> int:
+        m, n = len(grid), len(grid[0])
+
+        def dfs(x: int, y: int) -> int:
+            if x < 0 or x >= m or y < 0 or y >= n or grid[x][y] == 0:
+                return 0
+            fish = grid[x][y]
+            grid[x][y] = 0
+            for dx, dy in self.DIRS:
+                fish += dfs(x + dx, y + dy)
+            return fish
+
+        max_fish = 0
+        for i, j in product(range(m), range(n)):
+            if grid[i][j] != 0:
+                max_fish = max(max_fish, dfs(i, j))
+        return max_fish
+
+
+def main():
+    grid = [[0, 2, 1, 0],
+            [4, 0, 0, 3],
+            [1, 0, 0, 4],
+            [0, 3, 2, 0]]
+    assert Solution().findMaxFish(grid) == 7
+
+    grid = [[1, 0, 0, 0],
+            [0, 0, 0, 0],
+            [0, 0, 0, 0],
+            [0, 0, 0, 1]]
+    assert Solution().findMaxFish(grid) == 1
+
+
+if __name__ == '__main__':
+    main()

2025-01-January-LeetCoding-Challenge/README.md

@@ -30,7 +30,7 @@
 | January 25 | [2948. Make Lexicographically Smallest Array by Swapping Elements](https://leetcode.com/problems/make-lexicographically-smallest-array-by-swapping-elements/) | Medium | Solved |
 | January 26 | [2127. Maximum Employees to Be Invited to a Meeting](https://leetcode.com/problems/maximum-employees-to-be-invited-to-a-meeting/) | Hard | Unsolved |
 | January 27 | [1462. Course Schedule IV](https://leetcode.com/problems/course-schedule-iv/) | Medium | Solved |
-| January 28 | []() |  |  |
+| January 28 | [2658. Maximum Number of Fish in a Grid](https://leetcode.com/problems/maximum-number-of-fish-in-a-grid/) | Medium | Solved |
 | January 29 | []() |  |  |
 | January 30 | []() |  |  |
 | January 31 | []() |  |  |
@@ -40,5 +40,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 4 | 4 | 0 |
-| Medium | 19 | 16 | 3 |
+| Medium | 20 | 17 | 3 |
 | Hard   | 3 | 0 | 3 |