Leetcode 3073. Maximum Increasing Triplet Value

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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3073. Maximum Increasing Triplet Value

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact