You are given an integer n and an integer start.

Define an array nums where nums[i] $=$ start $+ 2 imes i$ for all $0 \leq i <$ n.

Return the bitwise XOR of all elements in nums.

Constraints:

• $1 \leq$ n $\leq 1000$

• $0 \leq$ start $\leq 1000$

• n $==$ nums.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.