Type an input and write what you think is the output . Each problem is converted to Web Assembly, so any possible input will show the corresponding output. Only correct predictions count.
Locked until you have predicted 3 outputs correctly.
| 1 | int solution(const vector<int>& nums) { |
| 2 | |
| 3 | int n = nums.size(); |
| 4 | int missing = n; |
| 5 | |
| 6 | for (int i = 0; i < n; i++) { |
| 7 | missing = missing ^ i ^ nums[i]; |
| 8 | } |
| 9 | |
| 10 | return missing; |
| 11 | } |
Names have been stripped. The signature is the only clue you get for free. Compiled as C++20 with the standard headers and using namespace std; already in scope.