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.