Problem 875. Return a list sorted by number of consecutive occurrences
Solution Stats
Problem Comments
-
5 Comments
@bmtran is a too strong for me.
I think that in case 3, the correct answer should be: y_correct1 = [1 0 2 9 1 -5 2 0 11] and in case 4: y_correct0 = [1 0 1 0], or did I misunderstood the goal?
I agree with J.R.! Menzinger. Correct answers given are wrong.
No, the provided answers in the test cases are correct. This is "the difficulty" that Jean-Marie mentions above: for integers that are tied by number of occurrences, they are to be sorted within the tied subset in ascending order, not kept in the original ordering within the vector.
Do you mind do explain in a different way? it is not clear for what exactly i should do. It miss 3 problems for me, but in any of them it is not clear the problem itself.
Solution Comments
Show commentsProblem Recent Solvers427
Suggested Problems
-
Golomb's self-describing sequence (based on Euler 341)
181 Solvers
-
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
897 Solvers
-
Fix the last element of a cell array
1750 Solvers
-
Natural numbers in string form
1849 Solvers
-
Solve a System of Linear Equations
14174 Solvers
More from this Author43
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!