Cody

# Problem 658. Find the biggest empty box

Solution 2005538

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

R = [] C = [] r1 = [] r2 = [] c1 = [] c2 = []

Assertion failed.

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

R = 2 3 2 3 C = 1 1 2 2 r1 = 2 r2 = 3 c1 = 1 c2 = 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));

R = 5 6 7 8 5 6 7 8 5 6 7 8 5 6 7 8 C = 1 1 1 1 2 2 2 2 3 3 3 3 4 4 4 4 r1 = 5 r2 = 8 c1 = 1 c2 = 4

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

R = 2 3 4 5 2 3 4 5 2 3 4 5 2 3 4 5 C = 2 2 2 2 3 3 3 3 4 4 4 4 5 5 5 5 r1 = 2 r2 = 5 c1 = 2 c2 = 5