Problem 44500. Find the starting index of a consecutive condition

Created by Shaul Salomon

Solve Later

Given a logical vector v, and a positive integer n, return the smallest index i that satisfies:

all( v(i : i+n-1) ) == true

For Example,

v = logical([0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0]);
i = consecutiveFind(v, 4);

Then:

i = 6

If there is no sequence of n consecutive true, then i should be an empty array.

Solve

Solution Stats

88 Solutions
31 Solvers

Last Solution submitted on May 24, 2020

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Atsushi Ueno on 16 Nov 2019

The test suite is not enough because it does not contain any case that the number of consecutive true bits is exactly same as n.

Solution Comments

Solution 1419086

1 Comment

1 Comment

Shaul Salomon on 17 Jan 2018

This is exactly what I was looking for.
I knew strcmp gives the same functionality for char arrays, but it didn't occur to me I can simply use it for logicals and doubles.
Thanks

Problem Recent Solvers31

Problem Tags

indexing vectors

Problem 44500. Find the starting index of a consecutive condition

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers31

Suggested Problems

More from this Author25

Problem Tags

Problem 44500. Find the starting index of a consecutive condition

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers31

Suggested Problems

More from this Author25

Problem Tags

Players