LeetCode: Find Xor-Beauty of Array

PublishedNovember 24, 2025

•1 min read

Problem:

https://leetcode.com/problems/find-xor-beauty-of-array/description/

Code:

class Solution:
    def xorBeauty(self, nums: List[int]) -> int:
        result=0
        for n in nums:
            result = result ^ n
        return result

Key Points:

The problem looks complex in the description, but the final math simplifies a lot.
The XOR-beauty of the array is simply: nums[0] ^ nums[1] ^ nums[2] ^ ... ^ nums[n-1]
This works because all the extra operations in the original formula cancel out.
XOR rules that make this work:
1. x ^ x = 0 → duplicates cancel.
2. x ^ 0 = x → does not change the value.
3. XOR is commutative & associative → order doesn’t matter.
Loop through the array and XOR every number into “result”.
Whatever remains at the end is the XOR-beauty.
Time: O(n)
Space: O(1)

#leetcode #python

Comments

Join the discussion

No comments yet. Be the first to comment.

More from this blog

LeetCode: Contains Duplicate II

Problem: https://leetcode.com/problems/contains-duplicate-ii/ Code: class Solution: def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: # window = k seen_in_window = set() for i in range(len(nums)): ...

Jan 9, 20262 min read

LeetCode: Rearrange Array Elements by Sign

Problem: https://leetcode.com/problems/rearrange-array-elements-by-sign/ Code: class Solution: def rearrangeArray(self, nums: List[int]) -> List[int]: non_neg_nums = [] neg_nums = [] result = [] # Segregated non-n...

Dec 26, 20252 min read

GeeksForGeeks: Array Leaders

Problem: https://www.geeksforgeeks.org/problems/leaders-in-an-array-1587115620/1 Code: class Solution: def leaders(self, arr): leads = [] n = len(arr) maximum = arr[-1] # till will handle negatives # we will colle...

Dec 26, 20252 min read

LeetCode: Intersection of Two Arrays

Problem: https://leetcode.com/problems/intersection-of-two-arrays/ Code: class Solution: def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]: result = set() n2 = set(nums2) for num in nums1: ...

Dec 24, 20252 min read

LeetCode: Repeated Substring Pattern

Problem: https://leetcode.com/problems/repeated-substring-pattern/ Code: class Solution: def repeatedSubstringPattern(self, s: str) -> bool: return s in (s + s)[1:-1] # Points to note: # - A repeated string will reappear ...

Dec 22, 20254 min read

LeetCode Shahwar

65 posts

I write LeetCode Explanations here

Command Palette

Problem:

Code:

Key Points:

Comments

More from this blog