Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2873. Maximum Value of an Ordered Triplet I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source