Problem 3357 · Hard

Minimize the Maximum Adjacent Element Difference

Some array entries are missing and marked -1. Pick one pair of positive integers, fill each gap with either of them, and return the smallest achievable value for the largest absolute difference between neighbors.

Open the interactive visualisation