Cody

Problem 1941. Lowest sum from a group of digits

Solution 1270433

Submitted on 18 Sep 2017 by omar malik
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
x = 0:3; y_correct = 33; assert(isequal(lowest_number(x),y_correct))
2   Pass
x=[1 2 3 7 8 9] ; y_correct = 417; assert(isequal(lowest_number(x),y_correct))
3   Pass
x=[7 8 9 7 8 9] ; y_correct = 1578; assert(isequal(lowest_number(x),y_correct))
4   Pass
x = 0:9; y_correct = 34047; assert(isequal(lowest_number(x),y_correct))
5   Pass
x=7*[ones(1,5) zeros(1,7)]; y_correct=1400084; assert(isequal(lowest_number(x),y_correct))
6   Pass
x=[ones(1,8) zeros(1,10)]; y_correct=200000222; assert(isequal(lowest_number(x),y_correct))
7   Pass
x = [0:9 1:8]; y_correct = 225802467; assert(isequal(lowest_number(x),y_correct))
8   Pass
x=[randperm(10)-1 randperm(6)]; y_correct=22580247; assert(isequal(lowest_number(x),y_correct))

Suggested Problems

More from this Author80

Community Treasure Hunt

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

Start Hunting!