Kata

Ascending Sequence => given a sequence of consecutive numbers in ascending order, for example: 3,4,5 where the difference is 1, however if given 2,7,9, which is not considered a ascending sequence (because the numbers there are not consecutive, difference between each number is not equal to 1).

Write a function that receives an array numbers (all numbers will be integers, can also include negative numbers) and returns the longest "ascending sequential sequence" from positive numbers.

For example if given the numbers below: 2,6,33,2,3,4,5,2,7,8,9,10,11,21,20

Your function will return 5.

7->8->9->10->11 which is 5 consecutive positive numbers

if there are consecutive numbers which are negative then they are not counted

Goodluck:P