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. LeetCode Problem - 1486 class Solution { public int xorOperation...