hardArrayBinary SearchMonotonic StackStack 0 views

Find the Number of Subarrays Where Boundary Elements Are Maximum

You are given an array of positive integers nums.

You are given an array of positive integers nums.

Return the number of subarrays of nums, where the first and the last elements of the subarray are equal to the largest element in the subarray.

Find the Number of Subarrays Where Boundary Elements Are Maximum diagram

Example 1

Input: nums = [1,4,3,3,2]

Output: 6

Explanation: There are 6 subarrays which have the first and the last elements equal to the largest element of the subarray: Hence, we return 6.

Example 2

Input: nums = [3,3,3]

Output: 6

Explanation: There are 6 subarrays which have the first and the last elements equal to the largest element of the subarray: Hence, we return 6.

Example 3

Input: nums = [1]

Output: 1

Explanation: There is a single subarray of nums which is [ 1 ] , with its largest element 1. The first element is 1 and the last element is also 1. Hence, we return 1.

Constraints

  • 1 <= nums.length <= 10^5
  • 1 <= nums[i] <= 10^9

Hints

Companies

No companies reported yet.

Discussion

Sign in to join the discussion.

Loading discussion...

Test results

No test cases yet.