Cody

Problem 658. Find the biggest empty box

Solution 1140824

Submitted on 17 Mar 2017 by H M Dipu Kabir
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
a = [1 0; 0 0]; [r1,r2,c1,c2] = biggest_box(a); sub = a(r1:r2,c1:c2); [m,n] = size(sub); len = 1; assert(isequal(sum(sub(:)),0)) assert(isequal(m,len)); assert(isequal(n,len));

a = 0 1 1 1 side = 1
2   Pass
a = [1 0 0; 0 0 0; 0 0 0]; [r1,r2,c1,c2] = biggest_box(a); sub = a(r1:r2,c1:c2); [m,n] = size(sub); len = 2; assert(isequal(sum(sub(:)),0)) assert(isequal(m,len)); assert(isequal(n,len));

a = 0 1 1 1 1 1 1 1 1 side = 1 a = 0 1 1 1 1 2 1 1 1 side = 2 a = 0 1 1 1 1 2 1 2 1 a = 0 1 1 1 1 2 1 2 2
3   Pass
a = eye(9); [r1,r2,c1,c2] = biggest_box(a); sub = a(r1:r2,c1:c2); [m,n] = size(sub); len = 4; assert(isequal(sum(sub(:)),0)) assert(isequal(m,len)); assert(isequal(n,len));

a = 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 side = 1 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 side = 2 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 2 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 2 2 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 2 2 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 2 2 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 2 2 1 1 0 1 2 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 2 2 1 1 0 1 2 3 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 side = 3 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 2 2 1 1 0 1 2 3 3 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 2 2 1 1 0 1 2 3 3 3 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 2 2 1 1 0 1 2 3 3 3 3 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 2 2 1 1 0 1 2 3 3 3 3 1 2 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 2 2 1 1 0 1 2 3 3 3 3 1 2 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 2 2 1 1 0 1 2 3 3 3 3 1 2 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 2 2 1 1 0 1 2 3 3 3 3 1 2 1 0 1 2 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 2 2 1 1 0 1 2 3 3 3 3 1 2 1 0 1 2 3 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 a = 0 1 1 1 1 1 1 1 1 1 0 1 2 2 2 2 2 2 1 1 0 1 2 3 3 3 3 1 2 1 0 1 2 3 4 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 ...
4   Pass
a = double(magic(7)<6); [r1,r2,c1,c2] = biggest_box(a); sub = a(r1:r2,c1:c2); [m,n] = size(sub); len = 4; assert(isequal(sum(sub(:)),0)) assert(isequal(m,len)); assert(isequal(n,len));

a = 1 1 1 0 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 side = 2 a = 1 1 1 0 1 1 1 1 2 2 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 side = 3 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 3 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 3 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 3 1 1 2 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 3 1 1 2 3 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 3 1 1 2 3 4 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 side = 4 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 3 1 1 2 3 4 4 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 3 1 1 2 3 4 4 0 1 2 1 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 3 1 1 2 3 4 4 0 1 2 2 1 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 3 1 1 2 3 4 4 0 1 2 2 3 1 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 3 1 1 2 3 4 4 0 1 2 2 3 4 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 3 1 1 2 3 4 4 0 1 2 2 3 4 0 1 1 1 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 3 1 1 2 3 4 4 0 1 2 2 3 4 0 1 1 2 1 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 3 1 1 2 3 4 4 0 1 2 2 3 4 0 1 1 2 3 1 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 3 1 1 2 3 4 4 0 1 2 2 3 4 0 1 1 2 3 3 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 1 2 3 2 2 2 3 0 1 2 3 3 3 3 1 1 2 3 4 4 0 1 2 2 3 4 0 1 1 2 3 3 0 1 1 a = 1 1 1 0 1 1 1 1 2 2 1 1 2 2 ...

Suggested Problems

More from this Author50

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!