Problem 875. Return a list sorted by number of consecutive occurrences
Inspired by Problem 38 by Cody Team. Given a vector x, return a vector y of the values in x sorted by the number of CONSECUTIVE occurrences in x. Ties (and it is the difficulty) are sorted from lowest to highest. So if x = [1 2 2 2 3 3 7 7 93] then
y = [2 3 7 1 93]
But if x = [1 1 2 2 2 3 3 7 7 1 93] then
y = [2 1 3 7 1 93]
Update - Test case added 22-8-22
Solution Stats
Problem Comments
-
5 Comments
Show
2 older comments
Berkay Dogus
on 1 Aug 2018
I agree with J.R.! Menzinger. Correct answers given are wrong.
goc3
on 2 Aug 2018
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.
Kleber Zuza Nobrega
on 20 Apr 2021
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 Solvers382
Suggested Problems
-
1317 Solvers
-
Getting the indices from a vector
10392 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
637 Solvers
-
991 Solvers
-
661 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!