Cody

# Problem 658. Find the biggest empty box

Solution 2005526

Submitted on 6 Nov 2019
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Fail
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));

idx = 25×0 empty double matrix arrfnd = 0 0 0 0

Output argument "r1" (and maybe others) not assigned during call to "biggest_box". Error in Test1 (line 2) [r1,r2,c1,c2] = biggest_box(a);

2   Fail
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));

idx = 25×0 empty double matrix arrfnd = 0 0 0 0 0 0 0 0 0

Output argument "r1" (and maybe others) not assigned during call to "biggest_box". Error in Test2 (line 2) [r1,r2,c1,c2] = biggest_box(a);

3   Fail
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));

idx = 25×0 empty double matrix arrfnd = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

Output argument "r1" (and maybe others) not assigned during call to "biggest_box". Error in Test3 (line 2) [r1,r2,c1,c2] = biggest_box(a);

4   Fail
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));

idx = 25×0 empty double matrix arrfnd = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

Output argument "r1" (and maybe others) not assigned during call to "biggest_box". Error in Test4 (line 2) [r1,r2,c1,c2] = biggest_box(a);