Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

3154. Maximum Value of an Ordered Triplet I

My accepted Python solution to LeetCode problem 3154, Maximum Value of an Ordered Triplet I, running in 0ms.

  • Difficulty: Easy
  • Python
  • Runtime 0ms
  • Memory 17.2MB

Read the problem on LeetCode View on GitHub

The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.

Python

Accepted on LeetCode — runtime 0ms, memory 17.2MB, accepted 2026-01-02.

python
class Solution:
    def maximumTripletValue(self, nums: List[int]) -> int:
        result = 0
        max_val = 0  # max(nums[i]) for i < j
        max_diff = 0  # max(nums[i] - nums[j]) for i < j
        for k in range(len(nums)):
            result = max(result, max_diff * nums[k])
            max_diff = max(max_diff, max_val - nums[k])
            max_val = max(max_val, nums[k])
        return result

Source