Maximize Adjacent Difference With One Reversal
Amazon● HardINTERNPHONE SCREENProblem statement
Given an integer array values, define its score as the sum of abs(values[i] - values[i + 1]) over every adjacent pair.
The problem statement continues
ProExamples
Example 1
values = [2,3,1,5,4]return = 10The original score is 8. Reversing the subarray [3,1,5] produces [2,5,1,3,4], whose score is 10.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 1 more worked example, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week