Leetcode 829. Consecutive Numbers Sum

Count how many ways a given n (1 ≤ n ≤ 10^9) can be written as a sum of consecutive positive integers. The core challenge is finding lengths k and starting values a satisfying n = k*(2a+k-1)/2 — which reduces to a number-theoretic/divisor-counting check (equivalently counting appropriate divisors of n) that can be done in O(sqrt(n)).

Asked at:

Question Timeline

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

Company

Level

Region

Mid October, 2025

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 829. Consecutive Numbers Sum

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact