EasyNo. 1486
XOR Operation in an Array — LeetCode 1486 Python Solution
- Pattern
- Bit Manipulation
- Topics
- Bit Manipulation, Math
- Reading time
- 2 min
- Source
- leetcode.com
The problem
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.
Example
- 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.
Python solution
class Solution:
def xorOperation(self, n: int, start: int) -> int:
return reduce(xor, ((start + 2 * i) for i in range(n)))Complexity
- Time
- O(n)where n is the length of the array
- Space · auxiliary
- O(1)
Pattern: Bit Manipulation
Use XOR, masks and the low-bit trick to replace whole data structures with an integer. LeetCode 1486. XOR Operation in an Array is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Bit Manipulation.
The bit manipulation guide has the Python template for the pattern and the 194 LeetCode problems that use it.
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 0029 | Divide Two Integers | Medium |
| 0067 | Add Binary | Easy |
| 0231 | Power of Two | Easy |
| 0342 | Power of Four | Easy |
| 0371 | Sum of Two Integers | Medium |
| 0405 | Convert a Number to Hexadecimal | Easy |
Frequently asked questions
- How hard is LeetCode 1486. XOR Operation in an Array?
LeetCode 1486. XOR Operation in an Array is rated Easy on LeetCode.
- What is the time complexity of LeetCode 1486. XOR Operation in an Array?
The Python solution on this page runs in O(n), where n is the length of the array.
- What is the space complexity of LeetCode 1486. XOR Operation in an Array?
The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 1486. XOR Operation in an Array cover?
LeetCode 1486. XOR Operation in an Array is tagged Bit Manipulation and Math on LeetCode.