Leetcode 3357. Minimize the Maximum Adjacent Element Difference

Given an array where missing entries are marked -1, choose exactly two positive integers x and y (each missing element replaced by either x or y) to minimize the maximum absolute difference between adjacent elements, and return that minimum possible maximum difference. Constraints: n up to 1e5 and values up to 1e9, so you must optimize over two global replacement values.