Cody

Problem 658. Find the biggest empty box

Solution 1429517

Submitted on 31 Jan 2018 by Berkay Dogus
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));

n = 1 2 3 size = 0 0 0 r1 = 1 r2 = 1 c1 = 2 c2 = 2
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));

n = 3 7 8 size = 0 0 1 0 0 0 1 1 0 0 0 r1 = 1 r2 = 2 c1 = 2 c2 = 3
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));

n = 19 20 37 83 100 101 size = Columns 1 through 29 0 0 0 0 0 0 0 0 1 1 1 1 1 1 2 2 2 2 3 3 0 0 0 0 0 0 0 0 1 Columns 30 through 58 1 1 1 1 2 2 2 3 0 0 0 0 0 0 0 0 1 1 1 1 1 2 2 0 0 0 0 0 0 Columns 59 through 87 0 0 1 1 1 1 1 2 2 0 0 0 0 0 0 0 0 1 1 1 1 1 2 2 3 0 0 0 0 Columns 88 through 116 0 0 0 0 1 1 1 1 1 2 2 2 3 3 0 0 0 0 0 0 0 0 1 1 1 1 1 2 2 Columns 117 through 140 2 2 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 0 0 r1 = 1 r2 = 4 c1 = 5 c2 = 8
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));

n = 30 31 47 size = Columns 1 through 29 0 0 0 0 0 0 1 1 1 1 2 2 0 0 0 0 0 0 0 1 1 1 1 1 1 2 2 2 2 Columns 30 through 58 3 3 0 0 0 0 0 0 0 1 1 1 1 1 2 2 2 3 0 0 0 0 0 0 1 1 1 1 2 Columns 59 through 86 2 0 0 0 0 0 0 1 1 1 1 2 2 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 r1 = 2 r2 = 5 c1 = 2 c2 = 5

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!