Leetcode 2873. Maximum Value of an Ordered Triplet I

Given an array, find the maximum (nums[i] - nums[j]) * nums[k] over all i < j < k (return 0 if all results are negative). Key insight: for each middle index j, maximize the difference using the largest previous nums[i] and the product using the largest subsequent nums[k], so evaluate using prefix/suffix maxima.