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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2485. Find the Pivot Integer

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact