Problem 59. Pattern matching

Created by Cody Team

Solve Later

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

Last solution submitted on Aug 20, 2019

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Oleg Komarov on 28 Jan 2012

Not column, but row wise.

Solution Comments

Solution 1534182

1 Comment

1 Comment

William Moraga on 19 May 2018

this is actually pretty fun

Solution 1056854

1 Comment

1 Comment

Roche de Guzman on 19 Nov 2016

amazing:)

Solution 546456

1 Comment

1 Comment

Gergely Patay on 16 Dec 2014

I'm not proud of this solution, the scoring system is clearly flawed.

Solution 165375

1 Comment

1 Comment

Nicholas Howe on 20 Nov 2012

Seems like the filter preventing abuse of @eval needs some work!

Solution 158914

1 Comment

1 Comment

Claudia on 15 Nov 2012

Nice! I learned something from you.

Solution 128509

1 Comment

1 Comment

Farhad on 12 Sep 2012

This solution is wrong. It detects a common patten among any two rows and not just the first row and other rows.

Solution 27070

1 Comment

1 Comment

Cris Luengo on 16 Jul 2012

What is the point?

Problem 59. Pattern matching

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Recent Solvers1067

Suggested Problems

More from this Author95

Tags

Problem 59. Pattern matching

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Recent Solvers1067

Suggested Problems

More from this Author95

Tags

Players