Cody

Problem 67. Find common elements in matrix rows

Solution 2036389

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

This solution is outdated. To rescore this solution, sign in.

Test Suite

Test Status Code Input and Output
1   Pass
x = []; y_correct = []; assert(isequal(common_by_row(x),y_correct))

y = []

2   Pass
x = [1e100; 1e100]; y_correct = [1e100]; assert(isequal(common_by_row(x),y_correct))

f = 2 g = 1 y = 1.0000e+100 y = 1.0000e+100

3   Pass
x = [1; 2]; y_correct = []; assert(isequal(common_by_row(x),y_correct))

f = 1 f = 1 1 g = 1×0 empty double row vector

4   Pass
x = ones(10); y_correct = [1]; assert(isequal(common_by_row(x),y_correct))

f = 10 g = 1 y = 1 y = 1

5   Pass
x = magic(10); y_correct = []; assert(isequal(common_by_row(x),y_correct))

f = 1 f = 1 1 f = 1 1 1 f = 1 1 1 1 f = 1 1 1 1 1 f = 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Column 31 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 32 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 33 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 34 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 35 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 36 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 37 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 38 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 39 1 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 40 1 1 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 41 1 1 1 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 42 1 1 1 1 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 43 1 1 1 1 1 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 44 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 45 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 46 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 47 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 48 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 49 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 50 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 51 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 52 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

6   Pass
x = wilkinson(9); y_correct = [0 1]; assert(isequal(common_by_row(x),y_correct))

f = 9 f = 9 9 f = 9 9 2 f = 9 9 2 2 f = 9 9 2 2 2 g = 1 2 y = 0 1 y = 0 1

7   Pass
x = [3 -2 1 NaN; NaN 0 -2 3]; y_correct = [-2 3]; assert(isequal(common_by_row(x),y_correct))

f = 2 f = 2 1 f = 2 1 1 f = 2 1 1 2 f = 2 1 1 2 0 f = 2 1 1 2 0 0 g = 1 4 y = -2 3 y = -2 3

Suggested Problems

More from this Author95

Community Treasure Hunt

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

Start Hunting!