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

Solution Stats

150 Solutions

68 Solvers

Last Solution submitted on Dec 08, 2025

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers68

Pauli Huusari Armando Longobardi Vasilis Bellos Alexander Ross

Suggested Problems

More from this Author43

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!