Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2909. Minimum Sum of Mountain Triplets II
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source