Cody

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

Solution 453427

Submitted on 11 Jun 2014 by rifat
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))

ans = 9

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

ans = 7

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

ans = 4

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

ans = 1