MediumNo. 2997
Minimum Number of Operations to Make Array XOR Equal to K — LeetCode 2997 Python Solution
- Pattern
- Bit Manipulation
- Topics
- Bit Manipulation, Array
- Reading time
- 2 min
- Source
- leetcode.com
The problem
You are given a 0-indexed integer array nums and a positive integer k. You can apply the following operation on the array any number of times: Choose any element of the array and flip a bit in its binary representation.
Example
- Input
- nums = [2,1,3,4], k = 1
- Output
- 2
- Explanation
- We can do the following operations:
Python solution
class Solution:
def minOperations(self, nums: List[int], k: int) -> int:
return reduce(xor, nums, k).bit_count()Complexity
- Time
- O(n)where n is the length of the array nums
- Space · auxiliary
- O(1)
Pattern: Bit Manipulation
Use XOR, masks and the low-bit trick to replace whole data structures with an integer. LeetCode 2997. Minimum Number of Operations to Make Array XOR Equal to K 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 |
|---|---|---|
| 0136 | Single Number | Easy |
| 0137 | Single Number II | Medium |
| 0260 | Single Number III | Medium |
| 0287 | Find the Duplicate Number | Medium |
| 0318 | Maximum Product of Word Lengths | Medium |
| 0393 | UTF-8 Validation | Medium |
Frequently asked questions
- How hard is LeetCode 2997. Minimum Number of Operations to Make Array XOR Equal to K?
LeetCode 2997. Minimum Number of Operations to Make Array XOR Equal to K is rated Medium on LeetCode.
- What is the time complexity of LeetCode 2997. Minimum Number of Operations to Make Array XOR Equal to K?
The Python solution on this page runs in O(n), where n is the length of the array nums.
- What is the space complexity of LeetCode 2997. Minimum Number of Operations to Make Array XOR Equal to K?
The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 2997. Minimum Number of Operations to Make Array XOR Equal to K cover?
LeetCode 2997. Minimum Number of Operations to Make Array XOR Equal to K is tagged Bit Manipulation and Array on LeetCode.