Add Solutions, Explanation and Update the README File of the day 5658

Author: Aarzoo

Algorithms/README.md

@@ -87,6 +87,7 @@
 | 2559            | 2559. Count Vowel Strings in Ranges  | [C++](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Code/solution.cpp), [Java](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Code/solution.java), [JavaScript](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Code/solution.js), [Python](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Code/solution.py), [Go](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Code/solution.go) | [Explanation](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Explanation/explanation.md)   | Medium             |
 | 2563            | Count the Number of Fair Pairs  | [C++](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Code/solution.cpp), [Java](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Code/solution.java), [JavaScript](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Code/solution.js), [Python](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Code/solution.py), [Go](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Code/solution.go) | [Explanation](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Explanation/explanation.md)   | Medium             |
 | 2601            | Prime Subtraction Operation  | [C++](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Code/solution.cpp), [Java](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Code/solution.java), [JavaScript](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Code/solution.js), [Python](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Code/solution.py), [Go](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Code/solution.go) | [Explanation](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Explanation/explanation.md)   | Medium             |
+| 2658            | Maximum Number of Fish in a Grid  | [C++](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Code/solution.cpp), [Java](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Code/solution.java), [JavaScript](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Code/solution.js), [Python](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Code/solution.py), [Go](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Code/solution.go) | [Explanation](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Explanation/explanation.md)   | Medium             |
 | 2661            | First Completely Painted Row or Column  | [C++](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Code/solution.cpp), [Java](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Code/solution.java), [JavaScript](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Code/solution.js), [Python](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Code/solution.py), [Go](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Code/solution.go) | [Explanation](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Explanation/explanation.md)   | Medium             |
 | 2678            | Number of Senior Citizens  | [C++](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Code/solution.cpp), [Java](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Code/solution.java), [JavaScript](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Code/solution.js), [Python](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Code/solution.py), [Go](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Code/solution.go) | [Explanation](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Explanation/explanation.md)   | Easy             |
 | 2683            | Neighboring Bitwise XOR  | [C++](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Code/solution.cpp), [Java](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Code/solution.java), [JavaScript](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Code/solution.js), [Python](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Code/solution.py), [Go](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Code/solution.go) | [Explanation](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Explanation/explanation.md)   | Medium             |

Algorithms/src/2658. Maximum Number of Fish in a Grid/Code/solution.cpp

@@ -0,0 +1,29 @@
+class Solution {
+public:
+    int findMaxFish(vector<vector<int>>& grid) {
+        int m = grid.size(), n = grid[0].size();
+        vector<vector<bool>> visited(m, vector<bool>(n, false));
+        int maxFish = 0;
+
+        auto dfs = [&](int r, int c, auto& dfs) -> int {
+            if (r < 0 || c < 0 || r >= m || c >= n || visited[r][c] || grid[r][c] == 0)
+                return 0;
+            visited[r][c] = true;
+            int fish = grid[r][c];
+            fish += dfs(r + 1, c, dfs);
+            fish += dfs(r - 1, c, dfs);
+            fish += dfs(r, c + 1, dfs);
+            fish += dfs(r, c - 1, dfs);
+            return fish;
+        };
+
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                if (!visited[i][j] && grid[i][j] > 0) {
+                    maxFish = max(maxFish, dfs(i, j, dfs));
+                }
+            }
+        }
+        return maxFish;
+    }
+};

Algorithms/src/2658. Maximum Number of Fish in a Grid/Code/solution.go

@@ -0,0 +1,38 @@
+func findMaxFish(grid [][]int) int {
+    m, n := len(grid), len(grid[0])
+    visited := make([][]bool, m)
+    for i := range visited {
+        visited[i] = make([]bool, n)
+    }
+    maxFish := 0
+
+    var dfs func(r, c int) int
+    dfs = func(r, c int) int {
+        if r < 0 || c < 0 || r >= m || c >= n || visited[r][c] || grid[r][c] == 0 {
+            return 0
+        }
+        visited[r][c] = true
+        fish := grid[r][c]
+        fish += dfs(r+1, c)
+        fish += dfs(r-1, c)
+        fish += dfs(r, c+1)
+        fish += dfs(r, c-1)
+        return fish
+    }
+
+    for i := 0; i < m; i++ {
+        for j := 0; j < n; j++ {
+            if !visited[i][j] && grid[i][j] > 0 {
+                maxFish = max(maxFish, dfs(i, j))
+            }
+        }
+    }
+    return maxFish
+}
+
+func max(a, b int) int {
+    if a > b {
+        return a
+    }
+    return b
+}

