O(1) space and time complexity 98% faster solution (cpp)

class Solution {
public:
int missingNumber(vector& nums) {

    int n=nums.size(),sum=0,val=0,ans=0;
    
    sum=accumulate(nums.begin(),nums.end(),sum);
    val=(n*(n+1))/2;
    ans=val-sum;
    
    return ans;
}

};

Comments (0)