Problem 672. Longest run of consecutive numbers

Created by James

Solve Later

Given a vector a, find the number(s) that is/are repeated consecutively most often. For example, if you have

a = [1 2 2 2 1 3 2 1 4 5 1]

The answer would be 2, because it shows up three consecutive times.

If your vector is a row vector, your output should be a row vector. If your input is a column vector, your input should be a column vector. You can assume there are no Inf or NaN in the input. Super (albeit non-scored) bonus points if you get a solution that works with these, though.

Solve

Solution Stats

Last solution submitted on Aug 06, 2019

Last 200 Solutions

Problem Comments

3 Comments

3 Comments

Aurelien Queffurust on 21 Jun 2012

I don't understand why for test suite 4 :
a=[0 1 1 1 0 2 2 0 1 1 1 0];
y_correct = [1 1];
I expect y_correct = [1 1 1]

Tim on 21 Jun 2012

The idea seems to be to return the element that occurs in the longest run, or all such elements in case of a tie. In case 4 there are two longest runs, both with element 1.

Aurelien Queffurust on 22 Jun 2012

Thanks Tim for the explanation . So as the vector [1 1 1] appears twice in test 4 with the unique value 1 , the result must be twice the unqiue value -> [ 1 1]. ok ok thanks again

Problem 672. Longest run of consecutive numbers

Solution Stats

Last 200 Solutions

Problem Comments

Recent Solvers126

Suggested Problems

More from this Author80

Tags

Problem 672. Longest run of consecutive numbers

Solution Stats

Last 200 Solutions

Problem Comments

Recent Solvers126

Suggested Problems

More from this Author80

Tags

Players