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 Solvers418
Suggested Problems
- 
         Return a list sorted by number of occurrences 2839 Solvers 
- 
         
         2374 Solvers 
- 
         How to find the position of an element in a vector without using the find function 2775 Solvers 
- 
         Project Euler: Problem 2, Sum of even Fibonacci 2611 Solvers 
- 
         Create an index-powered vector 872 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!