A little problem (inspired by CodeChef) for the coffee break.
A friend give you an array of size n-1 integers and these integers are in the range of 1 to n. There are no duplicates in array, but one of the integers is missing. Write efficient code to find the missing integer.
- The first argument contains an integer n denoting the size of array
- The second argument contains n integers A1, A2, ..., AN denoting the elements of array.
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers69
Suggested Problems
-
Project Euler: Problem 10, Sum of Primes
2093 Solvers
-
Given a window, how many subsets of a vector sum positive
871 Solvers
-
448 Solvers
-
475 Solvers
-
Fahrenheit to Celsius converter
601 Solvers
More from this Author43
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Nice problem !!