Python | Two pointer technique | Easy solution
Do hit like button if helpful!!!!\n\nclass Solution:\n    def numSubarrayBoundedMax(self, nums: List[int], left: int, right: int) -> int:\n        start,end = -
***Do hit like button if helpful!!!!***\n```\nclass Solution:\n    def numSubarrayBoundedMax(self, nums: List[int], left: int, right: int) -> int:\n        start,end = -1, -1\n        res = 0\n        for i in range(len(nums)):\n            if nums[i] > right:\n                start = end = i\n                continue\n                \n            if nums[i] >= left:\n                end = i\n                \n            res += end - start\n        return res\n```
['Two Pointers', 'Python', 'Python3']