Python Simple Solution
A continuous subsequence is essentially a subarray. Hence this question is asking for the longest increasing subarray and I have no idea why the question calls 
A continuous subsequence is essentially a subarray. Hence this question is asking for the longest increasing subarray and I have no idea why the question calls it continuous subsequence to confuse the readers. \n\nAnyway, we can make one pass of the array and keep track of the current streak of increasing elements, reset it when it does not increase.\n\n```\nclass Solution(object):\n    def findLengthOfLCIS(self, nums):\n        """\n        :type nums: List[int]\n        :rtype: int\n        """\n        # Time: O(n)\n        # Space: O(1)\n        max_len = i = 0\n        while i < len(nums):\n            curr = 1\n            while i + 1 < len(nums) and nums[i] < nums[i + 1]:\n                curr, i = curr + 1, i + 1\n            max_len = max(max_len, curr)\n            i += 1\n        return max_len\n```\n\n**\uD83D\uDCAF Check out https://www.techinterviewhandbook.org for more tips and tricks by me to ace your coding interview \uD83D\uDCAF**
[]