Available question text
Find the maximum positive difference nums[j] - nums[i] with i < j and nums[i] < nums[j] in an array, returning -1 if no such increasing pair exists. This is the classic "max profit" / prefix-minimum pattern — track the smallest prior value and update the best difference as you scan.
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 2016. Maximum Difference Between Increasing Elements
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source