Available question text
Given an integer array, find indices i < j < k with nums[i] < nums[j] < nums[k] that maximize the sum nums[i] + nums[j] + nums[k], and return that maximum sum (or -1 if no increasing triplet exists).
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 3073. Maximum Increasing Triplet Value
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source