Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

public int missingNumber(int[] nums) { int len =nums.length; int sum = (int)((len*(len+1))/2); //Finding sum of all the integers from 1 to n for(int i: nums) sum-=i; return sum; }

One potential problem would be if the sum is too large?

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.