Leetcode 2485. Find the Pivot Integer

Find an integer x in [1..n] such that the sum of 1..x equals the sum of x..n; return x or -1 if none exists. Use the closed-form triangular-number formulas to reduce the condition to a simple quadratic/arithmetical check (at most one solution exists).