leetcode - 1486 XOR Operation in an Array JavaScript Solution

simple js solution; going over binary numbers and XOR Operation

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 - 1486 XOR Operation in an Array JavaScript Solution канала litCode