XOR Operation in an Array

You are given an integer n and an integer start.

Define an array nums where nums[i] = start + 2 * i (0-indexed) and n == nums.length.

Return the bitwise XOR of all elements of nums.

Example 1
Inputn = 5, start = 0
Output8
Array nums is equal to [0, 2, 4, 6, 8], and (0 ^ 2 ^ 4 ^ 6 ^ 8) = 8.
Example 2
Inputn = 4, start = 3
Output8
Array nums is equal to [3, 5, 7, 9], and (3 ^ 5 ^ 7 ^ 9) = 8.

Constraints

  • 1 <= n <= 1000
  • 0 <= start <= 1000
  • n == nums.length

Asked at 2 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate