Question

The return value must be 0 or positive representing the length of the
sequence. Let’s call the function longestSequencePos(), with one
argument (nums).

And if you would comment out each section so I can understand it.

Answer 1

def countLongestSequence(nums):
        countMax=0
        count=0
        for i in range(0, len(nums)+1):
                if i == len(nums) or nums[i] <= 0:
                        if count > countMax:
                                countMax=count
                        count=0
                else:           
                        count+=1
        return countMax