Leetcode 2909. Minimum Sum of Mountain Triplets II
Find the minimum-sum "mountain" triplet i<j<k with nums[i]<nums[j]>nums[k] by treating each index as a potential peak j and locating the smallest elements to its left and right that are strictly less than nums[j]; return the minimal such sum or -1 if none exist.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.