Problem of The Day: Adjacent Increasing Subarrays Detection I

Problem Statement

leetcode problem link

Brute Force [Accepted]

class Solution:
    def hasIncreasingSubarrays(self, nums: List[int], k: int) -> bool:
        N = len(nums)
        for i in range(0, N - k + 1):
            arr1 = nums[i:i + k]
            arr2 = nums[i+k:i+k+k]
            if len(arr1) != k or len(arr2) != k:
                continue
            is_valid = True
            for a in range(1, k):
                if arr1[a - 1] >= arr1[a]:
                    is_valid = False
                    break
            if not is_valid:
                continue

            for b in range(1, k):
                if arr2[b - 1] >= arr2[b]:
                    is_valid = False
                    break
            if not is_valid:
                continue

            if is_valid:
                return True

        return False