_2317. Maximum XOR After Operations .md

2317. Maximum XOR After Operations

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : June 24, 2024

Last updated : July 04, 2024

---

Related Topics : Array, Math, Bit Manipulation

Acceptance Rate : 79.33 %

---

Intuition: 
We can basically form any number less than or equal 
to numbers we have, so we can isolate their bits and take 
whichever are present

---

Solutions

• m2317.c
• m2317.cpp
• m2317.java
• m2317.py

C

m2317.c

int maximumXOR(int* nums, int numsSize) {
    int output = 0;
    for (int i = 0; i < numsSize; i++) {
        output |= nums[i];
    }
    return output;
}

C++

m2317.cpp

class Solution {
public:
    int maximumXOR(vector<int>& nums) {
        int output = 0;

        for (int num : nums) {
            output |= num;
        }

        return output;
    }
};

Java

m2317.java

class Solution {
    public int maximumXOR(int[] nums) {
        int output = 0;
        for (int num : nums) {
            output |= num;
        }

        return output;
    }
}

Python

m2317.py

class Solution:
    def maximumXOR(self, nums: List[int]) -> int:
        output = 0
        for num in nums :
            output |= num

        return output