Available question text
Given an m×n grid of nonnegative integers and rules that let you redistribute values between neighboring cells, compute the smallest possible value of the largest cell after any sequence of legal transfers. This typically reduces to binary-searching the target maximum and running a greedy/feasibility scan (prefix-sum style) over the grid to test if that cap can be achieved.
Related questions
Continue with questions that share topics or the same question type.
- Add Consecutive-Value Bonuses to Grid Paths
Coding
- Find and Count Maximum-Score Grid Paths
Coding · Dynamic Programming · Grids & Matrices
- Find the Maximum Ancestor Value Across All Leaf Nodes in a Binary Tree
Coding
- Find the Maximum Sequence Value of Array
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 2371. Minimize Maximum Value in a Grid
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source