Cody

Problem 1921. Find the position of last minimum value in an integer array with numbers

Solution 2049845

Submitted on 7 Dec 2019 by Asif Newaz
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
x = [2 6 4 9 -10 3 1 5 -10]; y_correct = 9; assert(isequal(min_lpos(x),y_correct))

y = 9

2   Pass
x = [2 6 4 9 10 3 1 5 10]; y_correct = 7; assert(isequal(min_lpos(x),y_correct))

y = 7

3   Pass
x = [0 0 0 0]; y_correct = 4; assert(isequal(min_lpos(x),y_correct))

y = 4

4   Pass
x = [-20 6 4 9 3 1 5 -10]; y_correct = 1; assert(isequal(min_lpos(x),y_correct))

y = 1

Suggested Problems

More from this Author2