2012. Sum of Beauty in the Array

LeetCodeArrayOpen on judge ↗

You are given a 0-indexed integer array nums. For each index i (1 <= i <= nums.length - 2) the beauty of nums[i] equals: - 2, if nums[j] < nums[i] < nums[k], for all 0 <= j < i and for all i < k <= nums.length - 1. - 1, if nums[i - 1] < nums[i] < nums[i + 1], and the previous condition is not satisfied. - 0, if none of the previous conditions holds. Return the sum of beauty of all nums[i] wher

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