Cody

Problem 59. Pattern matching

Given a matrix, m-by-n, find all the rows that have the same "increase, decrease, or stay same" pattern going across the columns as the first row does. Do not list the row as a match to itself.

Example:

 Input  a = [1 2 3 0
             5 6 7 9
             2 7 8 7]
 Output b is 3

since the third column follows the increase-increase-decrease pattern used in vector a.

Solve

Solution Stats

47.61% Correct | 52.39% Incorrect
Last solution submitted on Oct 14, 2019

Problem Comments

Solution Comments

Problem Recent Solvers1085

Suggested Problems

More from this Author95

Problem Tags

indexing