Algorithms/src/2658. Maximum Number of Fish in a Grid/Code/solution.java

@@ -0,0 +1,28 @@
+class Solution {
+    public int findMaxFish(int[][] grid) {
+        int m = grid.length, n = grid[0].length;
+        boolean[][] visited = new boolean[m][n];
+        int maxFish = 0;
+
+        int dfs(int r, int c) {
+            if (r < 0 || c < 0 || r >= m || c >= n || visited[r][c] || grid[r][c] == 0)
+                return 0;
+            visited[r][c] = true;
+            int fish = grid[r][c];
+            fish += dfs(r + 1, c);
+            fish += dfs(r - 1, c);
+            fish += dfs(r, c + 1);
+            fish += dfs(r, c - 1);
+            return fish;
+        }
+
+        for (int i = 0; i < m; i++) {
+            for (int j = 0; j < n; j++) {
+                if (!visited[i][j] && grid[i][j] > 0) {
+                    maxFish = Math.max(maxFish, dfs(i, j));
+                }
+            }
+        }
+        return maxFish;
+    }
+}

Algorithms/src/2658. Maximum Number of Fish in a Grid/Code/solution.js

@@ -0,0 +1,27 @@
+var findMaxFish = function (grid) {
+  const m = grid.length,
+    n = grid[0].length;
+  const visited = Array.from({ length: m }, () => Array(n).fill(false));
+  let maxFish = 0;
+
+  const dfs = (r, c) => {
+    if (r < 0 || c < 0 || r >= m || c >= n || visited[r][c] || grid[r][c] === 0)
+      return 0;
+    visited[r][c] = true;
+    let fish = grid[r][c];
+    fish += dfs(r + 1, c);
+    fish += dfs(r - 1, c);
+    fish += dfs(r, c + 1);
+    fish += dfs(r, c - 1);
+    return fish;
+  };
+
+  for (let i = 0; i < m; i++) {
+    for (let j = 0; j < n; j++) {
+      if (!visited[i][j] && grid[i][j] > 0) {
+        maxFish = Math.max(maxFish, dfs(i, j));
+      }
+    }
+  }
+  return maxFish;
+};

Algorithms/src/2658. Maximum Number of Fish in a Grid/Code/solution.py

@@ -0,0 +1,22 @@
+class Solution:
+    def findMaxFish(self, grid: List[List[int]]) -> int:
+        m, n = len(grid), len(grid[0])
+        visited = [[False] * n for _ in range(m)]
+        max_fish = 0
+
+        def dfs(r, c):
+            if r < 0 or c < 0 or r >= m or c >= n or visited[r][c] or grid[r][c] == 0:
+                return 0
+            visited[r][c] = True
+            fish = grid[r][c]
+            fish += dfs(r + 1, c)
+            fish += dfs(r - 1, c)
+            fish += dfs(r, c + 1)
+            fish += dfs(r, c - 1)
+            return fish
+
+        for i in range(m):
+            for j in range(n):
+                if not visited[i][j] and grid[i][j] > 0:
+                    max_fish = max(max_fish, dfs(i, j))
+        return max_fish

Algorithms/src/2658. Maximum Number of Fish in a Grid/Explanation/explanation.md

