Leetcode - XOR Operation in an Array Solution — The Poor Coder

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:

Text

Input: n = 5, start = 0
Output: 8
Explanation: Array nums is equal to [0, 2, 4, 6, 8] where (0 ^ 2 ^ 4 ^ 6 ^ 8) = 8.
Where "^" corresponds to bitwise XOR operator.

Example 2:

Text

Input: n = 4, start = 3
Output: 8
Explanation: Array nums is equal to [3, 5, 7, 9] where (3 ^ 5 ^ 7 ^ 9) = 8.

Example 3:

Text

Input: n = 1, start = 7
Output: 7

Example 4:

Text

Input: n = 10, start = 5
Output: 2

Constraints:

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

Solution in Python#

Python

class Solution:
    def xorOperation(self, n: int, start: int) -> int:
        answer = 0
        for i in range(start,start+(n*2),2):
            answer ^= i
        return answer

Mar 202021

Leetcode - Subsets Solution

Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Return the solution in any order. Example 1: Example 2: Constraints: 1 <=…

leetcode array backtracking1 min read

May 112021

Leetcode - Find the Highest Altitude Solution

There is a biker going on a road trip. The road trip consists of n + 1 points at different altitudes. The biker starts his trip on point 0 with altitude equal 0. You are given an integer array gain of length n where…

leetcode array1 min read

May 112021

Leetcode - Count Good Meals Solution

A good meal is a meal that contains exactly two different food items with a sum of deliciousness equal to a power of two. You can pick any two different foods to make a good meal. Given an array of integers…

leetcode array Hash Table2 min read

Solution in Python#

Related posts

Leetcode - Subsets Solution

Leetcode - Find the Highest Altitude Solution

Leetcode - Count Good Meals Solution