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

Solution 1040267

Submitted on 31 Oct 2016 by Jakub Rysanek

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

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))
2	Pass	x = [2 6 4 9 10 3 1 5 10]; y_correct = 7; assert(isequal(min_lpos(x),y_correct))
3	Pass	x = [0 0 0 0]; y_correct = 4; assert(isequal(min_lpos(x),y_correct))
4	Pass	x = [-20 6 4 9 3 1 5 -10]; y_correct = 1; assert(isequal(min_lpos(x),y_correct))