Leetcode 2371. Minimize Maximum Value in a Grid

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.