Available question text
Given an m×n grid where positive cells contain fish and zeros are land, find the maximum total fish a fisher can collect by starting at any water cell and traversing its reachable adjacent water cells (up/down/left/right). This reduces to finding the connected component of positive cells with the largest sum (can be done with DFS/BFS; m,n ≤ 10).
Related questions
Continue with questions that share topics or the same question type.
- Maximum Number of Moves in a Grid
Coding
- Maximum Number of Points From Grid Queries
Coding · Array · Breadth-First Search · Heap (Priority Queue)
- All the Pairs With the Maximum Number of Common Followers
Coding
- Count Number of Maximum Bitwise-OR Subsets
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2658. Maximum Number of Fish in a Grid
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source