Number of Valid Subarrays

Try to solve the Number of Valid Subarrays problem.

We'll cover the following

Statement

Given an integer array nums, count how many non-empty contiguous subarrays exist where the first element of each subarray is less than or equal to every other element within that subarray.

Note: A subarray is defined as a contiguous portion of an array.

Constraints:

  • 1≤1 \leq nums.length ≤1000\leq 1000

  • 0≤0 \leq nums[i] ≤105\leq 10^5

Examples

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.