##### Welcome to Subscribe On Youtube

Formatted question description: https://leetcode.ca/all/2393.html

# 2393. Count Strictly Increasing Subarrays

## Description

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 1:**

Input:nums = [1,3,5,4,4,6]Output:10Explanation: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]. - Subarrays of length 3: [1,3,5]. The total number of subarrays is 6 + 3 + 1 = 10.

**Example 2:**

Input:nums = [1,2,3,4,5]Output:15Explanation:Every subarray is strictly increasing. There are 15 possible subarrays that we can take.

**Constraints:**

`1 <= nums.length <= 10`

^{5}`1 <= nums[i] <= 10`

^{6}