← All problemsSign in

3933. Largest Local Values in a Matrix II

LeetCodeArrayMatrixPrefix SumOpen on judge ↗

You are given an n x m integer matrix matrix containing non-negative integers. A non-zero cell (row, col) checks the cells near it as follows: - Let x = matrix[row][col]. - Consider every cell within x rows and x columns of (row, col). - Ignore cells that are outside the matrix. - Ignore the cells where both the row distance and column distance are exactly x. The cell (row, col) is a local m

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start