# Find XOR Beauty Of Array: Walkthrough

Find XOR Beauty Of Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

The XOR-beauty is the XOR of (effectiveValue of every triplet). It simplifies to the XOR of every nums[i] (each bit is independent and the triplet formula collapses). Just XOR the whole array.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Enumerating all triplets in O(n^3), or returning the OR instead of the XOR.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at learn more.