https://www.codemirroring.com/ds-algo/dynamic-programming/Recent content in Dynamic Programming on Code MirroringHugo -- gohugo.ioen-ushttps://www.codemirroring.com/ds-algo/dynamic-programming/count-strictly-increasing-subarrays/Mon, 01 Jan 0001 00:00:00 +0000https://www.codemirroring.com/ds-algo/dynamic-programming/count-strictly-increasing-subarrays/Count Strictly Increasing Subarrays - Golang Problem statement: You are given an array nums consisting of positive integers. Return the number of subarrays of nums that are in strictly increasing order. A subarray is a contiguous part of an array. Example: Input: [1,3,5,4,4,6] Expected output: 10 Explanation: The strictly increasing subarrays are the following: Subarrays of length 1: [1], [3], [5], [4], [4], [6]. Subarrays of length 2: [1,3], [3,5], [4,6].