top of page

Looking to master object-oriented and system design for tech interviews or career growth?

  • Improve your system design and machine coding skills.

  • Study with our helpful resources.

  • Prepare for technical interviews and advance your career.

**We're in beta mode and would love to hear your feedback.

Maximum Absolute Difference - Interviewbit Solution


Problem Description:

You are given an array of N integers, A1, A2 ,…, AN. Return maximum value of f(i, j) for all 1 ≤ i, j ≤ N.
f(i, j) is defined as |A[i] - A[j]| + |i - j|, where |x| denotes absolute value of x.

For example,

A=[1, 3, -1]  
f(1, 1) = f(2, 2) = f(3, 3) = 0 
f(1, 2) = f(2, 1) = |1 - 3| + |1 - 2| = 3 
f(1, 3) = f(3, 1) = |1 - (-1)| + |1 - 3| = 4 
f(2, 3) = f(3, 2) = |3 - (-1)| + |2 - 3| = 5  
So, we return 5.

Solution:


bottom of page