A list of cells is given.
Return true if the elements of the list increase monotonically (each element is strictly larger than the previous). Return false otherwise.
For example : If list={1 2 3 4 5} => the answer is YES (1->2->3->4->5)
If list={[1 2] 4 [4 5] 6} => the answer is YES (1(or 2)->4->5->6)
But if list={[1 2] 0 [4 5] 6} => the answer is NO (1 or 2 are >0)
Easy ?
And a list like ... {[10 1] [2 3] [4 40] [1 1 2 2 2 5] 6 40 [1:41] [1:42]} ?
Good luck !
How about adding a test suite where some of the cell entries are 2-D?
Most of the solutions will not be affected by this update.
Test 7,10 and 11 are fake, you have to correct these problem
In Test 7 : 1->2->4->5->6->40->41->42. So a path exists to go through the structure, even if we don't have a global increase in the cell.
At the beginning this problem was just a test to practice recursive algorithms. I am fed up with always factorial and fibonacci examples. Maybe some others problems will follow.
4573 Solvers
given 3 sides, find area of this triangle
579 Solvers
134 Solvers
223 Solvers
177 Solvers