1610. XOR Operation in an Array
My accepted Python solution to LeetCode problem 1610, XOR Operation in an Array, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.2MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 0ms, memory 17.2MB, accepted 2025-12-29.
class Solution:
def xorOperation(self, n: int, start: int) -> int:
result = 0
for i in range(n):
result ^= start + 2 * i
return result