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