Cody

# Problem 9. Who Has the Most Change?

Solution 1822968

Submitted on 22 May 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   Pass
a = [1 2 1 15]; b = 1; assert(isequal(most_change(a),b))

2   Fail
a = [ 1 2 1 15; 0 8 5 9]; b = 2; assert(isequal(most_change(a),b))

Index exceeds the number of array elements (1). Error in most_change (line 7) if A(k) < A(k+1) Error in Test2 (line 4) assert(isequal(most_change(a),b))

3   Fail
a = [ 1 22 1 15; 12 3 13 7; 10 8 23 99]; b = 3; assert(isequal(most_change(a),b))

Index exceeds the number of array elements (1). Error in most_change (line 7) if A(k) < A(k+1) Error in Test3 (line 5) assert(isequal(most_change(a),b))

4   Fail
a = [ 1 0 0 0; 0 0 0 24]; b = 1; assert(isequal(most_change(a),b))

Index exceeds the number of array elements (1). Error in most_change (line 7) if A(k) < A(k+1) Error in Test4 (line 3) assert(isequal(most_change(a),b))

5   Fail
a = [ 0 1 2 1; 0 2 1 1]; c = 1; assert(isequal(most_change(a),c))

Index exceeds the number of array elements (1). Error in most_change (line 7) if A(k) < A(k+1) Error in Test5 (line 3) assert(isequal(most_change(a),c))

6   Fail
% There is a lot of confusion about this problem. Watch this. a = [0 1 0 0; 0 0 1 0]; c = 2; assert(isequal(most_change(a),c)) % Now go back and read the problem description carefully.

Index exceeds the number of array elements (1). Error in most_change (line 7) if A(k) < A(k+1) Error in Test6 (line 4) assert(isequal(most_change(a),c))

7   Fail
a = [ 2 1 1 1; 1 2 1 1; 1 1 2 1; 1 1 1 2; 4 0 0 0]; c = 5; assert(isequal(most_change(a),c))

Index exceeds the number of array elements (1). Error in most_change (line 7) if A(k) < A(k+1) Error in Test7 (line 7) assert(isequal(most_change(a),c))