@@ -0,0 +1,96 @@
+# Find the Maximum Fish in a Grid
+
+## Step-by-Step Explanation
+
+This problem involves finding the maximum number of fish that can be collected in a grid by exploring connected components. Below is a detailed breakdown of the approach and logic used in the implementation across **C++**, **Java**, **JavaScript**, **Python**, and **Go**. Each step explains the logic for all the solutions without directly revealing the code.
+
+---
+
+### General Approach
+
+1. **Identify Connected Components**  
+   - The problem can be visualized as identifying connected groups of grid cells containing fish (non-zero values).
+   - Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse connected cells starting from any cell with a positive value.
+
+2. **Collect Fish from Connected Cells**  
+   - As you traverse each connected component, sum up the values (number of fish) in that component.
+
+3. **Track the Maximum Fish Count**  
+   - Compare the total fish collected from each connected component to keep track of the maximum.
+
+---
+
+### C++ Code: Step-by-Step
+
+1. **Grid Traversal**  
+   - Loop through each cell in the grid. If the cell contains fish (non-zero value) and hasn't been visited yet, initiate a DFS traversal.
+
+2. **DFS Implementation**  
+   - Use a recursive function to traverse all connected cells, summing up the fish values.
+   - Mark visited cells to avoid processing them again.
+
+3. **Track Maximum Fish**  
+   - After completing the DFS for each component, compare the total fish count with the current maximum and update accordingly.
+
+---
+
+### Java Code: Step-by-Step
+
+1. **Grid Traversal**  
+   - Use nested loops to go through all the grid cells. Start DFS whenever a fish-filled cell is found.
+
+2. **DFS as a Helper Function**  
+   - Implement DFS recursively or with a stack. For each connected cell, add the fish value to a running total and mark it as visited.
+
+3. **Compare and Update Maximum**  
+   - At the end of the traversal for each component, compare its total fish count with the global maximum.
+
+---
+
+### JavaScript Code: Step-by-Step
+
+1. **Iterate Through the Grid**  
+   - Use nested `for` loops to inspect each cell in the grid. When a cell with fish is found, initiate a DFS.
+
+2. **Handle Connected Components**  
+   - Implement a DFS function using recursion or an iterative approach (using a stack) to explore all connected cells. Add fish values and mark cells as visited.
+
+3. **Update Maximum Fish Count**  
+   - After completing the DFS for one component, compare its total fish count with the global maximum and store the higher value.
+
+---
+
+### Python Code: Step-by-Step
+
+1. **Loop Over the Grid**  
+   - Iterate through every cell using nested loops. When a cell with fish is encountered, start a DFS.
+
+2. **Recursive DFS Implementation**  
+   - Use a recursive function to traverse all connected cells. Add the value of each cell to the total count and mark it as visited.
+
+3. **Global Maximum Update**  
+   - At the end of each DFS, compare the total fish collected in that component with the maximum recorded so far and update as needed.
+
+---
+
+### Go Code: Step-by-Step
+
+1. **Traverse Each Cell**  
+   - Loop over all the cells in the grid. When a cell containing fish is found, trigger a DFS.
+
+2. **DFS with a Helper Function**  
+   - Implement DFS to explore connected cells. Maintain a running total of fish and ensure cells are marked as visited.
+
+3. **Update Maximum Fish Count**  
+   - After completing the DFS for a component, compare its total fish count with the global maximum and update.
+
+---
+
+### Complexity Analysis
+
+- **Time Complexity**:  
+  $$O(n \times m)$$ for all solutions, where \(n\) and \(m\) are the grid dimensions. This is because each cell is processed once during the traversal.
+
+- **Space Complexity**:  
+  - For DFS: \(O(\text{stack depth})\), which is proportional to the size of the grid in the worst case.  
+  - For BFS: \(O(n \times m)\) for the queue used to store cells during traversal.

README.md

@@ -89,6 +89,7 @@ Welcome to the LeetCode Solutions repository! Here, you'll find daily solutions
 | 2559            | 2559. Count Vowel Strings in Ranges  | [C++](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Code/solution.cpp), [Java](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Code/solution.java), [JavaScript](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Code/solution.js), [Python](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Code/solution.py), [Go](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Code/solution.go) | [Explanation](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Explanation/explanation.md)   | Medium             |
 | 2563            | Count the Number of Fair Pairs  | [C++](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Code/solution.cpp), [Java](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Code/solution.java), [JavaScript](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Code/solution.js), [Python](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Code/solution.py), [Go](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Code/solution.go) | [Explanation](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Explanation/explanation.md)   | Medium             |
 | 2601            | Prime Subtraction Operation  | [C++](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Code/solution.cpp), [Java](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Code/solution.java), [JavaScript](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Code/solution.js), [Python](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Code/solution.py), [Go](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Code/solution.go) | [Explanation](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Explanation/explanation.md)   | Medium             |
+| 2658            | Maximum Number of Fish in a Grid  | [C++](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Code/solution.cpp), [Java](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Code/solution.java), [JavaScript](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Code/solution.js), [Python](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Code/solution.py), [Go](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Code/solution.go) | [Explanation](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Explanation/explanation.md)   | Medium             |
 | 2661            | First Completely Painted Row or Column  | [C++](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Code/solution.cpp), [Java](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Code/solution.java), [JavaScript](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Code/solution.js), [Python](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Code/solution.py), [Go](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Code/solution.go) | [Explanation](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Explanation/explanation.md)   | Medium             |
 | 2678            | Number of Senior Citizens  | [C++](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Code/solution.cpp), [Java](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Code/solution.java), [JavaScript](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Code/solution.js), [Python](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Code/solution.py), [Go](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Code/solution.go) | [Explanation](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Explanation/explanation.md)   | Easy             |
 | 2683            | Neighboring Bitwise XOR  | [C++](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Code/solution.cpp), [Java](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Code/solution.java), [JavaScript](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Code/solution.js), [Python](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Code/solution.py), [Go](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Code/solution.go) | [Explanation](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Explanation/explanation.md)   | Medium             |