Leetcode Problem 2874. Maximum Value of an Ordered Triplet II

2874. Maximum Value of an Ordered Triplet II

Leetcode Solutions

O(n) with prefix and suffix preprocessing

  1. Initialize two arrays maxLeft and maxRight of the same length as the input array nums.
  2. Populate maxLeft with the maximum value seen so far from the left, starting from the second element.
  3. Populate maxRight with the maximum value seen so far from the right, starting from the second-to-last element.
  4. Initialize a variable maxTripletValue to store the maximum value of any triplet found.
  5. Iterate through the array from the second element to the second-to-last element.
  6. For each index i, calculate the triplet value using maxLeft[i - 1], nums[i], and maxRight[i + 1].
  7. Update maxTripletValue if the current triplet value is greater.
  8. Return maxTripletValue if it is positive, otherwise return 0.
UML Thumbnail

Using Ordered Maps for Maximum Triplet Value

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...