✅Mohit and array(Contest)

Mohit and array easy Time Limit: 2 sec Memory Limit: 128000 kB

Problem Statement :

Mohit has an array of N integers containing all elements from 1 to N, somehow he lost one element from the array. Given N-1 elements your task is to find the missing one. Input The first line of input contains a single integer N, the next line contains N-1 space-separated integers.

Constraints:- 1 ≤ N ≤ 1000 1 ≤ elements ≤ N Output Print the missing element Example Sample Input:- 3 3 1

Sample Output: 2

Sample Input:- 5 1 4 5 2

Sample Output:- 3

link:https://my.newtonschool.co/playground/code/x005rksju4sc

```java
import java.io.*; // for handling input/output
import java.util.*; // contains Collections framework

// don't change the name of this class
// you can add inner classes if needed
class Main {
    public static void main (String[] args) {
        

        Scanner scan= new Scanner(System.in);
        int n= scan.nextInt();
        int arr[]= new int[n];
        for(int i=0;i<n-1;i++){
            arr[i]=scan.nextInt();
        }
        int sum= n*(n+1)/2;
        int total =0;
        for(int i=0;i<n;i++){
            total = total+arr[i];
        }
        int b=sum-total;
        System.out.println(b);
    }
}
```