# Max Value Of Equation: Study Guide

Max Value Of Equation shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Points are sorted by x. Maximize yi + yj + |xi - xj| for xi < xj and xj - xi <= k. Because x is sorted, |xi-xj| = xj - xi, so the value is (yj + xj) + (yi - xi). Slide a window of points with xj - xi <= k and keep a max-deque of (yi - xi); the front of the deque plus (yj + xj) is the best pair ending at j.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Using yi + yj - |xi - xj| (the wrong sign) or scanning all pairs in the window instead of a monotonic deque.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI job interview answers in real time.