JavaMediumArrays15 min
Missing number in 1..n
An array holds 1..n with exactly one number missing. Find it in O(n) time, O(1) space.
Example
Input
—
Output
—
Hints (1)
- Sum formula n(n+1)/2 minus the actual sum.
Your solution
Checking runner availability…
Reference solution
Sign in for solutionMore Java programs
- Anagram check · Easy
- Check for an Armstrong number · Easy
- Check whether a number is a palindrome · Easy
- Check whether an integer is prime · Easy
- Compute a factorial with BigInteger · Easy
- Count vowels and consonants · Easy
- Find the first occurrence with binary search · Easy
- Find the GCD and LCM · Easy
- Find the minimum and maximum in an array · Easy
- Generate the Fibonacci series · Easy