Sponsored
Sponsored
Use these hints if you're stuck. Try solving on your own first.
Find the number of strictly increasing subarrays that end at a specific index. Can you calculate that for each index from 0 to n - 1?
The answer will be the sum of the number of subarrays that end at each index.