← Questions
Largest square subgrid with every sum under a limit
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given an integer grid and a limit, find the largest side length k such that every k x k square in the grid sums to at most the limit. Use 2D prefix sums to get any square's sum in constant time, then search over k.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding