3676. Count Bowl Subarrays

LeetCodeArrayStackMonotonic StackOpen on judge ↗

You are given an integer array nums with distinct elements. A subarray nums[l...r] of nums is called a bowl if: - The subarray has length at least 3. That is, r - l + 1 >= 3. - The minimum of its two ends is strictly greater than the maximum of all elements in between. That is, min(nums[l], nums[r]) > max(nums[l + 1], ..., nums[r - 1]). Return the number of bowl subarrays in nums. Example 1

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI