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 3since the third column follows the increase-increase-decrease pattern used in vector a.
Not column, but row wise.
this is actually pretty fun
amazing:)
I'm not proud of this solution, the scoring system is clearly flawed.
Seems like the filter preventing abuse of @eval needs some work!
Nice! I learned something from you.
This solution is wrong. It detects a common patten among any two rows and not just the first row and other rows.
What is the point?
350 Solvers
Back to basics 16 - byte order
147 Solvers
200 Solvers
168 Solvers
280 Solvers