Find Xor-Beauty of Array — LeetCode 2527 Python Solution

The problem

You are given a 0-indexed integer array nums. The effective value of three indices i, j, and k is defined as ((nums[i] | nums[j]) & nums[k]).

Example

Input

nums = [1,4]

Output

5

Explanation

The triplets and their corresponding effective values are listed below:

Python solution

class Solution:
    def xorBeauty(self, nums: List[int]) -> int:
        return reduce(xor, nums)

Complexity

Pattern: Bit Manipulation

Use XOR, masks and the low-bit trick to replace whole data structures with an integer. LeetCode 2527. Find Xor-Beauty of 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